Fortunate numbers: Difference between revisions

Implemented the "Fortunate numbers" task in Python.
(Implemented the "Fortunate numbers" task in Python.)
Line 238:
373 379 383 397 401 409 419 421 439 443
</pre>
 
=={{header|Python}}==
{{libheader|sympy}}
<lang python>from sympy.ntheory.generate import primorial
from sympy.ntheory import isprime
 
def fortunate_number(n):
'''Return the fortunate number for positive integer n.'''
# Since primorial(n) is even for all positive integers n,
# it suffices to search for the fortunate numbers among odd integers.
i = 3
primorial_ = primorial(n)
while True:
if isprime(primorial_ + i):
return i
i += 2
 
fortunate_numbers = set()
for i in range(1, 76):
fortunate_numbers.add(fortunate_number(i))
 
# Extract the first 50 numbers.
first50 = sorted(list(fortunate_numbers))[:50]
 
print('The first 50 fortunate numbers:')
print(('{:<3} ' * 10).format(*(first50[:10])))
print(('{:<3} ' * 10).format(*(first50[10:20])))
print(('{:<3} ' * 10).format(*(first50[20:30])))
print(('{:<3} ' * 10).format(*(first50[30:40])))
print(('{:<3} ' * 10).format(*(first50[40:])))</lang>
{{out}}
<pre>The first 50 fortunate numbers:
3 5 7 13 17 19 23 37 47 59
61 67 71 79 89 101 103 107 109 127
151 157 163 167 191 197 199 223 229 233
239 271 277 283 293 307 311 313 331 353
373 379 383 397 401 409 419 421 439 443 </pre>
 
=={{header|Raku}}==
Anonymous user