Cullen and Woodall numbers: Difference between revisions

Uses Algol 68Gs LONG LONG INT for long integers. The number of digits must be specified and appears to affect the run time as larger sies are specified. This sample only shows the first two Cullen primes as the time taken to find the third is rather long.

{{libheader|ALGOL 68-primes}}

# a Cullen number n is n2^2 + 1, Woodall number is n2^n - 1 #

PR read "primes.incl.a68" PR # include prime utilities #

print( ( newline ) )

END

{{out}}

<pre>

=={{header|Arturo}}==

 

inc n * 2^n

 

 

print ["First 20 cullen numbers:" join.with:" " to [:string] map 1..20 => cullen]

 

{{out}}

 

=={{header|AWK}}==

# syntax: GAWK -f CULLEN_AND_WOODALL_NUMBERS.AWK

BEGIN {

exit(0)

}

{{out}}

<pre>

==={{header|BASIC256}}===

{{trans|FreeBASIC}}

 

for n = 1 to 20

print int(num); " ";

next n

{{out}}

<pre>

 

==={{header|FreeBASIC}}===

Print "First 20 Cullen numbers:"

 

Print num; " ";

Next n

{{out}}

<pre>First 20 Cullen numbers:

 

==={{header|PureBasic}}===

PrintN("First 20 Cullen numbers:")

 

 

PrintN(#CRLF$ + "--- terminado, pulsa RETURN---"): Input()

{{out}}

<pre>

{{works with|True BASIC}}

{{trans|FreeBASIC}}

PRINT "First 20 Cullen numbers:"

 

PRINT num;

NEXT n

{{out}}

<pre>

{{works with|QBasic}}

{{trans|FreeBASIC}}

PRINT "First 20 Cullen numbers:"

 

PRINT num;

NEXT n

{{out}}

<pre>

 

==={{header|Yabasic}}===

 

for n = 1 to 20

next n

print

{{out}}

<pre>

 

=={{header|F_Sharp|F#}}==

// Cullen and Woodall numbers. Nigel Galloway: January 14th., 2022

let Cullen,Woodall=let fG n (g:int)=(bigint g)*2I**g+n in fG 1I, fG -1I

Seq.initInfinite((+)1)|>Seq.filter(fun n->let mutable n=Woodall n in Open.Numeric.Primes.MillerRabin.IsProbablePrime &n)|>Seq.take 12|>Seq.iter(printf "%A "); printfn ""

Seq.initInfinite((+)1)|>Seq.filter(fun n->let mutable n=Cullen n in Open.Numeric.Primes.MillerRabin.IsProbablePrime &n)|>Seq.take 5|>Seq.iter(printf "%A "); printfn ""

{{out}}

<pre>

=={{header|Factor}}==

{{works with|Factor|0.99 2022-04-03}}

sequences ;

 

{{out}}

<pre>

=={{header|Go}}==

{{libheader|GMP(Go wrapper)}}

 

import (

}

fmt.Println()

 

{{out}}

 

=={{header|Haskell}}==

findCullen n = toInteger ( n * 2 ^ n + 1 )

 

print cullens

putStrLn "First 20 Woodall numbers:"

{{out}}

<pre>First 20 Cullen numbers:

=={{header|J}}==

 

 

Task example:

 

3 10 27 68 165 390 903 2056 4617 10250 22539 49164 106509 229390 491535 1048592 2228241 4718610 9961491 20971540

woodall 1+i.20

 

 

=={{header|Julia}}==

{{trans|Raku}}

using Primes

 

println("\nFirst 5 Cullen primes: (in terms of n)\n", take(5, primecullens)) # A005849

println("\nFirst 12 Woodall primes: (in terms of n)\n", Int.(collect(take(12, primewoodalls)))) # A002234

<pre>

First 20 Cullen numbers: ( n × 2**n + 1)

 

=={{header|Lua}}==

table.range = function(t,n) local s=T{} for i=1,n do s[i]=i end return s end

table.map = function(t,f) local s=T{} for i=1,#t do s[i]=f(t[i]) end return s end

function woodall(n) return (n<<n)-1 end

print("First 20 Woodall numbers:")

{{out}}

<pre>First 20 Cullen numbers:

 

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

SetAttributes[{CullenNumber, WoodallNumber}, Listable]

CullenNumber[n_Integer] := n 2^n + 1

{i, 1, \[Infinity]}

];

{{out}}

<pre>{3, 9, 25, 65, 161, 385, 897, 2049, 4609, 10241, 22529, 49153, 106497, 229377, 491521, 1048577, 2228225, 4718593, 9961473, 20971521}

=={{header|Perl}}==

{{libheader|ntheory}}

use warnings;

use bigint;

($m,$n) = (12,0);

print "\n\nFirst $m Woodall primes: (in terms of n)\n";

{{out}}

<pre>First 20 Cullen numbers:

 

=={{header|Phix}}==

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

<span style="color: #004080;">atom</span> <span style="color: #000000;">t0</span> <span style="color: #0000FF;">=</span> <span style="color: #7060A8;">time</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;">"First 12 Woodall primes (in terms of n):%s\n"</span><span style="color: #0000FF;">,{</span><span style="color: #7060A8;">join</span><span style="color: #0000FF;">(</span><span style="color: #000000;">w</span><span style="color: #0000FF;">)})</span>

<span style="color: #0000FF;">?</span><span style="color: #7060A8;">elapsed</span><span style="color: #0000FF;">(</span><span style="color: #7060A8;">time</span><span style="color: #0000FF;">()-</span><span style="color: #000000;">t0</span><span style="color: #0000FF;">)</span>

{{out}}

<pre>

 

=={{header|Python}}==

print("working...")

print("First 20 Cullen numbers:")

print()

print("done...")

{{out}}

<pre>

===Bit Shift===

{{trans|Quackery}}

def woodall(n): return((n<<n)-1)

for i in range(1,20):

print(woodall(i),end=" ")

 

{{out}}

=={{header|Quackery}}==

 

 

[ dup << 1 - ] is woodall ( n --> n )

cr

say "First 20 Woodall numbers:" cr

 

{{out}}

=={{header|Raku}}==

 

my @woodall = ^∞ .map: { $_ × 1 +< $_ - 1 };

 

put "\nFirst 20 Woodall numbers: ( n × 2**n - 1)\n", @woodall[1..20]; # A003261

put "\nFirst 5 Cullen primes: (in terms of n)\n", @cullen.grep( &is-prime, :k )[^5]; # A005849

{{out}}

<pre>First 20 Cullen numbers: ( n × 2**n + 1)

 

=={{header|Ring}}==

load "stdlib.ring"

 

 

see nl + "done..." + nl

{{out}}

<pre>

 

=={{header|Rust}}==

// rug = "1.15.0"

 

.collect();

println!("{}", woodall_primes.join(" "));

 

{{out}}

 

=={{header|Sidef}}==

func woodall(n) { n * (1 << n) - 1 }

 

 

say "\nFirst 12 Woodall primes: (in terms of n)"

{{out}}

<pre>

 

=={{header|Verilog}}==

integer n, num;

$finish ;

end

 

 

{{libheader|Wren-big}}

Cullen primes limited to first 2 as very slow after that.

 

var cullen = Fn.new { |n| (BigInt.one << n) * n + 1 }

n = n + 1

}

 

{{out}}

{{libheader|Wren-gmp}}

Cullen primes still slow to emerge, just over 10 seconds overall.

 

import "./gmp" for Mpz

n = n + 1

}

 

{{out}}