Summer is a great time to explore cool problems to keep your skills sharp!  Schedule a class today!

Contests & Programs AMC and other contests, summer programs, etc.
AMC and other contests, summer programs, etc.
3 M G
BBookmark  VNew Topic kLocked
Contests & Programs AMC and other contests, summer programs, etc.
AMC and other contests, summer programs, etc.
3 M G
BBookmark  VNew Topic kLocked
G
Topic
First Poster
Last Poster
k a May Highlights and 2025 AoPS Online Class Information
jlacosta   0
May 1, 2025
May is an exciting month! National MATHCOUNTS is the second week of May in Washington D.C. and our Founder, Richard Rusczyk will be presenting a seminar, Preparing Strong Math Students for College and Careers, on May 11th.

Are you interested in working towards MATHCOUNTS and don’t know where to start? We have you covered! If you have taken Prealgebra, then you are ready for MATHCOUNTS/AMC 8 Basics. Already aiming for State or National MATHCOUNTS and harder AMC 8 problems? Then our MATHCOUNTS/AMC 8 Advanced course is for you.

Summer camps are starting next month at the Virtual Campus in math and language arts that are 2 - to 4 - weeks in duration. Spaces are still available - don’t miss your chance to have an enriching summer experience. There are middle and high school competition math camps as well as Math Beasts camps that review key topics coupled with fun explorations covering areas such as graph theory (Math Beasts Camp 6), cryptography (Math Beasts Camp 7-8), and topology (Math Beasts Camp 8-9)!

Be sure to mark your calendars for the following upcoming events:
[list][*]May 9th, 4:30pm PT/7:30pm ET, Casework 2: Overwhelming Evidence — A Text Adventure, a game where participants will work together to navigate the map, solve puzzles, and win! All are welcome.
[*]May 19th, 4:30pm PT/7:30pm ET, What's Next After Beast Academy?, designed for students finishing Beast Academy and ready for Prealgebra 1.
[*]May 20th, 4:00pm PT/7:00pm ET, Mathcamp 2025 Qualifying Quiz Part 1 Math Jam, Problems 1 to 4, join the Canada/USA Mathcamp staff for this exciting Math Jam, where they discuss solutions to Problems 1 to 4 of the 2025 Mathcamp Qualifying Quiz!
[*]May 21st, 4:00pm PT/7:00pm ET, Mathcamp 2025 Qualifying Quiz Part 2 Math Jam, Problems 5 and 6, Canada/USA Mathcamp staff will discuss solutions to Problems 5 and 6 of the 2025 Mathcamp Qualifying Quiz![/list]
Our full course list for upcoming classes is below:
All classes run 7:30pm-8:45pm ET/4:30pm - 5:45pm PT unless otherwise noted.

Introductory: Grades 5-10

Prealgebra 1 Self-Paced

Prealgebra 1
Tuesday, May 13 - Aug 26
Thursday, May 29 - Sep 11
Sunday, Jun 15 - Oct 12
Monday, Jun 30 - Oct 20
Wednesday, Jul 16 - Oct 29

Prealgebra 2 Self-Paced

Prealgebra 2
Wednesday, May 7 - Aug 20
Monday, Jun 2 - Sep 22
Sunday, Jun 29 - Oct 26
Friday, Jul 25 - Nov 21

Introduction to Algebra A Self-Paced

Introduction to Algebra A
Sunday, May 11 - Sep 14 (1:00 - 2:30 pm ET/10:00 - 11:30 am PT)
Wednesday, May 14 - Aug 27
Friday, May 30 - Sep 26
Monday, Jun 2 - Sep 22
Sunday, Jun 15 - Oct 12
Thursday, Jun 26 - Oct 9
Tuesday, Jul 15 - Oct 28

Introduction to Counting & Probability Self-Paced

Introduction to Counting & Probability
Thursday, May 15 - Jul 31
Sunday, Jun 1 - Aug 24
Thursday, Jun 12 - Aug 28
Wednesday, Jul 9 - Sep 24
Sunday, Jul 27 - Oct 19

Introduction to Number Theory
Friday, May 9 - Aug 1
Wednesday, May 21 - Aug 6
Monday, Jun 9 - Aug 25
Sunday, Jun 15 - Sep 14
Tuesday, Jul 15 - Sep 30

Introduction to Algebra B Self-Paced

Introduction to Algebra B
Tuesday, May 6 - Aug 19
Wednesday, Jun 4 - Sep 17
Sunday, Jun 22 - Oct 19
Friday, Jul 18 - Nov 14

Introduction to Geometry
Sunday, May 11 - Nov 9
Tuesday, May 20 - Oct 28
Monday, Jun 16 - Dec 8
Friday, Jun 20 - Jan 9
Sunday, Jun 29 - Jan 11
Monday, Jul 14 - Jan 19

Paradoxes and Infinity
Mon, Tue, Wed, & Thurs, Jul 14 - Jul 16 (meets every day of the week!)

Intermediate: Grades 8-12

Intermediate Algebra
Sunday, Jun 1 - Nov 23
Tuesday, Jun 10 - Nov 18
Wednesday, Jun 25 - Dec 10
Sunday, Jul 13 - Jan 18
Thursday, Jul 24 - Jan 22

