Prime Number Method | Dataford Interview Questions

Write a method to determine if a number is prime.

Return a Boolean indicating whether the given non-negative integer has exactly two positive divisors: 1 and itself. For example, 17 returns true, while 18 returns false.

Input and Output

Implement is_prime(n), which accepts an integer and returns a Boolean.

Constraints

0 <= n <= 10^9
n is an integer
Values less than 2 are not prime

Function Signature

def is_prime(n):

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