Curzon numbers: Difference between revisions
Content added Content deleted
(→{{header|PARI/GP}}: fix jump anchor problem) |
|||
Line 436: | Line 436: | ||
=={{header|EasyLang}}== |
=={{header|EasyLang}}== |
||
{{trans|FreeBASIC}} |
{{trans|FreeBASIC}} |
||
<syntaxhighlight |
<syntaxhighlight> |
||
func pow_mod b power modulus . |
func pow_mod b power modulus . |
||
x = 1 |
x = 1 |
||
Line 448: | Line 448: | ||
return x |
return x |
||
. |
. |
||
⚫ | |||
for k = 2 step 2 to 10 |
for k = 2 step 2 to 10 |
||
numfmt 0 0 |
|||
print " |
print "First 50 Curzon numbers using a base of " & k & ":" |
||
⚫ | |||
n = 1 |
n = 1 |
||
count = 0 |
count = 0 |
||
Line 460: | Line 461: | ||
if count <= 50 |
if count <= 50 |
||
write " " & n |
write " " & n |
||
if count mod |
if count mod 9 = 0 |
||
print "" |
print "" |
||
. |
. |