binomial limit (1 Viewer)

juantheron · Mar 17, 2023

Evaluation of $\displaystyle \lim_{n\rightarrow \infty}\bigg[\binom{n}{0}\cdot \binom{n}{1}\cdot \binom{n}{2}\cdots \cdots \binom{n}{n}\bigg]^{\frac{1}{n(n+1)}}$

s97127 · Mar 17, 2023

juantheron said:
Evaluation of $\displaystyle \lim_{n\rightarrow \infty}\bigg[\binom{n}{0}\cdot \binom{n}{1}\cdot \binom{n}{2}\cdots \cdots \binom{n}{n}\bigg]^{\frac{1}{n(n+1)}}$

what does (m n) stand for?

synthesisFR · Mar 17, 2023

juantheron said:
Evaluation of $\displaystyle \lim_{n\rightarrow \infty}\bigg[\binom{n}{0}\cdot \binom{n}{1}\cdot \binom{n}{2}\cdots \cdots \binom{n}{n}\bigg]^{\frac{1}{n(n+1)}}$

is it 0

Average Boreduser · Mar 17, 2023

actually if we observe newton's laws using SMH and mechanics we can assume the answer is actually 3

synthesisFR · Mar 18, 2023

tywebb said:
I put it into wolframalpha and got $\sqrt{e}$
View attachment 37999

canu explain how to do it

synthesisFR · Mar 19, 2023

Ok so its not a 4u question
WHY TF WOULD this person put it in the extension 2 thread i almost was gonna drop 4U looking at this working out

s97127 · Mar 19, 2023

synthesisFR said:
Ok so its not a 4u question
WHY TF WOULD this person put it in the extension 2 thread i almost was gonna drop 4U looking at this working out

This problem is too hard for me.

synthesisFR · Mar 19, 2023

tywebb said:
If I can do it then anyone can do it.

yeah except we dont know half the shi u used

s97127 · Mar 19, 2023

tywebb said:
If I can do it then anyone can do it.

but i have not learnt trigamma, digamma, Taylor series...etc yet

synthesisFR · Mar 19, 2023

tywebb said:
The gamma function is just a continuous version of factorial and the digamma and trigamma just come from the derivatives.

The hardest function that appeared was the hyperfactorial but I got rid of it pretty quickly by using l'Hospital rule.

That's a nifty rule to use - even for much simpler questions.

do u do maths at uni?

Average Boreduser · Mar 19, 2023

idk bruh. It's pretty damn simple

just limit properties and gamma function is just a continuous version of factorial and the digamma and trigamma just come from the derivatives. hardest function that appeared was the hyperfactorial but I got rid of it pretty quickly by using l'Hospital rule.
That's a nifty rule to use - even for much simpler questions. But realistically speaking if ur doing 4U and u cant even do smn as simple as that bruh

good luck bud.

synthesisFR · Mar 19, 2023

Pethmin said:
But realistically speaking if ur doing 4U and u cant even do smn as simple as that bruh good luck bud.

yeah man...
im considering to drop it tbh, even 3u for that matter. im just not good enough ...

Average Boreduser · Mar 19, 2023

synthesisFR said:
yeah man...
im considering to drop it tbh, even 3u for that matter. im just not good enough ...

honestly just dont do math at all for that matter, Ik kindergaetners who could do this qn (they go to ruse)

Average Boreduser · Mar 20, 2023

tywebb said:
There is another way to do it using Stirling's formula

So here is Method 2:

$\text{If }p(n)=\left(\prod_{r=0}^n{n \choose r}\right)^\frac{1}{n(n+1)}\text{ then }p(n)^{n(n+1)}=p(n-1)^{n(n-1)}\cdot\frac{n^n}{n!}.$

$\text{ If }L=\lim_{n\rightarrow\infty}p(n)\text{ then }$

