if Bk>0, then prove the following:
B1+B2+.....+Bn-B1B2....Bn<=n-1
(sum-product is less than equal to n-1)
When my instructor was talking about Bernoulli's inequalities, he gave us this problem to prove.
There seems to be a problem here.
If, $\displaystyle n=2$
Then,
$\displaystyle B_1+B_2-B_1B_2\leq 2-1$
Only when,
$\displaystyle 0<B_1\leq 1 \mbox{ and } 0<y\leq 1$
or,
$\displaystyle 1\geq B_1 \mbox{ and }1\geq B_2$