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.
Hello, does anyone else struggle with reading math olympiad books or am I just the only one? Whenever i try to study any different books I often get confused or overwhelmed very easily. This makes the process of studying very hard for me. Do you guys have any tips, or techniques you used? Any good videos you know?
A polynomial with real coefficients of degree greater than is given. Prove that there are infinitely many positive integers which cannot be represented in the form where and are positive integers.
Let be a scalene triangle with incenter and incircle . Let the tangency points of to be respectively. Let the line intersect the circumcircle of at the points . Assume that lies between the points and . Let be a circle that passes through and and that is tangent to at the point which lies on different semi-planes with with respect to the line . Let intersect at points and and let the second intersection point of the circumcircle of and the circumcircle of be . Prove that the intersection point of and lies on the circumcircle of if and only if the intersection point of and lies on .
For an integer with 5 digits (where are the digits and ) we define the \textit{permutation sum} as the value For example the permutation sum of 20253 is Let and be two fivedigit integers with the same permutation sum.
Prove that .
A total of 3300 handshakes were made at a party attended by 600 people. It was observed
that the total number of handshakes among any 300 people at the party is at least N. Find
the largest possible value for N.
Max amount of equal numbers among (a_i^2 + a_j^2)/(a_i + a_j)
mshtand12
Nan hour ago
by mshtand1
Source: Ukrainian Mathematical Olympiad 2025. Day 2, Problem 9.8
Given pairwise distinct positive integer numbers , find the maximum possible number of equal numbers among the fractions of the form Proposed by Mykhailo Shtandenko
Let be the incircle of triangle . Line is parallel to side and tangent to . Line is parallel to side and tangent to . It turned out that the intersection point of and lies on circumcircle of
Find all possible values of
Just use Cauchy-Schwarz: Now, denote and . Again, due to Cauchy-Schwarz (or AM-HM) we have Thus, it remains to prove that Consider the expression Since and function is increasing on (due to ) we have Therefore it suffices to prove that or so since we just need to check this inequality when (and it's easier to check initial inequality) or which is actually an equality.
Note. This solution isn't really artificial and is quite straightforward. Some motivation: firstly, we don't really care about , so we can optimize the left hand for variables (so the first inequality makes all equal to 1). Secondly, we have restriction only on the sum , so we try to optimize left hand for while the sum is fixes (so our second inequality makes all variables equal). Basically, at this point we've reduced our problem to the case and with the only resrtriction . Finally, the left hand now is a function of , so we can find it's minimum on which is attained at . After that it remains to check simple inequality of variables and (and again we can apply our "optimizing principle" since and is an increasing function of ).
This post has been edited 2 times. Last edited by richrow12, Nov 3, 2020, 1:48 PM
Let be a choice of variables minimizing the LHS.
Replacing and with by and , the LHS would be smaller.
So whenever , such a shift must be forbidden.
This means that and and .
Since everything is homogeneous we may w.l.o.g. assume that and . Then we need to check that Expanding the LHS and using AM-GM, we find that it equals where in the last step we used that which is equivalent to .
This post has been edited 2 times. Last edited by Tintarn, Nov 3, 2020, 9:51 AM
Let and be positive real numbers such that Proof that
Let and be positive real numbers such that Proof that Thank you very much.
richrow12 wrote:
Just use Cauchy-Schwarz: Now, denote and . Again, due to Cauchy-Schwarz (or AM-HM) we have Thus, it remains to prove that Consider the expression Since and function is increasing on (due to ) we have Therefore it suffices to prove that or so since we just need to check this inequality when (and it's easier to check initial inequality) or which is actually an equality.
Note. This solution isn't really artificial and is quite straightforward. Some motivation: firstly, we don't really care about , so we can optimize the left hand for variables (so the first inequality makes all equal to 1). Secondly, we have restriction only on the sum , so we try to optimize left hand for while the sum is fixes (so our second inequality makes all variables equal). Basically, at this point we've reduced our problem to the case and with the only resrtriction . Finally, the left hand now is a function of , so we can find it's minimum on which attains at . After that it remains to check simple inequality of variables and (and again we can apply our "optimizing principle" since and is an increasin fucntion of ).
Tintarn wrote:
Solution
Let be a choice of variables minimizing the LHS.
Replacing and with by and , the LHS would be smaller.
So whenever , such a shift must be forbidden.
This means that and and .
Since everything is homogeneous we may w.l.o.g. assume that and . Then we need to check that Expanding the LHS and using AM-GM, we find that it equals where in the last step we used that which is equivalent to .
This post has been edited 1 time. Last edited by sqing, Jul 20, 2022, 2:40 PM
Just use Cauchy-Schwarz: Now, denote and . Again, due to Cauchy-Schwarz (or AM-HM) we have Thus, it remains to prove that Consider the expression Since and function is increasing on (due to ) we have Therefore it suffices to prove that or so since we just need to check this inequality when (and it's easier to check initial inequality) or which is actually an equality.
Note. This solution isn't really artificial and is quite straightforward. Some motivation: firstly, we don't really care about , so we can optimize the left hand for variables (so the first inequality makes all equal to 1). Secondly, we have restriction only on the sum , so we try to optimize left hand for while the sum is fixes (so our second inequality makes all variables equal). Basically, at this point we've reduced our problem to the case and with the only resrtriction . Finally, the left hand now is a function of , so we can find it's minimum on which attains at . After that it remains to check simple inequality of variables and (and again we can apply our "optimizing principle" since and is an increasing function of ).
But we don't know whether or not? Let me know if I am wrong.