I am working on ps1:#1. I have been banging me head against the wall for some time now trying to figure it out. It seems that the simplest way to find a prime number is to take your test (n%n-1) and check for remainder == 0. This way you can differentiate between prime and not prime numbers. However, I cannot seem to get things to work right in python, and now I feel that this may not even be an accurate way to calculate prime numbers (deterministically).
I would greatly appreciate some pointers in the right direction on how to get this assignment to work. Thanks in advance.

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!

are you online?

yes, I am

go to chat

Looking for something else?

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

## More answers

Looking for something else?

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