0

Solving linear congruence

edit

• linear
• congruence
• symbolic
• equation
• solve

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

kdr01
1 ●1 ●1 ●1

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

Comments

Tip: provide an explicit example.

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

add a comment

Be the first one to answer this question!

Please start posting anonymously - your entry will be published after you log in or create a new account.