Results 1 to 3 of 3

- February 5th 2007, 06:51 AM #1

- Joined
- Mar 2006
- Posts
- 705
- Thanks
- 2

## GCD=1 Problem

Let r,s,t be integers. If r=st+1, prove gcd(r,s) = 1.

My works so far:

I know that to prove gcd(r,s) =1, I need to have ra + sb = 1 for some integers a and b.

Now r = st + 1 means 1 = r - st.

Well, r = r(1) and - st means + s(-b)

So 1 = r(1) + s (-t)

Is that right?

Thank you.

KK

- February 5th 2007, 07:02 AM #2

- Joined
- Nov 2005
- From
- New York City
- Posts
- 10,616
- Thanks
- 10

- February 5th 2007, 07:04 AM #3

- Joined
- Mar 2006
- Posts
- 705
- Thanks
- 2