Prime Check Coding | Dataford Interview Questions

Pega Platform may need to validate numeric values before applying a decision rule. Given an integer n, determine whether it is prime without relying on a library primality function.

A prime number is an integer greater than 1 with exactly two positive divisors: 1 and itself. Return True if n is prime; otherwise, return False.

Formal Specification

Input: One integer n.
Output: A Boolean value.
You may test divisors only up to the square root of n. Explain why this is sufficient.
Optimize the implementation by handling small values and eliminating even candidates before checking odd divisors.

Constraints

-10^12 <= n <= 10^12
The input is a valid integer
Use O(1) auxiliary space
Do not use a built-in primality function

Function Signature

def is_prime(n):

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