Curzon numbers: Difference between revisions

m
(Add PARI/GP implementation)
 
(One intermediate revision by one other user not shown)
Line 436:
=={{header|EasyLang}}==
{{trans|FreeBASIC}}
<syntaxhighlight lang=easylang>
func pow_mod b power modulus .
x = 1
Line 448:
return x
.
numfmt 0 4
for k = 2 step 2 to 10
numfmt 0 0
print "The firstFirst 50 Curzon numbers using a base of " & k & ":"
numfmt 0 4
n = 1
count = 0
Line 460 ⟶ 461:
if count <= 50
write " " & n
if count mod 109 = 0
print ""
.
Line 1,569 ⟶ 1,570:
 
=={{header|PARI/GP}}==
{{trans|Mathematica_Mathematica/_Wolfram_LanguageWolfram_Language}}
<syntaxhighlight lang="PARI/GP">
/* Define the CurzonNumberQ function for base b */
Line 1,624 ⟶ 1,625:
46845
</pre>
 
 
 
=={{header|Perl}}==
1,981

edits