Solving linear congruence

asked 6 years ago

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.

Preview: (hide)

Comments

Tip: provide an explicit example.

slelievre gravatar imageslelievre ( 3 years ago )