Question: Please use PYTHON and RECURSION Write a function count_prime_divisors (n) which returns the number of prime divisors of a given positive integer n. Do not

 Please use PYTHON and RECURSION Write a function count_prime_divisors (n) which

Please use PYTHON and RECURSION

Write a function count_prime_divisors (n) which returns the number of prime divisors of a given positive integer n. Do not count multiplicity of these divisors. Due to recursion limitations, your code will not be tested on numbers larger than 100. Do not hard code all 100 cases (marks will be deducted for codes that do not use recursion). Sample: count_prime_divisors (12) => 2

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!