How to find how many numbers in range [l, r] are coprime to n where ** r-l < n**? [ in O(sqrt(n)) complexity]
Thanks in advance.
# | User | Rating |
---|---|---|
1 | ecnerwala | 3649 |
2 | Benq | 3581 |
3 | jiangly | 3578 |
4 | orzdevinwang | 3570 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | tourist | 3565 |
8 | maroonrk | 3531 |
9 | Radewoosh | 3521 |
10 | Um_nik | 3482 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 161 |
4 | TheScrasse | 159 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 152 |
8 | SecondThread | 146 |
8 | orz | 146 |
10 | pajenegod | 145 |
Finding number of Coprime Numbers in a specific range
Thanks in advance.
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en4 | theFakeFellow | 2021-04-07 19:00:54 | 1 | Tiny change: '* where ** _r-l < n_*' -> '* where **_r-l < n_*' | ||
en3 | theFakeFellow | 2021-04-07 19:00:22 | 2 | Tiny change: '--------\nThanks i' -> '--------\n\nThanks i' | ||
en2 | theFakeFellow | 2021-04-07 18:59:43 | 262 | |||
en1 | theFakeFellow | 2021-04-07 18:59:03 | 204 | Initial revision (published) |
Name |
---|