( 1 + 6 2 + 6 ⋅ 1 2 2 ⋅ 5 + 6 ⋅ 1 2 ⋅ 1 8 2 ⋅ 5 ⋅ 8 + ⋯ ) 3 = ?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Can someone who solved this problem without the formula write a solution for it? Thanks in advance :)
Log in to reply
I managed to solve it a few days ago with an infinite sum. When I get home I'll post it. What I can remember right now was that I used (6^(n-1)) * (n-1)! As the denominator. n from 1. Noting that 0!=1
This is just a way to solve the problem without the binomial formula.
We can notice that every single denominator has a multiple of 6 (or a power of 6). If we expand every denominator and group the 6's, we will find a 'tentative' pattern.
( 6 0 ∗ ( 1 ) 1 + 6 1 ∗ ( 1 ) 2 + 6 2 ∗ ( 2 ) 1 0 . . . ) 3
This expression is almost the same as the problem, but if we input factorials, then we get an exactly equal expression!
= ( 6 0 ∗ ( 0 ! ) 1 + 6 1 ∗ ( 1 ! ) 2 + 6 2 ∗ ( 2 ! ) 1 0 . . . ) 3
= ( 1 + n = 1 ∑ ∞ 6 n ∗ n ! X ) 3
Note: I left out the 1 for simplicity in future steps, therefore started the infinite sum from 1 instead of 0.
By inspecting, we find that the factors in the numerators are just increasing 3's. Consequently, every factor found in the numerators must be "congruent" in MOD 3 (excluding 1, that's why I left it outside). Therefore, we can use something called triple factorials to rename the series into a simpler expression.
Definition : the triple factorial of n, is the product of positive integers less than n and congruent to n mod 3. So, for example, 8 ! ! ! = 8 × 5 × 2 . By using triple factorials, we only need the largest factor of each numerator.
2 , 5 , 8 , 1 1 . . .
Numerators in the infinite sum are therefore expressed as ( 3 n − 1 ) ! ! ! .
= ( 1 + n = 1 ∑ ∞ 6 n ∗ n ! ( 3 n − 1 ) ! ! ! ) 3
Triple factorial are not that famous, but we can transform them to gamma function expressions or simple factorials or Pochhammer notation, which are more popular notations.
Factorial to Gamma
Where k, x are natural numbers and x < k
( k n − x ) ! k = Γ ( k k − x ) k n Γ ( n + k k − x )
= ( 1 + n = 1 ∑ ∞ 6 n ∗ n ! ( 3 n − 1 ) ! ! ! ) 3
= ( 1 + n = 1 ∑ ∞ 6 n ∗ n ! ∗ Γ ( 2 / 3 ) 3 n ∗ Γ ( n + ( 2 / 3 ) ) ) 3
=( 1 + ( 2 3 2 − 1 )) 3
= 4
Thanks for explaining your solution! I have upvoted
Problem Loading...
Note Loading...
Set Loading...
We know,
( 1 + x ) n = 1 + n x + 2 ! n ( n − 1 ) x 2 + 3 ! n ( n − 1 ) ( n − 2 ) x 3 + …
Now,
n x = 3 1 and 2 ! n ( n − 1 ) x 2 = 3 6 5
By solving the above equations, we'll get x = − 2 1 and n = − 3 2 .
Therefore, ( 1 + x ) n = ( 2 1 ) − 3 2 = 4 3 1 , so our answer is ( 4 3 1 ) 3 = 4 .