Timeline for What is the fastest way of finding prime between $n$ and $2n$?
Current License: CC BY-SA 3.0
13 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 21, 2017 at 19:28 | comment | added | Prince M | Brute force, if n is small :) | |
| Apr 21, 2017 at 19:14 | comment | added | mdave16 | @Murad Although your question is related to primes, the name 'prime' is also given to ideals, rings, as well as other categories. That's why the 'prime-numbers' tag is better for attention. I also think that if you give more information like precomputational limits or method of calculation? | |
| Apr 21, 2017 at 19:10 | vote | accept | Murad | ||
| Apr 21, 2017 at 19:08 | answer | added | user7530 | timeline score: 4 | |
| Apr 21, 2017 at 19:00 | comment | added | Murad | @DietrichBurde I have no idea.Stackoverflow lets other people edit my questions without asking me. | |
| Apr 21, 2017 at 19:00 | history | edited | Shaun | CC BY-SA 3.0 |
added 2 characters in body
|
| S Apr 21, 2017 at 19:00 | history | edited | Shaun | CC BY-SA 3.0 |
deleted 1 character in body; edited tags
|
| Apr 21, 2017 at 19:00 | review | Suggested edits | |||
| S Apr 21, 2017 at 19:00 | |||||
| Apr 21, 2017 at 18:59 | history | edited | Murad | CC BY-SA 3.0 |
deleted 3 characters in body; edited tags
|
| Apr 21, 2017 at 18:58 | history | edited | Shaun | CC BY-SA 3.0 |
added 9 characters in body; edited tags; edited title; edited tags
|
| Apr 21, 2017 at 18:56 | comment | added | Shaun | Here's a MathJax tutorial :) | |
| Apr 21, 2017 at 18:56 | comment | added | Wojowu | Choosing a number from the interval randomly and testing its primality is better of an idea that you might think - for $n$ large the probability of hitting a prime is about $1/\log n$ by the prime number theorem. If you are careful to not pick numbers divisible by small primes, like $2,3,5$, then you already are improving by a factor of about $4$. | |
| Apr 21, 2017 at 18:51 | history | asked | Murad | CC BY-SA 3.0 |