Intermediate Counting & Probability
Wednesday, May 21 - Sep 17
Sunday, Jun 22 - Nov 2

Intermediate Number Theory
Sunday, Jun 1 - Aug 24
Wednesday, Jun 18 - Sep 3

Precalculus
Friday, May 16 - Oct 24
Sunday, Jun 1 - Nov 9
Monday, Jun 30 - Dec 8

Advanced: Grades 9-12

Olympiad Geometry
Tuesday, Jun 10 - Aug 26

Calculus
Tuesday, May 27 - Nov 11
Wednesday, Jun 25 - Dec 17

Group Theory
Thursday, Jun 12 - Sep 11

Contest Preparation: Grades 6-12

MATHCOUNTS/AMC 8 Basics
Friday, May 23 - Aug 15
Monday, Jun 2 - Aug 18
Thursday, Jun 12 - Aug 28
Sunday, Jun 22 - Sep 21
Tues & Thurs, Jul 8 - Aug 14 (meets twice a week!)

MATHCOUNTS/AMC 8 Advanced
Sunday, May 11 - Aug 10
Tuesday, May 27 - Aug 12
Wednesday, Jun 11 - Aug 27
Sunday, Jun 22 - Sep 21
Tues & Thurs, Jul 8 - Aug 14 (meets twice a week!)

AMC 10 Problem Series
Friday, May 9 - Aug 1
Sunday, Jun 1 - Aug 24
Thursday, Jun 12 - Aug 28
Tuesday, Jun 17 - Sep 2
Sunday, Jun 22 - Sep 21 (1:00 - 2:30 pm ET/10:00 - 11:30 am PT)
Monday, Jun 23 - Sep 15
Tues & Thurs, Jul 8 - Aug 14 (meets twice a week!)

AMC 10 Final Fives
Sunday, May 11 - Jun 8
Tuesday, May 27 - Jun 17
Monday, Jun 30 - Jul 21

AMC 12 Problem Series
Tuesday, May 27 - Aug 12
Thursday, Jun 12 - Aug 28
Sunday, Jun 22 - Sep 21
Wednesday, Aug 6 - Oct 22

AMC 12 Final Fives
Sunday, May 18 - Jun 15

AIME Problem Series A
Thursday, May 22 - Jul 31

AIME Problem Series B
Sunday, Jun 22 - Sep 21

F=ma Problem Series
Wednesday, Jun 11 - Aug 27

WOOT Programs
Visit the pages linked for full schedule details for each of these programs!


MathWOOT Level 1
MathWOOT Level 2
ChemWOOT
CodeWOOT
PhysicsWOOT

Programming

Introduction to Programming with Python
Thursday, May 22 - Aug 7
Sunday, Jun 15 - Sep 14 (1:00 - 2:30 pm ET/10:00 - 11:30 am PT)
Tuesday, Jun 17 - Sep 2
Monday, Jun 30 - Sep 22

Intermediate Programming with Python
Sunday, Jun 1 - Aug 24
Monday, Jun 30 - Sep 22

USACO Bronze Problem Series
Tuesday, May 13 - Jul 29
Sunday, Jun 22 - Sep 1

Physics

Introduction to Physics
Wednesday, May 21 - Aug 6
Sunday, Jun 15 - Sep 14
Monday, Jun 23 - Sep 15

Physics 1: Mechanics
Thursday, May 22 - Oct 30
Monday, Jun 23 - Dec 15

Relativity
Mon, Tue, Wed & Thurs, Jun 23 - Jun 26 (meets every day of the week!)
0 replies
jlacosta
May 1, 2025
0 replies
k i Adding contests to the Contest Collections
dcouchman   1
N Apr 5, 2023 by v_Enhance
Want to help AoPS remain a valuable Olympiad resource? Help us add contests to AoPS's Contest Collections.

Find instructions and a list of contests to add here: https://artofproblemsolving.com/community/c40244h1064480_contests_to_add
1 reply
dcouchman
Sep 9, 2019
v_Enhance
Apr 5, 2023
k i Zero tolerance
ZetaX   49
N May 4, 2019 by NoDealsHere
Source: Use your common sense! (enough is enough)
Some users don't want to learn, some other simply ignore advises.
But please follow the following guideline:


To make it short: ALWAYS USE YOUR COMMON SENSE IF POSTING!
If you don't have common sense, don't post.


More specifically:

For new threads:


a) Good, meaningful title:
The title has to say what the problem is about in best way possible.
If that title occured already, it's definitely bad. And contest names aren't good either.
That's in fact a requirement for being able to search old problems.

Examples:
Bad titles:
- "Hard"/"Medium"/"Easy" (if you find it so cool how hard/easy it is, tell it in the post and use a title that tells us the problem)
- "Number Theory" (hey guy, guess why this forum's named that way¿ and is it the only such problem on earth¿)
- "Fibonacci" (there are millions of Fibonacci problems out there, all posted and named the same...)
- "Chinese TST 2003" (does this say anything about the problem¿)
Good titles:
- "On divisors of a³+2b³+4c³-6abc"
- "Number of solutions to x²+y²=6z²"
- "Fibonacci numbers are never squares"


b) Use search function:
Before posting a "new" problem spend at least two, better five, minutes to look if this problem was posted before. If it was, don't repost it. If you have anything important to say on topic, post it in one of the older threads.
If the thread is locked cause of this, use search function.

