Very Big Mod

Правка en1, от oursaco, 2022-04-14 08:14:16

I've been working on an NTT implementation, which needs a big modulo in the form of x*2^k + 1. Does anyone know any mods of this form around 1e25. I rly don't want to use Chinese remainder theorem T-T.


  Rev. Язык Кто Когда Δ Комментарий
en1 Английский oursaco 2022-04-14 08:14:16 214 Initial revision (published)