flancian/garden
0
0
Fork 0
mirror of https://github.com/flancian/garden.git synced 2026-08-07 15:06:19 +00:00
Code Issues Packages Projects Releases Wiki Activity

autopushed

Browse Source
This commit is contained in:
Flancian
2023-10-14 21:51:36 +02:00
parent a5eab0b0cb
commit 6a3d32748f
1 changed files with 4 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files
bin/prime.py
+4
View File
@@ -9,6 +9,7 @@ import sys
# I'm not proud (I am a little bit?). # I'm not proud (I am a little bit?).
PROOF = [] # :) PROOF = [] # :)
LOG = [] # :)
def factor(n): def factor(n):
for i in range(2, n+1): for i in range(2, n+1):
@@ -26,6 +27,7 @@ def is_prime(n):
break break
# If this is a known composite, then we've already crossed off its multiples when we iterated over its primes. # If this is a known composite, then we've already crossed off its multiples when we iterated over its primes.
if not is_prime[i]: if not is_prime[i]:
LOG.append(f"[[{i*j}]] is composite: {i} * {j}.")
continue continue
# for j in range(2, math.ceil(math.sqrt(n) + 1)): # for j in range(2, math.ceil(math.sqrt(n) + 1)):
for j in range(2, n): for j in range(2, n):
@@ -70,6 +72,8 @@ def prime(n):
else: else:
click.echo(f"{n} is not prime. Want proof? :)") click.echo(f"{n} is not prime. Want proof? :)")
click.echo("\n".join([line for line in PROOF if f'[[{n}]]' in line])) click.echo("\n".join([line for line in PROOF if f'[[{n}]]' in line]))
click.echo(f"Also: ")
click.echo("\n".join([line for line in LOG if f'[[{n}]]' in line]))
if __name__ == '__main__': if __name__ == '__main__':
prime() prime()