4 ms·
Changing numbers to modulos under a large prime won't help you either. You can still divide numbers under modulo using Euclid algorithm [1] [1] https://en.wiki
by Grue3 11y ago
Changing numbers to modulos under a large prime won't help you either. You can still divide numbers under modulo using Euclid algorithm [1]
[1] https://en.wikipedia.org/wiki/Modular_multiplicative_inverse https://en.wikipedia.org/wiki/Modular_multiplicative_inverse