# small-p.py -- job #5: explicit listing at p = 2, 3, 5, 7 from the definitions only. from math import gcd, isqrt def is_prime(n): return n >= 2 and all(n % d for d in range(2, isqrt(n) + 1)) def primorial(p): return eval('*'.join(str(q) for q in range(2, p + 1) if is_prime(q))) for p in (2, 3, 5, 7): pn = next(q for q in range(p + 1, 10 * p) if is_prime(q)); P = primorial(p); top = pn * pn hole = lambda x: gcd(x, P) == 1 slots = [r for r in range(1, top + 1) if hole(r) and hole(r + 2)] lab = lambda r: f"({r},{r+2}){'' if is_prime(r) and is_prime(r+2) else '*'}" inside = [lab(r) for r in slots if p < r and r + 2 < top] edge = [lab(r) for r in slots if p < r < top and r + 2 >= top] below = [lab(r) for r in slots if r <= p] print(f"p={p} p'={pn} p#={P} zone=({p},{top}) zone wider than tile: {top > P}") print(f" slots wholly inside: {' '.join(inside)}") print(f" slots with r in zone but r+2 >= p'^2: {' '.join(edge) or '-'}") print(f" slots with r <= p: {' '.join(below) or '-'} twin primes with r <= p: {[(r, r+2) for r in range(2, p + 1) if is_prime(r) and is_prime(r+2)] or '-'}") print("* = not a twin prime pair")