| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | ecnerwala | 3649 |
| 2 | Benq | 3581 |
| 3 | orzdevinwang | 3570 |
| 4 | Geothermal | 3569 |
| 4 | cnnfls_csy | 3569 |
| 6 | tourist | 3565 |
| 7 | maroonrk | 3531 |
| 8 | Radewoosh | 3521 |
| 9 | Um_nik | 3482 |
| 10 | jiangly | 3468 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | maomao90 | 174 |
| 2 | awoo | 164 |
| 3 | adamant | 163 |
| 4 | TheScrasse | 159 |
| 5 | nor | 158 |
| 6 | maroonrk | 156 |
| 7 | -is-this-fft- | 152 |
| 8 | SecondThread | 147 |
| 9 | orz | 146 |
| 10 | pajenegod | 145 |
how to generate next prime number for a given long interger n where n can be 0<=n<=10^18
for example if n is 10 then the next prime number is 11. how can i do it in 0.5 sec?? is there any number theory? pls give me any suggestion..
thanks in advance..
http://en.wikipedia.org/wiki/Prime_gap, so simple bruteforce is fast( of course, you need a reasonable primality test).
How to check prime ????? sqrt(10^18) = 10^9
http://help.topcoder.com/data-science/competing-in-algorithm-challenges/algorithm-tutorials/primality-testing-non-deterministic-algorithms/, there are some non-deterministic methods that work very well with this limit(10^18).
after reading the topcoder tutorial & wiki link, i implement in this way..my code is it okay??
http://www.wikihow.com/Check-if-a-Number-Is-Prime