Honaker primes: Difference between revisions

Content added Content deleted

Inline

@@ Line 321: / Line 321: @@
-from sympy import nextprime
+from pyprimesieve import primes
@@ Line 329: / Line 329: @@
-def generate_honaker():
+def generate_honaker(limit = 5_000_000):
+    hcount = 0
-    ''' Generate the sequence of Honaker primes '''
-    pri, ppi, hcount = 2, 1, 0
+    for (ppi, pri) in enumerate(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, pri
+            yield hcount, ppi + 1, pri