Hello, fellow Brillianters, how are you all doing?
Recently I came across this question here, and whilst trying to come up with a proof for my solution, I stumbled upon this equation here:
, where both a and b are non-negative integers.
I wanted to prove that there are only three pairs of solutions for this question; namely, , and .
My first impulse was to try to prove that if any odd integer , , is not a solution, then cannot be a solution as well. I thought that it was sufficient until Calvin Lin came along and showed me that I only proved that and cannot be solutions at the same time. Worst part is that he has no idea either of how to prove this.
So here I am, my friends; do you know a way to prove my statement right (or wrong)? I'd appreciate any form of help you can provide me. Thanks!
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
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
This is a Ramanujan-Nagell type equation.
According to Wikipedia, a result of Siegel implies that the number of solutions in each case is finite, but not much further is known.
I believe It is unlikely that there is a simply proof of this statement.