Pandigital prime: Difference between revisions

=={{header|ALGOL 68}}==

Uses the observations in the Factor sample - the prime we are looking for can only have 7 or 4 digits.

# As noted in the Factor sample, only 7 and 4 digit primes need be #

# considered: 1 is not prime, all 2, 3, 5, 6, 8 and 9 digit #

find pd prime( 1, "pandigital" );

find pd prime( 0, "pandigital0" )

{{out}}

<pre>

=={{header|C#|CSharp}}==

class Program {

fun('0');

}

{{out|Output @ Tio.run}}

<pre>1..7: 7,652,413 21 μs

=={{header|Delphi|Delphi}}==

uses System.SysUtils, System.Classes, System.Math;

label nxt;

end;

end.

{{out}}

<pre>

=={{header|Factor}}==

{{works with|Factor|0.99 2021-06-02}}

math.primes math.ranges present sequences sequences.cords ;

[ reverse 0 [ 10^ * + ] reduce-index prime? ] find-last nip

"The largest pandigital decimal prime is: " print

{{out}}

<pre>

=={{header|FreeBASIC}}==

{{trans|Ring}}

If n Mod 3 = 0 Then Return False

Dim As Integer i = 5

digits = digits * 10 - 9

Next z

{{out}}

<pre>The largest 1..7 pandigital prime is 7652413. 6.32 ms

{{trans|Wren}}

{{libheader|Go-rcu}}

import (

}

}

{{out}}

See e.g. [[Erd%C5%91s-primes#jq]] for a suitable implementation of `is_prime`.

# drawing from the digits in the input array,

# in descending numerical order

| select(is_prime);

{{out}}

<pre>

=={{header|Julia}}==

function pandigitals(firstdig, lastdig)

println("Max pandigital prime over [$firstdigit, 9] is ", pandigitals(firstdigit, 9))

end

<pre>

Max pandigital prime over [1, 9] is 7652413

=={{header|Perl}}==

{{libheader|ntheory}}

use strict; # https://rosettacode.org/wiki/Pandigital_prime

is_prime($n) and exit ! print "$n\n";

} $digits;

{{out}}

<pre>7652413</pre>

Slightly different approach for optional portion of task.

use warnings;

use ntheory <forperm is_prime vecmax>;

} @{[0..$c]};

}

{{out}}

<pre>76540231</pre>

=={{header|Phix}}==

<span style="color: #008080;">with</span> <span style="color: #008080;">javascript_semantics</span>

<span style="color: #004080;">sequence</span> <span style="color: #000000;">avail</span>

<span style="color: #008080;">end</span> <span style="color: #008080;">if</span>

<span style="color: #008080;">end</span> <span style="color: #008080;">for</span>

{{out}}

With full inner workings (the second "1" is really "01", a failing pandigital0), obviously removing the "?n" on the fourth line above will reduce the output to just four lines.<br>

=={{header|Raku}}==

say max ($i..7).map: -> $size {

|($i..$size).permutations».join.grep(&is-prime);

}

{{out}}

<pre>7652413

Essentially, the CPU time was displayed as using 0.00 seconds &nbsp; (rounded to two fractional decimal digits).

pand = reverse(123456789) /*get a big 9-digit pandigital number. */

gp= 0 /*indicate that primes not generated. */

end /*k*/ /* [↓] a prime (J) has been found. */

#= #+1; @.#= j; sq.#= j*j; !.j= 1 /*bump #Ps; P──►@.assign P; P^2; P flag*/

{{out|output|text=&nbsp; when using the internal default input:}}

<pre>

=={{header|Ring}}==

hi = 7654321

for z in ['1', '0']

if n % i = 0 return 0 ok i += 4

end

{{out|Output @ Tio.run}}

<pre>working...

=={{header|Ruby}}==

Using the observations from the Factor code:

def find_pan(ar) = ar.permutation(ar.size).find{|perm| perm.join.to_i.prime? }.join.to_i

puts find_pan(digits)

digits << 0

{{out}}

<pre>7652413

=={{header|Sidef}}==

for n in (b `downto` 1) {

say ("Max pandigital prime over [1, 9] is: ", largest_pandigital_prime(a: 1))

{{out}}

<pre>

<br>

This makes use of the optimization strategy in the Factor entry to do both the basic and optional tasks.

import "./math" for Int

import "./fmt" for Fmt

if (outer) break

}

{{out}}