Prime Check With Recursion

EasyPython00:00

Practice interviewer

In session

5 left

00:00

Your question is Prime Check With Recursion. Start with the requirements on the right.

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

You need to log in / sign up to run or submit.

Problem

A War Dragons feature needs to classify integer values as prime or non-prime. Implement is_prime(n) using trial division, then rewrite the divisor-checking logic recursively without changing the function's behavior.

A prime number is an integer greater than 1 with no positive divisors other than 1 and itself. You only need to test divisors through the square root of n.

Formal Specification

Input: An integer n.
Output: Return True if n is prime; otherwise return False.
Treat 0 and 1 as non-prime.
The final implementation of is_prime must use recursion to test candidate divisors.
Do not use libraries or convert the number to a string.

Constraints

0 <= n <= 10^9
Return a Boolean value.
The final implementation must use recursion for divisor checking.
Stop checking when divisor * divisor > n.

Function Signature

def is_prime(n):

Your solutionPython 3

You need to log in / sign up to run or submit.

Run your code to see test output