Results 1 to 1 of 1

Thread: Euclid's Algorithm

LinkBack
- LinkBack URL
- About LinkBacks
Thread Tools
- Show Printable Version
- Subscribe to this Thread…
Display
- Linear Mode
- Switch to Hybrid Mode
- Switch to Threaded Mode

March 29th 2009, 04:54 AM #1

Jimmy_W

Junior Member

Joined

Sep 2008

Posts

47

Euclid's Algorithm

Hello,
Using a calculator,I know that the solution to $d = 55^{-1} \ (mod \ 10752)$ is d = 391.

Can someone please show me how to prove this by hand using Euclid's Algorithm? Any help would be greatly appreciated.
Thanks

Follow Math Help Forum on Facebook and Google+

« Finding last two digits of a large number | Orders, Primitive Roots »

Similar Math Help Forum Discussions

Euclid Algorithm

Posted in the Number Theory Forum

Replies: 3
Last Post: January 15th 2012, 11:32 AM
Finding GCD using Euclid's algorithm

Posted in the Number Theory Forum

Replies: 15
Last Post: September 23rd 2008, 06:45 PM
Another GCD using Euclid's Algorithm

Posted in the Number Theory Forum

Replies: 3
Last Post: September 23rd 2008, 09:03 AM
Euclid's algorithm

Posted in the Number Theory Forum

Replies: 1
Last Post: August 3rd 2008, 05:18 AM
Euclid Algorithm

Posted in the Number Theory Forum

Replies: 5
Last Post: April 10th 2008, 05:28 AM

Search Tags

algorithm, euclid

Copyright © 2005-2013 Math Help Forum. All rights reserved.