Check Prime Number | Dataford Interview Questions

Check whether the given no is prime or not.

Implement is_prime(n) to return True when n has exactly two positive divisors, 1 and itself. Return False for numbers less than 2. Use an efficient primality test rather than checking every value up to n.

Input: One integer n.

Output: A Boolean value.

Constraints

-10^9 <= n <= 10^9
Return a Boolean value.
The input is a single integer.

Function Signature

def is_prime(n):

Your question is Check Prime Number. 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