Prime Checking | Dataford Interview Questions

Check if a number is prime.

Implement is_prime(n), which returns True when n has exactly two positive divisors and False otherwise. The input is an integer n with 0 <= n <= 10^12; return a Boolean result. For example, is_prime(29) returns True, while is_prime(1) returns False.

Constraints

0 <= n <= 10^12
The input is an integer.
Return a Boolean value.

Function Signature

def is_prime(n):

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

Check if a number is prime.

Constraints

0 <= n <= 10^12
The input is an integer.
Return a Boolean value.

Function Signature

def is_prime(n):

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