Timeline for Finding Primes in Java
Current License: CC BY-SA 3.0
17 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 23, 2017 at 12:41 | history | edited | CommunityBot |
replaced http://stackoverflow.com/ with https://stackoverflow.com/
|
|
| Sep 3, 2014 at 16:41 | history | rollback | Pimgd |
Rollback to Revision 6
|
|
| Sep 3, 2014 at 16:32 | history | edited | syb0rg | CC BY-SA 3.0 |
Just made a new command for the Big O notation
|
| Aug 3, 2014 at 16:46 | history | edited | Jamal | CC BY-SA 3.0 |
added 15 characters in body
|
| Aug 3, 2014 at 16:45 | vote | accept | TheCoffeeCup | ||
| Aug 3, 2014 at 16:43 | history | edited | syb0rg | CC BY-SA 3.0 |
Use times symbol, not a star
|
| Aug 3, 2014 at 10:59 | comment | added | 200_success | @BoristheSpider The Sieve works using just repeated addition, rather than division or the modulo operator. | |
| Aug 3, 2014 at 10:56 | comment | added | Boris the Spider | @200_success what are the advantages of an infinite sieve vs the simple technique below? Is an infinite sieve much faster? Are there any comparisons of the two techniques? | |
| Aug 3, 2014 at 10:39 | comment | added | 200_success |
Alternatively, implement a Prime class that presents the illusion of an "infinite" sieve. It's tricky to do implement correctly, though.
|
|
| Aug 3, 2014 at 10:31 | comment | added | 200_success | @mleyfman A reasonable estimate of the size of the sieve needed is 1.4 max ln(max), where the factor of 1.4 inflates the estimate generously. | |
| Aug 3, 2014 at 10:08 | history | rollback | Pimgd |
Rollback to Revision 2
|
|
| Aug 3, 2014 at 10:06 | history | edited | Pimgd | CC BY-SA 3.0 |
rollback until fix
|
| Aug 3, 2014 at 1:55 | comment | added | mleyfman | There is no deterministic formula for the number of primes below n. Furthermore, the "density" of primes decreases with n (but is always positive), and so it will always take longer and longer to find more primes. | |
| Aug 3, 2014 at 1:53 | history | edited | syb0rg | CC BY-SA 3.0 |
Made the LaTeX stuff more pretty.
|
| Aug 3, 2014 at 1:27 | comment | added | TheCoffeeCup | But how am I supposed to determine the number of primes that a number will produce? e.g. Input was 10, so what number do I set as max? | |
| Aug 3, 2014 at 0:35 | comment | added | 200_success | The sieve-of-eratosthenes is a much better strategy, especially when you want to find many primes. | |
| Aug 3, 2014 at 0:32 | history | answered | Pimgd | CC BY-SA 3.0 |