Equal prime and composite sums: Difference between revisions
Added Sidef
(Equal prime and composite sums in FreeBASIC) |
(Added Sidef) |
||
Line 487:
209,456,854,921,713 - 5,012,372ⁿᵈ prime sum, 19,786,181ˢᵗ composite sum 968.26 seconds
^C</pre>
=={{header|Sidef}}==
<lang ruby>func f(n) {
var (
p = 2, sp = p,
c = 4, sc = c,
)
var res = []
while (res.len < n) {
if (sc == sp) {
res << [sp, c.composite_count, p.prime_count]
c.next_composite!
sc += c
}
while (sp < sc) {
p.next_prime!
sp += p
}
while (sc < sp) {
c.next_composite!
sc += c
}
}
return res
}
f(8).each_2d {|n, ci, pi|
printf("%12s = %-9s = %s\n", n, "P(#{pi})", "C(#{ci})")
}</lang>
{{out}}
<pre>
10 = P(3) = C(2)
1988 = P(33) = C(51)
14697 = P(80) = C(147)
83292 = P(175) = C(361)
1503397 = P(660) = C(1582)
18859052 = P(2143) = C(5699)
93952013 = P(4556) = C(12821)
89171409882 = P(118785) = C(403341)
</pre>
(takes ~6 seconds)
=={{header|Wren}}==
| |||