Opening the reading…
Opening the reading…
DSA FUNDAMENTALS › MATH BASICS
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.
OUTPUT
SamplePrime
What a finished answer prints, from the lesson. Nothing has run yet — press Run and this is replaced by your program’s own output.