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.
Let be an integer. Ion draws a regular -gon and all its diagonals. On every diagonal and edge, Ion writes a positive integer, such that for any triangle formed with the vertices of the -gon, one of the numbers on its edges is the sum of the two other numbers on its edges. Determine the smallest possible number of distinct values that Ion can write.
Concurrence of lines defined by intersections of circles
Lukaluce1
N2 hours ago
by sarjinius
Source: 2025 Macedonian Balkan Math Olympiad TST Problem 2
Let be an acute-angled triangle and , and be the feet of the altitudes from , and , respectively. On the rays , and , we have points , and respectively, lying outside of , such that If the intersections of and , and , and and are , and respectively, prove that , and have a common point.
Question:
Solve for f:Z-->Z
My solution:
At a=0,
Take t=f(b) to get
Therefore, f(x)=2x+n where n=f(0)
Could someone please clarify if this is right or wrong?
Triangle ABC has incircle touching the sides at D, E, F as shown.
AD, BE, CF concurrent at Gergonne point G.
BG and CG cuts the incircle at X and Y, respectively.
AG cuts the incircle at K.
Prove: K, X, D, Y form a harmonic quadrilateral. (KX/KY = DX/DY)
Combi that will make you question every choice in your life so far
blug1
N3 hours ago
by HotSinglesInYourArea
and are standing in front of the room in which there is . They know that there is a chessboard in the room and that on every square there is a coin. Every coin is black on one side and white on the other side and is flipped randomly. enters the room and then points at exactly one square on the chessboard. After that, must flip exactly one coin of his choice on the chessboard to the other side and leave. Finally, enters the room ( and haven't met again after entered the room) and he has to guess which square did point at.
What strategy do and have that will make this happen every time?
Let triangle be a triangle with incenter and circumcircle with circumcenter . The incircle touches at respectively. is another intersection point of external bisector of with , and is incircle touch point to . Let be points lie on . intersect at . Assume that . Suppose that and are concyclic, and are concurrent.
Prove that are concurrent. , tangent line to at and are concurrent.
Let be a real number. Gugu has a napkin with ten distinct real numbers written on it, and he writes the following three lines of real numbers on the blackboard:
[list]
[*]In the first line, Gugu writes down every number of the form , where and are two (not necessarily distinct) numbers on his napkin.
[*]In the second line, Gugu writes down every number of the form , where and are
two (not necessarily distinct) numbers from the first line.
[*]In the third line, Gugu writes down every number of the form , where are four (not necessarily distinct) numbers from the first line.
[/list]
Determine all values of such that, regardless of the numbers on Gugu's napkin, every number in the second line is also a number in the third line.
Answers are and which clearly hold. Let . We have Lemma: For positive reals if , then there exists positive reals and . Proof:Omitted.
Pick to get . If or , then by the lemma and and multiplying these give thus, for all positive reals. Since , we get thus, . If for some , then . Since for which holds for sufficiently large , we see that and since , holds.
If for all , then . Since which holds for sufficiently large , we observe thus, as desired.
Solution. It is straightforward to check that the above functions satisfy the inequality using Muirhead. Let satisfy the inequality. By letting we get that . Notice that the function also satisfies the inequality, so we can suppose without loss of generality that .
Claim 1. for all . Proof. Let . Setting gives so for all . Letting for some gives . But since and , it follows that , proving the claim.
Claim 2. for all . Proof. Any number can be expressed as for some . Setting gives that . Since , it follows that for all . Letting for some gives that . But since and , it follows that , proving the claim.
Combining both Claims gives that for all , as required.
we show the inequality of the problem with : Easily we get that: Define . Then we have On the other hand we have and because of we have , If then which means that .
If we multiply this inequality with we get that But we proved that Therefore, for all we have .
Now choose such that . Then because of And actually we can prove that for all we can choose such that and . For proving that we only have to solve the system below: If we put those into the question's inequality we get that: And because we have that: Now if then , so so for all positive real numbers ,, which means that And are a partition of positive real numbers.
Let such that is or it is . Then all of the numbers are in too.
Because if one of the numbers does not belong to (let that number be ), then we can find such that and . Now if we put these in the main inequality we get that: which is a contradiction.
So all of the numbers and one are in .
Similarly we can show that and all the numbers are in the same set, but we know that and all the numbers are in , so and all the numbers are in .
And if we do it for all natural numbers we get that all the real numbers are in . So or (but not at the same time). Now we only have to check this inequality: This is true because: Therefore: and we are done