# 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.

add a comment

Solving linear congruence

`solve_mod`

function cannot handle such large moduli apparently.

add a comment

Asked: **
2018-12-09 13:28:31 -0600
**

Seen: **639 times**

Last updated: **Dec 09 '18**

Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.