| # | User | Rating |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3831 |
| 3 | Radewoosh | 3646 |
| 4 | jqdai0815 | 3620 |
| 4 | Benq | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | gamegame | 3386 |
| 10 | ksun48 | 3373 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 164 |
| 1 | maomao90 | 164 |
| 3 | Um_nik | 163 |
| 4 | atcoder_official | 160 |
| 5 | -is-this-fft- | 158 |
| 6 | awoo | 157 |
| 7 | adamant | 156 |
| 8 | TheScrasse | 154 |
| 8 | nor | 154 |
| 10 | Dominater069 | 153 |
Confusion regarding a property of Euler's Totient Function
I was trying to solve this(LightOJ 1370) problem. When I failed to come up with a memory efficient solution, I looked at some AC solutions.
Interestingly, the solutions used a property that states that the minimum number that has a phi value greater than or equal to a given number, must be the first prime number greater than the given number. For example, For 20, the answer is 23. I am looking for a proof of this property.
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en6 |
|
Aritra741 | 2020-09-05 10:12:39 | 14 | Tiny change: 'htOJ-1370) prob' -> 'htOJ-1370)(LightOJ 1370) prob' | |
| en5 |
|
Aritra741 | 2020-09-04 16:17:45 | 182 | ||
| en4 |
|
Aritra741 | 2020-09-04 15:16:52 | 182 | ||
| en3 |
|
Aritra741 | 2020-09-04 14:26:23 | 7 | Tiny change: 'ing for a formal proof of ' -> 'ing for a proof of ' | |
| en2 |
|
Aritra741 | 2020-09-04 14:24:40 | 3 | Tiny change: 'solutions. \nInteres' -> 'solutions.\n \nInteres' | |
| en1 |
|
Aritra741 | 2020-09-04 14:21:47 | 523 | Initial revision (published) |
