ka May Highlights and 2025 AoPS Online Class Information
jlacosta0
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.
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
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
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
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
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
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.
I think I know why this problem was rejected by IMO PSC several times...
mshtand11
Na few seconds ago
by sarjinius
Source: Ukrainian Mathematical Olympiad 2025. Day 2, Problem 11.8
Exactly country leaders arrived at the IMO. At the final session, the IMO chairperson wants to introduce some changes to the regulations, which the leaders must approve. To pass the changes, the chairperson must gather at least of the votes "FOR" out of the total number of leaders. Some leaders do not attend such meetings, and it is known that there will be exactly leaders present. The chairperson must seat them in a square-shaped conference hall of size , where each leader will be seated in a designated cell. It is known that exactly of these leaders will surely support the chairperson, i.e., they will always vote "FOR." All others will vote as follows: At the last second of voting, they will look at how their neighbors voted up to that moment — neighbors are defined as leaders seated in adjacent cells (sharing a side). If the majority of neighbors voted "FOR," they will also vote "FOR." If there is no such majority, they will vote "AGAINST." For example, a leader seated in a corner of the hall has exactly neighbors and will vote "FOR" only if both of their neighbors voted "FOR."
(a) Can the IMO chairperson arrange their supporters so that they vote "FOR" in the first second of voting and thereby secure a "FOR" vote from at least of all leaders?
(b) What is the maximum number of "FOR" votes the chairperson can obtain by seating their 28 supporters appropriately?
Let be a quadrilateral with . Diagonals and meet at . Let and denote the circumcircle and the circumcenter of triangle . Let and denote the circumcircle and circumcenter of triangle . Segment meets and again at and (other than and ), respectively. Let and be the midpoints of minor arcs (not including ) and (not including ). Prove that .
Determine all natural numbers with at most four natural divisors, which have the property that for any two distinct proper divisors and of , the positive integer divides .
Something weird with this one FE in integers (probably challenging, maybe not)
Gaunter_O_Dim_of_math2
N3 hours ago
by aaravdodhia
Source: Pang-Cheng-Wu, FE, problem number 52.
During FE problems' solving I found a very specific one:
Find all such f that f: Z -> Z and for all integers a, b, c f(a^3 + b^3 + c^3) = f(a)^3 + f(b)^3 + f(c)^3.
Everything what I've got is that f is odd, f(n) = n or -n or 0
for all n from 0 to 11 (just bash it), but it is very simple and do not give the main idea.
I actually have spent not so much time on this problem, but definitely have no clue. As far as I see, number theory here or classical FE solving or advanced methods, which I know, do not work at all.
Is here a normal solution (I mean, without bashing and something with a huge number of ugly and weird inequalities)?
Or this is kind of rubbish, which was put just for bash?
Let and be two fixed points in the plane. For each point of the plane, outside of the line , let be the barycenter of the triangle . Determine the locus of points such that .
Note: The locus is the set of all points of the plane that satisfies the property.
When I was posting IMO LongList 1985 problems, this problem really bothered me. I posted it here (with changed variables). Read that topic to find the solution.
Y byteomihai, HamstPan38825, Amir Hossein, FriIzi, bryanguo, peace09, EpicBird08, two_steps, Assassino9931, cubres
Solution from Twitch Solves ISL:
Let ,,,.This condition is the same as saying which is equivalent to saying the multiset is the same as the multiset , (because Newton's formulas imply the polynomials with these roots have the same coefficients). Therefore, while .
Going back, with this gives only one solution, which evidently works:
We will substitute and Now, notice that the equations become and Now, we would like to find some constants, so that we can add the powers of them to both sides to make both sides equal. Notice that we can replace the constants with to make our equations equal to for Thus, by Newton Sums, we have that the sets and are equal. Since we get that and But, since is nonnegative, so Thus, giving us our pair
Denote ,, 2w = c, -3z = d. Now we plug in these into the system and we get a + b - c - d = 1, ,,. But this is basically equivalent to for n = 1,2,3,4. By Newton's formulas the polynomials with these roots have the same coefficients which means that (a, b, -1, -1) is some permutation of (c, d, -2, 1). Since , then for a is left to equal 1 b = -2, c = d = -1 (a, b, c, d) = (1, -2, -1, -1) .
Since the variables look pretty nasty, we can substitute stand-alone variables instead of contrived variables. The substitutions to be made are:
This gives the following equations:
These formulas can be rearranged to get:
We can replace the numbers with , where the equations now become:
Since the first four Newton's sums are fixed in the degree 4 polynomial, we can conclude that the coefficients are the same. Therefore, the multisets and are permutations of each other.
Setting , and since cannot be negative as it is under a square root, we have and .
Finally, computing the original variables, we get the solution as:
The obvious substituiton to make is ,,, and . This gives us the equations Now we can rearrange each of the equations as follows: Remark
The intuition for this is that we have four equations, so we want four terms on each side of our rearrangement. The powers of fit in nicely.
Now it follows that the polynomials and are equivalent. This is because of Newtons Sums and the fact that we have four Newton Sums and four roots. From here the finish is clear. and while (because , we can discount ). This translates to the solution
Perform the substitution ,,, and . We obtain: In fact, we actually have for . Consider the polynomials and . The first four Newton's sums of both of these polynomials are equal, so the polynomials must be identical. Therefore, the only solution is , which corresponds to .
This post has been edited 1 time. Last edited by gladIasked, Aug 21, 2024, 3:58 PM
We substitute From there we get the system of equations:
From there, I got hinted the idea that this is equivalent to From Vieta's formula (or Newton sums, either one works), we obtain that the numbers on each side of the equality form the same set (that is, the set of roots of the polynomial of the forth root, which are exactly ) or that (since ): Plugging into the original substitution, we find that the answer is
Define Thus, By choosing a polynomial of degree 4 with the roots we see that it must as be the same as Hence, By the definition of we have that and Thus, our answer is