Write a Simple Prime Checker | Dataford Interview Questions

How would you write a program to find if a number is prime?

Implement is_prime(n) to return True when n is prime and False otherwise. Treat all integers less than 2 as non-prime, and use an approach efficient enough for values up to 10^12.

Constraints

n is an integer
-10^12 <= n <= 10^12
Return a boolean value
An integer is prime only if it is greater than 1 and has no positive divisors other than 1 and itself

Function Signature

def is_prime(n):

Your question is Write a Simple Prime Checker. 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

How would you write a program to find if a number is prime?

Implement is_prime(n) to return True when n is prime and False otherwise. Treat all integers less than 2 as non-prime, and use an approach efficient enough for values up to 10^12.

Constraints

n is an integer
-10^12 <= n <= 10^12
Return a boolean value
An integer is prime only if it is greater than 1 and has no positive divisors other than 1 and itself

Function Signature

def is_prime(n):

Your question is Write a Simple Prime Checker. 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.