Update (by Amir Hossein). The best way to search for two keywords in AoPS is to input
[code]+"first keyword" +"second keyword"[/code]
so that any post containing both strings "first word" and "second form".


c) Good problem statement:
Some recent really bad post was:
[quote]$lim_{n\to 1}^{+\infty}\frac{1}{n}-lnn$[/quote]
It contains no question and no answer.
If you do this, too, you are on the best way to get your thread deleted. Write everything clearly, define where your variables come from (and define the "natural" numbers if used). Additionally read your post at least twice before submitting. After you sent it, read it again and use the Edit-Button if necessary to correct errors.


For answers to already existing threads:


d) Of any interest and with content:
Don't post things that are more trivial than completely obvious. For example, if the question is to solve $x^{3}+y^{3}=z^{3}$, do not answer with "$x=y=z=0$ is a solution" only. Either you post any kind of proof or at least something unexpected (like "$x=1337, y=481, z=42$ is the smallest solution). Someone that does not see that $x=y=z=0$ is a solution of the above without your post is completely wrong here, this is an IMO-level forum.
Similar, posting "I have solved this problem" but not posting anything else is not welcome; it even looks that you just want to show off what a genius you are.

e) Well written and checked answers:
Like c) for new threads, check your solutions at least twice for mistakes. And after sending, read it again and use the Edit-Button if necessary to correct errors.



To repeat it: ALWAYS USE YOUR COMMON SENSE IF POSTING!


Everything definitely out of range of common sense will be locked or deleted (exept for new users having less than about 42 posts, they are newbies and need/get some time to learn).

The above rules will be applied from next monday (5. march of 2007).
Feel free to discuss on this here.
49 replies
ZetaX
Feb 27, 2007
NoDealsHere
May 4, 2019
Frustration with Olympiad Geo
gulab_jamun   12
N an hour ago by ohiorizzler1434
Ok, so right now, I am doing the EGMO book by Evan Chen, but when it comes to problems, there are some that just genuinely frustrate me and I don't know how to deal with them. For example, I've spent 1.5 hrs on the second to last question in chapter 2, and used all the hints, and I still am stuck. It just frustrates me incredibly. Any tips on managing this? (or.... am I js crashing out too much?)
12 replies
gulab_jamun
Yesterday at 2:13 PM
ohiorizzler1434
an hour ago
Inequality by Po-Ru Loh
v_Enhance   57
N an hour ago by Learning11
Source: ELMO 2003 Problem 4
Let $x,y,z \ge 1$ be real numbers such that \[ \frac{1}{x^2-1} + \frac{1}{y^2-1} + \frac{1}{z^2-1} = 1. \] Prove that \[ \frac{1}{x+1} + \frac{1}{y+1} + \frac{1}{z+1} \le 1. \]
57 replies
v_Enhance
Dec 29, 2012
Learning11
an hour ago
King's Constrained Walk
Hellowings   0
2 hours ago
Source: Own
Given an n x n chessboard, with a king starting at any square, the king's task is to visit each square in the board exactly once (essentially an open path); this king moves how a king in chess would.
However, we are allowed to place k numbers on the board of any value such that for each number A we placed on the board, the king must be in the position of that number A on its Ath square in its journey, with the starting square as its 1st square.
Suppose after we placed k numbers, there is one and only one way to complete the king's task (this includes placing the king in a starting square), find the minimum value of k set by n.

Didn't know I could post it here xd; I'm unsure how hard this question could be.
0 replies
Hellowings
2 hours ago
0 replies
Plz give me the solution
Madunglecha   0
2 hours ago
For given M
h(n) is defined as the number of which is relatively prime with M, and 1 or more and n or less.
As B is h(M)/M, prove that there are at least M/3 or more N such that satisfying the below inequality
|h(N)-BN| is under 1+sqrt(B×2^((the number of prime factor of M)-3))
0 replies
Madunglecha
2 hours ago
0 replies
Inspired by Darealzolt
sqing   0
2 hours ago
Source: Own
Let $ a,b,c\geq 1$ and $ a^2+b^2+c^2+abc=\frac{9}{2}. $ Prove that
$$3\left(\sqrt[3] 2+\frac{1}{\sqrt[3] 2} -1\right) \geq a+b+c\geq  \frac{3+\sqrt{11}}{2}$$$$\frac{3}{2}\left(4+\sqrt[3] 4-\sqrt[3] 2\right) \geq a+b+c+ab+bc+ca\geq  \frac{3(1+\sqrt{11})}{2}$$
0 replies
sqing
2 hours ago
0 replies
2024 IMO P1
EthanWYX2009   104
N 2 hours ago by SYBARUPEMULA
Source: 2024 IMO P1
Determine all real numbers $\alpha$ such that, for every positive integer $n,$ the integer
$$\lfloor\alpha\rfloor +\lfloor 2\alpha\rfloor +\cdots +\lfloor n\alpha\rfloor$$is a multiple of $n.$ (Note that $\lfloor z\rfloor$ denotes the greatest integer less than or equal to $z.$ For example, $\lfloor -\pi\rfloor =-4$ and $\lfloor 2\rfloor= \lfloor 2.9\rfloor =2.$)

