Solving linear congruence

asked 2018-12-09 13:28:31 -0500

kdr01 gravatar image

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.

edit retag flag offensive close merge delete