Created
October 23, 2021 00:17
-
-
Save adietrichs/a480be3933f9b2866a81a4b2a815ee10 to your computer and use it in GitHub Desktop.
Paradigm Pinball
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
from math import isqrt | |
nonprimes = set() | |
primes = [2] | |
prev_n = 2 | |
def ensure_primes(n): | |
global prev_n | |
if n <= prev_n: | |
return | |
subroot = True | |
for p in primes: | |
end = n // p | |
if end < p: | |
subroot = False | |
break | |
for i in range(p, end + 1): | |
nonprimes.add(p * i) | |
for p in range(prev_n + 1, n + 1): | |
if p in nonprimes: | |
continue | |
primes.append(p) | |
if subroot: | |
end = n // p | |
if end < p: | |
subroot = False | |
else: | |
for i in range(p, end + 1): | |
nonprimes.add(p * i) | |
prev_n = n | |
def factors(n): | |
fctrs = [] | |
cutoff = isqrt(n) | |
ensure_primes(cutoff) | |
for p in primes: | |
if p > cutoff: | |
break | |
while n % p == 0: | |
fctrs.append(p) | |
n //= p | |
cutoff = isqrt(n) | |
fctrs.append(n) | |
return fctrs | |
def explore(target, max_mul, max_depth): | |
assert max_depth >= 1 | |
for mul in range(max_mul + 1): | |
fctrs = factors(mul * 2 ** 32 + target) | |
all = [] | |
for fctr in fctrs: | |
if fctr < 300: | |
all.append(fctr) | |
elif max_depth == 1: | |
break | |
else: | |
subfctrs = explore(fctr, max_mul, max_depth - 1) | |
if not subfctrs: | |
break | |
all += subfctrs | |
else: | |
return all | |
return None | |
if __name__ == "__main__": | |
print(sorted(explore(0x020c020c, 20, 3) or [])) |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment