G
Topic
First Poster
Last Poster
k a My Retirement & New Leadership at AoPS
rrusczyk   1571
N Mar 26, 2025 by SmartGroot
I write today to announce my retirement as CEO from Art of Problem Solving. When I founded AoPS 22 years ago, I never imagined that we would reach so many students and families, or that we would find so many channels through which we discover, inspire, and train the great problem solvers of the next generation. I am very proud of all we have accomplished and I’m thankful for the many supporters who provided inspiration and encouragement along the way. I'm particularly grateful to all of the wonderful members of the AoPS Community!

I’m delighted to introduce our new leaders - Ben Kornell and Andrew Sutherland. Ben has extensive experience in education and edtech prior to joining AoPS as my successor as CEO, including starting like I did as a classroom teacher. He has a deep understanding of the value of our work because he’s an AoPS parent! Meanwhile, Andrew and I have common roots as founders of education companies; he launched Quizlet at age 15! His journey from founder to MIT to technology and product leader as our Chief Product Officer traces a pathway many of our students will follow in the years to come.

Thank you again for your support for Art of Problem Solving and we look forward to working with millions more wonderful problem solvers in the years to come.

And special thanks to all of the amazing AoPS team members who have helped build AoPS. We’ve come a long way from here:IMAGE
1571 replies
rrusczyk
Mar 24, 2025
SmartGroot
Mar 26, 2025
k a March Highlights and 2025 AoPS Online Class Information
jlacosta   0
Mar 2, 2025
March is the month for State MATHCOUNTS competitions! Kudos to everyone who participated in their local chapter competitions and best of luck to all going to State! Join us on March 11th for a Math Jam devoted to our favorite Chapter competition problems! Are you interested in training for MATHCOUNTS? Be sure to check out our AMC 8/MATHCOUNTS Basics and Advanced courses.

Are you ready to level up with Olympiad training? Registration is open with early bird pricing available for our WOOT programs: MathWOOT (Levels 1 and 2), CodeWOOT, PhysicsWOOT, and ChemWOOT. What is WOOT? WOOT stands for Worldwide Online Olympiad Training and is a 7-month high school math Olympiad preparation and testing program that brings together many of the best students from around the world to learn Olympiad problem solving skills. Classes begin in September!

Do you have plans this summer? There are so many options to fit your schedule and goals whether attending a summer camp or taking online classes, it can be a great break from the routine of the school year. Check out our summer courses at AoPS Online, or if you want a math or language arts class that doesn’t have homework, but is an enriching summer experience, our AoPS Virtual Campus summer camps may be just the ticket! We are expanding our locations for our AoPS Academies across the country with 15 locations so far and new campuses opening in Saratoga CA, Johns Creek GA, and the Upper West Side NY. Check out this page for summer camp information.

Be sure to mark your calendars for the following events:
[list][*]March 5th (Wednesday), 4:30pm PT/7:30pm ET, HCSSiM Math Jam 2025. Amber Verser, Assistant Director of the Hampshire College Summer Studies in Mathematics, will host an information session about HCSSiM, a summer program for high school students.
[*]March 6th (Thursday), 4:00pm PT/7:00pm ET, Free Webinar on Math Competitions from elementary through high school. Join us for an enlightening session that demystifies the world of math competitions and helps you make informed decisions about your contest journey.
[*]March 11th (Tuesday), 4:30pm PT/7:30pm ET, 2025 MATHCOUNTS Chapter Discussion MATH JAM. AoPS instructors will discuss some of their favorite problems from the MATHCOUNTS Chapter Competition. All are welcome!
[*]March 13th (Thursday), 4:00pm PT/7:00pm ET, Free Webinar about Summer Camps at the Virtual Campus. Transform your summer into an unforgettable learning adventure! From elementary through high school, we offer dynamic summer camps featuring topics in mathematics, language arts, and competition preparation - all designed to fit your schedule and ignite your passion for learning.[/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.

Introductory: Grades 5-10

Prealgebra 1 Self-Paced

Prealgebra 1
Sunday, Mar 2 - Jun 22
Friday, Mar 28 - Jul 18
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

Prealgebra 2 Self-Paced

Prealgebra 2
Tuesday, Mar 25 - Jul 8
Sunday, Apr 13 - Aug 10
Wednesday, May 7 - Aug 20
Monday, Jun 2 - Sep 22
Sunday, Jun 29 - Oct 26
Friday, Jul 25 - Nov 21


Introduction to Algebra A Self-Paced

Introduction to Algebra A
Sunday, Mar 23 - Jul 20
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 Self-Paced

Introduction to Counting & Probability
Sunday, Mar 16 - Jun 8
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
Monday, Mar 17 - Jun 9
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 Self-Paced

Introduction to Algebra B
Sunday, Mar 2 - Jun 22
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
Tuesday, Mar 4 - Aug 12
Sunday, Mar 23 - Sep 21
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
Sunday, Mar 16 - Sep 14
Tuesday, Mar 25 - Sep 2
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

Intermediate Counting & Probability
Sunday, Mar 23 - Aug 3
Wednesday, May 21 - Sep 17
Sunday, Jun 22 - Nov 2

Intermediate Number Theory
Friday, Apr 11 - Jun 27
Sunday, Jun 1 - Aug 24
Wednesday, Jun 18 - Sep 3

Precalculus
Sunday, Mar 16 - Aug 24
Wednesday, Apr 9 - Sep 3
Friday, May 16 - Oct 24
Sunday, Jun 1 - Nov 9
Monday, Jun 30 - Dec 8

Advanced: Grades 9-12

Olympiad Geometry
Wednesday, Mar 5 - May 21
Tuesday, Jun 10 - Aug 26

Calculus
Sunday, Mar 30 - Oct 5
Tuesday, May 27 - Nov 11
Wednesday, Jun 25 - Dec 17

Group Theory
Thursday, Jun 12 - Sep 11

Contest Preparation: Grades 6-12

MATHCOUNTS/AMC 8 Basics
Sunday, Mar 23 - Jun 15
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
Tuesday, Mar 4 - May 20
Monday, Mar 31 - Jun 23
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

AMC 12 Final Fives
Sunday, May 18 - Jun 15

F=ma Problem Series
Wednesday, Jun 11 - Aug 27

WOOT Programs
Visit the pages linked for full schedule details for each of these programs!


MathWOOT Level 1
MathWOOT Level 2
ChemWOOT
CodeWOOT
PhysicsWOOT

Programming

Introduction to Programming with Python
Monday, Mar 24 - Jun 16
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

Intermediate Programming with Python
Sunday, Jun 1 - Aug 24
Monday, Jun 30 - Sep 22

USACO Bronze Problem Series
Tuesday, May 13 - Jul 29
Sunday, Jun 22 - Sep 1

Physics

Introduction to Physics
Sunday, Mar 30 - Jun 22
Wednesday, May 21 - Aug 6
Sunday, Jun 15 - Sep 14
Monday, Jun 23 - Sep 15

Physics 1: Mechanics
Tuesday, Mar 25 - Sep 2
Thursday, May 22 - Oct 30
Monday, Jun 23 - Dec 15

Relativity
Sat & Sun, Apr 26 - Apr 27 (4:00 - 7:00 pm ET/1:00 - 4:00pm PT)
Mon, Tue, Wed & Thurs, Jun 23 - Jun 26 (meets every day of the week!)
0 replies
jlacosta
Mar 2, 2025
0 replies
k i Peer-to-Peer Programs Forum
jwelsh   157
N Dec 11, 2023 by cw357
Many of our AoPS Community members share their knowledge with their peers in a variety of ways, ranging from creating mock contests to creating real contests to writing handouts to hosting sessions as part of our partnership with schoolhouse.world.

To facilitate students in these efforts, we have created a new Peer-to-Peer Programs forum. With the creation of this forum, we are starting a new process for those of you who want to advertise your efforts. These advertisements and ensuing discussions have been cluttering up some of the forums that were meant for other purposes, so we’re gathering these topics in one place. This also allows students to find new peer-to-peer learning opportunities without having to poke around all the other forums.

To announce your program, or to invite others to work with you on it, here’s what to do:

1) Post a new topic in the Peer-to-Peer Programs forum. This will be the discussion thread for your program.

2) Post a single brief post in this thread that links the discussion thread of your program in the Peer-to-Peer Programs forum.

Please note that we’ll move or delete any future advertisement posts that are outside the Peer-to-Peer Programs forum, as well as any posts in this topic that are not brief announcements of new opportunities. In particular, this topic should not be used to discuss specific programs; those discussions should occur in topics in the Peer-to-Peer Programs forum.

Your post in this thread should have what you're sharing (class, session, tutoring, handout, math or coding game/other program) and a link to the thread in the Peer-to-Peer Programs forum, which should have more information (like where to find what you're sharing).
157 replies
jwelsh
Mar 15, 2021
cw357
Dec 11, 2023
k i C&P posting recs by mods
v_Enhance   0
Jun 12, 2020
The purpose of this post is to lay out a few suggestions about what kind of posts work well for the C&P forum. Except in a few cases these are mostly meant to be "suggestions based on historical trends" rather than firm hard rules; we may eventually replace this with an actual list of firm rules but that requires admin approval :) That said, if you post something in the "discouraged" category, you should not be totally surprised if it gets locked; they are discouraged exactly because past experience shows they tend to go badly.
-----------------------------
1. Program discussion: Allowed
If you have questions about specific camps or programs (e.g. which classes are good at X camp?), these questions fit well here. Many camps/programs have specific sub-forums too but we understand a lot of them are not active.
-----------------------------
2. Results discussion: Allowed
You can make threads about e.g. how you did on contests (including AMC), though on AMC day when there is a lot of discussion. Moderators and administrators may do a lot of thread-merging / forum-wrangling to keep things in one place.
-----------------------------
3. Reposting solutions or questions to past AMC/AIME/USAMO problems: Allowed
This forum contains a post for nearly every problem from AMC8, AMC10, AMC12, AIME, USAJMO, USAMO (and these links give you an index of all these posts). It is always permitted to post a full solution to any problem in its own thread (linked above), regardless of how old the problem is, and even if this solution is similar to one that has already been posted. We encourage this type of posting because it is helpful for the user to explain their solution in full to an audience, and for future users who want to see multiple approaches to a problem or even just the frequency distribution of common approaches. We do ask for some explanation; if you just post "the answer is (B); ez" then you are not adding anything useful.

You are also encouraged to post questions about a specific problem in the specific thread for that problem, or about previous user's solutions. It's almost always better to use the existing thread than to start a new one, to keep all the discussion in one place easily searchable for future visitors.
-----------------------------
4. Advice posts: Allowed, but read below first
You can use this forum to ask for advice about how to prepare for math competitions in general. But you should be aware that this question has been asked many many times. Before making a post, you are encouraged to look at the following:
[list]
[*] Stop looking for the right training: A generic post about advice that keeps getting stickied :)
[*] There is an enormous list of links on the Wiki of books / problems / etc for all levels.
[/list]
When you do post, we really encourage you to be as specific as possible in your question. Tell us about your background, what you've tried already, etc.

Actually, the absolute best way to get a helpful response is to take a few examples of problems that you tried to solve but couldn't, and explain what you tried on them / why you couldn't solve them. Here is a great example of a specific question.
-----------------------------
5. Publicity: use P2P forum instead
See https://artofproblemsolving.com/community/c5h2489297_peertopeer_programs_forum.
Some exceptions have been allowed in the past, but these require approval from administrators. (I am not totally sure what the criteria is. I am not an administrator.)
-----------------------------
6. Mock contests: use Mock Contests forum instead
Mock contests should be posted in the dedicated forum instead:
https://artofproblemsolving.com/community/c594864_aops_mock_contests
-----------------------------
7. AMC procedural questions: suggest to contact the AMC HQ instead
If you have a question like "how do I submit a change of venue form for the AIME" or "why is my name not on the qualifiers list even though I have a 300 index", you would be better off calling or emailing the AMC program to ask, they are the ones who can help you :)
-----------------------------
8. Discussion of random math problems: suggest to use MSM/HSM/HSO instead
If you are discussing a specific math problem that isn't from the AMC/AIME/USAMO, it's better to post these in Middle School Math, High School Math, High School Olympiads instead.
-----------------------------
9. Politics: suggest to use Round Table instead
There are important conversations to be had about things like gender diversity in math contests, etc., for sure. However, from experience we think that C&P is historically not a good place to have these conversations, as they go off the rails very quickly. We encourage you to use the Round Table instead, where it is much more clear that all posts need to be serious.
-----------------------------
10. MAA complaints: discouraged
We don't want to pretend that the MAA is perfect or that we agree with everything they do. However, we chose to discourage this sort of behavior because in practice most of the comments we see are not useful and some are frankly offensive.
[list] [*] If you just want to blow off steam, do it on your blog instead.
[*] When you have criticism, it should be reasoned, well-thought and constructive. What we mean by this is, for example, when the AOIME was announced, there was great outrage about potential cheating. Well, do you really think that this is something the organizers didn't think about too? Simply posting that "people will cheat and steal my USAMOO qualification, the MAA are idiots!" is not helpful as it is not bringing any new information to the table.
[*] Even if you do have reasoned, well-thought, constructive criticism, we think it is actually better to email it the MAA instead, rather than post it here. Experience shows that even polite, well-meaning suggestions posted in C&P are often derailed by less mature users who insist on complaining about everything.
[/list]
-----------------------------
11. Memes and joke posts: discouraged
It's fine to make jokes or lighthearted posts every so often. But it should be done with discretion. Ideally, jokes should be done within a longer post that has other content. For example, in my response to one user's question about olympiad combinatorics, I used a silly picture of Sogiita Gunha, but it was done within a context of a much longer post where it was meant to actually make a point.

On the other hand, there are many threads which consist largely of posts whose only content is an attached meme with the word "MAA" in it. When done in excess like this, the jokes reflect poorly on the community, so we explicitly discourage them.
-----------------------------
12. Questions that no one can answer: discouraged
Examples of this: "will MIT ask for AOIME scores?", "what will the AIME 2021 cutoffs be (asked in 2020)", etc. Basically, if you ask a question on this forum, it's better if the question is something that a user can plausibly answer :)
-----------------------------
13. Blind speculation: discouraged
Along these lines, if you do see a question that you don't have an answer to, we discourage "blindly guessing" as it leads to spreading of baseless rumors. For example, if you see some user posting "why are there fewer qualifiers than usual this year?", you should not reply "the MAA must have been worried about online cheating so they took fewer people!!". Was sich überhaupt sagen lässt, lässt sich klar sagen; und wovon man nicht reden kann, darüber muss man schweigen.
-----------------------------
14. Discussion of cheating: strongly discouraged
If you have evidence or reasonable suspicion of cheating, please report this to your Competition Manager or to the AMC HQ; these forums cannot help you.
Otherwise, please avoid public discussion of cheating. That is: no discussion of methods of cheating, no speculation about how cheating affects cutoffs, and so on --- it is not helpful to anyone, and it creates a sour atmosphere. A longer explanation is given in Seriously, please stop discussing how to cheat.
-----------------------------
15. Cutoff jokes: never allowed
Whenever the cutoffs for any major contest are released, it is very obvious when they are official. In the past, this has been achieved by the numbers being posted on the official AMC website (here) or through a post from the AMCDirector account.

You must never post fake cutoffs, even as a joke. You should also refrain from posting cutoffs that you've heard of via email, etc., because it is better to wait for the obvious official announcement. A longer explanation is given in A Treatise on Cutoff Trolling.
-----------------------------
16. Meanness: never allowed
Being mean is worse than being immature and unproductive. If another user does something which you think is inappropriate, use the Report button to bring the post to moderator attention, or if you really must reply, do so in a way that is tactful and constructive rather than inflammatory.
-----------------------------

Finally, we remind you all to sit back and enjoy the problems. :D