Proposed by Santiago Rodríguez, Colombia
104 replies
EthanWYX2009
Jul 16, 2024
SYBARUPEMULA
2 hours ago
2-var inequality
sqing   8
N 2 hours ago by sqing
Source: Own
Let $ a,b>0 , a^2+b^2-ab\leq 1 . $ Prove that
$$a^3+b^3 -\frac{a^4}{b+1}  -\frac{b^4}{a+1} \leq 1 $$
8 replies
sqing
May 27, 2025
sqing
2 hours ago
Mustang Math Recruitment is Open!
MustangMathTournament   6
N 3 hours ago by Helena_Liang
The Interest Form for joining Mustang Math is open!

Hello all!

We're Mustang Math, and we are currently recruiting for the 2025-2026 year! If you are a high school or college student and are passionate about promoting an interest in competition math to younger students, you should strongly consider filling out the following form: https://link.mustangmath.com/join. Every member in MM truly has the potential to make a huge impact, no matter your experience!

About Mustang Math

Mustang Math is a nonprofit organization of high school and college volunteers that is dedicated to providing middle schoolers access to challenging, interesting, fun, and collaborative math competitions and resources. Having reached over 4000 U.S. competitors and 1150 international competitors in our first six years, we are excited to expand our team to offer our events to even more mathematically inclined students.

PROJECTS
We have worked on various math-related projects. Our annual team math competition, Mustang Math Tournament (MMT) recently ran. We hosted 8 in-person competitions based in Washington, NorCal, SoCal, Illinois, Georgia, Massachusetts, Nevada and New Jersey, as well as an online competition run nationally. In total, we had almost 900 competitors, and the students had glowing reviews of the event. MMT International will once again be running later in August, and with it, we anticipate our contest to reach over a thousand students.

In our classes, we teach students math in fun and engaging math lessons and help them discover the beauty of mathematics. Our aspiring tech team is working on a variety of unique projects like our website and custom test platform. We also have a newsletter, which, combined with our social media presence, helps to keep the mathematics community engaged with cool puzzles, tidbits, and information about the math world! Our design team ensures all our merch and material is aesthetically pleasing.

Some highlights of this past year include 1000+ students in our classes, AMC10 mock with 150+ participants, our monthly newsletter to a subscriber base of 6000+, creating 8 designs for 800 pieces of physical merchandise, as well as improving our custom website (mustangmath.com, 20k visits) and test-taking platform (comp.mt, 6500+ users).

Why Join Mustang Math?

As a non-profit organization on the rise, there are numerous opportunities for volunteers to share ideas and suggest projects that they are interested in. Through our organizational structure, members who are committed have the opportunity to become a part of the leadership team. Overall, working in the Mustang Math team is both a fun and fulfilling experience where volunteers are able to pursue their passion all while learning how to take initiative and work with peers. We welcome everyone interested in joining!

More Information

To learn more, visit https://link.mustangmath.com/RecruitmentInfo. If you have any questions or concerns, please email us at contact@mustangmath.com.

https://link.mustangmath.com/join
6 replies
MustangMathTournament
May 24, 2025
Helena_Liang
3 hours ago
ai+aj is the multiple of n
Jackson0423   0
3 hours ago

Consider an increasing sequence of integers \( a_n \).
For every positive integer \( n \), there exist indices \( 1 \leq i < j \leq n \) such that \( a_i + a_j \) is divisible by \( n \).
Given that \( a_1 \geq 1 \), find the minimum possible value of \( a_{100} \).
0 replies
Jackson0423
3 hours ago
0 replies
Addition on the IMO
naman12   139
N 3 hours ago by ezpotd
Source: IMO 2020 Problem 1
Consider the convex quadrilateral $ABCD$. The point $P$ is in the interior of $ABCD$. The following ratio equalities hold:
\[\angle PAD:\angle PBA:\angle DPA=1:2:3=\angle CBP:\angle BAP:\angle BPC\]Prove that the following three lines meet in a point: the internal bisectors of angles $\angle ADP$ and $\angle PCB$ and the perpendicular bisector of segment $AB$.

Proposed by Dominik Burek, Poland
139 replies
naman12
Sep 22, 2020
ezpotd
3 hours ago
IMO ShortList 1998, number theory problem 5
orl   66
N 4 hours ago by lksb
Source: IMO ShortList 1998, number theory problem 5
Determine all positive integers $n$ for which there exists an integer $m$ such that ${2^{n}-1}$ is a divisor of ${m^{2}+9}$.
66 replies
orl
Oct 22, 2004
lksb
4 hours ago
2020 EGMO P5: P is the incentre of CDE
alifenix-   50
N 4 hours ago by EpicBird08
Source: 2020 EGMO P5
Consider the triangle $ABC$ with $\angle BCA > 90^{\circ}$. The circumcircle $\Gamma$ of $ABC$ has radius $R$. There is a point $P$ in the interior of the line segment $AB$ such that $PB = PC$ and the length of $PA$ is $R$. The perpendicular bisector of $PB$ intersects $\Gamma$ at the points $D$ and $E$.

Prove $P$ is the incentre of triangle $CDE$.
50 replies
alifenix-
Apr 18, 2020
EpicBird08
4 hours ago
[CASH PRIZES] IndyINTEGIRLS Spring Math Competition
Indy_Integirls   75
N Yesterday at 9:01 PM by Audreyma0321
[center]IMAGE

