Ormiston pairs: Difference between revisions
→{{header|Wren}}: No longer requires pairs to be disjoint. Extended search to 1 billion.
No edit summary |
(→{{header|Wren}}: No longer requires pairs to be disjoint. Extended search to 1 billion.) |
||
Line 430:
import "./fmt" for Fmt
var limit =
var primes = Int.primeSieve(limit)
var orm30 = []
Line 437:
var count = 0
var counts = []
var p1 = primes[i]
var p2 = primes[i+1]
if ((p2 - p1) % 18 != 0)
var
var d2 =
▲ if (Lst.areEqual(d1.sort(), d2.sort())) {
if (count < 30) orm30.add([p1, p2])
if (p1 >= j) {
Line 453 ⟶ 450:
}
count = count + 1
i = i + 2▼
}
}
Line 461 ⟶ 455:
System.print("First 30 Ormiston pairs:")
Fmt.tprint("[$,6d] ", orm30, 3)
System.print()
Fmt.print("\n$,d Ormiston pairs before 100,000", counts[0])▼
j = 1e5
Fmt.print("$,d Ormiston pairs before 1,000,000", counts[1])▼
for (i in 0...counts.count) {
}</syntaxhighlight>
{{out}}
Line 482 ⟶ 479:
382 Ormiston pairs before 1,000,000
3,722 Ormiston pairs before 10,000,000
34,901 Ormiston pairs before 100,000,000
</pre>
| |||