MHB Optimizing Binomial Coefficients for Maximum Value

anemone
Gold Member
MHB
POTW Director
Messages
3,851
Reaction score
115
From the binomial theorem, we have

$\displaystyle \begin{align*}\left(1+\dfrac{1}{5}\right)^{1000}&={1000 \choose 0}\left(\dfrac{1}{5}\right)^{0}+{1000 \choose 1}\left(\dfrac{1}{5}\right)^{1}+{1000 \choose 2}\left(\dfrac{1}{5}\right)^{2}+\cdots+{1000 \choose 1000}\left(\dfrac{1}{5}\right)^{1000}\\&=A_0+A_1+A_2+\cdots+A_{1000} \end{align*}$

where $\displaystyle A_k={1000 \choose k}\left(\dfrac{1}{5}\right)^{k}$.

For which $k$ is $A_k$ the largest?
 
Mathematics news on Phys.org
anemone said:
From the binomial theorem, we have

$\displaystyle \begin{align*}\left(1+\dfrac{1}{5}\right)^{1000}&={1000 \choose 0}\left(\dfrac{1}{5}\right)^{0}+{1000 \choose 1}\left(\dfrac{1}{5}\right)^{1}+{1000 \choose 2}\left(\dfrac{1}{5}\right)^{2}+\cdots+{1000 \choose 1000}\left(\dfrac{1}{5}\right)^{1000}\\&=A_0+A_1+A_2+\cdots+A_{1000} \end{align*}$

where $\displaystyle A_k={1000 \choose k}\left(\dfrac{1}{5}\right)^{k}$.

For which $k$ is $A_k$ the largest?

I looked for k such that $\frac{1000!}{k!(1000-k)!5^k}>\frac{1000!}{(k+1)!(999-k)!5^{k+1}}$.

This simplifies to $\frac{1}{1000-k}>\frac{1}{5k+5}$.

Leading to k=166 if I didn't make any dopey errors.
 
Thanks M R for your participation and your correct solution!(Yes)

A solution proposed by other:

Note that $\displaystyle A_k={1000 \choose k}\left(\dfrac{1}{5}\right)^k=\dfrac{1000!}{5^k(k!)(1000-k)!}$, so to maximize $A_K$ means we must minimize its denominator, and if we let it as $P_k=5^k(k!)(1000-k)!$, for all $k$, we have $P_{k+1}=5^{k+1}((k+1)!)(1000-(k+1))!=5^{k+1}((k+1)!)(999-k)!=P_k\left(\dfrac{5(k+1)}{1000-k}\right)$.

For small values of $k$, $\dfrac{5(k+1)}{1000-k}<1$, so we must have $P-0>P_1>P_2>\cdots$. The minimum value will thus come at the smallest value of $k$ for which $\dfrac{5(k+1)}{1000-k}>1$, so we must have $5(k+1)>1000-k\,\,\rightarrow k=166$
 
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
I'm interested to know whether the equation $$1 = 2 - \frac{1}{2 - \frac{1}{2 - \cdots}}$$ is true or not. It can be shown easily that if the continued fraction converges, it cannot converge to anything else than 1. It seems that if the continued fraction converges, the convergence is very slow. The apparent slowness of the convergence makes it difficult to estimate the presence of true convergence numerically. At the moment I don't know whether this converges or not.
Back
Top