It is a known fact that powers of add upto any natural sum less than the next power of . This has been the basis for many practical problems with measurements, and allows us to count binary. The notation of this property is:
Then I realised, this could be extended to powers of , after the sum is multiplied by i.e.
This worked even for , when the sum was multiplied by
Thus, I thought I may generalize it:
, for all
Is this generalization correct, or is there a limit to ?
If there is a proof for this statement, can someone post it below?
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
I actually registered this about a year ago but couldn't find a proof. Tag me if you can.
Log in to reply
Tag? How?
Log in to reply
Like this: @Sharky Kesa
Easy proof.
Let S = sum_i=1^n (x^i). Take -1 from both sides. After multiplying x-1 into the LHS sum and a bit of manipulation, it is easy to see LHS = (x^n+1) + S - S - 1 = RHS.
Thus, we can also conclude that x can be any complex number.
Thank you for the proofs! Now that this has been proven, can it be altered to give the value of any number xy
It's pretty easy.Think of it as a polynomial
xn−1+xn−2+...+1
Then multiply by x−1 and you will simply get (as things cancel)
xn−1
Log in to reply
I just realised that. Me and my slow head.