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

Solving linear congruence

`solve_mod`

function cannot handle such large moduli apparently.

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

Asked: ** 2018-12-09 20:28:31 +0200 **

Seen: **786 times**

Last updated: **Dec 09 '18**

How to make solve to use certain variables on the right side

How to get all (numerical) solutions of an equation?

Solve large system of linear equations over GF(2)

Solve system of equations with additional conditions in sage

Unable to make sense of Maxima expression

Interactive maxima question on fraction value during solve()

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.

Tip: provide an explicit example.