"badmod" solving equations in modular arithmetic
- To: mathgroup at smc.vnet.net
- Subject: [mg37761] "badmod" solving equations in modular arithmetic
- From: AGUIRRE ESTIBALEZ Julian <mtpagesj at lg.ehu.es>
- Date: Tue, 12 Nov 2002 03:13:09 -0500 (EST)
- Organization: Universidad del Pais Vasco/Euskal Herriko Unibertsitatea
- Sender: owner-wri-mathgroup at wolfram.com
Dear MathGroup,
I need to solve equations in modular arithmetic with large prime
modulus. One example is
Solve[{x^4 == -14436, Modulus == 457381}]
for which I get the message
Roots::badmod: Cannot extract roots of input modulo 457381
Is there a known limit on the size of Modulus? In fact, I do not need the
solutions, I just need to know if there are any. So my second question: is
there a bulit-in function or a package that computes a "cuartic"
JacobiSymbol?
Thanks,
Julian Aguirre | Voice: +34 946012659
Departamento de Matematicas | Fax: +34 944648500
Universidad del Pais Vasco | Postal: Aptdo. 644, 48080 Bilbao, Spain
| email: mtpagesj at lg.ehu.es