Rosetta Code

Sum of two adjacent numbers are primes: Difference between revisions

Page Discussion

Sum of two adjacent numbers are primes (view source)

Revision as of 13:43, 18 December 2022

98 bytes removed ,  1 year ago
→‎{{header|Action!}}: Use formatted output
(Added Action!)
(→‎{{header|Action!}}: Use formatted output)
Line 35:
IF primes( n + n1 ) THEN
count ==+ 1
PrintC2PrintF( "%2U: %2U + %2U = %2U%E", count, n, n1, n + n1 )
Print( ": " )
PrintC2( n )
Print( " + " )
PrintC2( n1 )
Print( " = " )
PrintC2( n + n1 )
PutE()
FI
OD
Tigerofdarkness
3,038

edits

Retrieved from "https://rosettacode.org/wiki/Special:MobileDiff/334470"