-----------------------------
(EDIT 2024-09-13: AoPS has asked to me to add the following item.)

Advertising paid program or service: never allowed

Per the AoPS Terms of Service (rule 5h), general advertisements are not allowed.

While we do allow advertisements of official contests (at the MAA and MATHCOUNTS level) and those run by college students with at least one successful year, any and all advertisements of a paid service or program is not allowed and will be deleted.
0 replies
v_Enhance
Jun 12, 2020
0 replies
k i Stop looking for the "right" training
v_Enhance   50
N Oct 16, 2017 by blawho12
Source: Contest advice
EDIT 2019-02-01: https://blog.evanchen.cc/2019/01/31/math-contest-platitudes-v3/ is the updated version of this.

EDIT 2021-06-09: see also https://web.evanchen.cc/faq-contest.html.

Original 2013 post
50 replies
v_Enhance
Feb 15, 2013
blawho12
Oct 16, 2017
Is this FE solvable?
Mathdreams   0
25 minutes ago
Find all $f:\mathbb{R} \rightarrow \mathbb{R}$ such that \[f(2x+y) + f(x+f(2y)) = f(x)f(y) - xy\]for all reals $x$ and $y$.
0 replies
Mathdreams
25 minutes ago
0 replies
OFM2021 Senior P1
medhimdi   0
32 minutes ago
Let $a_1, a_2, a_3, \dots$ and $b_1, b_2, b_3, \dots$ be two sequences of integers such that $a_{n+2}=a_{n+1}+a_n$ and $b_{n+2}=b_{n+1}+b_n$ for all $n\geq1$. Suppose that $a_n$ divides $b_n$ for an infinity of integers $n\geq1$. Prove that there exist an integer $c$ such that $b_n=ca_n$ for all $n\geq1$
0 replies
medhimdi
32 minutes ago
0 replies
Hard NT problem
tiendat004   2
N an hour ago by avinashp
Given two odd positive integers $a,b$ are coprime. Consider the sequence $(x_n)$ given by $x_0=2,x_1=a,x_{n+2}=ax_{n+1}+bx_n,$ $\forall n\geq 0$. Suppose that there exist positive integers $m,n,p$ such that $mnp$ is even and $\dfrac{x_m}{x_nx_p}$ is an integer. Prove that the numerator in its simplest form of $\dfrac{m}{np}$ is an odd integer greater than $1$.
2 replies
tiendat004
Aug 15, 2024
avinashp
an hour ago
disjoint subsets
nayel   2
N an hour ago by alexanderhamilton124
Source: Taiwan 2001
Let $n\ge 3$ be an integer and let $A_{1}, A_{2},\dots, A_{n}$ be $n$ distinct subsets of $S=\{1, 2,\dots, n\}$. Show that there exists $x\in S$ such that the n subsets $A_{i}-\{x\}, i=1,2,\dots n$ are also disjoint.

what i have is this
2 replies
nayel
Apr 18, 2007
alexanderhamilton124
an hour ago
2012 AIME II Problem 12
xHypotenuse   4
N 4 hours ago by Soupboy0
Hello guys, I want to know what was wrong with my PIE approach.

First here's the problem:

For a positive integer $p$, define the positive integer $n$ to be $p$-safe if $n$ differs in absolute value by more than $2$ from all multiples of $p$. For example, the set of $10$-safe numbers is $\{ 3, 4, 5, 6, 7, 13, 14, 15, 16, 17, 23, \ldots\}$. Find the number of positive integers less than or equal to $10,000$ which are simultaneously $7$-safe, $11$-safe, and $13$-safe.


My approach was finding the number of 7-unsafe numbers, 11-unsafe, and 13-unsafe, then finding 77-unsafe, 91-unsafe, 143-unsafe, and finally 1001-unsafe numbers and using PIE for a complementary counting approach. But somehow I got a number over than 10,000 for the total number of unsafe numbers. Is my approach valid and have I made arithmetic errors or does the PIE approach just not work?
4 replies
xHypotenuse
Yesterday at 11:40 PM
Soupboy0
4 hours ago
2026 AMC 8C
ChaitraliKA   2
N 6 hours ago by soumil2013
You’ve never seen an AMC 8 quite like this…

We, ChaitraliKA and Aaronjudgeisgoat, present
THE 2026 AMC 8C

Context

This is a totally legit mock test that you can use to predict what your real AMC 8 score will be!
We created many high quality problems for this test, and put our blood, sweat, and tears into it (and if u dont take it we’ll put your blood into it as well). We GUARANTEE that when you take a look at the problems, you will be stunned by the sheer quality oozing out of them. We know this for certain as we got this exact reaction from every single newborn baby that volunteered to take this test. This mock is perfect, not just for people looking to ace the AMC 8 next year, but even for high schoolers.

[quote=ChaitraliKA]
This was my first time making a mock, I wanted to make it as realistic as possible. As a person who has never taken an AMC 8 before, I thoroughly researched the types of problems and the format before making this. After some deep analysing, I have come to the conclusion that our mock highly resembles an AMC 8 with a -100% margin of error. I personally enjoyed making this, and put my heart and soul into making the problems and writing out the solutions. There was a lot of collaboration and every question has approval from both of us. As the most respected Cringe Nerdy Mathematician in history, I can guarantee you that it's not only about the math, it's about the experience of taking it. Please scroll down and take the test now. Thank you. [/quote]

