| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | ecnerwala | 3648 |
| 2 | Benq | 3580 |
| 3 | orzdevinwang | 3570 |
| 4 | cnnfls_csy | 3569 |
| 5 | Geothermal | 3568 |
| 6 | tourist | 3565 |
| 7 | maroonrk | 3530 |
| 8 | Radewoosh | 3520 |
| 9 | Um_nik | 3481 |
| 10 | jiangly | 3467 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | maomao90 | 174 |
| 2 | adamant | 164 |
| 2 | awoo | 164 |
| 4 | TheScrasse | 160 |
| 5 | nor | 159 |
| 6 | maroonrk | 156 |
| 7 | -is-this-fft- | 150 |
| 8 | SecondThread | 147 |
| 9 | orz | 146 |
| 10 | pajenegod | 145 |
Hi!
Today I was surfing Wikipedia and came across this article — Palindromic prime
This article says that the largest known palindromic prime is $$$10^{474500}$$$ + $$$999 * 10^{237249} + 1$$$.
Well it is easy to see that this number is palindrome, but... why is it prime?
I don't find any proof, and I am really curios — how to proof that this number is prime, when number is quite big?
In general, it's quite hard. There is a result from 2002 for which later authors got the Godel prize which proves that primality testing can in fact be done in polynomial time, check this wikipedia link: AKS primality test. There is a lot of advanced research, especially for the uses in cryptography, and the answer to your question is likely not simple (the prime you mention is huge). I am curious if someone has a more optimistic answer...