mirror of
https://github.com/DeaDvey/mathgenerator.git
synced 2025-11-28 14:35:23 +01:00
28 lines
584 B
Python
28 lines
584 B
Python
from .__init__ import *
|
|
from ..__init__ import Generator
|
|
|
|
|
|
def primeFactorsFunc(minVal=1, maxVal=200):
|
|
a = random.randint(minVal, maxVal)
|
|
n = a
|
|
i = 2
|
|
factors = []
|
|
|
|
while i * i <= n:
|
|
if n % i:
|
|
i += 1
|
|
else:
|
|
n //= i
|
|
factors.append(i)
|
|
|
|
if n > 1:
|
|
factors.append(n)
|
|
|
|
problem = f"Find prime factors of {a}"
|
|
solution = f"{factors}"
|
|
return problem, solution
|
|
|
|
|
|
primeFactors = Generator("Prime Factorisation", 27, "Prime Factors of a =",
|
|
"[b, c, d, ...]", primeFactorsFunc)
|