\[\gcd(a^{2^{m}}+1,a^{2^{n}}+1 )=\begin{cases} 1 \text{ if }a \text { is even} \\ 2 \text{ if }a \text { is odd} \end{cases}\]

If \(m \neq n\), prove the equation above.

\[\gcd(a^{2^{m}}+1,a^{2^{n}}+1 )=\begin{cases} 1 \text{ if }a \text { is even} \\ 2 \text{ if }a \text { is odd} \end{cases}\]

If \(m \neq n\), prove the equation above.

No vote yet

1 vote

×

Problem Loading...

Note Loading...

Set Loading...

## Comments

Sort by:

TopNewestNote that \(a^{2^{m+1}} - 1 = (a^{2^m} - 1)(a^{2^m} + 1)\). Thus, if \(n > m\), then \(a^{2^n} - 1 = (a^{2^m} - 1)(a^{2^m} + 1)(a^{2^{m+1}} + 1) \ldots (a^{2^{n-1}} + 1)\). Thus \(a^{2^n} + 1 = (a^{2^m} + 1) \cdot k + 2\) for some integer \(k\). We know that \(\gcd(a, b+ka) = \gcd(a, b)\), thus \(\gcd(a^{2^m} + 1, a^{2^n} + 1) = \gcd(a^{2^m} + 1, 2)\). If \(a\) is odd, clearly \(a^{2^m} + 1\) is even, so the GCD is 2. If \(a\) is even, clearly \(a^{2^m} + 1\) is odd, so 2 doesn't divide it, thus the only remaining choice is that the GCD is 1. – Ivan Koswara · 8 months, 3 weeks ago

Log in to reply

– Akshat Sharda · 8 months, 3 weeks ago

Aah! Thanks!Log in to reply

@Ivan Koswara !!! – Chinmay Sangawadekar · 8 months, 3 weeks ago

Was this your original ? Nice oneLog in to reply

– Akshat Sharda · 8 months, 3 weeks ago

No :-P if it would have been why would I write need helpLog in to reply

– Chinmay Sangawadekar · 8 months, 3 weeks ago

to prove it :PLog in to reply

I had a new Idea !!!

Let us research some properties of gcd of two towers leaving same remainder modulo some number

@Akshat Sharda – Chinmay Sangawadekar · 8 months, 3 weeks ago

Log in to reply

@Chinmay Sangawadekar – Akshat Sharda · 8 months, 3 weeks ago

I can't understand what you're saying! :-) But let's discuss... Are you making another note?Log in to reply

– Chinmay Sangawadekar · 8 months, 3 weeks ago

wait I will create a note , can you come on slack now ?Log in to reply