Greetings, AoPS! IndyINTEGIRLS will be hosting a virtual math competition on May 25,
2024 from 12 PM to 3 PM EST.
Join other woman-identifying and/or non-binary "STEMinists" in solving problems, socializing, playing games, winning prizes, and more! If you are interested in competing, please register here![/center]

----------

[center]Important Information[/center]

Eligibility: This competition is open to all woman-identifying and non-binary students in middle and high school. Non-Indiana residents and international students are welcome as well!

Format: There will be a middle school and high school division. In each separate division, there will be an individual round and a team round, where students are grouped into teams of 3-4 and collaboratively solve a set of difficult problems. There will also be a buzzer/countdown/Kahoot-style round, where students from both divisions are grouped together to compete in a MATHCOUNTS-style countdown round! There will be prizes for the top competitors in each division.

Problem Difficulty: Our amazing team of problem writers is working hard to ensure that there will be problems for problem-solvers of all levels! The middle school problems will range from MATHCOUNTS school round to AMC 10 level, while the high school problems will be for more advanced problem-solvers. The team round problems will cover various difficulty levels and are meant to be more difficult, while the countdown/buzzer/Kahoot round questions will be similar to MATHCOUNTS state to MATHCOUNTS Nationals countdown round in difficulty.

Platform: This contest will be held virtually through Zoom. All competitors are required to have their cameras turned on at all times unless they have a reason for otherwise. Proctors and volunteers will be monitoring students at all times to prevent cheating and to create a fair environment for all students.

Prizes: At this moment, prizes are TBD, and more information will be provided and attached to this post as the competition date approaches. Rest assured, IndyINTEGIRLS has historically given out very generous cash prizes, and we intend on maintaining this generosity into our Spring Competition.

Contact & Connect With Us: Email us at indy@integirls.org.

---------
[center]Help Us Out

Please help us in sharing the news of this competition! Our amazing team of officers has worked very hard to provide this educational opportunity to as many students as possible, and we would appreciate it if you could help us spread the word!
75 replies
Indy_Integirls
May 11, 2025
Audreyma0321
Yesterday at 9:01 PM
Perfect Square Dice
asp211   68
N Yesterday at 7:09 PM by xHypotenuse
Source: 2019 AIME II #4
A standard six-sided fair die is rolled four times. The probability that the product of all four numbers rolled is a perfect square is $\tfrac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$.
68 replies
asp211
Mar 22, 2019
xHypotenuse
Yesterday at 7:09 PM
Inequality with a^2+b^2+c^2+abc=4
cn2_71828182846   72
N May 27, 2025 by endless_abyss
Source: USAMO 2001 #3
Let $a, b, c \geq 0$ and satisfy \[ a^2+b^2+c^2 +abc = 4 . \] Show that \[ 0 \le ab + bc + ca - abc \leq 2. \]
72 replies
cn2_71828182846
Jun 27, 2004
endless_abyss
May 27, 2025
Inequality with a^2+b^2+c^2+abc=4
G H J
Source: USAMO 2001 #3
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
sqing
42512 posts
#60 • 2 Y
Y by Adventure10, Mango247
If $a,b,c\ge0$ such that $a^2+b^2+c^2+abc=4$, then
$$a+b+c\le\sqrt{8+abc}\qquad$$
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Euler1728
639 posts
#61 • 2 Y
Y by Adventure10, Mango247
v_Enhance wrote:
OK let's practice bashing.

The left-hand side of the inequality is trivial; just note that $\min \left\{ a,b,c \right\} \le 1$. Hence, we focus on the right side.
We use Lagrange Multipliers.

Define \[ U = \left\{ (a,b,c) \mid a,b,c > 0 \text{ and } a^2+b^2+c^2 < 1000 \right\}. \]This is an intersection of open sets, so it is open. Its closure is \[ \overline U = \left\{ (a,b,c) \mid a,b,c \ge 0 \text{ and } a^2+b^2+c^2 \le 1000 \right\}. \]Hence the constraint set \[ \overline S = \left\{ \mathbf x \in \overline U : g(\mathbf x) = 4 \right\} \]is compact, where $g(a,b,c) = a^2+b^2+c^2+abc$. Excellent.

Define \[ f(a,b,c) = a^2+b^2+c^2+ab+bc+ca. \]It's equivalent to show that $f \le 6$ subject to $g$. Over $\overline S$, it must achieve a global maximum. Now we consider two cases.

If $\mathbf x$ lies on the boundary, that means one of the components is zero (since $a^2+b^2+c^2=1000$ is clearly impossible). WLOG $c=0$, then we wish to show $a^2+b^2+ab \le 6$ for $a^2+b^2=4$, which is trivial.

Now for the interior $U$, we may use the method of Lagrange Multipliers. Consider a local maximum $\mathbf x \in U$. Compute \[ \nabla f = \left<2a+b+c, 2b+c+a, 2c+a+b \right> \]and \[ \nabla g = \left<2a+bc, 2b+ca, 2c+ab\right>. \]Of course, $\nabla g \neq \mathbf 0$ everywhere, so introducing our multiplier yields \[ \left<2a+b+c,a+2b+c,a+b+2c\right> = \lambda \left<2a+bc,2b+ca,2c+ab\right>. \]Note that $\lambda \neq 0$ since $a,b,c > 0$. Subtracting $2a+b+c = \lambda(2a+bc)$ from $a+2b+c = \lambda(2b+ca)$ implies that \[ (a-b)(\left[ 2\lambda - 1 \right] - \lambda c) = 0. \]We can derive similar equations for the others. Hence, we have three cases.

