So, I first asked- is it even possible to write every power of 3 as a sum of the terms preceding it? Instinct said yes, and with a little guesswork I noticed a pattern: 3-1 = 2(1), 9-1 = 2(1+3), 27-1 = 2(1+3+9), and so on. This led to the general formula, Sum(i=0, n-1) {3i
Before I state the general formula for xn
Our goal is to prove that 1+2(1+3+9+...+3n-1
Multiplying out and adding the 1 to the first term of the sum,
3+2(3)+2(9)+...+2(3n-1
Adding the first two terms of the LHS,
9+2(9)+2(27)+...+2(3n-1
Adding the first two terms of the LHS,
27+2(27)+...+2(3n-1
And so on. This domino process by which each preceeding sum adds with the next term to create a power of three can be quantified by this relationship: 3k-1
A similar proof can be can be used to show that the formula for 2^n works, or for any consequent base. Here's the general formula: 1+(x-1)*Sum(i=0, n-1) {xi} = xn
After creating this formula and remembering one of my older finds on the same topic, I had the desire to somehow combine the two finds and generate some cool new relationship. (The other formula came up with the same kind of result, a formula for xn