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.
Revision history [back]
 | 1 | initial version |
| | 1 | initial version |
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.
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.