MathGroup Archive 2001

[Date Index] [Thread Index] [Author Index]

Search the Archive

Re: Congruences

  • To: mathgroup at smc.vnet.net
  • Subject: [mg29016] Re: Congruences
  • From: Ignacio Rodriguez <ignacio at sgirmn.pluri.ucm.es>
  • Date: Fri, 25 May 2001 01:47:54 -0400 (EDT)
  • Organization: UCM
  • References: <9eihq2$58n@smc.vnet.net>
  • Sender: owner-wri-mathgroup at wolfram.com

1. Try with Solve

Solve[{19 x==1,Modulus==140},x,Mode->Modular]

{x->59,Modulus->140}

Mod[Times[19,59],140]

1

2. Even easier. Use Mod

Mod[x,16]==12

No matter the size of x, just try not to misspell it.

Flip wrote:

> Hi All,
>
> I was having a difficult time find this in the documentation and was hoping
> someone here could help.
>
> 1.  How do you solve the congruence 19 x = 1 mod 140?
>
> 2.  I am trying to verify that x = 12 mod 16 (where x is a 1024-bit number).
> How do I do that (essentially the same as question 1.)?
>
> Thank you ... Flip

--

Ignacio Rodriguez Ramirez de Arellano
Unidad de RMN
Universidad Complutense
Paseo Juan XXIII, 1
Madrid 28040, Spain

Tel. 34-91-394-3288
Fax  34-91-394-3245
e-mail: ignacio at sgirmn.pluri.ucm.es





  • Prev by Date: RE: A tricky equation
  • Next by Date: Re: Congruences
  • Previous by thread: Re: Congruences
  • Next by thread: Re: Congruences