write a Python program that uses recursion to find the sorted (ascending order) prime factors of...

Transcribed Image Text:

write a Python program that uses recursion to find the sorted (ascending order) prime factors of an input. A simple way to test primality of a number n is to iterate through integers from 2 to √n (inclusive). However, be sure that your implementation follows the form of the strong inductive proof. We've included test cases: [] def prime_factors (n): # Write your code here [] assert prime_factors (60) == [2, 2, 3, 5] assert prime_factors (25) assert prime_factors (2) == [2] [5, 5] == assert prime_factors (210) == [2, 3, 5, 7] assert prime_factors (110) == [2, 5, 11] assert prime_factors (85) == [5, 17] write a Python program that uses recursion to find the sorted (ascending order) prime factors of an input. A simple way to test primality of a number n is to iterate through integers from 2 to √n (inclusive). However, be sure that your implementation follows the form of the strong inductive proof. We've included test cases: [] def prime_factors (n): # Write your code here [] assert prime_factors (60) == [2, 2, 3, 5] assert prime_factors (25) assert prime_factors (2) == [2] [5, 5] == assert prime_factors (210) == [2, 3, 5, 7] assert prime_factors (110) == [2, 5, 11] assert prime_factors (85) == [5, 17]

Answer rating: 100% (QA)

def primefactorsn Finds the sorted prime factors of a number using recursion Args n int The input ... View the full answer