Rosetta Code

Wagstaff primes: Difference between revisions

← Older editNewer edit →
Content deleted Content added
Drkameleon (talk | contribs)
1,532 edits
Trizen (talk | contribs)
2,757 edits
Added Sidef
(5 intermediate revisions by 4 users not shown)
Line 347:
using big_int = mpz_class;
 
std::string to_string(const big_int& num, size_t nmax_digits) {
std::string str = num.get_str();
size_t len = str.size();
if (len > nmax_digits) {
str = str.substrreplace(0, nmax_digits / 2), +len - max_digits, "..." + str.substr(len - n / 2);
str += " (";
str += std::to_string(len);
Line 496:
 
<syntaxhighlight lang="easylang">
procfunc prime v . rn .
rif n mod 2 = 10 and n > 2
if v mod 2 = 0 or v mod 3 =return 0
if v <> 2 and v <> 3
r = 0
.
break 1
.
di = 53
while d * di <= vsqrt n
if vn mod di = 0
r =return 0
break 2
.
di += 2
.
return 1
.
pri = 1
nwag = 0
while nwag <> 10
pri += 2
callif prime pri r= 1
if r = 1
wag = (pow 2 pri + 1) / 3
callif prime wag r= 1
if r = 1
nwag += 1
print pri & " => " & wag
Line 528 ⟶ 521:
.
</syntaxhighlight>
 
 
=={{header|F_Sharp|F#}}==
Line 1,194 ⟶ 1,186:
24: 5807 => [1748 digit number]
</pre>
 
=={{header|Quackery}}==
 
<code>from</code>, <code>index</code>, <code>incr</code>, and <code>end</code> are defined at [[Loops/Increment loop index within loop body#Quackery]].
 
<code>prime</code> is defined at [[Miller–Rabin primality test#Quackery]].
 
<syntaxhighlight lang="Quackery"> [ bit 1+ 3 / ] is wagstaff ( n --> n )
 
[] 3 from
[ 2 incr
index prime while
index wagstaff prime while
index join
dup size 24 = if end ]
10 split swap
witheach
[ dup say "p = " echo
wagstaff
say ", w(p) = " echo cr ]
witheach
[ say "p = " echo cr ]
</syntaxhighlight>
 
{{out}}
 
<pre>p = 3, w(p) = 3
p = 5, w(p) = 11
p = 7, w(p) = 43
p = 11, w(p) = 683
p = 13, w(p) = 2731
p = 17, w(p) = 43691
p = 19, w(p) = 174763
p = 23, w(p) = 2796203
p = 31, w(p) = 715827883
p = 43, w(p) = 2932031007403
p = 61
p = 79
p = 101
p = 127
p = 167
p = 191
p = 199
p = 313
p = 347
p = 701
p = 1709
p = 2617
p = 3539
p = 5807</pre>
 
=={{header|Raku}}==
Line 1,307 ⟶ 1,349:
3539
5807
</pre>
 
=={{header|Sidef}}==
<syntaxhighlight lang="ruby">var iter = Enumerator({|callback|
var p = 2
loop {
var t = ((2**p + 1)/3)
callback([p, t]) if t.is_prime
p.next_prime!
}
})
 
var n = 1
say "Index Exponent Prime"
say "-"*31
 
iter.each {|k|
var (e, p) = k...
p = "(#{p.len} digits)" if (n > 10)
say "#{'%5s'%n} #{'%8s'%e} #{'%16s'%p}"
break if (n == 24)
++n
}</syntaxhighlight>
{{out}}
<pre>
Index Exponent Prime
-------------------------------
1 3 3
2 5 11
3 7 43
4 11 683
5 13 2731
6 17 43691
7 19 174763
8 23 2796203
9 31 715827883
10 43 2932031007403
11 61 (18 digits)
12 79 (24 digits)
13 101 (30 digits)
14 127 (38 digits)
15 167 (50 digits)
16 191 (58 digits)
17 199 (60 digits)
18 313 (94 digits)
19 347 (104 digits)
20 701 (211 digits)
21 1709 (514 digits)
22 2617 (788 digits)
23 3539 (1065 digits)
24 5807 (1748 digits)
</pre>
 
Line 1,316 ⟶ 1,409:
 
Even so, as far as the stretch goal is concerned, takes around 25 seconds to find the next 14 Wagstaff primes but almost 10 minutes to find the next 19 on my machine (Core i7). I gave up after that.
<syntaxhighlight lang="ecmascriptwren">import "./math" for Int
import "./gmp" for Mpz
import "./fmt" for Fmt
Retrieved from "https://rosettacode.org/wiki/Wagstaff_primes"