MHB Can You Solve This Challenging Inequality Problem?

anemone
Gold Member
MHB
POTW Director
Messages
3,851
Reaction score
115
Given positive real numbers $a,\,b,\,c$ and $d$ that satisfy the following inequalities:

$a \le 1 \\a+4b \le 17\\a+4b+16c \le273\\a+4b+16c+64d \le4369$

Find the minimum value of $\dfrac{1}{d}+\dfrac{2}{4c+d}+\dfrac{3}{16b+4c+d}+\dfrac{4}{64a+16b+4c+d}$.
 
Mathematics news on Phys.org
The coefficients in the denominators by necessity gives the following order of priority: $a,b,c,d$, i.e. $a$ must be our first choice and $a$ must necessarily be chosen as large as possible: $a = 1$, in order to maximize the last term in the given expression. The next to be prioritized is $b$ with the help of the second inequality, which implies: $b = 4$. Next in the priority list is $c$ and from the third inequality criterion, we have: $c = 16$. At last comes $d$ in the last inequality: $d = 64$.

Thus our minimum value must be: $\frac{4}{64} = \frac{1}{16}$.
 
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