AoPSWiki
Do you have what it takes to be the next brilliant trader, researcher, or developer at Jane Street Capital? Find out in the Careers in Mathematics Forum.

2001 USAMO Problems/Problem 3

From AoPSWiki

Revision as of 06:35, 21 December 2008 by Minsoens (Talk | contribs)
(diff) ← Older revision | Current revision (diff) | Newer revision → (diff)

Problem

Let a, b, c \geq 0 and satisfy

a^2 + b^2 + c^2 + abc = 4.

Show that

ab + bc + ca - abc \leq 2.

Solution

This problem needs a solution. If you have a solution for it, please help us out by adding it.

See also

2001 USAMO (Problems • Resources: AoPS | ML)
Preceded by
Problem 2
1 2 3 4 5 6 Followed by
Problem 4
Do you have what it takes to be the next brilliant trader, researcher, or developer at Jane Street Capital? Find out in the Careers in Mathematics Forum.
© Copyright 2008 AoPS Incorporated. All Rights Reserved. • FoundationPrivacyContact Us