Ask your own question, for FREE!
MIT 6.00 Intro Computer Science (OCW) 7 Online
OpenStudy (anonymous):

In assignment #1, should I assume that 2 and 3 are prime and use the 6+i format for integers to generate potential primes and then test up to sqrt of n?

OpenStudy (anonymous):

As long as the implementation work, you should be fine. There isn't only a correct way to do it, you can use Sieve's method, brute-force method, or something else. :-)

OpenStudy (anonymous):

Alright. I am going to try to craft my own tomorrow. Spent a couple hours attempting this problem, and ended up looking at a few examples of how people accomplished it. I feel like I understand what they did.

OpenStudy (anonymous):

6n+1 and 6n+5 have equal probabilities to occur ... usually a loop from 2 to sqrt(n) works better to find potentially i guess!

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!