(2n±1)2+⌊2(2n±1)2⌋2=⌈2(2n±1)2⌉2
I somehow found an equation that can generate Pythagorean triplets as shown above for any integral value of n, regardless of positive or negative.
But I can't find a formal proof... So any approach or suggestions?
#NumberTheory
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
Let ⌊2(2n±1)2⌋=v Then, ⌈2(2n±1)2⌉=v+1(2n±1)2=2v+1
Hence, the conjectured equation is equivalent to (2v+1)+(v)2=(v+1)2 Which is obviously true! Q.E.D.
Look at the 2n+1 case. (2n+1)^2=4n^2+4n+1. As in the expression, we are dividing by 2. The 1/2 will be canceled when the floor is taken, so we will have (2n^2+2n)^2 for that part. The LHS will then become (2n+1)^2+(2n^2+2n)^2. Now we have the RHS. Applying a similar method we get 4n^2+4n+1 to round up with the ceiling, so now we have (2n^2+2n+1)^2. Now equate the LHS and RHS, yielding (2n+1)^2+(2n^2+2n)^2=(2n^2+2n+1)^2. Dy difference of square we know this is true because the (2n+1)^2 must equal (2n^2+2n+2n^2+2n+1). Hence proven. The other case simplifies in a nearly identical way. If you need more specifications, just ask. Nice formula.