Prime Number Function | Dataford Interview Questions

Write a function to judge if a number is a prime number.

Implement is_prime(n), which accepts an integer and returns True if n has exactly two positive divisors, 1 and itself. Otherwise, return False. Values less than 2 are not prime. The solution should avoid testing divisors greater than the square root of n.

Contract

Input: one integer n
Output: a Boolean

Constraints

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

Function Signature

def is_prime(n):

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