Is there any prime number larger than 998244353 which is such that we can apply NTT on arrays of size up to 2^19 and the prime number is greater than 1e11
# | User | Rating |
---|---|---|
1 | tourist | 3690 |
2 | jiangly | 3647 |
3 | Benq | 3581 |
4 | orzdevinwang | 3570 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | Radewoosh | 3509 |
8 | ecnerwala | 3486 |
9 | jqdai0815 | 3474 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 173 |
2 | awoo | 164 |
3 | adamant | 163 |
4 | TheScrasse | 160 |
5 | nor | 157 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 152 |
8 | Petr | 146 |
8 | orz | 146 |
10 | pajenegod | 145 |
Is there any prime number larger than 998244353 which is such that we can apply NTT on arrays of size up to 2^19 and the prime number is greater than 1e11
Name |
---|
Any prime that is greater than $$$10^{11}$$$ and is in the form of $$$k \times 2^{19}+1$$$, where $$$k$$$ is an integer, should fit your requirements.
Note that $$$998244353 = 119 \times 2^{23}+1$$$.
Why did gray guy need FFT? Go learn bubble sort
$$$100000595969$$$ is the smallest prime $$$p$$$ above $$$10^{11}$$$ with $$$p \equiv 1 \pmod{2^{19}}$$$ (found with a simple python3 session). The smallest primitive root is $$$3$$$.