Prove this inequality using induction

Click For Summary
The discussion focuses on proving an inequality using mathematical induction, specifically addressing difficulties with the inductive step. The base case for n=1 is established easily, showing that 1-x is greater than or equal to 2/3. The main challenge lies in understanding how to apply the provided hint for n+1 numbers, which involves combining the last two numbers to reduce the problem to n numbers. By demonstrating that the sum of two numbers leads to a valid conclusion for n=2, the discussion suggests generalizing this approach for the inductive step. Clarifying the hint and applying it correctly is crucial for completing the proof.
sdfsfasdfasf
Messages
75
Reaction score
12
Homework Statement
Given n positive numbers x1, x2, . . . , xn such that x1 + x2 + · · · + xn <= 1/3, prove by
induction that
(1 − x1)(1 − x2) × · · · × (1 − xn) >= 2/3
Relevant Equations
Principle of Induction, proof by induction, base case, inductive step
1728314044959.png



Been stuck on this one for a while now.

Base case is easy, n=1, we have x <=1/3, so trivially 1-x>= 2/3 and we are done.

The issue is with the inductive step, I don't know how to use the hint, infact I am struggling to understand what is meant by the hint.

Any help (or a full solution) would be greatly appreciated.
 
Physics news on Phys.org
sdfsfasdfasf said:
The issue is with the inductive step, I don't know how to use the hint, infact I am struggling to understand what is meant by the hint.
The hint means that when you have ##n + 1## numbers, you combine the last two numbers by adding them, and then you only have ##n## numbers.
 
To make that a little more explicit: Consider ##x_1 + x_2 = y \leq 1/3##. Then by the ##n=1## case, ##(1-y) \geq 2/3##. Therefore ##(1-x_1)(1-x_2) = 1 - y + x_1 x_2 \geq 1-y \geq 2/3##, which proves the relation for ##n=2##. Now generalize this to an induction step.
 
First, I tried to show that ##f_n## converges uniformly on ##[0,2\pi]##, which is true since ##f_n \rightarrow 0## for ##n \rightarrow \infty## and ##\sigma_n=\mathrm{sup}\left| \frac{\sin\left(\frac{n^2}{n+\frac 15}x\right)}{n^{x^2-3x+3}} \right| \leq \frac{1}{|n^{x^2-3x+3}|} \leq \frac{1}{n^{\frac 34}}\rightarrow 0##. I can't use neither Leibnitz's test nor Abel's test. For Dirichlet's test I would need to show, that ##\sin\left(\frac{n^2}{n+\frac 15}x \right)## has partialy bounded sums...