$\begin{aligned}\lim_{n\rightarrow\infty}\frac{L^{n(n+1)}}{L^{n(n-1)}\cdot\frac{n^n}{n!}}&=\lim_{n\rightarrow\infty}\frac{L^{2n}n!}{n^n}\\&=\lim_{n\rightarrow\infty}\left(L^{2n}\cdot\frac{\sqrt{2\pi n}}{e^n}\right)\cdot\lim_{n\rightarrow\infty}\left(\frac{n!}{n^n}\cdot\frac{e^n}{\sqrt{2\pi n}}\right)\\&=\lim_{n\rightarrow\infty}\left(L^{2n}\cdot\frac{\sqrt{2\pi n}}{e^n}\right)\cdot1\text{ by Stirling's formula}\\&=1\end{aligned}$

$\begin{aligned}\therefore L&=\lim_{n\rightarrow\infty}\left(\frac{e^n}{\sqrt{2\pi n}}\right)^\frac{1}{2n}\\&=\sqrt{e}\cdot\lim_{n\rightarrow\infty}\left(\frac{1}{\sqrt{2\pi}}\right)^\frac{1}{2n}\cdot\sqrt[4]{\lim_{x\rightarrow 0^+}x^x}\text{ if }x=\frac{1}{n}\\&=\sqrt{e}\cdot1\cdot1\\&=\sqrt{e}\end{aligned}$

r u sure its
$\text{If }p(n)=\left(\prod_{r=0}^n{n \choose r}\right)^\frac{1}{n(n+1)}\text{ then }p(n)^{n(n+1)}=p(n-1)^{n(n-1)}\cdot\frac{n^n}{n!}.$

$\text{ If }L=\lim_{n\rightarrow\infty}p(n)\text{ then }$ ? I got
$\text{If }x(n)=\left(\prod_{r=0}^y{n \choose r}\right)^\frac{1}{n(n+1)}\text{ then }a(r)^{b(z+t)}=u(ny-1)^{n(n-1)}\cdot\frac{n^n}{n!}.$

$\text{ If }L=\lim_{n\rightarrow\infty}p(n)\text{ then }$

s97127 · Mar 24, 2023

tywebb said:
Here is another method using the Stolz–Cesàro theorem. It starts the same as the first method but then goes in a completely different direction, nevertheless ending up at the same answer.

Method 3.

$\begin{aligned}\ln\lim_{n\rightarrow\infty}\left(\prod_{r=0}^n{n\choose r}\right)^{\frac{1}{n(n+1)}}&=\ln\left(\lim_{n\rightarrow\infty}\prod_{r=1}^nr^{2r-n-1}\right)^{\frac{1}{n(n+1)}}\text{ algebraic simplification }\\&=\lim_{n\rightarrow\infty}\sum_{r=1}^n\frac{(2r-n-1)\ln r}{n(n+1)}\text{ by log laws}\\&=\lim_{n\rightarrow\infty}\frac{2\ln\prod_{r=1}^n r^r-(n+1)\ln n!}{n(n+1)}\\&=\lim_{n\rightarrow\infty}\frac{2\ln\prod_{r=1}^{n+1}r^r-(n+2)\ln(n+1)!-(2\ln\prod_{r=1}^nr^r-(n+1)\ln n!)}{(n+1)(n+2)-n(n+1)}\text{ using the Stolz-Ces\`{a}ro theorem}\\&={\textstyle\frac{1}{2}}\lim_{n\rightarrow\infty}\frac{\ln(n+1)^{n+1}-\ln(n+1)!}{n+1}\\&={\textstyle\frac{1}{2}}\lim_{n\rightarrow\infty}\frac{\ln(n+1)^{n+1}-\ln(n+1)!-(\ln n^n-\ln n!)}{n+1-n}\text{ by Stolz-Ces\`{a}ro again}\\&={\textstyle\frac{1}{2}}\lim_{n\rightarrow\infty}\textstyle{\ln(1+\frac{1}{n})^n}\\&=\textstyle\frac{1}{2}\ln e\\&=\textstyle\frac{1}{2}\end{aligned}$

$\text{Hence }\lim_{n\rightarrow\infty}\left(\prod_{r=0}^n{n\choose r}\right)^\frac{1}{n(n+1)}=e^\frac{1}{2}=\sqrt e$

Someone gives me this solution using Stolz Cesaro as well but i don't really get it. Can you please write down a detailed solution for me? Thanks

juantheron · Mar 28, 2023

Thanks Tywebb for different Methods.

Make a Difference – Donate to Bored of Studies!

binomial limit (1 Viewer)

juantheron

Active Member

s97127

Active Member

synthesisFR

afterhscivemostlybeentrollingdonttakeitsrsly

Average Boreduser

Rising Renewal

synthesisFR

afterhscivemostlybeentrollingdonttakeitsrsly

synthesisFR

afterhscivemostlybeentrollingdonttakeitsrsly

s97127

Active Member

synthesisFR

afterhscivemostlybeentrollingdonttakeitsrsly

s97127

Active Member

synthesisFR

afterhscivemostlybeentrollingdonttakeitsrsly

Average Boreduser

Rising Renewal

synthesisFR

afterhscivemostlybeentrollingdonttakeitsrsly

Average Boreduser

Rising Renewal

Average Boreduser

Rising Renewal

s97127

Active Member

Attachments

juantheron

Active Member

Users Who Are Viewing This Thread (Users: 0, Guests: 1)