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.
Every popular person is the best friend of a popular person?
yunxiu8
N22 minutes ago
by HHGB
Source: 2012 European Girls’ Mathematical Olympiad P6
There are infinitely many people registered on the social network Mugbook. Some pairs of (different) users are registered as friends, but each person has only finitely many friends. Every user has at least one friend. (Friendship is symmetric; that is, if is a friend of , then is a friend of .)
Each person is required to designate one of their friends as their best friend. If designates as her best friend, then (unfortunately) it does not follow that necessarily designates as her best friend. Someone designated as a best friend is called a -best friend. More generally, if is a positive integer, then a user is an -best friend provided that they have been designated the best friend of someone who is an -best friend. Someone who is a -best friend for every positive integer is called popular.
(a) Prove that every popular person is the best friend of a popular person.
(b) Show that if people can have infinitely many friends, then it is possible that a popular person is not the best friend of a popular person.
Given a triangle , with as its incenter and as its circumcircle, intersects again at . Let be a point on the arc , and a point on the segment , such that . If is the midpoint of , prove that the meeting point of the lines and lies on .
Proposed by Tai Wai Ming and Wang Chongli, Hong Kong
Let be a triangle with the incenter , and let the incircle of touch at points respectively. Let intersect again at a point . Let the lines through and parallel to intersect again at points respectively. Prove that lies on the common chord of the circumcircle of and the circumcircle of .
Let be a point in the plane, and a line not passing through . Evan does not have a straightedge, but instead has a special compass which has the ability to draw a circle through three distinct noncollinear points. (The center of the circle is not marked in this process.) Additionally, Evan can mark the intersections between two objects drawn, and can mark an arbitrary point on a given object or on the plane.
(i) Can Evan construct* the reflection of over ?
(ii) Can Evan construct the foot of the altitude from to ?
*To construct a point, Evan must have an algorithm which marks the point in finitely many steps.
Let and be the quantities on the LHS and RHS, respectively. Since they have equal sum and sum of squares (), their second symmetric sums are equal. Additionally, their products are equal because where . It follows that and are the roots of the same cubic; specifically, equals one of . If or , the result is trivial; if , whence as desired.
This post has been edited 1 time. Last edited by peace09, Aug 10, 2023, 4:57 PM Reason: wording
Note that expanding and using area gives us
Next,
Now by Vieta's these are roots of the same polynomial, from which it's easy to see that the triangle is isosceles.
Let the three elements on the LHS and the elements on the RHS.
First, we can see that
The second equality comes from the fact that : And the last equality comes from a simple expansion. By Vieta, we can deduce that both of the triples are roots of the same polynomial of the third degree. One can check the three cases of equality to prove the desired result.
This post has been edited 1 time. Last edited by Cusofay, Dec 2, 2023, 2:04 PM Reason: .
The sets and are equivalent.
First, notice that Thus, by this and the condition given, Now, notice that Call this common product for some number ( is just the area). We know that so the product of these square root expressions are the same as well. Thus, by Vieta's, the claim is proven.
Now, we have that which gives us that or which gives or and finally, This case is a bit tricker. Notice that, after rearranging, and since we know that the sets and are the same. Then, since these numbers are positive, we have that and so we are done.
Since the geometry condition is kinda useless we can denote , and (in that way the triangle has area ). Now let , and , and also let , and be the roots of a polynomial P(x). Let , and , and also let , and be the roots of a polynomial Q(x). From the condition of the problem we get that . Now . Also . We have that and . We know that and and since we know and , this means now we have that ,,, which by Vieta's means that the two polynomials have equal roots. Now WLOG b = c, WLOG a = b, WLOG a = c whatever is the equality in the roots from LHS and RHS there are always two equal sides of the triangle is isosceles. We are ready.
Our first step is to reduce the number of variables in the problem, specifically to establish a relationship between ,, and ,,. The geometric condition doesn't impose any specific constraints, so we can assume that the area of the triangle is . Using the area formula, we obtain the relationships:
Next, consider the two sides of the equation as two separate polynomials. Let the LHS be , with roots:
The RHS will be , with roots:
Let's examine the relationships between the roots. The first relationship is:
This follows from the conditions given in the problem. Another important relationship is:
This can be seen by writing it out explicitly:
and
This shows that .
Our goal is to show that two of ,, are equal. We now focus on the pairwise relationships in the polynomial. We know:
This is true by the commutative property after removing the square roots. From Newton's sums, we have:
Replacing with and , and using our known equalities, we get:
Given that:
are all true, Vieta's formulas imply that and have the same roots. Setting combinations of roots equal to each other:
Thus, there will always be two equal sides in the triangle, proving that it is isosceles.
Let . Then, we have the equation: Without loss of generality, let . The equation becomes: From the equation, we observe that: and similarly, by symmetry in the numerators and denominators, we also have: and: Thus, the sets of roots for the polynomials formed by these expressions must be identical: Now, considering the symmetry of the expressions, we analyze the three cases: Thus, we conclude that the solution is:
WLOG, let Thus, We can rewrite our equality as: Let the 3 values on the left be and the 3 values on the right be Notice that: Thus, they are the roots to the same polynomial of degree 3. There exist 3 cases, if In the first one, we can factor it to have that Thus, In the 2nd and 3rd, we can cancel the common term, and then or
We start by letting each term on the left-hand side respectively and each term on the right respectively. Then we have the obvious relations that We also claim that for , In conjunction, these all imply that the polynomial with roots ,, and is the same as the polynomial with roots ,, and . This means that we have three cases.
Case 1: In this case, we have that , implying that .
Case 2: This time, we have that and since none of ,, or can be zero, we must that .
\textbf{Case 3: } Finally, we have which explicitly gives that .
Thus, in all cases, is isosceles.
This post has been edited 1 time. Last edited by Kempu33334, Yesterday at 4:34 PM