Re: Congruences

*To*: mathgroup at smc.vnet.net*Subject*: [mg29026] Re: [mg29007] Congruences*From*: "Milton Brown" <miltbrown at earthlink.net>*Date*: Fri, 25 May 2001 01:48:01 -0400 (EDT)*References*: <200105240807.EAA05001@smc.vnet.net> <001701c11450$5422f1c0$f5e3b3d1@pams>*Sender*: owner-wri-mathgroup at wolfram.com

Should have said 19 x = 1 mod 140 solution is x = 59 ----- Original Message ----- From: "Milton Brown" <miltbrown at earthlink.net> To: mathgroup at smc.vnet.net Subject: [mg29026] Re: [mg29007] Congruences > 19 x = 1 mod 40 solution is x = 59 > > x = 12 mod 16 solution is x = 12 > > I have a program I can provide if you are interested. > > Milton L. Brown > miltbrown at earthlink.net > > > ----- Original Message ----- > From: "Flip" <nospam at newsranger.com> To: mathgroup at smc.vnet.net > To: <mathgroup at smc.vnet.net> > Sent: Thursday, May 24, 2001 1:07 AM > Subject: [mg29026] [mg29007] Congruences > > > > 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 > > > > >

**References**:**Congruences***From:*Flip <nospam@newsranger.com>