I write today to announce my retirement as CEO from Art of Problem Solving. When I founded AoPS 22 years ago, I never imagined that we would reach so many students and families, or that we would find so many channels through which we discover, inspire, and train the great problem solvers of the next generation. I am very proud of all we have accomplished and I’m thankful for the many supporters who provided inspiration and encouragement along the way. I'm particularly grateful to all of the wonderful members of the AoPS Community!
I’m delighted to introduce our new leaders - Ben Kornell and Andrew Sutherland. Ben has extensive experience in education and edtech prior to joining AoPS as my successor as CEO, including starting like I did as a classroom teacher. He has a deep understanding of the value of our work because he’s an AoPS parent! Meanwhile, Andrew and I have common roots as founders of education companies; he launched Quizlet at age 15! His journey from founder to MIT to technology and product leader as our Chief Product Officer traces a pathway many of our students will follow in the years to come.
Thank you again for your support for Art of Problem Solving and we look forward to working with millions more wonderful problem solvers in the years to come.
And special thanks to all of the amazing AoPS team members who have helped build AoPS. We’ve come a long way from here:IMAGE
ka March Highlights and 2025 AoPS Online Class Information
jlacosta0
Mar 2, 2025
March is the month for State MATHCOUNTS competitions! Kudos to everyone who participated in their local chapter competitions and best of luck to all going to State! Join us on March 11th for a Math Jam devoted to our favorite Chapter competition problems! Are you interested in training for MATHCOUNTS? Be sure to check out our AMC 8/MATHCOUNTS Basics and Advanced courses.
Are you ready to level up with Olympiad training? Registration is open with early bird pricing available for our WOOT programs: MathWOOT (Levels 1 and 2), CodeWOOT, PhysicsWOOT, and ChemWOOT. What is WOOT? WOOT stands for Worldwide Online Olympiad Training and is a 7-month high school math Olympiad preparation and testing program that brings together many of the best students from around the world to learn Olympiad problem solving skills. Classes begin in September!
Do you have plans this summer? There are so many options to fit your schedule and goals whether attending a summer camp or taking online classes, it can be a great break from the routine of the school year. Check out our summer courses at AoPS Online, or if you want a math or language arts class that doesn’t have homework, but is an enriching summer experience, our AoPS Virtual Campus summer camps may be just the ticket! We are expanding our locations for our AoPS Academies across the country with 15 locations so far and new campuses opening in Saratoga CA, Johns Creek GA, and the Upper West Side NY. Check out this page for summer camp information.
Be sure to mark your calendars for the following events:
[list][*]March 5th (Wednesday), 4:30pm PT/7:30pm ET, HCSSiM Math Jam 2025. Amber Verser, Assistant Director of the Hampshire College Summer Studies in Mathematics, will host an information session about HCSSiM, a summer program for high school students.
[*]March 6th (Thursday), 4:00pm PT/7:00pm ET, Free Webinar on Math Competitions from elementary through high school. Join us for an enlightening session that demystifies the world of math competitions and helps you make informed decisions about your contest journey.
[*]March 11th (Tuesday), 4:30pm PT/7:30pm ET, 2025 MATHCOUNTS Chapter Discussion MATH JAM. AoPS instructors will discuss some of their favorite problems from the MATHCOUNTS Chapter Competition. All are welcome!
[*]March 13th (Thursday), 4:00pm PT/7:00pm ET, Free Webinar about Summer Camps at the Virtual Campus. Transform your summer into an unforgettable learning adventure! From elementary through high school, we offer dynamic summer camps featuring topics in mathematics, language arts, and competition preparation - all designed to fit your schedule and ignite your passion for learning.[/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.
Prealgebra 1
Sunday, Mar 2 - Jun 22
Friday, Mar 28 - Jul 18
Sunday, Apr 13 - Aug 10
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
Tuesday, Mar 25 - Jul 8
Sunday, Apr 13 - Aug 10
Wednesday, May 7 - Aug 20
Monday, Jun 2 - Sep 22
Sunday, Jun 29 - Oct 26
Friday, Jul 25 - Nov 21
Introduction to Algebra A
Sunday, Mar 23 - Jul 20
Monday, Apr 7 - Jul 28
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
Sunday, Mar 16 - Jun 8
Wednesday, Apr 16 - Jul 2
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
Monday, Mar 17 - Jun 9
Thursday, Apr 17 - Jul 3
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
Sunday, Mar 2 - Jun 22
Wednesday, Apr 16 - Jul 30
Tuesday, May 6 - Aug 19
Wednesday, Jun 4 - Sep 17
Sunday, Jun 22 - Oct 19
Friday, Jul 18 - Nov 14
Introduction to Geometry
Tuesday, Mar 4 - Aug 12
Sunday, Mar 23 - Sep 21
Wednesday, Apr 23 - Oct 1
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
Intermediate: Grades 8-12
Intermediate Algebra
Sunday, Mar 16 - Sep 14
Tuesday, Mar 25 - Sep 2
Monday, Apr 21 - Oct 13
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
MATHCOUNTS/AMC 8 Basics
Sunday, Mar 23 - Jun 15
Wednesday, Apr 16 - Jul 2
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
Friday, Apr 11 - Jun 27
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
Tuesday, Mar 4 - May 20
Monday, Mar 31 - Jun 23
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
Introduction to Programming with Python
Monday, Mar 24 - Jun 16
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
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][/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 , do not answer with " is a solution" only. Either you post any kind of proof or at least something unexpected (like " is the smallest solution). Someone that does not see that 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.
In convex quadrilateral . Let be a point on side , and be a point on the extension of such that . Let be the circumcenter of , and be a point on the side extension of satisfying . Line BP intersects AC at point Q. Prove that
An immortal flea jumps on whole points of the number line, beginning with . The length of the first jump is , the second , the third , and so on. The length of jump is equal to . The flea decides whether to jump left or right on its own. Is it possible that sooner or later the flee will have been on every natural point, perhaps having visited some of the points more than once?
There are lamps arranged in a circle in that order. At any given time, each lamp is either on or off. Every second, each lamp undergoes a change according to the following rule:
(a) For each lamp , if have the same state in the previous second, then is off right now. (Indices taken mod .)
(b) Otherwise, is on right now.
Initially, all the lamps are off, except for which is on. Prove that for infinitely many integers all the lamps will be off eventually, after a finite amount of time.
For given positive integers and , let us consider the equation[list=a]
[*]For and , find the least positive integer satisfying this equation.
[*]Prove that for any positive integers and , there exist infinitely many positive integers satisfying this equation.
[/list] (Here, denotes the greatest common divisor of positive integers and .)
Two positive integers and are prime-related if or for some prime . Find all positive integers , such that has at least three divisors, and all the divisors can be arranged without repetition in a circle so that any two adjacent divisors are prime-related.
It is known that from segments of lengths , and , a triangle can be formed. Could it happen that from segments of lengths a right-angled triangle can be formed?
Determine all composite positive integers for which it is possible to arrange all divisors of that are greater than 1 in a circle so that no two adjacent divisors are relatively prime.
Triangle has side lengths ,, and . Select a point inside , and construct the incenters of ,, and and denote them as ,,. What is the maximum area of the triangle ?
Multiply the second equation by and substitute to get Rearranging, we find the equivalent If , this shows that and hence which is a solution. If , we also get .
From now on assume that . Hence On the other hand, remember from the first equation that Hence and must have different signs and hence so that and . But now AM-GM implies that which is a contradiction.
Hence the only solution is .
Motivation
It should be very natural to eliminate one equation and one variable. This leads to the equation in two variables . At this point, for each fixed , we except solutions for , unless something special happens.
Since we don't find a parameter family of solutions (like always works), we expect that "something special" should happen which means that some inequality must prevent us from having real solutions (since complex solutions will always be there).
But in fact it is easily verified that the equation in has non-trivial (and very ugly!) real solutions.
So where is our mistake? We forgot that also has to be real. From this we get an inequality on from the first equation and combining the two in a clever way it is then not too hard to find something like the above solution.
We should find discriminants from the first equation.
Let be discriminants for respectively. Now we will find them:
Now, , so we have a system of inequalities:
And when we add them we get which is same as our second condition, so we now have a system of equations from which we get that: . Now it is easy to get which holds only for . Finally is the only solution.
Even though it's very contrived, I find this problem hilarious. Look at the first equation, where we have Summing times the second and third equations and subtracting the first, we yield the second equality as an equality. Thus, equality must hold in all three of these inequalities, so .
This post has been edited 1 time. Last edited by HamstPan38825, Jan 7, 2023, 2:52 AM
We can look at the discriminants when the first equation is considered as a quadratic in ,, or , which gives us the inequalities Now look at these, considering the second equation. Note that . So we can cancel out those terms, and the remaining inequality is However, from our above discriminant-derived inequalites, , which means .
Assume now that none of ,, or is . So , so and . Then , clearly impossible unless . So the only solution is .
We claim that the only solution is . This clearly works. Consider the discriminant of the first equation as a quadratic in respectively. We get Adding the last two inequalities, But by the second equation, this means that the equality case of the first inequality must hold. From this we deduce that , but plugging this into the first original equation yields , so either or . We can check that both cases do indeed give , as desired.
This post has been edited 1 time. Last edited by pqr., Aug 27, 2023, 3:51 PM
View the first equation as a quadratic in , and let be the discriminant; then . Defining and similarly, we have . For ,, and to be real, we must have ; but the second equation rewrites as so in fact we have equality and .
Looking at the equation for , we have . Then
If , the original first equation gives , and then the equation for gives
If , the equation for gives , and the original first equation gives
If , then the equation for gives , so from the third equation we have , which we already handled
Thus is indeed the only solution.
This post has been edited 1 time. Last edited by eibc, Jan 1, 2024, 10:37 PM
Consider the first equation as a quadratic wrt ,, and .
Let be the discriminant of a quadratic in variable .
Then
Summing the last two inequalities gives us And adding the last inequality gives And since this is the second original equality, we get that must be the only solution.
Quadratic formula on for the first equation gives us:
We notice that the discriminants all sum to . Hence, All three of the terms which are squared must therefore be equal to . From either or . When we must have so or , but each implies the other.
When we must have so , which then implies . Therefore, the only solution is .
This post has been edited 1 time. Last edited by Marcus_Zhang, Mar 23, 2025, 5:24 PM