Euclid-Mullin sequence: Difference between revisions
Content added Content deleted
m (→{{header|Julia}}: simplify) |
|||
| Line 75: | Line 75: | ||
<pre>First sixteen: 2 3 7 43 13 53 5 6221671 38709183810571 139 2801 11 17 5471 52662739 23003 |
<pre>First sixteen: 2 3 7 43 13 53 5 6221671 38709183810571 139 2801 11 17 5471 52662739 23003 |
||
Next eleven: 30693651606209 37 1741 1313797957 887 71 7127 109 23 97 159227</pre> |
Next eleven: 30693651606209 37 1741 1313797957 887 71 7127 109 23 97 159227</pre> |
||
=={{header|Python}}== |
|||
<lang python>""" Rosetta code task: Euclid-Mullin_sequence """ |
|||
from primePy import primes |
|||
def euler_mullin(): |
|||
""" generate Euler-Mullin sequence """ |
|||
total = 1 |
|||
while True: |
|||
next_iter = primes.factor(total + 1) |
|||
total *= next_iter |
|||
yield next_iter |
|||
GEN = euler_mullin() |
|||
print('First 16 Euler-Mullin numbers:', ', '.join([str(next(GEN)) for _ in range(16)])) |
|||
</lang>{{out}} |
|||
<pre> |
|||
First 16 Euler-Mullin numbers: 2, 3, 7, 43, 13, 53, 5, 6221671, 38709183810571, 139, 2801, 11, 17, 5471, 52662739, 23003 |
|||
</pre> |
|||
=={{header|Raku}}== |
=={{header|Raku}}== |
||