Write a function primeFac in Python that computes the prime factorization of a number: it accepts a single argument, an integer greater than 1 it returns a list containing the prime factorization each number in the list is a prime number greater than 1 the product of the numbers in the list is the original number the factors are listed in non-decreasing order Examples of possibles results: >>> primeFac(5) [5] >>> primeFac(72) [2, 2, 2, 3, 3] >>> primeFac(72)==[2, 2, 2, 3, 3]
Write a function primeFac in Python that computes the prime factorization of a number:
- it accepts a single argument, an integer greater than 1
- it returns a list containing the prime factorization
each number in the list is a prime number greater than 1
the product of the numbers in the list is the original number
the factors are listed in non-decreasing order
Examples of possibles results:
>>> primeFac(5)
[5]
>>> primeFac(72)
[2, 2, 2, 3, 3]
>>> primeFac(72)==[2, 2, 2, 3, 3]
True
>>> [ (i,primeFac(i)) for i in range(10,300,23)]
[(10, [2, 5]), (33, [3, 11]), (56, [2, 2, 2, 7]), (79, [79]), (102, [2, 3, 17]),
(125, [5, 5, 5]), (148, [2, 2, 37]), (171, [3, 3, 19]), (194, [2, 97]), (217,
[7, 31]), (240, [2, 2, 2, 2, 3, 5]), (263, [263]), (286, [2, 11, 13])]
>>> [ (i,primeFac(i)) for i in range(3,300,31)]
[(3, [3]), (34, [2, 17]), (65, [5, 13]), (96, [2, 2, 2, 2, 2, 3]), (127, [127]),
(158, [2, 79]), (189, [3, 3, 3, 7]), (220, [2, 2, 5, 11]), (251, [251]), (282,
[2, 3, 47])]
Please only give to me the final code or the "tool" that could generate any of the above results. Thanks!
Trending now
This is a popular solution!
Step by step
Solved in 2 steps
