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.
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: 6 years ago
Seen: 2,685 times
Last updated: Dec 09 '18
Tip: provide an explicit example.