ka April Highlights and 2025 AoPS Online Class Information
jlacosta0
Apr 2, 2025
Spring is in full swing and summer is right around the corner, what are your plans? At AoPS Online our schedule has new classes starting now through July, so be sure to keep your skills sharp and be prepared for the Fall school year! Check out the schedule of upcoming classes below.
WOOT early bird pricing is in effect, don’t miss out! If you took MathWOOT Level 2 last year, no worries, it is all new problems this year! Our Worldwide Online Olympiad Training program is for high school level competitors. AoPS designed these courses to help our top students get the deep focus they need to succeed in their specific competition goals. Check out the details at this link for all our WOOT programs in math, computer science, chemistry, and physics.
Looking for summer camps in math and language arts? Be sure to check out the video-based summer camps offered at the Virtual Campus that are 2- to 4-weeks in duration. 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)!
Prealgebra 1
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
Introduction to Algebra A
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
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
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
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
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
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
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
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.
A rectangle with odd integer side lengths is divided into small rectangles with integer side lengths. Prove that there is at least one among the small rectangles whose distances from the four sides of are either all odd or all even.
A number is interesting if 2018 divides (the number of positive divisors of ). Determine all positive integers such that there exists an infinite arithmetic progression with common difference whose terms are all interesting.
Given a fixed circle with its center . There are two fixed points and one moving point on . The midpoint of the line segment is . is a fixed point on . Line intersects at , and line intersects at .
Find all the fixed points such that is always tangent to when varies. Hint
We have 2 dominoes in flowers and not connected like here
IMAGE
Determine a necessary and sufficient condition on m and n, so that G can be covered with these 2 kinds of dominoes.
Let be an isosceles triangle with . The circle , passing through and , intersects segment at . The circle is tangent to at and passes through . Let and be the midpoints of segments and , respectively. The line intersects and at points and , respectively, where and are the intersections closer to . Prove that .
I have noticed thousands upon thousands of inequalities that you have posted to HSO and was wondering where you get the inspiration, imagination, and even the validation that such inequalities are true? Also, what do you find particularly appealing and important about specifically inequalities rather than other branches of mathematics? Thank you :)
An ant is on the Cartesian plane. In a single move, the ant selects a positive integer , then either travels [list]
[*] units vertically (up or down) and units horizontally (left or right); or
[*] units horizontally (left or right) and units vertically (up or down).
[/list]
Thus, for any , the ant can choose to go to one of eight possible points.
Prove that, for any integers and , the ant can travel from to using at most moves.
In a trapezium , the sides and are parallel and the angles and are acute. Show that it is possible to divide the triangle into 4 disjoint triangle and the triangle into 4 disjoint triangles such that the triangles and are congruent for all .
A non-degenerate triangle is given in the plane, let be the set of points which lie strictly inside it. Also let be the set of circles in the plane. For a point , let be the reflection of in sides respectively. Define a function such that is the circumcircle of . Is injective?
Note: The function is called injective if for any ,
numbers at vertices of triangle / tetrahedron, consecutive and gcd related
parmenides511
N3 hours ago
by TheBaiano
Source: 2022 May Olympiad L2 p4
a) A positive integer is written at each vertex of a triangle. Then on each side of the triangle the greatest common divisor of its ends is written. It is possible that the numbers written on the sides be three consecutive integers, in some order?
b) A positive integer is written at each vertex of a tetrahedron. Then, on each edge of the tetrahedron is written the greatest common divisor of its ends . It is possible that the numbers written in the edges are six consecutive integers, in some order?
In a board, some squares are painted red. Let be the number of rows that have an odd number of red squares and let be the number of columns that have an odd number of red squares. Find all possible values of . For each value found, give a example of how the board can be painted.
The vertices of a regular polygon with sides are marked on the blackboard. Ana and Beto play alternately, Ana begins. Each player, in turn, must do the following: join two vertices with a segment, without cutting another already marked segment; or delete a vertex that does not belong to any marked segment.
The player who cannot take any action on his turn loses the game. Determine which of the two players can guarantee victory:
a) if
b) if
Quite an interesting question. Here's my partial solution:
Make x=0, y=-f(0), then we will have f(f(0)-f(0))+0f(-f(0))=f(0*-f(0)-f(0))+f(0).
Which means f(-f(0))=0
Make x=-f(0),y=0, then we will have f(0)^2=0, f(0)=0
Make y=0, then we will know f(f(x))=f(x)
(not sure about the rest)
Y byTintarn, Deadline, Tellocan, math_comb01, Beeoin
This problem is proposed by me. Hope you all enjoyed it!
Official Solution
Let denote the assertion of the given functional equation.
Claim 1: Proof: Note that and gives us the following: Consider the first expression. Plugging in it yields: If we denote , then we have . Plugging in the second expression gives us: This either means that or . In both cases, the claim is proved.
Since , the second expression becomes \hfill (*)
Claim 2: or for all real numbers Proof: Consider : Replacing by and using (*) leads to: Suppose that there does not exist such that , then for all real numbers . Otherwise as desired.
Claim 3: If , then \Proof: Suppose for some real number . Then gives us: On the other hand leads us to the following: Taking from both sides in the last relation and using (*) leads to: This proves the claim.
To finish the problem, consider : Setting gives us: From Claim 3 we obtain that . Now looking at and replacing by , we get that: On the other hand, , the previous relation and (*) give us the following: Thus, the only possible functions that satisfy the given relation are and . It is easy to check that they indeed work.
Let be the assertion
Clearly is a solution, so let us assume that is not identically zero.
Let
Then
So because is not zero everywhere.
Let
So if then we have the must be the identity.
Let us assume that
But then contradiction.
Thus, and it follows that is the only other solution.
This post has been edited 1 time. Last edited by tadpoleloop, Nov 11, 2023, 9:02 PM
Let denote the given assertion.
Since is a solution, suppose that is not always 0. for all
If , then Let there be some real number s.t. . Then Let there be some real number s.t. . This is impossible as and yielding Taking on both sides, we get , a contradiction.
The finishing steps are the same as the official solution.
We claim that the two solutions are and , which we confirm are solutions. Let denote the given assertion, and let . Then, gives us . Using this, we can deduce that So, gives us Now, gives us , labelled (1). Then, we can force and to cancel with , which using (1) gives us Since is one of our claimed solutions, assume otherwise that . gives us . Using this and (1) to simplify we get that So, , which in turn gives us . gives us . By induction, this becomes for all integers . Now, for any integer , using (2) on gives us Finally, for any integer , using (1), (2), and (3) on gives us So, no solutions exist other than and .
Denote as the assertion of the following F.E.
By we get , now by we get which gives .
Now gives , gives , and for by we get . Since is a solution suppose there exists s.t. then by here we get and by we get , now by indooks we get for any integer so in the previous equation set to be to get that , also remember that and now follow directly. From we get so if then we get for all reals .
So suppose otherwise that then but this means which contradicts .
Therefore the only solutions to this F.E. are and for all reals , thus done
Let be the assertion .
P(x,f(-1))\Rightarrow f(xf(-1))=xf(-1)f(-1)\ne0\boxed{f(x)=x}P(f(x),1)\Rightarrow f(x)f(1)=f(x)4
So if we have the solution , which fits. Otherwise:
So no more solutions.