MHB Prove Positive Fraction + Inverse is ≥2

IHateFactorial
Messages
15
Reaction score
0
Problem: Prove that any positive fraction plus its inverse is greater than or equal to two.

Proof:

$$\frac{a}{b}+\frac{b}{a}\ge2$$

$$\frac{a^2+b^2}{ab}\ge2$$

$${a^2+b^2}\ge2ab$$

$$a^2+b^2 - 2ab\ge0$$

$$a^2 - 2ab + b^2\ge0$$

$$(a-b)^2\ge0$$

This is true for all a and b:

Case 1:
$$a>b\therefore a-b>0; (a-b)^2>0$$

Case 2:
$$a=b\therefore a-b=0; (a-b)^2=0$$

Case 3:
$$a<b\therefore a-b<0; (a-b)^2>0$$

Tadaaaa!?

Is this right?

If so, one question:

$$(a-b)^2\ge0$$

Can't we just square root both sides and get:

$$a-b\ge0$$

I imagine the rules for squares and square roots are different when working with inequalities... HOW are they different?
 
Mathematics news on Phys.org
IHateFactorial said:
Problem: Prove that any positive fraction plus its inverse is greater than or equal to two.

Proof:

$$\frac{a}{b}+\frac{b}{a}\ge2$$

$$\frac{a^2+b^2}{ab}\ge2$$

$${a^2+b^2}\ge2ab$$

$$a^2+b^2 - 2ab\ge0$$

$$a^2 - 2ab + b^2\ge0$$

$$(a-b)^2\ge0$$

I would have started from the bottom and worked my way up. As it is, you're starting out by assuming what you want to prove is true.

IHateFactorial said:
... one question:

$$(a-b)^2\ge0$$

Can't we just square root both sides and get:

$$a-b\ge0$$

What if $b>a$? In general, $\sqrt{(x-y)^2}=|x-y|$.
 
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