[quote=Aaronjudgeisgoat]
After writing a MATHCOUNTS mock, I figured I would try and take it a step further - create an AMC 8 mock. As a fellow person who has never taken an AMC 8 before, I knew there was work needed to be done before I could accurately create one. I thoroughly reviewed the rules for this test, as well as the format. I even made sure to make every single answer choice viable, simulating the silliable nature of the actual AMC 8. We reviewed every single question, answer and solution, and after cross-comparing it with actual MAA exams, I found that it's not 100% accurate to the exam, but 200% accurate. That's right, it's accurate and even more accurate. Overall, this was a very fun experience, creating my first AMC mock so that people in need of math problems have something to work on. I thank @ChaitraliKA for giving me the opportunity to problem write, and I had a very fun time collaborating with the Cringiest and Nerdiest Mathematician of them all. In conclusion, I implore you to click the link below and proceed with the test, as not only will you learn, you will have fun.
Thank you for your blood.
[/quote]

You have two options on how to take it: Google Docs or MathDash
Google Docs:
Problems
Please read the guidelines carefully, and submit your answers for grading to ChaitraliKA and Aaronjudgeisgoat through AoPS PMs. We will send you the solutions as well, once we have graded you.
MathDash:
https://mathdash.fly.dev/contest/2026amc8c
If you do it on MathDash, we will still send you your final score through AoPS PMs, due to some issues.

We expect to start grading on April 15.

The leaderboard will be updated on the MSM post.
Good luck :)!


Please don't get this locked again. I will be very sad if that happens, because we put a lot of effort into this. If you're going to be a goody-two-shoes, just try to solve the legit problems and ignore the rest.

If you don't want to waste time, here are the legit problems that we would like you to try
2 replies
ChaitraliKA
Today at 1:14 PM
soumil2013
6 hours ago
[TEST RELEASED] Mock Geometry Test for College Competitions
Bluesoul   25
N Today at 8:46 AM by parmenides51
Hi AOPSers,

I have finished writing a mock geometry test for fun and practice for the real college competitions like HMMT/PUMaC/CMIMC... There would be 10 questions and you should finish the test in 60 minutes, the test would be close to the actual test (hopefully). You could sign up under this thread, PM me your answers!. The submission would close on March 31st at 11:59PM PST.

I would create a private discussion forum so everyone could discuss after finishing the test. This is the first mock I've written, please sign up and enjoy geometry!!

~Bluesoul

Discussion forum: Discussion forum

Leaderboard
25 replies
Bluesoul
Feb 24, 2025
parmenides51
Today at 8:46 AM
[March 2025] MEX MAGAZINE
Possible   1
N Today at 4:43 AM by Possible
Hello AoPS!

MathEXplained MAGAZINE aims to be a monthly newsletter that publishes articles in a newspaper-style format about various math related subjects in a way which can appeal to a broader audience. Topics may range from trending news stories within the math community to in-depth dissections of niche and interesting mathematical topics for more advanced readers.

Our Goal

While many of us on this platform might feel as if math is something super familiar to us, the truth is that this isn't the case outside of our tightly-knit community. Math doesn't get much coverage in mainstream media due to it being wrongfully seen by the general population either as a nerd's hobby or extremely foreign to the average person. Our mission as an organization is to promote mathematics through recognizing top mathletes, covering interesting math topics, and painting mathematics as something which can be fun and easy to get into.

March 2025 Edition

Celebrate the month of $\pi$ with MEX MAGAZINE's new publication! Check out this google drive file to solve some $\pi$ related math problems! Make sure to also read about our other spreads which cover Buffon's needle problem, the mathematics behind chess, and the history of $\pi$ day!

Website

If you are interested in reading our past issues, you can check out our website at this link. Over there, you can find links to our discord community where problem discussions can happen.

Staff

Our program is currently looking for new staff members! Please fill out this form to be considered.
1 reply
Possible
Today at 4:42 AM
Possible
Today at 4:43 AM
Nerfed 2023 JMO 1
brainfertilzer   29
N Today at 4:25 AM by Math-Lego
Source: 2024 AIME II P11
Find the number of triples of nonnegative integers $(a,b,c)$ satisfying $a + b + c = 300$ and
\[ a^2b + a^2c + b^2a + b^2c + c^2a + c^2b = 6{,}000{,}000.\]
29 replies
brainfertilzer
Feb 8, 2024
Math-Lego
Today at 4:25 AM
The 2nd geometry problem is #20
Frestho   59
N Today at 4:11 AM by megahertz13
Source: 2020 AMC 10A #20 / 2020 AMC 12A #18
Quadrilateral $ABCD$ satisfies $\angle ABC = \angle ACD = 90^{\circ}, AC = 20$, and $CD = 30$. Diagonals $\overline{AC}$ and $\overline{BD}$ intersect at point $E$, and $AE = 5$. What is the area of quadrilateral $ABCD$?

$\textbf{(A) } 330 \qquad\textbf{(B) } 340 \qquad\textbf{(C) } 350 \qquad\textbf{(D) } 360 \qquad\textbf{(E) } 370$
59 replies
Frestho
Jan 31, 2020
megahertz13
Today at 4:11 AM
Tennessee Math Tournament (TMT) Online 2025
TennesseeMathTournament   62
N Today at 3:29 AM by TennesseeMathTournament
Hello everyone! We are excited to announce a new competition, the Tennessee Math Tournament, created by the Tennessee Math Coalition! Anyone can participate in the virtual competition for free.

