Curzon numbers: Difference between revisions

(Perl: fast modular exponentiation)
Line 109:
END # is curon # ;
 
BEGINFOR #k taksFROM #2 BY 2 TO 10 DO
print( ( "1000th Curzon numbernumbers with base ", whole( k, 0 ), ": ", whole( n, 0 )newline ) );
LONG INT k := 0;
WHILEINT kcount +:= 20, n := 0;
WHILE n k <+:= 101;
count < n +:= 150
DO
print(IF is curzon( "Curzon numbers with base "n, whole( k, 0 ), ":", newline ) );THEN
LONG INT count := 0,print( ( whole( n, :=-4 0;)
WHILE n , IF ( count +:= 1; ) MOD 10 = 0 THEN newline ELSE " " FI
count < 50 )
DO )
IF is curzon( n, k ) THENFI
OD;
print( ( whole( n, -4 )
WHILE IF is curzon( n, k ) , IF (THEN count +:= 1 ) MOD 10 = 0 THEN newline ELSE " " FI;
count < )1000
)DO
n +:= FI1
OD;
print( ( "1000th Curzon WHILEnumber IFwith isbase curzon", whole( nk, k0 ), THEN": count", +:=whole( 1n, FI0 ) ) );
print( ( newline, newline ) count < 1000)
DOOD
n +:= 1
OD;
print( ( "1000th Curzon number with base ", whole( k, 0 ), ": ", whole( n, 0 ) ) );
print( ( newline, newline ) )
OD
END # task #
END
</syntaxhighlight>
3,022

edits