 ComponentResolver vs *ngIf
 What did Thanos mean by this?
 Who gets the last call on the “don't enter human dwellings” rule in the Artemis Fowl series?
 Why did Ryo Ishida in Dark Matter do this?
 Book identification. Mysterious genetically enhanced genius children
 RMAN backup set, nothing else, how can I duplicate?
 Working from a USB
 Parallel voltage source concept
 When wood or any fuel is burnt at atmospheric pressure,is the chemical energy converted into isobaric work and heat transferred to the surro
 Can anything orbit a black hole with dipping under the event horizon?
 Mechanism of quantum entanglement; proof of quantumness
 The role of the “observer” in quantum theory?
 velocity along straight line polar coordinates
 Can 5g Wifi be disabled in Nougat?
 View HDMI output on Android Phone
 Simple IRF530+Motor circuit with Arduino Not Working [SOLVED]
 Is my zener diode labeled wrong, or am i seeing a strange failure mode?
 Does anyone have advice on homemade EKG/ECG leads?
 Load the program in the PIC through the pickit
 How to switch composite video signal inputs to one output
If $(x_1a)(x_2a)\cdots(x_na)=k^n$ prove by using the laws of inequality that $x_1x_2 \cdots x_n\geq (a+k)^n$
If $x_i>a>0$ for $i=1,2\cdots n$ and $(x_1a)(x_2a)\cdots(x_na)=k^n$, $k>0$, prove by using the laws of inequality that $$x_1x_2 \cdots x_n\geq (a+k)^n$$.
Attempt:
If we expand $(x_1a)(x_2a)\cdots(x_na)=k^n$ in the LHS, we get
$x_1x_2 \cdots x_n a\sum x_1x_2\cdots x_{n1} +a^2\sum x_1x_2\cdots x_{n2}  \cdots +(1)^na^n=k^n$. But it becomes cumbersome to go further. Please help me.
Using convenient notation, we will prove a theorem from which the result of the question may be easily derived. Given any positive real numbers $ x_1, x_2,...,$ we will write their initial geometric means as $$g_n:=(x_1\cdots x_n)^{1/n}\quad(n=1,2,...).$$
Theorem.$\quad$Given any $a\geqslant0$, and for each $n$,
the following proposition (which we will denote by $P_n$) holds:$$(x_1+a)\cdots(x_n+a)\geqslant (g_n+a)^n\quad\text{for all}\quad x_1,x_2,...>0.$$Proof.$\quad$We proceed by Cauchy induction. That is, we establish (1) $P_1\,;\;$ (2) $P_k\Rightarrow P_{2k}$ for any

Using convenient notation, we will prove a theorem from which the result of the question may be easily derived. Given any positive real numbers $ x_1, x_2,...,$ we will write their initial geometric means as $$g_n:=(x_1\cdots x_n)^{1/n}\quad(n=1,2,...).$$
Theorem.$\quad$Given any $a\geqslant0$, and for each $n$,
the following proposition (which we will denote by $P_n$) holds:$$(x_1+a)\cdots(x_n+a)\geqslant (g_n+a)^n\quad\text{for all}\quad x_1,x_2,...>0.$$Proof.$\quad$We proceed by Cauchy induction. That is, we establish (1) $P_1\,;\;$ (2) $P_k\Rightarrow P_{2k}$ for any $k=1,2,...,$ and (3) $P_{k+1}\Rightarrow P_k$ for any $k=1,2,...$.
(1)$\quad$Clearly the inequality (actually equality) holds for $n=1$ since $g_1=x_1$ in this case.
(2)$\quad$To prove this, let us suppose that $P_n$ has been established for the case $n=k$:$$(x_1+a)\cdots(x_k+a)\geqslant(g_k+a)^k.$$A corresponding result holds also for $x_{k+1},...,x_{2k}$ , which we write as$$(x_{k+1}+a)\cdots(x_{2k}+a)\geqslan
20180312 22:43:42