Case 1: If $a=b=c$, then $a=b=c=1$, and this satisfies $f(1,1,1) \le 6$.
Case 2: If $a$, $b$, $c$ are pairwise distinct, then we derive $a = b = c = 2 - \lambda^{-1}$, contradiction.
Case 3: Now suppose that $a=b \neq c$. That means $\lambda = \frac{1}{2-a}$ (of course our conditions force $c < 2$). Now \[ 2a+2c = a+b+2c = \lambda (2c+ab)
	= \frac{1}{2-a} (2c+a^2) \]which implies \[ 4a+4c-2a^2-2ac = 2c+a^2 \]meaning (with the additional note that $a \neq 1$) we have \[ c = \frac{3a^2-4a}{2-2a}. \]Note that at this point, $c > 0$ forces $1 < a < \frac 43$.

The constraint $a^2+b^2+c^2+abc=4 \iff c^2 + + a^2c + (2a^2-4) = 0$ now gives \[ \left( 3a^2-4a \right)^2 + a^2 \left( 3a^2-4a \right)\left( 2-2a \right) + \left( 2a^2-4 \right)\left( 2-2a \right)^2 = 0. \]Before expanding this, it is prudent to see if it has any rational roots. A quick inspection finds that $a=2$ is such a root (precisely, $16-32+16=0$). Now, we can expand and try to factor:
\begin{align*}
	0 &= -6a^5 + 31a^4 - 48a^3 + 8a^2 + 32a - 16 \\
	&= (a-2)(-6a^4 + 19a^3 - 10a^2 - 12a + 8) \\
	&= (a-2)^2 \left( -6a^3+7a^2+4a-4 \right) \\
	\intertext{Seeing a cubic, we desperately try every rational root and miraculously discover}
	&= (a-2)^2 (2-3a)(2a^2-a-2).
\end{align*}The only root $a$ in the interval $\left( 1,\tfrac43 \right)$ is $a = \frac 14 \left( 1 + \sqrt{17} \right)$. You can guess what comes next -- write
\[ c = \frac{a(3a-4)}{2-2a} = \frac{1}{8} \left( 7 - \sqrt{17} \right) \]and \[ f(a,b,c)
	= 3a^2+2ac+c^2
	= \frac{1}{32} \left( 121 + 17\sqrt{17} \right)
	. \]This is the last critical point, so we're done once we check this is less than $6$. This follows from the inequality $17^3 < (6 \cdot 32 - 121)^2$; in fact, we actually have \[ \frac{1}{32} \left( 121 + 17\sqrt{17}  \right) \approx 5.97165. \]This completes the solution.

