Beta 0.41.0Beta

Dashboard
Learn
Exercises
Challenges
Visualizer

What's newv0.41.0

SearchSearch for a chapter, module, exercise, challenge, page, or profile

Dashboard
Learn
Exercises
Challenges
Visualizer

is_prime

Your mission

Write a function that returns 1 when an integer is prime and 0 when it is not.

See it in action

is_prime(7): 1
is_prime(12): 0
is_prime(1): 0

Your checklist

n is between -1000 and 100000 inclusive.
A prime is an integer greater than 1 whose only positive divisors are 1 and itself.
Return 1 if n is prime and 0 otherwise, never any other value.
Print nothing. The return value is what gets checked.

Constraints

Expected file: is_prime.c
Allowed functions: None. Write every helper yourself.

C

is_prime

Functions

Your mission

Write a function that returns 1 when an integer is prime and 0 when it is not.

See it in action

is_prime(7): 1
is_prime(12): 0
is_prime(1): 0

Your checklist

n is between -1000 and 100000 inclusive.
A prime is an integer greater than 1 whose only positive divisors are 1 and itself.
Return 1 if n is prime and 0 otherwise, never any other value.
Print nothing. The return value is what gets checked.

Constraints

Expected file: is_prime.c
Allowed functions: None. Write every helper yourself.

Run the tests to grade your code

Minus seven is not prime
The lowest allowed value
Minus one
Zero
One is not prime
Two, the only even prime
Three
Four
Nine, the square of a prime
Twenty-five, the square of a prime
One hundred twenty-one, the square of a prime
Ninety-one is seven times thirteen
Two hundred twenty-one is thirteen times seventeen
Ninety-seven
A four-digit prime
The largest prime in range
The highest allowed value is even
Every prime from -20 to 50
A prime returns exactly 1
Count of primes from -1000 to 10000

Memory will appear here

C