Solving linear congruence
Is there a simple way to solve a linear congruence modulo an integer with large prime factors in Sage? solve_mod
function cannot handle such large moduli apparently.
Asked: 2018-12-09 20:28:31 +0200
Seen: 2,248 times
Last updated: Dec 09 '18
Tip: provide an explicit example.