Fortunate numbers: Difference between revisions

{{trans|Nim}}

 

I n < 2 | n % 2 == 0

R n == 2

L(m) sorted(Array(s))[0 .< nn]

V i = L.index

 

{{out}}

=={{header|Arturo}}==

 

primorial: function [n][

product first.n: n firstPrimes

]

 

 

{{out}}

=={{header|Factor}}==

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

math.ranges prettyprint sequences sets sorting ;

 

primorial dup next-prime 2dup - abs 1 =

[ next-prime ] when - abs

{{out}}

<pre>

Use any primality testing example, the [[set]]s example, and [[Bubble Sort]] as includes for finding primes, removing duplicates, and sorting the output respectively. Coding these up again would bloat the code without being illustrative. Ditto for using a bigint library to get Fortunates after the 7th one, it's just not worth the bother.

 

#include "isprime.bas"

#include "sets.bas"

for n=0 to 6

print forts(n)

 

=={{header|Go}}==

{{trans|Wren}}

{{libheader|Go-rcu}}

 

import (

}

fmt.Println()

 

{{out}}

 

=={{header|Haskell}}==

import Math.NumberTheory.Primes.Testing (isPrime)

import Data.List (nub)

 

fortunateNumbers :: [Integer]

 

<pre>λ> take 50 fortunateNumbers

of fortunate(n) for successive values of n.

 

2, range(3; infinite; 2) | select(is_prime);

if length >= $limit then ., break $out else empty end);

 

{{out}}

<pre>

 

=={{header|Julia}}==

 

primorials(N) = accumulate(*, primes(N), init = big"1")

foreach(p -> print(rpad(last(p), 5), first(p) % 10 == 0 ? "\n" : ""),

(map(fortunate, 1:100) |> unique |> sort!)[begin:50] |> enumerate)

<pre>

After sorting, the first 50 distinct fortunate numbers are:

 

=={{header|Mathematica}}/{{header|Wolfram Language}}==

primorials[n_] := Times @@ Prime[Range[n]]

vals = Table[

{i, 100}

];

{{out}}

<pre>{3,5,7,13,17,19,23,37,47,59,61,67,71,79,89,101,103,107,109,127,151,157,163,167,191,197,199,223,229,233,239,271,277,283,293,307,311,313,331,353,373,379,383,397,401,409,419,421,439,443}</pre>

{{libheader|bignum}}

Nim doesn’t provide a standard module to deal with big integers. So, we have chosen to use the third party module “bignum” which provides functions to easily find primes and check if a number is prime.

import bignum

 

echo "First $# fortunate numbers:".format(N)

for i, m in list:

 

{{out}}

=={{header|Perl}}==

{{libheader|ntheory}}

use warnings;

use List::Util <first uniq>;

 

print "First $upto distinct fortunate numbers:\n" .

{{out}}

<pre>First 50 distinct fortunate numbers:

 

=={{header|Phix}}==

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

<span style="color: #008080;">include</span> <span style="color: #004080;">mpfr</span><span style="color: #0000FF;">.</span><span style="color: #000000;">e</span>

<span style="color: #000000;">fortunates</span> <span style="color: #0000FF;">=</span> <span style="color: #7060A8;">join_by</span><span style="color: #0000FF;">(</span><span style="color: #7060A8;">apply</span><span style="color: #0000FF;">(</span><span style="color: #004600;">true</span><span style="color: #0000FF;">,</span><span style="color: #7060A8;">sprintf</span><span style="color: #0000FF;">,{{</span><span style="color: #008000;">"%3d"</span><span style="color: #0000FF;">},</span><span style="color: #000000;">fortunates</span><span style="color: #0000FF;">}),</span><span style="color: #000000;">1</span><span style="color: #0000FF;">,</span><span style="color: #000000;">10</span><span style="color: #0000FF;">)</span>

<span style="color: #7060A8;">printf</span><span style="color: #0000FF;">(</span><span style="color: #000000;">1</span><span style="color: #0000FF;">,</span><span style="color: #008000;">"The first 50 distinct fortunate numbers are:\n%s\n"</span><span style="color: #0000FF;">,{</span><span style="color: #000000;">fortunates</span><span style="color: #0000FF;">})</span>

{{out}}

<pre>

=={{header|Python}}==

{{libheader|sympy}}

from sympy.ntheory import isprime

 

print(('{:<3} ' * 10).format(*(first50[20:30])))

print(('{:<3} ' * 10).format(*(first50[30:40])))

{{out}}

<pre>The first 50 fortunate numbers:

Limit of 75 primorials to get first 50 unique fortunates is arbitrary, found through trial and error.

 

 

say display :title("First 50 distinct fortunate numbers:\n"),

cache $list;

$title ~ $list.batch($cols)».fmt($fmt).join: "\n"

{{out}}

<pre>First 50 distinct fortunate numbers:

For this task's requirement, &nbsp; finding the 8^th fortunate number requires running this REXX program in a 64-bit address

<br>space. &nbsp; It is CPU intensive as there is no &nbsp; '''isPrime''' &nbsp; BIF for the large (possible) primes generated.

numeric digits 12

parse arg n cols . /*obtain optional argument from the CL.*/

end /*k*/ /* [↑] only process numbers ≤ √ J */

#= #+1; @.#= j; sq.#= j*j; !.j= /*bump # of Ps; assign next P; P²; P# */

output

<pre>

 

=={{header|Ruby}}==

 

primorials = Enumerator.new do |y|

p fortunates[0, limit]

{{out}}

<pre>[3, 5, 7, 13, 17, 19, 23, 37, 47, 59, 61, 67, 71, 79, 89, 101, 103, 107, 109, 127, 151, 157, 163, 167, 191, 197, 199, 223, 229, 233, 239, 271, 277, 283, 293, 307, 311, 313, 331, 353, 373, 379, 383, 397, 401, 409, 419, 421, 439, 443]

</pre>

=={{header|Sidef}}==

var P = n.pn_primorial

2..Inf -> first {|m| P+m -> is_prob_prime }

 

say "\n#{limit} Fortunate numbers, sorted with duplicates removed:"

{{out}}

<pre>

{{libheader|Wren-seq}}

{{libheader|Wren-fmt}}

import "/big" for BigInt

import "/sort" for Sort

Sort.quick(fortunates)

System.print("After sorting, the first 50 distinct fortunate numbers are:")

 

{{out}}