Prime Number via Recursion | Dataford Interview Questions

Write a program to find whether a number is prime using recursion.

Implement is_prime(n), which accepts one integer and returns True if it is prime and False otherwise. For example, 29 returns True, while 9 returns False. Treat all integers less than 2 as non-prime, and use recursive divisor checking.

Constraints

n is an integer
-10^6 <= n <= 10^6
The implementation must use recursion to test candidate divisors

Function Signature

def is_prime(n):

Your question is Prime Number via Recursion. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

Write a program to find whether a number is prime using recursion.

Constraints

n is an integer
-10^6 <= n <= 10^6
The implementation must use recursion to test candidate divisors

Function Signature

def is_prime(n):

Your question is Prime Number via Recursion. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.