Waste less time on Facebook — follow Brilliant.
×

Need help

\[\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.

Note by Akshat Sharda
1 year, 8 months ago

No vote yet
1 vote

  Easy Math Editor

MarkdownAppears as
*italics* or _italics_ italics
**bold** or __bold__ bold

- bulleted
- list

  • bulleted
  • list

1. numbered
2. list

  1. numbered
  2. list
Note: you must add a full line of space before and after lists for them to show up correctly
paragraph 1

paragraph 2

paragraph 1

paragraph 2

[example link](https://brilliant.org)example link
> This is a quote
This is a quote
    # I indented these lines
    # 4 spaces, and now they show
    # up as a code block.

    print "hello world"
# I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
MathAppears as
Remember to wrap math in \( ... \) or \[ ... \] to ensure proper formatting.
2 \times 3 \( 2 \times 3 \)
2^{34} \( 2^{34} \)
a_{i-1} \( a_{i-1} \)
\frac{2}{3} \( \frac{2}{3} \)
\sqrt{2} \( \sqrt{2} \)
\sum_{i=1}^3 \( \sum_{i=1}^3 \)
\sin \theta \( \sin \theta \)
\boxed{123} \( \boxed{123} \)

Comments

Sort by:

Top Newest

Note 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 - 1 year, 8 months ago

Log in to reply

Aah! Thanks!

Akshat Sharda - 1 year, 8 months ago

Log in to reply

Was this your original ? Nice one @Ivan Koswara !!!

Chinmay Sangawadekar - 1 year, 8 months ago

Log in to reply

@Chinmay Sangawadekar No :-P if it would have been why would I write need help

Akshat Sharda - 1 year, 8 months ago

Log in to reply

@Akshat Sharda to prove it :P

Chinmay Sangawadekar - 1 year, 8 months ago

Log 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 - 1 year, 8 months ago

Log in to reply

I can't understand what you're saying! :-) But let's discuss... Are you making another note? @Chinmay Sangawadekar

Akshat Sharda - 1 year, 8 months ago

Log in to reply

wait I will create a note , can you come on slack now ?

Chinmay Sangawadekar - 1 year, 8 months ago

Log in to reply

×

Problem Loading...

Note Loading...

Set Loading...