Commit 2024-12-20 09:05 c3d1ac11
View on Github →feat(Polynomial): bounding the coefficients of modByMonic/divByMonic (#19163)
Using the usual euclidean algorithm, one can write the coefficients of p %ₘ q and p /ₘ q as sums of products of a few number of coefficients of p and q.
From GrowthInGroups