Timeline for Finding the first 10 million primes
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 10, 2018 at 21:45 | vote | accept | Trevor_zam | ||
| Jan 9, 2018 at 12:42 | comment | added | akshaya pandey | another possible optimization is that we already know 2,3 are primes and all even number > 2 are not prime numbers, thus after 3, we increment the loop counter by 2 instead of 1. Thus, we avoid calculations for all even numbers. | |
| Jan 8, 2018 at 4:21 | answer | added | mdfst13 | timeline score: 6 | |
| Jan 8, 2018 at 3:23 | comment | added | markspace |
BigInteger prime = new BigInteger("2"); then loop over prime = prime.nextProbablePrime(); It would be interesting to see the difference in performance between this and what you have.
|
|
| Jan 7, 2018 at 22:33 | history | edited | Jamal | CC BY-SA 3.0 |
deleted 3 characters in body; edited tags; edited title
|
| Jan 7, 2018 at 22:31 | review | First posts | |||
| Jan 7, 2018 at 23:44 | |||||
| Jan 7, 2018 at 22:27 | history | asked | Trevor_zam | CC BY-SA 3.0 |