Drexel dragonThe Math ForumDonate to the Math Forum



Search All of the Math Forum:

Views expressed in these public forums are not endorsed by Drexel University or The Math Forum.


Math Forum » Discussions » sci.math.* » sci.math

Topic: a number theory problem
Replies: 1   Last Post: May 19, 2012 4:58 PM

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]
Don Coppersmith

Posts: 53
Registered: 2/2/06
Re: a number theory problem
Posted: May 19, 2012 4:58 PM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

Recall how we compute gcd: repeatedly subtract
multiples of the smaller number from the larger until
we reach gcd(g,0)=g. At each step, if n=m*k+p,
use gcd(n,m) = gcd(m,p).

Now consider gcd(a^m-1,a^n-1). Again suppose
n=m*k+p. Subtract a multiple of (a^m-1) from
(a^n-1) to get (a^p-1), because

(a^m-1)*(a^p + a^(p+m) + a^(p+2m) + ... + a^(n-m)
= a^n - a^p.

(a^n-1) - (a^n-a^p) = (a^p-1).

So gcd(a^n-1,a^m-1) = gcd(a^m-1,a^p-1).

So we just follow the same steps in parallel:
mimicking the steps that compute gcd(n,m)=d
to compute gcd(a^n-1,a^m-1) = a^d-1.

Don Coppersmith


> For m and n positive integers and a > 1, why is d =
> gcd(a^m - 1, a^n - 1) = a^(m,n) - 1 where (m.n) =
> gcd(m,n)?
>
> It easy to see if t|N then a^t - 1 divides a^N - 1
> (geometrical series), so it follows that a^(m,n) - 1
> divides d. But why is it equal to d?




Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© Drexel University 1994-2014. All Rights Reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.