Idoneal numbers: Difference between revisions
Content added Content deleted
(→{{header|Action!}}: Simplification - don't need a loop to find c) |
(→{{header|Action!}}: Avoid unsigned comparison against -2...) |
||
| Line 29: | Line 29: | ||
PROC Main() |
PROC Main() |
||
CARD count, maxCount, n |
CARD count, maxCount, n, a, b, c, ab, sum |
||
BYTE idoneal |
BYTE idoneal |
||
count = 0 maxCount = 65 |
count = 0 maxCount = 65 |
||
n = 0 |
n = 0 |
||
n2 = n - 2 |
|||
WHILE count < maxCount DO |
WHILE count < maxCount DO |
||
n ==+ 1 |
n ==+ 1 |
||
n2 ==+ 1 |
|||
idoneal = 1 |
idoneal = 1 |
||
a = 1 |
a = 1 |
||
WHILE a < |
WHILE ( a + 2 ) < n AND idoneal = 1 DO |
||
b = a + 1 |
b = a + 1 |
||
DO |
DO |
||