Opening the reading…

Checking Primality Stops at the Square Root — drill-1 — LearnYard

03 Dsa FundamentalsMath BasicsCheck if a Number is Prime without using the Sieve of Eratosthenes

Lesson · no judge

1 of 4 parts done

1/4

DSA FUNDAMENTALS › MATH BASICS

Write it, run it, read the output

Reading · 5 minQuiz · 5 questions2 code drills · run only

This is a scratch drill — your code runs, nothing is graded or recorded. No test cases, no expected output, no verdict.

TASK

Implement isPrime for n = 29. Test candidate divisors through the inclusive square-root bound, then print "Prime" when the number is prime.

C++

Loading editor…

OUTPUT

Sample

Prime

What a finished answer prints, from the lesson. Nothing has run yet — press Run and this is replaced by your program’s own output.

Previous · Calculate the LCM and GCD of Two Numbers3 parts left before this item is marked done.Next part · Code drill 2

AI TUTORTalk to tutor

Scoped to Check if a Number is Prime without using the Sieve of Eratosthenes. The tutor can see the reading, its checkpoints and your drill code.

The tutor reads this lesson alongside you and answers questions about it — nudging you towards the answer rather than handing it over.

Sign in to use the tutor

The tutor will not answer a quiz question for you, and it will not paste a working drill. It explains the reading it can see.