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
Source: Revenge JOM 2025 Problem 4, Revenge JOMSL 2025 C3
There are people are playing a game at Cheesy's math casino, where is a prime number. Let be a positive integer. A subset of length from the set of integers from to inclusive is randomly chosen, with an equal probability ( and is fixed). The winner of Cheesy's game is person , if the sum of the chosen numbers are congruent to for .
For each , find all values of such that no person will sue Cheesy for creating unfair games (i.e. all the winning outcomes are equally likely).
(Proposed by Jaydon Chieng, Yeoh Teck En)
Remark
It has also been discovered (thanks to one of the contestants) that the problem is by no means original: In fact, the problem statement is just a subcase of USATST 2024 P3 and is similar to IMO 1995 P6, of which both have the AoPS links attached below. The proposer of this specific problem would like to apologise and reassure people that this mistake was not intentional, merely an oversight by the proposer himself for not being diligent enough.
IMO 1995/6: https://artofproblemsolving.com/community/c6h15112p107230
USATST 2024/3: https://artofproblemsolving.com/community/c6h3214874p29409068
Partitioning coprime integers to arithmetic sequences
sevket124
N13 minutes ago
by bochidd
Source: 2025 Turkey EGMO TST P3
For a positive integer , let be the set of positive integers that do not exceed and are coprime to . Define as the smallest positive integer that allows to be partitioned into disjoint subsets, each forming an arithmetic progression.
Prove that there exist infinitely many pairs satisfying ,, and .
Let be a quadrilateral and let be a line. Let intersect the lines at points respectively. Given that these six points on are in the order , show that the circles with diameter are coaxal.
Consider a rectangular grid of points consisting of rows and columns. Each point is coloured with one of the colours red, blue or green. Show that no matter whatever way the colouring is done, there always exist four points
of the same colour that form the vertices of a rectangle. An illustration is shown in the figure below.
A particle is in the origin of the Cartesian plane. In each step the particle can go unit in any of the directions, left, right, up or down. Find the number of ways to go from to in steps. (Note: Two paths where identical set of points is traversed are considered different if the order of traversal of each point is different in both paths.)
Let the vertices of the square are on a circle of radius and with center . Let and are the mid points of and respectively. Then;
(a) Show that the quadrilateral is a square.
(b) Find the distance from the mid point of to .
p2. There are real numbers and such that the only -intercept of equals its -intercept. Compute .
p3. Consider the set of digit numbers (with ) such that ,, and . What’s the size of this set?
p4. Let be the midpoint of in . A line perpendicular to D intersects at . If the area of is four times that of the area of , what is in degrees?
p5. Define the sequence with and for . Find .
p6. Find the maximum possible value of .
p7. Let . Let (x) be the th derivative of . What is the largest integer such that divides ?
p8. Let be the set of vectors where are all real numbers. Let denote . Let be the set in given by If a point is uniformly at random from , what is ?
p9. Let be the unique integer between and , inclusive, that is equivalent modulo to . Let be the set of primes between and , inclusive. Find .
p10. In the Cartesian plane, consider a box with vertices ,,,. We pick an integer between and , inclusive, uniformly at random. We shoot a puck from in the direction of and the puck bounces perfectly around the box (angle in equals angle out, no friction) until it hits one of the four vertices of the box. What is the expected number of times it will hit an edge or vertex of the box, including both when it starts at and when it ends at some vertex of the box?
p11. Sarah is buying school supplies and she has . She can only buy full packs of each of the following items. A pack of pens is , a pack of pencils is , and any type of notebook or stapler is . Sarah buys at least pack of pencils. She will either buy stapler or no stapler. She will buy at most college-ruled notebooks and at most graph paper notebooks. How many ways can she buy school supplies?
p12. Let be the center of the circumcircle of right triangle with . Let be the midpoint of minor arc and let be a point on line such that . Let be the intersection of line and the Circle and let be the intersection of line and . If and , compute the radius of the Circle .
p13. Reduce the following expression to a simplified rational
p14. Compute the following integral .
p15. Define to be the maximum possible least-common-multiple of any sequence of positive integers which sum to . Find the sum of all possible odd
PS. You should use hide for answers. Collected here.
Y byreveryu, Adventure10, Adventure10, son7, Mango247
I don't know why you say this problem is not hard, but everybody has its own opinion. So, let's give a monstruous solution:
First, it is trivial to prove that f(0)=0, f(1)=1. Suppose e managed to show that f(2)=2. Put y=2 and you wil find that and an easy induction shows that f(n)=n for any natural n. Now we use the fact that . Then, it's immediately to show that for any rational x and that for any nonnegative x. So, for any we have since this one has the same sign as . Thus, f is increasing on the positive and also multiplicative. It follows that f(x)=x for any positive x. It is also trivial to show that f is odd, so f(x)=x for any x.
Now, the main thing: proving that f(2)=2. Put . Then and also . Using that we find that . But . Thus, from where a=0 or a=2. If a=0, then f(3)=-1 so false.
I didn't mean that the problem was easy, I just meant that it wasn't hard to the extent that any of those parts is not obtainable.
The (union of) the Singapore team got almost every part except showing that the function was increasing on positive (which, as we found out, is not difficult, it's just that we don't have enough experience with it).
Whatever the case is there are quite a number of things to be shown. The official solution I have with all the details is 2 full pages long.
Small note regarding the ending: It's easy to observe that the function is injective (if f(x) = f(y) but x <> y, then the LHS is defined but the RHS is undefined). Then since we have shown that f(0) = 0, a <> 0.
Harazi, how do you show that f(x) >= 0 for x >= 0 ??
Here is all I have (not a complete solution, just some ideas which could be of use for finding a simpler solution):
We have given the equation
.
At first, our function f(x) must be injective; else, we would have x and y with f(x) = f(y) while , so that the right member of (1) would get undefined while the left member wouldn't.
Putting y = 0 in (1), we get
,
what becomes (1 - f(1))f(x) = -f(0)(1 + f(1)). Now, if f(1) were not 1, we could divide by 1 - f(1), and f(x) would be a constant. This is not possible since f(x) is injective; hence, f(1) = 1. Therefore, -f(0)(1 + f(1)) = (1 - f(1))f(x) = 0. But since , we must have f(0) = 0. As a consequence, for every (since f(x) is injective).
Putting y = -x in (1), we get
.
Using f(0) = 0, this immediately becomes f(-x) = -f(x). Consequently, f(-1) = -f(1) = -1.
Now let be a real number; then,
,
what simplifies to f(x)f(ay) = f(y)f(ax). With y = 1, this becomes f(x)f(a) = f(1)f(ax) = f(ax). (This trivially holds for x = 1 and for a = 0, even if these cases were not allowed in the proof.) Hence, we have f(x)f(a) = f(ax). In other words, our function f(x) is multiplicative.
As a consequence,
and
.
Now, substitute y = 1 in (1). Then, with f(1) = 1 we obtain
.
The quadratic equation
has two real solutions: and . But (3) shows that if x is a solution of the quadratic equation (4), then f(x) must be a solution of (4), too. Hence, we have 4 possible cases:
Case 1. and .
Case 2. and .
Case 3. and .
Case 4. and .
The latter two cases are impossible because of the injectivity; hence, one of the Cases 1 and 2 holds. Wherever Case 1 holds or Case 2 is unimportant; in any case, we have
and
.
Hence, applying (1) to and , we find
,
i. e.
,
so that, using (2), we have
.
Therefore, by the multiplicativity,
.
Then, we may proceed as you did and show that f(x) = x for any rational x. But how do you get the positivity?
Darij
This post has been edited 2 times. Last edited by darij grinberg, Mar 7, 2008, 6:38 PM
Solution. As usual, let assert the above equation. Then, we prove some claims.
Claim 1. is injective. Proof. This holds because if and , then the left hand side is defined while the right hand side is not, a contradiction.
Claim 2. is an odd function. Proof. gives us that so or for all implying that is constant, say . Plugging this back into gives us that and we are done.
Claim 3. is multiplicative. Proof. Firstly, yields that . Next, gives us that implying that and so we are done.
Claim 4. is strictly increasing over . Proof. We need to show that implies for all . with and yields that and since is multiplicative, implies for all positive reals (since ), we see that and this completes the proof of this claim.
Coming back to our problem, since is multiplicative, let . Then, since is a positive real, for all . Let . Then, we see that is an additive function. Also, since is strictly increasing over the positive reals, so is and so is . Therefore, is monotone and additive, implying that where c is a constant. This means that and so implying that for all . Plugging in the original equation yields that or, for all . Since is odd, we can conclude that for all which indeed fits.
Remark
My solution may seem similar to harazi's solution, but the key thing is I did not want to include any kind of non-trivial specific casework, like for P(2,1) or something like that. I hope this solution is correct.
This post has been edited 2 times. Last edited by rama1728, Oct 3, 2021, 12:39 PM Reason: .
We claim that the only such function is , plugging it in functional equation, we can see that it works. The second condition of our problem says that is injective. Let be the assertion, we now proceed with a bunch of claims. Claim: Proof: First of all notice that constant functions don't satisfy our functional equation. Now, so must be zero since otherwise the function would be constant.
Claim: Proof:
Claim: i.e. is odd. Proof:
Claim: For any ,. Proof:Combining this with , we get our desired result.
Claim: i.e. is multiplicative. Proof:So indeed we have .
Claim: is strictly increasing over Proof: First of all, notice that which means . Now suppose we have and such that ,which means .
Now let , notice that . With all the conditions we have, and this means and plugging it in our original equation, we get and .
This post has been edited 1 time. Last edited by Nuterrow, Apr 7, 2022, 7:22 PM Reason: a small detail
The answer is , which works. Moreover, denote the given assertion as . We will solve this problem through a series of claims: Claim 1: and
Proof: Suppose that . Notice that yields
which means is constant, a contradiction. Hence, and therefore, Claim 2: is odd
Proof: Plug in to get
which simplifies to , as desired. Claim 3: is multiplicative
Proof: Notice that
Clearing denominators and simplifying, we get
Claim 4: is strictly increasing
Proof: Since is odd, we can WLOG only consider when . Then, note that
for some ; this means is positive over the given domain.
If , then
implying that . Claim 5: for all .
Proof: We will prove this using induction on . For the first base case, observe that . As for the other case, suppose that .
Consequently,
Then,
Solving this yields or , but the former is impossible due to being increasing. Hence, , completing the base case. For the inductive step, consider :
It is easy to see that if and by the inductive hypothesis, then , finishing the induction.
Because is multiplicative, is also equivalent to the identity function over rationals as well; furthermore, is strictly increasing, which expands the identity function to all real numbers.
Note that since it is clear that can't be constant, it follows from that . We also get from . Now putting in the main equation, we find So is an odd function. Now, notice that So is multiplicative. Next, we square things using the multiplicativity: and Comparing and , we see that for all . But this holds for too for if we put in then we get . So is additive over , but since is odd, it must be additive over . Since is additive, multiplicative and non constant, must be the identity function.
Clearly, for all satisfies our equation. So this is the only solution.
This post has been edited 1 time. Last edited by pie854, Sep 9, 2024, 8:23 PM
We claim is the only solution, which clearly works.
First implies and or contradicting injectivity.
Now implies is odd.
Taking implies for all . In particular , so implies .
Next, gives . Then gives , so .
We now show by strong induction that for positive integers , and thus by oddness all integers. It is true for . If it is true up to then if is even write . If is odd then gives .
Next if is rational for integers then gives .
Finally, if then implies . By oddness, is increasing. Since it is the identity on rationals, it is the identity on reals.
This post has been edited 1 time. Last edited by OronSH, Nov 27, 2024, 6:03 PM
Take We get If the expression isn't then is constant, so From we have
Take to get Thus,
Now, note that on since
Take We get Thus, we can conclude that for as we can achieve all values of for positive values, and for all Thus, we conclude that is decreasing(by combining the fact that and is multiplicative).
Now, let Thus, However, is also increasing on Thus, we can conclude that , and thus, . Plugging this in, we get
The answer is . Plug in so that Since is nonconstant, this means that and .
The RHS is determined by the value of since it is , and the LHS is invariant under multiplying both and by a constant, so multiplying the input by must always multiply the output by the same amount regardless of the original input. However, since , this multiplier must be . Thus, so is multiplicative.
Note that this implies for since . Furthermore, if , then and are both positive, so as well. However, because is multiplicative, is additive on , and moreover increasing. Thus it is linear so . However, clearly only works since , so we are done.