Ormiston pairs: Difference between revisions
→{{header|Wren}}: Tweak.
(→{{header|Wren}}: Better way of checking for anagrams - more than 40% faster than before.) |
(→{{header|Wren}}: Tweak.) |
||
Line 490:
var limit = 1e9
var primes = Int.primeSieve(limit)
var orm30 = []
var i = 0
Line 501 ⟶ 500:
if ((p2 - p1) % 18 != 0) continue
var key1 = 1
for (dig in Int.digits(p1)) key1 = key1 *
var key2 = 1
for (dig in Int.digits(p2)) key2 = key2 *
if (key1 == key2) {
if (count < 30) orm30.add([p1, p2])
| |||