Check if sum of first n primes is prime: Difference between revisions
Check if sum of first n primes is prime (view source)
Revision as of 08:48, 23 July 2021
, 2 years ago→{{header|Julia}}: list n
m (→{{header|Julia}}: list n) |
|||
Line 14:
So, with a bit of experimentation, we find that to duplicate the Ring result we need to sum up to the first 160 primes, which then
gives us 20 prime results when we filter for a prime number as the sum:
<lang julia>julia> julia> filter(p -> isprime(p[2]), collect(enumerate(accumulate(+, primes(prime(160))))))
20-element Vector{Tuple{Int64, Int64}}:
(96, 22039)
(100, 24133)
(102, 25237)
(108, 28697)
(114, 32353)
(122, 37561)
(124, 38921)
(130, 43201)
(132, 44683)
(146, 55837)
(152, 61027)
(158, 66463)
</lang>
=={{header|Ring}}==
| |||