Prime Number Logic | Dataford Interview Questions

Write the logic to check whether a number is prime.

Implement is_prime(n) to return True when n is prime and False otherwise. A prime number is an integer greater than 1 with exactly two positive divisors. Optimize the check so it does not test every value up to n.

Function: def is_prime(n):

Input: One integer n. Output: A Boolean.

Constraints

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

Function Signature

def is_prime(n):

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