I Maximizing xy: Understanding Optimization Problems in Mathematics

  • I
  • Thread starter Thread starter Mr Davis 97
  • Start date Start date
  • Tags Tags
    Optimization
Mr Davis 97
Messages
1,461
Reaction score
44
I am little confused when it comes to optimization problems. For example, say we are given that ##x+y=2##, and are asked to maximize ##xy##. By AM-GM, we have that ##xy \le 1##. But why should this indicate that ##1## is the maximum value? Isn't it an equally true statement to claim that ##xy \le 2##, since the former interval is contained in the latter?
 
Mathematics news on Phys.org
It is equally true, but not as useful. 2 is merely an upper bound, whereas 1 is a least upper bound. In fact it is a maximum, that is achieved when ##x=y##. Arithmetic and Geometric Means are identical when all data are the same.
 
  • Like
Likes Mr Davis 97
andrewkirk said:
It is equally true, but not as useful. 2 is merely an upper bound, whereas 1 is a least upper bound. In fact it is a maximum, that is achieved when ##x=y##. Arithmetic and Geometric Means are identical when all data are the same.
I think it was the distinction between upper bound and least upper bound that I was looking for.
 
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