Example of prime factorization algorithm implemented in Python

This article mainly introduces the prime factorization algorithm implemented in Python, involving operating skills related to Python mathematical operations. Friends in need can refer to it

The example of this article describes the prime factorization algorithm implemented in Python . I would like to share it with you for your reference. The details are as follows:

I originally wanted to implement another basic mathematical algorithm problem, but found that the algorithm of decomposing prime factors must be completed before implementation.

I didn’t go online to look for a better solution algorithm. I just wrote a tentative solution algorithm based on my own understanding. This is the guess-try method mentioned by the professor in the MIT open course. The code is implemented as follows:

#!/usr/bin/python
def PrimeNum(num):
   r_value =[]
   for i inrange(2,num+1):
      for jin range(2,i):
         ifi % j == 0:
            break
      else:
         r_value.append(i)
   returnr_value
def PrimeFactorSolve(num,prime_list):
   for n inprime_list:
      ifnum % n == 0:
         return[n,num / n]
def Primepisor(num):
   prime_range= PrimeNum(num)
   ret_vale =[]
   while numnot in prime_range:
      factor_list= PrimeFactorSolve(num,prime_range)
      ret_vale.append(factor_list[0])
      num =factor_list[1]
   else:
      ret_vale.append(num)
   printret_vale
Primepisor(120)

The program execution result is as follows:

E:\WorkSpace\01_Programming Language\03_Python\python_exp07> ;pythonpython_exp07.py
[2, 2, 2, 3, 5]

I extracted and tested other data. Judging from the simple example calculation, the result is still accurate.

Related recommendations:

Example of algorithm for solving the greatest common divisor implemented in Python

##

The above is the detailed content of Example of prime factorization algorithm implemented in Python. For more information, please follow other related articles on the PHP Chinese website!