MHB Minimum of the Sum of Logarithms

anemone
Gold Member
MHB
POTW Director
Messages
3,851
Reaction score
115
Find the minimum of $\large \log_{a_1}\left(a_2-\dfrac{1}{4}\right)+\log_{a_2}\left(a_3-\dfrac{1}{4}\right)+\cdots+\log_{a_n}\left(a_1-\dfrac{1}{4}\right)$ where $a_1,\,a_2,\cdots,a_n$ are real numbers in the interval $\left(\dfrac{1}{4},\,1\right)$.
 
Mathematics news on Phys.org
anemone said:
Find the minimum of $\large \log_{a_1}\left(a_2-\dfrac{1}{4}\right)+\log_{a_2}\left(a_3-\dfrac{1}{4}\right)+\cdots+\log_{a_n}\left(a_1-\dfrac{1}{4}\right)$ where $a_1,\,a_2,\cdots,a_n$ are real numbers in the interval $\left(\dfrac{1}{4},\,1\right)$.

[sp]Attempt ... because changing the order of the variables the problem remains the same, the solution will be such that $ a_ {1} = a_ {2} = ... = a_ {n} = x $ and the function to be minimized is...

$\displaystyle f(x) = log_{x} (x - \frac{1}{4})\ (1)$

Proceeding in standard fashion is...

$\displaystyle f^{\ '} (x) = \frac{\frac{\ln x}{x - \frac{1}{4}} - \frac{\ln (x - \frac{1}{4})}{x}}{\ln ^{2} x}\ (2)$

... and the (2) vanishes for...

$\displaystyle x\ \ln x = (x - \frac{1}{4})\ \ln (x - \frac{1}{4}) \implies x = \frac{1}{2}\ (3)$[/sp]

Kind regards

$\chi$ $\sigma$
 
chisigma said:
[sp]Attempt ... because changing the order of the variables the problem remains the same, the solution will be such that $ a_ {1} = a_ {2} = ... = a_ {n} = x $ and the function to be minimized is...

$\displaystyle f(x) = log_{x} (x - \frac{1}{4})\ (1)$

Proceeding in standard fashion is...

$\displaystyle f^{\ '} (x) = \frac{\frac{\ln x}{x - \frac{1}{4}} - \frac{\ln (x - \frac{1}{4})}{x}}{\ln ^{2} x}\ (2)$

... and the (2) vanishes for...

$\displaystyle x\ \ln x = (x - \frac{1}{4})\ \ln (x - \frac{1}{4}) \implies x = \frac{1}{2}\ (3)$[/sp]

Kind regards

$\chi$ $\sigma$

Thanks chisigma for participating in this challenge!

And in your method,the minimum of $\large \log_{a_1}\left(a_2-\dfrac{1}{4}\right)+\log_{a_2}\left(a_3-\dfrac{1}{4}\right)+\cdots+\log_{a_n}\left(a_1-\dfrac{1}{4}\right)$ where $a_1,\,a_2,\cdots,a_n$ are real numbers in the interval $\left(\dfrac{1}{4},\,1\right)$ would be $2n$.

Here is the solution of other that I wanted to share:

Since $\log_m a$ is a decreasing function of $a$ when $0<m<1$, and since $\left(a-\dfrac{1}{2}\right)^2\ge 0$ which implies $a^2\ge a-\dfrac{1}{4}$, we have

$\large \log_{a_k}\left(a_{k+1}-\dfrac{1}{4}\right)\ge \log_{a_k} a_{k+1}^2=2\log_{a_k} a_{k+1}=2\dfrac{\log a_{k+1}}{\log a_{k}}$

It follows that

$\begin{align*}\log_{a_1}\left(a_2-\dfrac{1}{4}\right)+\log_{a_2}\left(a_3-\dfrac{1}{4}\right)+\cdots+\log_{a_n}\left(a_1-\dfrac{1}{4}\right)&\ge 2\left(\dfrac{\log a_2}{\log a_1}+\dfrac{\log a_3}{\log a_2}+\cdots+\dfrac{\log a_n}{\log a_{n-1}}+\dfrac{\log a_1}{\log a_n}\right)\\&\ge 2n\,\,\,\text{by AM-GM inequality}\end{align*}$

Equalities hold iff $a_1=a_2=\cdots=a_n=\dfrac{1}{2}$.
 
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