I need to calculate the remainder of a 50000 digits BigInt divided by a 49999 digits BigInt What’s the fastest way to do it? mod()? mod1()? x%y? rem()? Is there any package to do it? Thanks!

What is faster? Modular Arithmetic functions and operations

stevengj December 4, 2020, 1:08am 21

I wouldn’t use a bigint for digits at all, since that isn’t a big number. Instead use big(10)^c

Topic		Replies	Views
Modular multiplication without overflow Performance	32	3716	November 23, 2022
Checking divisibility efficiently General Usage numbers , math	6	392	October 17, 2024
Faster `div`, `rem` and `mod` for small integers? Performance	4	209	June 27, 2025
Why is fld(a, b) so much slower than floor(a / b)? General Usage	11	1356	November 11, 2019
Optimizing remainder with constant modulus implementation Performance	2	569	April 6, 2021