In case 3 , can anyone tell how c<2 is concluded?
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Euler1728
639 posts
#62 • 2 Y
Y by Adventure10, Mango247
Anyone ??
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
piis3141592653
100 posts
#63 • 3 Y
Y by Euler1728, Adventure10, Mango247
$c\ge2 \Longrightarrow c^2 \ge 4 \Longrightarrow a^2 + b^2 + c^2 + abc >4,$ contradiction.
This post has been edited 1 time. Last edited by piis3141592653, Aug 6, 2019, 4:38 PM
Reason: greater/equal, not strict
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
sqing
42512 posts
#67
Y by
cn2_71828182846 wrote:
Let $a, b, c \geq 0$ and satisfy \[ a^2+b^2+c^2 +abc = 4 . \]Show that \[ 0 \le ab + bc + ca - abc \leq 2. \]
2017 Preparation for juniors, Romania:
Let $a, b, c > 0$ and satisfy \[ a^2+b^2+c^2 = 3. \]Show that \[ ab + bc + ca - abc \leq 2. \]
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
dikhendzab
108 posts
#68 • 1 Y
Y by N0_NAME
Let $a \leq 1$ and $b,c \geq 1$. Now, obviously $(b-1)(c-1) \geq 0$ and:
$ab+bc+ca-abc=a(b+c)+bc(1-a) \geq 0$
We will solve quadratic equation $a^2+b^2+c^2+abc-4=0$ for $a$, so:
$a=\frac{\sqrt{(4-b^2)(4-c^2)}-bc}{2}$. And we will use this in second equation:
$ab+bc+ca-abc=-abc+ab+ac-a+a+bc=-a(b-1)(c-1)+a+bc \leq a+bc=\frac{bc+\sqrt{(4-b^2)(4-c^2)}}{2}$
By Cauchy-Schwarz inequality we see that:
$\frac{bc+\sqrt{(4-b^2)(4-c^2)}}{2} \leq \frac{\sqrt{(4-b^2+b^2)(4-c^2+c^2)}}{2}=\frac{\sqrt{16}}{2}=2$
So, $0 \leq ab+bc+ca-abc \leq 2$ :)
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
GeronimoStilton
1521 posts
#69 • 3 Y
Y by teomihai, Mango247, khina
It is well-known that we can substitute $a=2\cos A,b=2\cos B,c=2\cos C$ for a triangle $ABC$. Observe that
\[ab+bc+ca\ge 3\sqrt[3]{a^2b^2c^2}\ge abc\]because $abc\le 27$, which shows the first part of the inequality. For the latter part, rewrite it as showing
\[3\ge \sum_{\mbox{cyc}}(\cos A+\cos B)^2.\]Note since triangle $ABC$ is not obtuse, we can let $a^2=y+z,b^2=z+x,c^2=x+y$ for some nonnegative $x,y,z$, so the problem amounts to showing
\[3\ge \sum_{\mbox{cyc}}\left(\frac{b^2+c^2-a^2}{2bc}+\frac{a^2+c^2-b^2}{2ac}\right)^2 = 2\sum_{\mbox{cyc}}\frac{x^2}{(x+y)(x+z)}+2\sum_{\mbox{cyc}}\frac{yz}{(y+z)\sqrt{(x+z)(x+y)}}.\]By rearranging, the problem amounts to checking
\[6xyz+3\sum_{\mbox{sym}}x^2y\ge 2\sum_{\mbox{cyc}}x^2(y+z)+2\sum_{\mbox{cyc}}yz\sqrt{(x+z)(x+y)}.\]By cancelling, it is equivalent to show
\[6xyz+\sum_{\mbox{sym}}x^2y\ge 2\sum_{\mbox{cyc}}yz\sqrt{(x+z)(x+y)}.\]But by AM-GM, the latter expression is at most
\[\sum_{\mbox{cyc}}(2xyz+y^2z+z^2y),\]so done.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
PCChess
548 posts
#70
Y by
For the lower bound, write $0 \le ab + bc + ca - abc$ as
\[0\le -a((b-1)(c-1)-1)+bc.\]This is clearly true since $(b-1)(c-1)-1$ must be nonpositive.
Now we deal with the upper bound. WLOG, we can let $a-1$ and $b-1$ have the same sign. Then $(a-1)(b-1)=ab-b-a+1 \ge 0 \implies ab+1 \ge a+b$. Multiplying by $c$ and subtracting $abc$, we get $c \ge ac+bc-abc$. Adding $ab, $
\[c+ab \ge ac+bc+ab-abc.\]This means to prove the upper bound it suffices to prove $c+ab \le 2$. Assume FTSOC that $c+ab>2$. Then,

\begin{align*}
4
&=a^2+b^2+c(c+ab) \\
&\ge 2ab+c(c+ab) \\
&> 2ab+2c 
\end{align*}
which implies that $2>ab+c,$ contradiction. Hence, $c+ab \le 2$ and we are done.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
MathThm
54 posts
#72
Y by
My solution:
We know that $min\{a,b,c\}\leq1$ so wlog any two of $a,b,c$ can be $\geq1$ or $\leq1$
So let $a\leq 1$ and $b,c\geq 1$ so we have \[ab+bc+ca-abc=a(b+c)+bc(1-a)\geq 0\]So lower bound is proved.So now we need to prove upper bound so \[a^2+b^2+c^2+abc=4\]and we know that $b^2+c^2\geq 2bc$ by AM-GM so now put this up\[a^2+2bc\leq 4\implies bc(2+a)\leq 4-a^2=(2+a)(2-a)\\\implies bc\leq 2-a\]now lets see what we have until now,
$\bullet$ $(1-b)(1-c)\geq 0$ for both the cases
$\bullet$ $bc\leq 2-a$
So now begin the sol lets see what we have
\[ab+bc+ca-abc\leq ab+2-a+ca-abc=2-a(1-b-c+bc)=2-a(1-b)(1-c)\leq 2\]So we are done now !
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
ZETA_in_olympiad
2211 posts
#74 • 1 Y
Y by Mango247
Part 1: $0\leq ab+bc+ca.$
Notice $$\min (a,b,c) \leq 1 \implies ab+bc+ca \geq bc \geq abc.$$Equality when $a=b=0, c=2.$ Q.E.D.

Part 2: $ab+bc+ca-abc\leq 2.$
WLOG, $a\leq 1, c\geq 1,$ then $$abc+b \geq ab+bc \implies b(a-1)(c-1)\geq 0.$$We have to prove $2\geq ac+b.$
Notice: $$a^2+c^2+b(ac+b)=4 \implies 2ac+b(ac+b) \leq 4 \implies (b+2)(ac+b-2) \leq 0 \implies ac+b \leq 2.$$Equality when $a=b=c=1.$ Q.E.D.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
OronSH
1748 posts
#75 • 1 Y
Y by ehuseyinyigit
Set $a=2\cos A,b=2\cos B,c=2\cos C$ for $\triangle ABC$ acute. Then the stronger lower bound $ab+bc+ca-3abc\ge 0$ follows from Erdos-Mordell from the circumcenter of $ABC$ to its tangential triangle.

If $\triangle ABC$ has side lengths $x,y,z$ we can write $a,b,c$ in terms of $x,y,z$ by Law of Cosines.

We can check that \[abc+2-ab-bc-ca=\sum_{\text{cyc}}bc\cdot\frac{(y-z)^2}{2yz}\]which is nonnegative so we are done.
This post has been edited 1 time. Last edited by OronSH, Sep 20, 2024, 5:26 PM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
HamstPan38825
8868 posts
#76
Y by
Here is my writeup of Evan's LM solution. By bashing standards, I consider it quite beautiful (and also reflects the structure of the inequality well).

