Let \(a, b, c\) be all positive integers such that \(a^2 +b^2= c^2 \).

Prove that, for all positive integers \(n\),
both \(a^{2n+1}+b^{2n+1}+c^{2n+1}\) and \((b+c)(c+a)(a+b)\) are divisible by \(a+b+c\).

Hey guy S please give your comments and also your efforts to solve the problem as I am waiting eagerly of any comments of brillianters

No vote yet

1 vote

×

Problem Loading...

Note Loading...

Set Loading...

Easy Math Editor

`*italics*`

or`_italics_`

italics`**bold**`

or`__bold__`

boldNote: you must add a full line of space before and after lists for them to show up correctlyparagraph 1

paragraph 2

`[example link](https://brilliant.org)`

`> This is a quote`

Remember to wrap math in \( ... \) or \[ ... \] to ensure proper formatting.`2 \times 3`

`2^{34}`

`a_{i-1}`

`\frac{2}{3}`

`\sqrt{2}`

`\sum_{i=1}^3`

`\sin \theta`

`\boxed{123}`

## Comments

Sort by:

TopNewestFirst let's show that \(ab\) is divisible by \(a+b+c\):

\[ab = \dfrac{(a+b)^2-a^2-b^2}{2} = \dfrac{(a+b)^2 - c^2}{2} = \dfrac{(a+b+c)(a+b-c)}{2}\]

Now \(a+b+c\) and \(a+b-c\) differ by an even number, so they have the same parity. However, they can't both be odd, because then the final expression above would not be an integer, even though it's equal to \(ab\) which is an integer. Therefore \(a+b-c\) is even, so \(\dfrac{a+b-c}{2}\) is an integer. Therefore \(ab\) is divisible by \(a+b+c\). \(\square\)

For the rest of the proof, for brevity let \(p = a+b+c\) and let \(q = \dfrac{ab}{a+b+c}\) (which is an integer by the above lemma).

\[\begin{align} (b+c)(c+a)(a+b) & = (p-a)(p-b)(p-c) \\ & = p^3 - (a+b+c)p^2 + (ab+ac+bc)p - abc \\ & = (ab+ac+bc)p - pqc \\ (a+b)(b+c)(c+a) & = p(ab+ac+bc - qc) \end{align}\]

Therefore \((b+c)(c+a)(a+b)\) is divisible by \(p\). \(\square\)

Next we'll show that \(a^{2n+1} + b^{2n+1} + c^{2n+1}\) is divisible by \(p\) for any \(n \ge 0\):

\[a^{2n+1} + b^{2n+1} + c^{2n+1} = a^{2n+1} + b^{2n+1} - (a+b)^{2n+1} + \left[(a+b)^{2n+1} + c^{2n+1} \right] \]

I say that \((a+b)^{2n+1} + c^{2n+1}\) is divisible by \(p\). Why? Using modular arithmetic, we have \(a+b \equiv -c \pmod{p}\). Therefore, \[(a+b)^{2n+1} + c^{2n+1} \equiv (-c)^{2n+1} + c^{2n+1} \equiv -c^{2n+1} + c^{2n+1} \equiv 0 \pmod{p}\]

Hence \((a+b)^{2n+1} + c^{2n+1} = pr\) for some integer \(r\). Continuing with the proof:

\[\begin{align} a^{2n+1} + b^{2n+1} + c^{2n+1} & = a^{2n+1} + b^{2n+1} - (a+b)^{2n+1} + \left[(a+b)^{2n+1} + c^{2n+1} \right] \\ & = a^{2n+1} + b^{2n+1} - (a+b)^{2n+1} + pr \\ & = pr + a^{2n+1} + b^{2n+1} - \sum_{k=0}^{2n+1} \binom{2n+1}{k} a^{2n+1-k} b^k \\ & = pr - \sum_{k=1}^{2n} \binom{2n+1}{k} a^{2n+1-k} b^k \end{align}\]

Now let's consider that last sum. For each \(k\) between \(1\) and \(2n\), the exponents of \(a\) and \(b\) are always at least \(1\). Therefore for each \(k\), \(a^{2n+1-k} b^k\) is divisible by \(ab\). Hence the entire sum is divisible by \(ab\). Let's say the sum equals \(abs\) for some integer \(s\).

\[\begin{align} a^{2n+1} + b^{2n+1} + c^{2n+1} & = pr - abs \\ & = pr - pqs \\ a^{2n+1} + b^{2n+1} + c^{2n+1} & = p(r-qs) \end{align}\]

Therefore, \(a^{2n+1} + b^{2n+1} + c^{2n+1}\) is divisible by \(p\). \(\square\)

Log in to reply

What have you tried? Where are you stuck?

Log in to reply

Superb Ariel

Log in to reply

Thank you ariel Sir but why do you Follow me could you tell me for what reason

Log in to reply

Although your answer is correct

Log in to reply

Sir could you make me understand what poincare conjecture is i tried IT but i van Not Figure out

Log in to reply

Hello sir try another Problem coordinates are Also tough

Log in to reply