Find squares n where n+1 is prime: Difference between revisions
Content deleted Content added
Added XPL0 example. |
→{{header|Wren}}: No need to examine odd squares > 1. |
||
Line 70:
var squares = []
var i = 1
while (i <= limit) {
var n = i * i
if (Int.isPrime(n+1)) squares.add(n)
i = (i == 1) ? 2 : i + 2
}
System.print("There are %(squares.count) square numbers 'n' where 'n+1' is prime, viz:")
| |||