- #1

ashwinb

- 1

- 0

I basically have to prove that gcd(a, b, c) = gcd(gcd(a,b), c).

So I know that if I just need to prove that the sets {a, b, c} and {gcd(a,b), c} have the same sets of divisors.

You are using an out of date browser. It may not display this or other websites correctly.

You should upgrade or use an alternative browser.

You should upgrade or use an alternative browser.

- Thread starter ashwinb
- Start date

- #1

ashwinb

- 1

- 0

I basically have to prove that gcd(a, b, c) = gcd(gcd(a,b), c).

So I know that if I just need to prove that the sets {a, b, c} and {gcd(a,b), c} have the same sets of divisors.

- #2

tiny-tim

Science Advisor

Homework Helper

- 25,838

- 255

hi ashwinb! welcome to pf!

gcd(a, b, c) = gcd(gcd(a,b), c)

you usually do this sort of thing by proving separately:

i] gcd(a, b, c) ≤ gcd(gcd(a,b), c)

ii] gcd(a, b, c) ≥ gcd(gcd(a,b), c)

how far have you got?

- #3

A. Bahat

- 150

- 0

Share:

- Replies
- 1

- Views
- 2K

- Last Post

- Replies
- 4

- Views
- 2K

- Replies
- 0

- Views
- 7K

- Last Post

- Replies
- 3

- Views
- 8K

- Last Post

- Replies
- 8

- Views
- 2K

- Last Post

- Replies
- 3

- Views
- 16K

- Last Post

- Replies
- 1

- Views
- 1K

- Last Post

- Replies
- 1

- Views
- 3K

- Replies
- 1

- Views
- 2K

- Last Post

- Replies
- 1

- Views
- 1K