The testing window is from March 22nd to April 12th, 2025. Virtual competitors may participate in the competition at any time during that window.

The virtual competition consists of three rounds: Individual, Bullet, and Team. The Individual Round is 60 minutes long and consists of 30 questions (AMC 10 level). The Bullet Round is 20 minutes long and consists of 80 questions (Mathcounts Chapter level). The Team Round is 30 minutes long and consists of 16 questions (AMC 12 level). Virtual competitors may compete in teams of four, or choose to not participate in the team round.

To register and see more information, click here!

If you have any questions, please email connect@tnmathcoalition.org or reply to this thread!

Thank you to our lead sponsor, Jane Street!

IMAGE
62 replies
1 viewing
TennesseeMathTournament
Mar 9, 2025
TennesseeMathTournament
Today at 3:29 AM
amc 10 prep
Aopsauser9999   3
N Today at 3:13 AM by Aopsauser9999
Source: hi
Hi! This year I got 69 and 72 (or something around those numbers) on the 2024 AMC 10A and 10B. I want to qualify for AIME this year. Is this a feasible goal? To prepare, should I do all of the exercises in Volume 1 and the intro books, then do mock tests and practice tests from mathdash and stuff?
3 replies
Aopsauser9999
Today at 2:34 AM
Aopsauser9999
Today at 3:13 AM
Mop Qual stuff
HopefullyMcNats2025   63
N Today at 2:41 AM by mathboy282
How good of an award/ achievement is making MOP, I adore comp math but am scared if I dedicate all my time to it I won’t get in a good college such as MIT or Harvard
63 replies
HopefullyMcNats2025
Sunday at 11:23 PM
mathboy282
Today at 2:41 AM
AMC 10/AIME Study Forum
PatTheKing806   106
N Today at 2:32 AM by BrocSoc
[center]

Me (PatTheKing806) and EaZ_Shadow have created a AMC 10/AIME Study Forum! Hopefully, this forum wont die quickly. To signup, do /join or \join.

Click here to join! (or do some pushups) :P

People should join this forum if they are wanting to do well on the AMC 10 next year, trying get into AIME, or loves math!
106 replies
PatTheKing806
Mar 27, 2025
BrocSoc
Today at 2:32 AM
IMO ShortList 1999, geometry problem 3
orl   13
N May 6, 2024 by asdf334
Source: IMO ShortList 1999, geometry problem 3
A set $ S$ of points from the space will be called completely symmetric if it has at least three elements and fulfills the condition that for every two distinct points $ A$ and $ B$ from $ S$, the perpendicular bisector plane of the segment $ AB$ is a plane of symmetry for $ S$. Prove that if a completely symmetric set is finite, then it consists of the vertices of either a regular polygon, or a regular tetrahedron or a regular octahedron.
13 replies
orl
Nov 13, 2004
asdf334
May 6, 2024
IMO ShortList 1999, geometry problem 3
G H J
Source: IMO ShortList 1999, geometry problem 3
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
orl
3647 posts
#1 • 3 Y
Y by Adventure10, megarnie, Mango247
A set $ S$ of points from the space will be called completely symmetric if it has at least three elements and fulfills the condition that for every two distinct points $ A$ and $ B$ from $ S$, the perpendicular bisector plane of the segment $ AB$ is a plane of symmetry for $ S$. Prove that if a completely symmetric set is finite, then it consists of the vertices of either a regular polygon, or a regular tetrahedron or a regular octahedron.
Attachments:
This post has been edited 1 time. Last edited by orl, Nov 14, 2004, 10:18 PM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
orl
3647 posts
#2 • 2 Y
Y by Adventure10, Mango247
Please post your solutions. This is just a solution template to write up your solutions in a nice way and formatted in LaTeX. But maybe your solution is so well written that this is not required finally. For more information and instructions regarding the ISL/ILL problems please look here: introduction for the IMO ShortList/LongList project and regardingsolutions :)
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
mathmanman
1444 posts
#3 • 3 Y
Y by Adventure10, Adventure10, Mango247
http://www.kalva.demon.co.uk/imo/isoln/isoln991.html

Alternate solution :
Let us consider the convex hull $S'$ of the points $A_1, A_2, \ldots, A_n$ of $S$.
Since the convex hull of a convex polygon is a convex polygon, we have that $S'$ satisfies the conditions of the problem. Then, $S'$ is the set of the vertices of regular polygon.
Let's show that : $S = S'$. This means that $S'$ does not contain points inside $S$. Indeed, let us consider an inside point $A \in S$, $S'$ would not be invariant with regard to $s_{AA_i}$, where $AA_i = \min_{1 \le j \le n} AA_j$.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
epitomy01
240 posts
#4 • 2 Y
Y by Adventure10, Mango247
I think the problem statement here is different from the real problem.
In the real problem, the points were in a plane, and not in space, so there was nothing about a tetrahedron or an octahedron.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Moonmathpi496
413 posts
#5 • 2 Y
Y by Adventure10, Mango247
epitomy01 wrote:
I think the problem statement here is different from the real problem.
In the real problem, the points were in a plane, and not in space, so there was nothing about a tetrahedron or an octahedron.
You're right, but the problem appeared as IMO 01 was adopted the main problem...i.e. space to plane.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
mavropnevma
15142 posts
#6 • 3 Y
Y by Adventure10, Mango247, TensorGuy666
Proof for the planar case, as asked in the competition. Denote by $\Omega$ the mass center of $S$; clearly $\Omega$ lies on each axis of symmetry. Since for $A,B \in S$ the perpendicular bisector of $AB$ is an axis of symmetry for $S$, it follows $\Omega A = \Omega B$, hence $S$ is made of concyclic points, lying on a circle of centre $\Omega$.

