MHB Inequality: $(1+a)^7(1+b)^7(1+c)^7 > 7^7 a^4b^4c^4$

  • Thread starter Thread starter kaliprasad
  • Start date Start date
  • Tags Tags
    Inequality
kaliprasad
Gold Member
MHB
Messages
1,333
Reaction score
0
if $a,b,c$ are positive real numbers show that $(1+a)^7(1+b)^7(1+c)^7 > 7^7 a^4b^4c^4$
 
Mathematics news on Phys.org
Can you...hmm...

pretty please, give us some clues?:o
 
anemone said:
Can you...hmm...

pretty please, give us some clues?:o

given up so early

multiply out the LHS
 
kaliprasad said:
given up so early

You might be onto something!:p

But on the level, I have bestowed much thought on this problem...hehehe...
 
kaliprasad said:
if $a,b,c$ are positive real numbers show that $(1+a)^7(1+b)^7(1+c)^7 > 7^7 a^4b^4c^4$

$$(1+a)(1+b)(1+c)=1+a+b+ab+c+ac+bc+abc$$

AM-GM inequality:

$$\dfrac{a+b+c+ab+ac+bc+abc}{7}\ge(abc)^{4/7}$$

$$\Rightarrow a+b+c+ab+ac+bc+abc\ge7(abc)^{4/7}$$

$$\Rightarrow1+a+b+ab+c+ac+bc+abc>7(abc)^{4/7}$$

$$\Rightarrow(1+a)(1+b)(1+c)>7(abc)^{4/7}$$

$$\Rightarrow(1+a)^7(1+b)^7(1+c)^7>7^7a^4b^4c^4$$

$$\text{Q. E. D.}$$
 
greg1313 said:
$$(1+a)(1+b)(1+c)=1+a+b+ab+c+ac+bc+abc$$

AM-GM inequality:

$$\dfrac{a+b+c+ab+ac+bc+abc}{7}\ge(abc)^{4/7}$$

$$\Rightarrow a+b+c+ab+ac+bc+abc\ge7(abc)^{4/7}$$

$$\Rightarrow1+a+b+ab+c+ac+bc+abc>7(abc)^{4/7}$$

$$\Rightarrow(1+a)(1+b)(1+c)>7(abc)^{4/7}$$

$$\Rightarrow(1+a)^7(1+b)^7(1+c)^7>7^7a^4b^4c^4$$

$$\text{Q. E. D.}$$
good answer same as mine.
I hoped that Anemone would solve it particularly after my hint.
 
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.

Similar threads

Replies
1
Views
1K
Replies
1
Views
1K
Replies
4
Views
2K
Replies
8
Views
1K
Replies
5
Views
3K
Back
Top