Solving linear congruence

asked 2018-12-09 20:28:31 +0100

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


Tip: provide an explicit example.

slelievre gravatar imageslelievre ( 2021-05-16 15:34:32 +0100 )edit