Pell numbers: Difference between revisions

Content added Content deleted

Inline

@@ Line 127: / Line 127: @@
     print( ( newline, "First 10 Pell primes:", newline, "index Pell prime", newline ) );
-    INT pdx := 2;
+    INT c := 0;
-    INT c   := 0;
+    FOR pdx FROM 2 WHILE c < 10 DO
-    WHILE
         IF is probably prime( p[ pdx ] ) THEN
             print( ( whole( pdx, -5 ), " ", whole( p[ pdx ], 0 ), newline ) );
             c +:= 1
-        FI;
+        FI
-        pdx +:= 1;
+    OD;
-        c < 10
-    DO SKIP OD;
-    [ 0 : 20 ]LONG INT nsw;
-    FOR n FROM 0 TO 19 DO nsw[ n ] := p[ 2 * n ] + p[ 2 * n + 1 ] OD;
     print( ( newline, newline, "First 20 Newman-Shank-Williams numbers:", newline ) );
-    FOR n FROM 0 TO 19 DO print( ( " ", whole( nsw[ n ], 0 ) ) ); IF n = 13 THEN print( ( newline ) ) FI OD;
+    FOR n FROM 0 TO 19 DO
+        LONG INT nsw = p[ 2 * n ] + p[ 2 * n + 1 ];
+        print( ( " ", whole( nsw, 0 ) ) ); IF n = 13 THEN print( ( newline ) ) FI
+    OD;
     print( ( newline, newline, "First 20 near isosceles right triangles:", newline ) );