The left side of the inequality follows because one of $a, b, c$ is at most $1$. For the right side, let $U$ denote the open set of all points $(a, b, c)$ with positive coordinates such that $a^2+b^2+c^2 < 4$, such that its closure $\overline U$ is given by the set of all points $(a, b, c)$ with nonnegative coordinates such that $a^2+b^2+c^2 \leq 4$.

Now, we aim to maximize the quantity $f(a, b, c) = a^2+b^2+c^2+ab+bc=ca$ subject to the constraint $g(a, b, c) = a^2+b^2+c^2+abc=4$. By LM, $f$ achieves a global maximum at some critical point in the constraint set $S$.

Now let $\mathbf u \in \overline U \setminus U$. Then $0 \in \{a, b, c\}$ (either directly or if $a^2+b^2+c^2=4$), and thus it suffices to show that $b^2+c^2+bc \leq 6$ given the condition $b^2+c^2 = 4$, which is clear.

For the rest of the solution, we compute the gradients
\begin{align*}
\nabla f &= [2a+b+c, 2b+c+a, 2c+a+b] \\
\nabla g &= [2a+bc, 2b+ca, 2c+ab]
\end{align*}and observe that the equation $\nabla f = \lambda \nabla g$ implies that $a=b$ or $c = 2-\frac 1{\lambda}$ and cyclic permutations. In particular, either $a=b=c=1$ or $a=b=2-\frac 1{\lambda}$. In this case, the constraint implies $c \in \{-2, 2-a^2\}$ so $c = 2-a^2$.

Thus we have characterized all the critical points of $f$ along $S$. It remains to verify that \[ab+bc+ca-abc = a^2+2a\left(2-a^2\right)-a^2\left(2-a^2\right) - 2 = \left(a-\sqrt 2\right)(a-1)^2 \leq 0\]which is clearly true as $a \leq \sqrt 2$. This completes the proof.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
math90
1479 posts
#77
Y by
cn2_71828182846 wrote:
Let $a, b, c \geq 0$ and satisfy \[ a^2+b^2+c^2 +abc = 4 . \]Show that \[ 0 \le ab + bc + ca - abc \leq 2. \]

There is a very short symmetric proof for RHS:

By C-S
$$1=\sum\frac{a}{2a+bc}\ge\frac{(a+b+c)^2}{2\sum a^2+3abc}=\frac{4-abc+2\sum ab}{8+abc}$$Hence
$$abc+8\ge 4-abc+2\sum ab$$or
$$2abc+4\ge 2\sum ab$$Q.E.D.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Novmath
20 posts
#78
Y by
ductoan0503 wrote:
cn2_71828182846 wrote:
Let $ a, b, c \geq 0$ and satisfy
\[ a^2 + b^2 + c^2 + abc = 4 .
\]Show that
\[ ab + bc + ca - abc \leq 2.
\]

Among a, b, c there must exist 2 numbers, say a and b, such that $ (1-a)(1-b) \geq 0$
Then: $ 1 \geq a + b - ab$
On the other hand, from $ a^2 + b^2 + c^2 + abc = 4$ we have:
$ c = \frac {-ab + \sqrt{a^2b^2 - 4a^2 - 4b^2 + 16}}{2} \leq \frac {-ab + \sqrt{a^2b^2 - 8ab + 16}}{2} = -ab +2$
Thus:
$ ab + bc + ca - abc = ab + c(a+b-ab) \leq ab + c \leq 2  (q.e.d)$

Nice solution
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
endless_abyss
66 posts
#80
Y by
Nice way to make use of some black magic trig substitutions :-D
Here's a somewhat shorter solution falling back to the geometric properties.

Refer to Chapter 1 of "Problems From The Book" by Titu Andreescu for more dark arts and seemingly magical substitutions!

Note that $x, y, z = 2 \cos A, 2 \cos B, 2 \cos C $ works,

and also note that the LHS is trivial, so we focus on proving -

$ 2 \cos A \cos B + 2 \cos B \cos C + 2 \cos A \cos C - 4 \cos A \cos B \cos C \leq 1 $
Now, inspired by the existence of terms like $ 2 \cos A \cos B$, we want to complete the square, and luckily enough the same trig identity we abused earlier can do just that!

so, now we simply need to prove -

$ ( \cos A + \cos B + \cos C )^2 \leq \sin^2 A + \sin^2 B + \sin^2 C $

Now, motivated by the distance of each of the vertices to the orthocenter relations like $ a = 2 R \sin A $, we multiply both the sides by $ 4 R^2 $, and we just need to prove -

$ ( AH^2 + BH^2 + CH^2 ) \leq a^2 + b^2 + c^2 $

Now, note that since the side lengths are already in the form of squares, the time is ripe for cosine rule to finish this problem!

just note that
$ a^2 = (B H)^2 + (H C)^2 + 2(B H)(H C) \cos A $
summing over finishes.
comments
$\square$
:starwars:
This post has been edited 1 time. Last edited by endless_abyss, May 27, 2025, 4:17 PM
Reason: Typos
Z K Y
N Quick Reply
G
H
=
a