• anonymous
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.
MIT 6.00 Intro Computer Science (OCW)
• Stacey Warren - Expert brainly.com
Hey! We 've verified this expert answer for you, click below to unlock the details :)
SOLVED
At vero eos et accusamus et iusto odio dignissimos ducimus qui blanditiis praesentium voluptatum deleniti atque corrupti quos dolores et quas molestias excepturi sint occaecati cupiditate non provident, similique sunt in culpa qui officia deserunt mollitia animi, id est laborum et dolorum fuga. Et harum quidem rerum facilis est et expedita distinctio. Nam libero tempore, cum soluta nobis est eligendi optio cumque nihil impedit quo minus id quod maxime placeat facere possimus, omnis voluptas assumenda est, omnis dolor repellendus. Itaque earum rerum hic tenetur a sapiente delectus, ut aut reiciendis voluptatibus maiores alias consequatur aut perferendis doloribus asperiores repellat.

Looking for something else?

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