# Thread:

1. ## I need help finishing a gcd proof

the question was to prove:
if m and n are positive integers and gcd(m, n) = d, then gcd(2n - 1, 2m - 1) = 2d - 1.

my approach was the following:

given gdc(m,n) = d, the d|m and d|n also m = dp and n = dq for some integers p and q.
so, (2n - 1, 2m - 1) = (2dq - 1, 2dp - 1)
2dq - 1 = 2d - 1(2d(q-1) + 2d(q-2) +...+ 2d + 1) = (2d - 1)(s) for some integer s.
2dp - 1 = 2d - 1(2d(p-1) + 2d(p-2) +...+ 2d + 1) = (2d - 1)(t) for some integer t.

so (2d - 1) is a divisor of (2n - 1, 2m - 1), however I do not know how to show that it is the gcd(2n - 1, 2m - 1) or how to show that
gcd(s,t) = 1.

my instructor suggested proof by induction showing true for m + n < s, then true for m + n = s. I can not see how to start the proof
using his suggestion. any help would be appreciated.

2. ## Re: I need help finishing a gcd proof

Hey bskcase98.

If something is a greatest divisor (let alone a greatest common divisor), then it means that all divisors must be less than that divisor. In other words if you have n and the greatest divisor of n is a then if n = ab then b <= a. From this can you show that this holds?

3. ## Re: I need help finishing a gcd proof

You've proven that, if $d = gcd(a,b)$, then $(2^d - 1)$ divides the $gcd((2^a - 1), (2^b-1))$.

If you could prove that $gcd((2^a - 1), (2^b-1))$ divides $(2^d - 1)$, then you'd be done, since they'd then be equal.

Recall in a previous thread of yours called "need help with an Eucledian algorthim and gcd involving factorials and large exponets", I gave a long derivation? In there I wrote:
"Proposition: If d divides $(b^y - 1)$ and d divides $(b^y - 1)$, then d divides $(b^{gcd(x, y)} - 1)$. Rather than work out a proof, I'll run through it step by step for this problem."
Well, now that proposition is exactly what you need. Switching the labelling back to the current problem, you'd be done if you could prove:

Lemma: If $c$ divides $(2^a - 1)$ and $c$ divides $(2^b - 1)$, then $c$ divides $(2^{gcd(a, b)} - 1)$.

If you can prove that Lemma, then, since $c$ = $gcd((2^a - 1), (2^b-1))$ divides both $(2^a - 1)$ and $(2^b - 1)$, it would follow that

$c = gcd((2^a - 1), (2^b-1))$ divides $(2^{gcd(a, b)} - 1)$.

And since you already have shown that $(2^{gcd(a,b)} - 1)$ divides the $gcd((2^a - 1), (2^b-1))$, you'd then be done.

That insane calculation I did in that other problem lays out - perhaps - the way for you to prove the above Lemma.

By the way, that insane calculation is, I believe, called Euclid's Algorithm for finding the gcd.

Just a thought. Good luck.
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 22, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.939906656742096, "perplexity_flag": "middle"}