Consider any three consecutive (on the circle) points $A,B,C \in S$; since the perpendicular bisector of $AC$ is an axis of symmetry for $S$, it follows $B$ lies on it, hence $BA = BC$. Therefore $S$ is a regular polygon, and clearly all regular polygons fulfill the requirements.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
sunny2000
234 posts
#7 • 2 Y
Y by Adventure10, Mango247
orl wrote:
A set $ S$ of points from the space will be called completely symmetric if it has at least three elements and fulfills the condition that for every two distinct points $ A$ and $ B$ from $ S$, the perpendicular bisector plane of the segment $ AB$ is a plane of symmetry for $ S$. Prove that if a completely symmetric set is finite, then it consists of the vertices of either a regular polygon, or a regular tetrahedron or a regular octahedron.

Solution
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
vsathiam
201 posts
#8 • 2 Y
Y by Adventure10, Mango247
I guess for the 3-d case it suffices to show that 1) convex hull of S = S is circumscribable in a sphere, and 2) every circle formed by taking 3 points of S is congruent. [this, combined with the 2-D case should be sufficient...]
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
goodbear
1108 posts
#9 • 3 Y
Y by chystudent1-_-, Mango247, Mango247
Cute problem!

First, the global part. Let $O$ be the centroid of $S$. Since reflection across the perpendicular bisector of $AB$ fixes $S$, it must also fix $O$, so $AO=BO$ and $O$ is the circumcenter of $S$.

We now split the problem into two cases:

Case 1: $S$ is coplanar.
Let $\Omega$ be the circumcircle of $S$. Assume for the sake of contradiction that there are points $A,B,C,D\in S$ in that order around $\Omega$ with
  • $A\ne D$,
  • $A$ and $B$ consecutive,
  • $C$ and $D$ consecutive, and
  • $\overarc{\ensuremath{ADB}}<\overarc{\ensuremath{CAD}}$.
[asy]
draw(unitcircle);
pair A=dir(162),B=dir(234),C=dir(354),D=dir(42);
pair Z=(5/4)*sqrt(A*D), Cp=A*D/C;
draw(-Z--Z,blue+dashed+(1/2)*bp);
draw(C--Cp,blue+(1/2)*bp,Arrow,Margins);
dot("$A$",A,A); dot("$B$",B,B); dot("$C$",C,C); dot("$D$",D,D);
dot("$C'$",Cp,Cp,blue);
[/asy]
Then, reflecting $C$ over the perpendicular bisector of $AD$ gives a point between $A$ and $B$ in $S$, a contradiction.

Therefore, the arcs between consecutive points in $S$ must all be congruent, so $S$ consists of the vertices of a regular polygon, as desired.
$\square$

Case 2: $S$ is not coplanar.
Let $\Omega$ be the circumsphere of $S$. Take the convex polyhedron formed by $S$, i.e. the convex hull of $S$. Let $P\in S$ and let the neighbors of $P$ on the convex hull be $A_1,A_2,\ldots,A_n$ in that order for some $n\ge 3$.

By Case 1, the faces of the convex hull are regular polygons, so $$PA_1=PA_2=\ldots=PA_n.$$Thus, $A_1,A_2,\ldots,A_n$ lie on the circle formed by the intersection of $\Omega$ and the sphere centered at $P$ containing $A_1,A_2,\ldots,A_n$. By Case 1, they then must form a regular polygon. Therefore, $$\angle A_1PA_2=\angle A_2PA_3=\ldots=\angle A_nPA_1,$$so the faces containing these angles have the same number of sides and are congruent regular polygons. It follows that the convex hull of $S$ is a platonic solid.

The cube, dodecahedron, and icosahedron do not work because they are not preserved when reflecting across the perpendicular bisector of a space diagonal. Thus, $S$ consists of the vertices of either a regular tetrahedron or a regular octahedron, as desired.
$\square$
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
TheUltimate123
1740 posts
#10 • 1 Y
Y by Mango247
Solved with nukelauncher and Th3Numb3rThr33.

First, we verify the planar case: Let \(G\) be the centroid of the points in \(S\); then \(G\) lies on each perpendicular bisector \(AB\), so \(GA=GB\) for all \(A\), \(B\) in \(S\); i.e.\ the points in \(S\) lie on a circle centered at \(G\). Let the points of \(S\) lie on the circle in the order \(A_1\), \(A_2\), \ldots, \(A_n\). We can verify for each \(i\) by looking at the perpendicular bisector of \(\overline{A_{i-1}A_{i+1}}\) that \(A_iA_{i-1}=A_iA_{i+1}\), so the polygon is regular, as needed.

Then assume the points are not all planar. Let \(G\) be the centroid again, so we can verify analogously that the points in \(S\) lie on a sphere centered at \(G\). Consider the polyhedron formed by the points in \(S\).

Observe that any plane containing at least three points must form a regular polygon. We will verify the following claim:

Claim: If we have a plane containing at least four points, and there is a point \(P\) not on the plane, then there is a point \(P\) on the other side of the plane as \(P\).

