Prime Number Check Programming Challenge

Problem

A prime number is greater than 1 and divisible only by 1 and itself. Checking divisors up to the square root of n is enough.

Implement is_prime(n).

n: The number to test.

Return true if n is prime, otherwise false.

-1,000 ≤ n ≤ 1,000,000,000,000

Example 1

Input:
n = 29

Expected output:
expected = True

Input:
long long n = 29;

Expected output:
bool expected = true;

Input:
long n = 29;

Expected output:
bool expected = true;

29 has no divisors other than 1 and 29.

Example 2

Input:
n = 21

Expected output:
expected = False

Input:
long long n = 21;

Expected output:
bool expected = false;

Input:
long n = 21;

Expected output:
bool expected = false;

21 = 3 × 7, so it is not prime.

This challenge is adapted for CodeUtility. Follow the statement and constraints above.