Prime Check With Best Approach | Dataford Interview Questions

Q. Check whether a given number is prime or not with the best approach.

Implement is_prime(n) to return True if n is prime and False otherwise. Optimize the check by testing divisors only through the square root of n.

Input: A non-negative integer n.

Output: A Boolean indicating whether n is prime.

Constraints

0 <= n <= 10^12
Return a Boolean value
A prime number is an integer greater than 1 with exactly two positive divisors

Function Signature

def is_prime(n):

Your question is Prime Check With Best Approach. 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