![]() |
Python
1.0
|
A simple factorization algorithm. More...
Functions | |
def | factorize_rec (n) |
Factorizes an integer or long number. More... | |
def | factorize (n) |
Factorizes an integer or long number. More... | |
def | condense (L) |
Condenses the list of prime factors of a number, so that each factor appears just once, in the format \(prime^{nth_{power}}\). More... | |
def | main (argv=None) |
main function for testing. More... | |
Variables | |
input = raw_input | |
A simple factorization algorithm.
Note that we need to test only primes \(\pi\) such that \(\pi \le \sqrt(n)\).
def _10_factorize.condense | ( | L | ) |
Condenses the list of prime factors of a number, so that each factor appears just once, in the format \(prime^{nth_{power}}\).
e.g., python factorize2.py 173248246132375748867198458668657948626531982421875
['3^24', '5^14', '7^33', '13']
L | a list with the prime factors of a number. |
Referenced by main().
def _10_factorize.factorize | ( | n | ) |
Factorizes an integer or long number.
Non recursive version.
n | given integer. |
Referenced by main().
def _10_factorize.factorize_rec | ( | n | ) |
Factorizes an integer or long number.
Recursive version.
n | given integer. |
def _10_factorize.main | ( | argv = None | ) |
_10_factorize.input = raw_input |
Referenced by main().