n = 1 ∏ ∞ n ( n + 3 ) ( n + 1 ) ( n + 2 ) = ?
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.
You don't even need to use logarithm. You can use the technique of telescoping product. Note that the product can be rewritten as,
n = 1 ∏ ∞ n ( n + 3 ) ( n + 1 ) ( n + 2 ) = ( n = 1 ∏ ∞ n ) ⋅ ( n = 4 ∏ ∞ n ) ( n = 2 ∏ ∞ n ) ⋅ ( n = 3 ∏ ∞ n ) = 2 × 3 2 × 3 2 ⋅ ( n = 4 ∏ ∞ n 2 n 2 ) = 3
The product converges because the denominator grows faster than the numerator.
Log in to reply
Great solution yar...
Its just that I am more comfortable with log :)
Log in to reply
Well yes, everybody has their own preferences. :)
Greatly solved. Nice
you are BRILLIANT bro......
Log in to reply
I'm nowhere near brilliant, dude! I'm just an ordinary guy with somewhat of an average knowledge in math.
Log in to reply
@Prasun Biswas – i am glad to follow a guy like you............
Nice solution :) This one makes mine look so dumb .
+1 !
This was indeed an oral problem.
Nice solution.... Did in a similar way..
Figure these two out separately: (n+1)/n and (n+2)/(n+3). You have R+1 and 3/R+3= 3 × R+1/R+3 Since R is "infinite" R+1/R+3 = 1 So answer is 3
We know that
n = 1 ∏ ∞ n ( n + 3 ) ( n + 1 ) ( n + 2 ) = n = 1 ∏ ∞ ( n + 1 ) × n = 1 ∏ ∞ ( n + 2 ) × n = 1 ∏ ∞ n 1 × n = 1 ∏ ∞ ( n + 3 ) 1
Let's deal with the first product .
n = 1 ∏ ∞ ( n + 1 ) = n → ∞ lim ( 1 + 1 ) ( 1 + 2 ) ( 1 + 3 ) … ( 1 + n )
Let's use the Gauss form of Gamma Function , which is
Γ ( x ) = n → ∞ lim x ( x + 1 ) ( x + 2 ) … ( x + n ) n x n !
∴ We have ,
x Γ ( x ) = n → ∞ lim ( x + 1 ) ( x + 2 ) … ( x + n ) n x n !
Which gives us ,
n = 1 ∏ ∞ ( x + n ) = x Γ ( x ) n x n !
∴ We get the following ,
n = 1 ∏ ∞ ( 1 + n ) = Γ ( 1 ) n 1 n ! n = 1 ∏ ∞ ( 2 + n ) = 2 ⋅ Γ ( 2 ) n 2 n ! n = 1 ∏ ∞ ( 3 + n ) = 3 ⋅ Γ ( 3 ) n 3 n !
And we also know that r = 1 ∏ n r 1 = n ! 1
Now all that's left is some multiplication and division ,
n = 1 ∏ ∞ n ( n + 3 ) ( n + 1 ) ( n + 2 )
= Γ ( 1 ) n 1 n ! × 2 ⋅ Γ ( 2 ) n 2 n ! × n ! 1 × n 3 n ! 3 ⋅ Γ ( 3 )
= 2 ⋅ Γ ( 2 ) 3 ⋅ Γ ( 3 )
= 3
Awesome technique ! thanks for sharing it @Azhaghu Roopesh M
Woah! You really damn overthought it!
Log in to reply
Nope!! It's just that I remember these identities so I solved it in 4 steps(but 4 is still longer) , I just wanted to make it clear to the others , but I guess I failed !
Also I created this question using the Gauss form , I never realised that you could bash this question so easily . But BEWARE , I will release a tougher version of this question :P
n = 1 ∏ k n ( n + 3 ) ( n + 1 ) ( n + 2 ) = k ! × 3 ! k ! k ! × 2 ! k ! = 3 ! 1 2 ! 1 = 3
Solved this in my head too... Nice problem!
I can see a big error in your solution. You're considering a finite upper limit k for the product. In that case, your value should be dependent on k .
The main error you made in your solution was not noticing the fact that,
n = 1 ∏ k ( n + m ) = m ! ( k + m ) ! = m ! k ! for a finite k and some constant m
Key point: When you shift the index of a sum or product where the limits are finite, the shifting is the same for both lower and upper limits because the number of terms of the sum/product is always the same.
Thanks ⌣ ¨
Basically, n = 1 , and the only thing that increases in each new fraction is what's being summed to n in each of the factors of its numerator and denominator. But I will still use n , instead of 1 , until the very end of the solution, because I think it's easier to visualize it this way:
Simply predicting how many times each number will appear in the numerator and in the denominator:
n = 1 ∏ ∞ n ( n + 3 ) ( n + 1 ) ( n + 2 ) = n 1 ⋅ n + 1 n + 1 ⋅ n + 2 ( n + 2 ) 2 ⋅ ( n + 3 n + 3 ) 2 ⋅ ( n + 4 n + 4 ) 2 ⋅ ( n + 5 n + 5 ) 2 ⋯
= n 1 ⋅ 1 ⋅ 1 n + 2 ⋅ 1 2 ⋅ 1 2 ⋅ 1 2 ⋯ = n n + 2 = 1 1 + 2 = 3
As we can see denominator is larger than numerator the term converges
So after some point we would be very near to answer as the term will converge to 1
Here is my C code
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 |
|
The line (int)(ans+0.5) is simply to round - off to upper bound
Hi Deep !
Type out your code using the following format (without the "") and write your code between C and the "```" marks .
"```C
```"
To get the output as :
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 |
|
Thnxx Azhaghu Roopesh M
Firstly, write out the series and simplify as much as possible: n ( n + 3 ) ( n + 1 ) ( n + 2 ) × ( n + 1 ) ( n + 4 ) ( n + 2 ) ( n + 3 ) × ( n + 2 ) ( n + 5 ) ( n + 3 ) ( n + 4 ) × . . . Now we start with n=1 so we are left with: 3 × n → ∞ lim n n − 2 = 3 × n → ∞ lim ( 1 − n 2 ) = 3
Simplicity is beauty :)
Problem Loading...
Note Loading...
Set Loading...
Just for a change, take log on both the sides and make pairs(let the value of expression be S)
ln ( S ) = n = 1 ∑ ∞ ( ln ( n + 1 ) − ln ( n ) ) + n = 1 ∑ ∞ ( ln ( n + 2 ) − ln ( n + 3 ) )
Now they both are telescoping series, the first one will converge to 0 and the second one will converge to ln ( 3 )
∴ ln S = l n 3 ⟹ S = 3
Lol I solved this orally