Rosetta Code

Honaker primes: Difference between revisions

← Older editNewer edit →
Content deleted Content added
Chunes (talk | contribs)
1,827 edits
Add Factor
Wherrera (talk | contribs)
4,111 edits
m use primes function
Line 321:
 
 
from sympypyprimesieve import nextprimeprimes
 
 
Line 329:
 
 
def generate_honaker(limit = 5_000_000):
hcount = 0
''' Generate the sequence of Honaker primes '''
pri,for (ppi, hcountpri) = 2, 1,in 0enumerate(primes(limit)):
if digitsum(pri) == digitsum(ppi + 1):▼
while True:
pri = nextprime(pri)
ppi += 1
▲ if digitsum(pri) == digitsum(ppi):
hcount += 1
yield hcount, ppi + 1, pri
 
 
Retrieved from "https://rosettacode.org/wiki/Honaker_primes"