Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Show that $$1+ac+ab+3a\leq b+c+abc+3bc$$ if $1\leq a\leq bc,$ $1\leq b\leq ac,$ $1\leq c\leq ab.$

share|cite|improve this question
Where is the inequality from? – Sunni Dec 18 '11 at 21:36

$1\leq a$, so $0\leq (a-1)$. Similarly for $b$ and $c$, so we have

$$ 0\leq (a-1)(b-1)(c-1) $$

$a \leq bc$ so $0\leq bc-a$ and

$$ 0 \leq 4(bc-a) $$

Adding these two we get

$$ 0 \leq (a-1)(b-1)(c-1) + 4(bc-a) $$

Multiplying out yields the result:

$$ 0 \leq (abc-ab-ac+a-bc+b+c-1) + 4bc - 4a $$ $$ 0 \leq abc-ab-ac-3a+3bc+b+c-1 $$ $$ 1+ab+ac+3a \leq abc+3bc+b+c $$ As required.

To solve this I took out the $bc$ and $a$ terms, as given that $bc-a$ could be 0, I reasoned that the inequality should hold with them gone. I "guessed" the factorization $(a-1)(b-1)(c-1)$, and put in some extra terms to compensate, which happened to be of the form $bc-a$.

share|cite|improve this answer
Nice job of exposing the symmetric heart of the question. – André Nicolas Dec 18 '11 at 22:11

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.