I'm stuck on ps1a
How do I test if a particular candidate is prime? I understand that I need to check if there is a remainder when I divide by any integer>1, but how do I actually structure that test?

Hey! We 've verified this expert answer for you, click below to unlock the details :)

I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!

Not only odd - 2 too. And up to a certain limit, which is way lower than the number you test.

Looking for something else?

Not the answer you are looking for? Search for more explanations.