Proof. Let the plane contain regular polygon \(A_1A_2\cdots A_k\) with side length \(s\). If there is a point \(P\) ``above'' the plane, then we can select a point \(Q\) on the plane containing \(\triangle PA_1A_2\) yet still ``above'' the plane with \(QA_1=s\).

By \(k\ge4\), we have \(QA_1=A_1A_2<A_1A_3\), so the perpendicular bisector plane of \(\overline{QA_3}\) intersects segment \(A_1A_3\); that is, the reflection of \(A_1\) over the perpendicular bisector plane lies ``below'' the plane, and it must also be in \(S\). \(\blacksquare\)

It follows that every face of the polyhedron is an equilateral triangle, so the polyhedron is either a regular tetrahedron, regular octahedron, or regular icosahedron (by platonic solids). To rule out the icosahedron, take the space diagonal; the two pentagons do not pair up.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
crazyeyemoody907
450 posts
#11
Y by
whoa gj raymond and espen
:O
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
v_Enhance
6870 posts
#12 • 1 Y
Y by chystudent1-_-
Solution from Twitch Solves ISL:

Let $G$ be the centroid of $S$.

Claim: All points of $S$ lie on a sphere $\Gamma$ centered at $G$.
Proof. Each perpendicular bisector plane passes through $G$. So if $A,B \in S$ it follows $GA = GB$. $\blacksquare$

Claim: Consider any plane passing through three or more points of $S$. The points of $S$ in the plane form a regular polygon.
Proof. The cross section is a circle because we are intersecting a plane with sphere $\Gamma$. Now if $A$, $B$, $C$ are three adjacent points on this circle, by taking the perpendicular bisector we have $AB=BC$. $\blacksquare$
If the points of $S$ all lie in a plane, we are done. Otherwise, the points of $S$ determine a polyhedron $\Pi$ inscribed in $\Gamma$. All of the faces of $\Pi$ are evidently regular polygons, of the same side length $s$.

Claim: Every face of $\Pi$ is an equilateral triangle.
Proof. Suppose on the contrary some face $A_1 A_2 \dots A_n$ has $n > 3$. Let $B$ be any vertex adjacent to $A_1$ in $\Pi$ other than $A_2$ or $A_n$. Consider the plane determined by $\triangle A_1 A_3 B$. This is supposed to be a regular polygon, but arc $A_1 A_3$ is longer than arc $A_1 B$, and by construction there are no points inside these arcs. This is a contradiction. $\blacksquare$
Hence, $\Pi$ has faces all congruent equilateral triangles. This implies it is a regular polyhedron --- either a regular tetrahedron, regular octahedron, or regular icosahedron. We can check the regular icosahedron fails by taking two antipodal points as our counterexample. This finishes the problem.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
awesomeming327.
1681 posts
#13
Y by
Let $G$ be the centroid. Note that since the entire figure is symmetric across each perpendicular bisector, the centroid must be on every perpendicular bisector. Thus, $S$ is conspheric.

$~$
Let $T$ be a subset of $S$ that lies on a circle. Let $A_1$, $A_2$, $A_3$, $A_4$, $A_5$ be adjacent points appearing in that order, taking cyclics if needed. By the perpendicular bisector of $A_3A_4$, $A_2A_3=A_4A_5$. By the perpendicular bisector of $A_2A_4$, $A_1A_2=A_4A_5$ which means $A_1A_2=A_2A_3$, and therefore the points on $T$ form a regular polygon.

$~$
Clearly any regular polygon works, so suppose there was some other point $P$. Then its neighbors form a regular polygon and therefore all the angles including $P$ of the convex hull are equal. Furthermore all the faces of this solid are regular polygons so we have ourselves a tetrahedron, cube, octahedron, dodecahedron and icosahedron and it is easy to check only the tetra and octa hedrons work.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
asdf334
7586 posts
#14
Y by
First solve the 2D case. If there are at least three points in a plane then consider the convex hull. By choosing a side of the convex hull and taking the "perpendicular bisector plane" we find that every angle of the convex hull is the same. By choosing a segment between points two vertices apart we find that every side of the convex hull has the same length. Hence the convex hull is a regular polygon.
Take a point $A$ on the convex hull and interior point $B$. Reflection preserves the condition that a point is on the convex hull, which is a contradiction as $A$ will be sent to $B$.
Now we solve the 3D case. We have already found that the points in any nontrivial plane form a convex polygon. Consider the convex hull again.
Consider the gravity center (average of vectors) $O$. Since any plane of symmetry passes through the gravity center it follows $O$ is the center of the sphere through all the points. (Oops, could have made this observation earlier.)
We can actually repeat this logic. Take a point $A$ and its neighbors $A_1,\dots,A_n$. Reflection about the perpendicular bisector plane of $A_iA_j$ sends neighbors of $A_i$ to neighbors of $A_j$, thus $A$ is preserved. Hence $AA_i$ is constant, meaning $A_1,\dots,A_n$ lie on a circle. Thus they form a regular polygon, implying that the faces of the convex hull containing $A$ are actually congruent.
This reduces the search space to platonic solids.
  • Tetrahedrons work.
  • Cubes fail on the space diagonal.
  • Octahedrons work.
  • To disprove dodecahedrons and icosahedrons take two points which are a distance of two edges apart.
We are done. $\blacksquare$
Z K Y
N Quick Reply
G
H
=
a