We have your learning goals covered with Spring and Summer courses available. Enroll today!

G
Topic
First Poster
Last Poster
k a My Retirement & New Leadership at AoPS
rrusczyk   1571
N Yesterday at 11:40 PM 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
Yesterday at 11:40 PM
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
a truly remarkable problem
john0512   14
N 10 minutes ago by OronSH
Consider the sequence of positive integers $$6,69,696,6969,69696\cdots.$$It is well known that $69696=264^2$. Prove that this is the only perfect square in the sequence.

Jiahe Liu, Vikram Sarkar, Allen Wang, Ritwin Narra, Carlos Rodriguez, Susie Lu, Jonathan He, Jordan Lefkowitz, Victor Chen, Luv Udeshi
14 replies
+2 w
john0512
Feb 20, 2023
OronSH
10 minutes ago
Inequality
Tendo_Jakarta   1
N 13 minutes ago by Tendo_Jakarta
Let \(a,b,c\) be positive numbers such that \(a+b+c = 3\). Find the maximum value of
\[T = \dfrac{bc}{\sqrt{a}+3}+\dfrac{ca}{\sqrt{b}+3}+\dfrac{ab}{\sqrt{c}+3}  \]
1 reply
Tendo_Jakarta
Today at 7:24 AM
Tendo_Jakarta
13 minutes ago
2018 Peru Cono Sur TST P3
EmersonSoriano   1
N 17 minutes ago by kokcio
Let $ I $ be the incenter of a triangle $ ABC $ with $ AB \neq AC $, and let $ M $ be the midpoint of the arc $ BAC $ of the circumcircle of the triangle. The perpendicular line to $ AI $ passing through $ I $ intersects line $ BC $ at point $ D $. The line $ MI $ intersects the circumcircle of triangle $ BIC $ at point $ N $. Prove that line $ DN $ is tangent to the circumcircle of triangle $ BIC $.
1 reply
EmersonSoriano
5 hours ago
kokcio
17 minutes ago
Rational numbers
steven_zhang123   1
N 39 minutes ago by kokcio
Source: G635
Find all positive real numbers \( \alpha \) such that there exist infinitely many rational numbers \( \frac{p}{q} (p, q \in \mathbb{Z}, p > 0, \gcd(p, q) = 1 ) \) satisfying

\[
\left| \frac{q}{p} - \frac{\sqrt{5} - 1}{2} \right| < \frac{\alpha}{p^2}.
\]
1 reply
steven_zhang123
Today at 1:24 PM
kokcio
39 minutes ago
Metamorphosis of Medial and Contact Triangles
djmathman   101
N 2 hours ago by ErTeeEs06
Source: 2014 USAJMO Problem 6
Let $ABC$ be a triangle with incenter $I$, incircle $\gamma$ and circumcircle $\Gamma$. Let $M,N,P$ be the midpoints of sides $\overline{BC}$, $\overline{CA}$, $\overline{AB}$ and let $E,F$ be the tangency points of $\gamma$ with $\overline{CA}$ and $\overline{AB}$, respectively. Let $U,V$ be the intersections of line $EF$ with line $MN$ and line $MP$, respectively, and let $X$ be the midpoint of arc $BAC$ of $\Gamma$.

(a) Prove that $I$ lies on ray $CV$.

(b) Prove that line $XI$ bisects $\overline{UV}$.
101 replies
1 viewing
djmathman
Apr 30, 2014
ErTeeEs06
2 hours ago
high tech FE as J1?!
imagien_bad   59
N 2 hours ago by maths31415
Source: USAJMO 2025/1
Let $\mathbb Z$ be the set of integers, and let $f\colon \mathbb Z \to \mathbb Z$ be a function. Prove that there are infinitely many integers $c$ such that the function $g\colon \mathbb Z \to \mathbb Z$ defined by $g(x) = f(x) + cx$ is not bijective.
Note: A function $g\colon \mathbb Z \to \mathbb Z$ is bijective if for every integer $b$, there exists exactly one integer $a$ such that $g(a) = b$.
59 replies
1 viewing
imagien_bad
Mar 20, 2025
maths31415
2 hours ago
Pascal, Cayley and Fermat 2025
melpomene7   44
N 2 hours ago by alexz103
Anyone else do a CEMC contest? I did fermat but totally fumbled and got a 108.
44 replies
melpomene7
Feb 28, 2025
alexz103
2 hours ago
AMC 8 score thread
Squidget   223
N 2 hours ago by Aopsauser9999
$\begin{tabular}{c|c|c|c|c}Username & Grade & Score \\ \hline
Squidget & 7 & 21 \\
\end{tabular}$

223 replies
Squidget
Jan 30, 2025
Aopsauser9999
2 hours ago
Predicted AMC 8 Scores
megahertz13   137
N 3 hours ago by DhruvJha
$\begin{tabular}{c|c|c|c}Username & Grade & AMC8 Score \\ \hline
megahertz13 & 5 & 23 \\
\end{tabular}$
137 replies
megahertz13
Jan 25, 2024
DhruvJha
3 hours ago
usamOOK geometry
KevinYang2.71   87
N Today at 2:31 PM by Primeniyazidayi
Source: USAMO 2025/4, USAJMO 2025/5
Let $H$ be the orthocenter of acute triangle $ABC$, let $F$ be the foot of the altitude from $C$ to $AB$, and let $P$ be the reflection of $H$ across $BC$. Suppose that the circumcircle of triangle $AFP$ intersects line $BC$ at two distinct points $X$ and $Y$. Prove that $C$ is the midpoint of $XY$.
87 replies
KevinYang2.71
Mar 21, 2025
Primeniyazidayi
Today at 2:31 PM
USAJMO #5 - points on a circle
hrithikguy   206
N Today at 6:06 AM by Ilikeminecraft
Points $A,B,C,D,E$ lie on a circle $\omega$ and point $P$ lies outside the circle. The given points are such that (i) lines $PB$ and $PD$ are tangent to $\omega$, (ii) $P, A, C$ are collinear, and (iii) $DE \parallel AC$. Prove that $BE$ bisects $AC$.
206 replies
hrithikguy
Apr 28, 2011
Ilikeminecraft
Today at 6:06 AM
LMT Spring 2025 and Girls&#039; LMT 2025
vrondoS   14
N Today at 5:17 AM by why1434
The Lexington High School Math Team is proud to announce LMT Spring 2025 and our inaugural Girls’ LMT 2025! LMT is a competition for middle school students interested in math. Students can participate individually, or on teams of 4-6 members. This announcement contains information for BOTH competitions.

LMT Spring 2025 will take place from 8:30 AM-5:00 PM on Saturday, May 3rd at Lexington High School, 251 Waltham St., Lexington, MA 02421.

The competition will include two individual rounds, a Team Round, and a Guts Round, with a break for lunch and mini-events. A detailed schedule is available at https://lhsmath.org/LMT/Schedule.

There is a $15 fee per participant, paid on the day of the competition. Pizza will be provided for lunch, at no additional cost.

Register for LMT at https://lhsmath.org/LMT/Registration/Home.

Girls’ LMT 2025 will be held ONLINE on MathDash from 11:00 AM-4:15 PM EST on Saturday, April 19th, 2025. Participation is open to middle school students who identify as female or non-binary. The competition will include an individual round and a team round with a break for lunch and mini-events. It is free to participate.

Register for GLMT at https://www.lhsmath.org/LMT/Girls_LMT.

More information is available on our website: https://lhsmath.org/LMT/Home. Email lmt.lhsmath@gmail.com with any questions.
14 replies
vrondoS
Today at 1:55 AM
why1434
Today at 5:17 AM
Practice AMC 10A
freddyfazbear   41
N Today at 3:23 AM by DhruvJha
Hey everyone!

I’m back with another practice test. Sorry this one took a while to pump out since I have been busy lately.

Post your score/distribution, favorite problems, and thoughts on the difficulty of the test down below. Hope you enjoy!


Practice AMC 10A

1. Find the sum of the infinite geometric series 1/2 + 7/36 + 49/648 + …
A - 18/11, B - 9/22, C - 9/11, D - 18/7, E - 9/14

2. What is the first digit after the decimal point in the square root of 420?
A - 1, B - 2, C - 3, D - 4, E - 5

3. Caden’s calculator is broken and two of the digits are swapped for some reason. When he entered in 9 + 10, he got 21. What is the sum of the two digits that got swapped?
A - 2, B - 3, C - 4, D - 5, E - 6

4. Two circles with radiuses 47 and 96 intersect at two points A and B. Let P be the point 82% of the way from A to B. A line is drawn through P that intersects both circles twice. Let the four intersection points, from left to right be W, X, Y, and Z. Find (PW/PX)*(PY/PZ).
A - 50/5863, B - 47/96, C - 1, D - 96/47, E - 5863/50

5. Two dice are rolled, and the two numbers shown are a and b. How many possible values of ab are there?
A - 17, B - 18, C - 19, D - 20, E - 21

6. What is the largest positive integer that cannot be expressed in the form 6a + 9b + 4c + 20d, where a, b, c, and d are positive integers?
A - 29, B - 38, C - 43, D - 76, E - 82

7. What is the absolute difference of the probabilities of getting at least 6/10 on a 10-question true or false test and at least 3/5 on a 5-question true or false test?
A - 0, B - 1/504, C - 1/252, D - 1/126, E - 1/63

8. How many arrangements of the letters in the word “ginger” are there such that the two vowels have an even number of letters (remember 0 is even) between them (including the original “ginger”)?
A - 72, B - 108, C - 144, D - 216, E - 432

9. After opening his final exam, Jason does not know how to solve a single question. So he decides to pull out his phone and search up the answers. Doing this, Jason has a success rate of anywhere from 94-100% for any given question he uses his phone on. However, if the teacher sees his phone at any point during the test, then Jason gets a 0.5 multiplier on his final test score, as well as he must finish the rest of the test questions without his phone. (Assume Jason uses his phone on every question he does until he finishes the test or gets caught.) Every question is a 5-choice multiple choice question. Jason has a 90% chance of not being caught with his phone. What is the expected value of Jason’s test score, rounded to the nearest tenth of a percent?
A - 89.9%, B - 90.0%, C - 90.1%, D - 90.2%, E - 90.3%

10. A criminal is caught by a police officer. Due to a lack of cooperation, the officer calls in a second officer so they can start the arrest smoothly. Officer 1 takes 26:18 to arrest a criminal, and officer 2 takes 13:09 to arrest a criminal. With these two police officers working together, how long should the arrest take?
A - 4:23, B - 5:26, C - 8:46, D - 17:32, E - 19:44

11. Suppose that on the coordinate grid, the x-axis represents economic freedom, and the y-axis represents social freedom, where -1 <= x, y <= 1 and a higher number for either coordinate represents more freedom along that particular axis. Accordingly, the points (0, 0), (1, 1), (-1, 1), (-1, -1), and (1, -1) represent democracy, anarchy, socialism, communism, and fascism, respectively. A country is classified as whichever point it is closest to. Suppose a theoretical new country is selected by picking a random point within the square bounded by anarchy, socialism, communism, and fascism as its vertices. What is the probability that it is fascist?
A - 1 - (1/4)pi, B - 1/5, C - (1/16)pi, D - 1/4, E - 1/8

12. Statistics show that people in Memphis who eat at KFC n days a week have a (1/10)(n+2) chance of liking kool-aid, and the number of people who eat at KFC n days a week is directly proportional to 8 - n (Note that n can only be an integer from 0 to 7, inclusive). A random person in Memphis is selected. Find the probability that they like kool-aid.
A - 13/30, B - 17/30, C - 19/30, D - 23/30, E - 29/30

14. Find the number of positive integers n less than 69 such that the average of all the squares from 1^2 to n^2, inclusive, is an integer.
A - 11, B - 12, C - 23, D - 24, E - 48

15. Find the number of ordered pairs (a, b) of integers such that (a - b)^2 = 625 - 2ab.
A - 6, B - 10, C - 12, D - 16, E - 20

16. What is the 420th digit after the decimal point in the decimal expansion of 1/13?
A - 4, B - 5, C - 6, D - 7, E - 8

17. Two congruent towers stand near each other. Both take the shape of a right rectangular prism. A plane that cuts both towers into two pieces passes through the vertical axes of symmetry of both towers and does not cross the floor or roof of either tower. Let the point that the plane crosses the axis of symmetry of the first tower be A, and the point that the plane crosses the axis of symmetry of the second tower be B. A is 81% of the way from the floor to the roof of the first tower, and B is 69% of the way from the floor to the roof of the second tower. What percent of the total mass of both towers combined is above the plane?
A - 19%, B - 25%, C - 50%, D - 75%, E - 81%

18. What is the greatest number of positive integer factors an integer from 1 to 100 can have?
A - 10, B - 12, C - 14, D - 15, E - 16

19. On an analog clock, the minute hand makes one full revolution every hour, and the hour hand makes one full revolution every 12 hours. Both hands move at a constant rate. During which of the following time periods does the minute hand pass the hour hand?
A - 7:35 - 7:36, B - 7:36 - 7:37, C - 7:37 - 7:38, D - 7:38 - 7:39, E - 7:39 - 7:40

20. Find the smallest positive integer that is a leg in three different Pythagorean triples.
A - 12, B - 14, C - 15, D - 20, E - 21

21. How many axes of symmetry does the graph of (x^2)(y^2) = 69 have?
A - 2, B - 3, C - 4, D - 5, E - 6

22. Real numbers a, b, and c are chosen uniformly and at random from 0 to 3. Find the probability that a + b + c is less than 2.
A - 4/81, B - 8/81, C - 4/27, D - 8/27, E - 2/3

23. Let f(n) be the sum of the positive integer divisors of n. Find the sum of the digits of the smallest odd positive integer n such that f(n) is greater than 2n.
A - 15, B - 18, C - 21, D - 24, E - 27

24. Find the last three digits of 24^10.
A - 376, B - 576, C - 626, D - 876, E - 926

25. A basketball has a diameter of 9 inches, and the hoop has a diameter of 18 inches. Peter decides to pick up the basketball and make a throw. Given that Peter has a 1/4 chance of accidentally hitting the backboard and missing the shot, but if he doesn’t, he is guaranteed that the frontmost point of the basketball will be within 18 inches of the center of the hoop at the moment when a great circle of the basketball crosses the plane containing the rim. No part of the ball will extend behind the backboard at any point during the throw, and the rim is attached directly to the backboard. What is the probability that Peter makes a green FN?
A - 3/128, B - 3/64, C - 3/32, D - 3/16, E - 3/8
41 replies
freddyfazbear
Mar 24, 2025
DhruvJha
Today at 3:23 AM
USA Canada math camp
Bread10   35
N Today at 2:34 AM by abbominable_sn0wman
How difficult is it to get into USA Canada math camp? What should be expected from an accepted applicant in terms of the qualifying quiz, essays and other awards or math context?
35 replies
Bread10
Mar 2, 2025
abbominable_sn0wman
Today at 2:34 AM
degree of f=2^k
Sayan   15
N Mar 18, 2025 by Gejabsk
Source: ISI 2012 #8
Let $S = \{1,2,3,\ldots,n\}$. Consider a function $f\colon S\to S$. A subset $D$ of $S$ is said to be invariant if for all $x\in D$ we have $f(x)\in D$. The empty set and $S$ are also considered as invariant subsets. By $\deg (f)$ we define the number of invariant subsets $D$ of $S$ for the function $f$.

i) Show that there exists a function $f\colon S\to S$ such that $\deg (f)=2$.

ii) Show that for every $1\leq k\leq n$ there exists a function $f\colon S\to S$ such that $\deg (f)=2^{k}$.
15 replies
Sayan
May 13, 2012
Gejabsk
Mar 18, 2025
degree of f=2^k
G H J
Source: ISI 2012 #8
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Sayan
2130 posts
#1 • 2 Y
Y by mathbuzz, Adventure10
Let $S = \{1,2,3,\ldots,n\}$. Consider a function $f\colon S\to S$. A subset $D$ of $S$ is said to be invariant if for all $x\in D$ we have $f(x)\in D$. The empty set and $S$ are also considered as invariant subsets. By $\deg (f)$ we define the number of invariant subsets $D$ of $S$ for the function $f$.

i) Show that there exists a function $f\colon S\to S$ such that $\deg (f)=2$.

ii) Show that for every $1\leq k\leq n$ there exists a function $f\colon S\to S$ such that $\deg (f)=2^{k}$.
This post has been edited 3 times. Last edited by Sayan, May 16, 2012, 7:18 AM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
iarnab_kundu
866 posts
#2 • 3 Y
Y by mathbuzz, Adventure10, and 1 other user
pls post it in combinatorics; I wrote it fully but someone erased everything :furious:

writing again :

lets take f to be a permutation. consider a permutation where

(n-t+2,...,n) are fixed points. and consider the biggest of the remaining elements; assign the biggest i.e (n-t+1) to f(1) ; and the smallest to f(2), second smallest to f(3)(if it is possible ) and so on

this works (easy to prove)


for example the required permutation of (1,2,..,5) with degree 2^3 is (3,1,2,4,5)
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
#3 • 6 Y
Y by Abhinandan18, opptoinfinity, math_and_me, Adventure10, Mango247, PRMOisTheHardestExam
As a first observation, one must allow $\emptyset$ to be (vacuously) considered as an invariant subset, for any $f$ (otherwise point ii) would fail for $k=n$).

Now, the idea from above can be written more simply, with the permutation $f_k = (1)(2)\cdots(k-1)(k,k+1,\ldots,n)$, written as a product of cycles, having $\deg(f) = 2^{k}$ for all $1\leq k \leq n$.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
iarnab_kundu
866 posts
#4 • 2 Y
Y by Adventure10, Mango247
In the actual paper it was mentioned that the empty set and the set {1,...,n} are ''invariant'' subset. So I request Sayan to edit it.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
mathbuzz
803 posts
#5 • 4 Y
Y by ISI4, agirlhasnoname, Adventure10, Mango247
well, for part (1) , we may take a cycle permutation.i.e. take f(1)=2 , f(2)=3 ,...,f(n-1)=n,f(n)=1.this clearly satisfies deg.(f)=2
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Irfan
389 posts
#6 • 2 Y
Y by Adventure10, Mango247
Can we simply not use f(1)=1 f(2)=4.... argument for (1) ?
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
JackXD
151 posts
#7 • 2 Y
Y by Adventure10, Mango247
ignore this post
This post has been edited 1 time. Last edited by JackXD, May 9, 2017, 1:00 PM
Reason: faulty post in another forum
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
stranger_02
337 posts
#9 • 2 Y
Y by Madhavi, PRMOisTheHardestExam
Sayan wrote:
Let $S = \{1,2,3,\ldots,n\}$. Consider a function $f\colon S\to S$. A subset $D$ of $S$ is said to be invariant if for all $x\in D$ we have $f(x)\in D$. The empty set and $S$ are also considered as invariant subsets. By $\deg (f)$ we define the number of invariant subsets $D$ of $S$ for the function $f$.

i) Show that there exists a function $f\colon S\to S$ such that $\deg (f)=2$.

ii) Show that for every $1\leq k\leq n$ there exists a function $f\colon S\to S$ such that $\deg (f)=2^{k}$.

For the second part, we can simply consider a function defined piecewise as
$f(x)=x$ when $x\leq{k}$
$f(x)=1$ $($or any number in this range$)$, otherwise

Therefore, we see that $f(x)$ has exactly $2^k$ subsets..

Q.E.D $\square$
This post has been edited 1 time. Last edited by stranger_02, Jun 18, 2020, 3:25 PM
Reason: Latex
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Titttu
7 posts
#10
Y by
I can give a hint sumation of binomial coffecient wii helpful.. breka as required in 2,3,4,...n parts the total set and for every break u get the required 2^k
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Titttu
7 posts
#11
Y by
I can give a hint sumation of binomial coffecient wii helpful.. breka as required in 2,3,4,...n parts the total set and for every break u get the required 2^k
I gave one example which help you .
Let, k=3 then break S in 3 parts.
The break is going to happen like this=
f(x)=x+1 and f(b) =a ( where a is the first element of the partion and b is the last element of the partion . and for rest of the elemnets of the element it will tak care by the f(x) =x+1 )
Now if we choose one partition we can do it by 3c1 ways , we can choose 2 partition by 3c2 ways and 3 partition(which is total set for this case) 3c3 ways . And we can choose no partition in 3co ways ( which is empty set) .
The sum of all the cases is 2^3 .And you can do it 4 partition(u get 2^4) and so on ..upto n partition (after some partition u have to consider 1 element as partition & always shuffle the partition like that inside the partition there is no kind of subset which can satisfy our requirements .


Sorry guys I can't use the latex format .
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
ftheftics
651 posts
#12 • 1 Y
Y by Gerninza
It will enough to show a construction of a function to prove the existence.

For a fixed positive integer $k \in [1,n]$ consider the function

\[f(x) = \begin{cases}  
 x + 1 &  \text{for} ,  1\le x\le n-k-1
\\
1 & \text{for}    ,  x\ge n-k \end{cases} \]
Now consider $A =\{ 1 ,2,\cdots , n-k \}$ and $B =\{n-k+1,\cdots ,n\}$

Now Any subset $D$ of $S$ with $D= A \cup R$ (Where $R$ is subset of $B$) is invariant Under $f$ .

Since there is $2^k$ subsets of $B$ thus , There can have $2^k$ subset $D$ of $S$ for which $D$ is invariant under $f$ .

By definition $ \deg (f) =2^k$


Now for part (i) just take $k=1$
This post has been edited 1 time. Last edited by ftheftics, May 20, 2021, 1:07 PM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
allofme
2 posts
#13
Y by
@ftheftics the subsets you have considered as AUR where R is subset of B, all of them essentially consist A and some additional elements. So we get 2^k subsets all containing at least A. But apart from this there is phi which does not include anything making the deg(f)=2^k+1. Kindly enlighten me on this aspect.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
idkwhatthisis
44 posts
#14
Y by
I believe induction should work, for $\deg(f) = 2$ just take a cycle, and to get to a permutation with $\deg(f) = 2^m$ from $n$ to $n+1$ just take $f(n+1) = n+1$ and a permutation $g$ of $\{1,\ldots,n\}$ such that $\deg(g) = 2^{m-1}$ and we should be done.

EDIT: I just realised that by fixing $k-1$ points and applying the same construction in (i) to the remaining numbers then everything is cool
This post has been edited 2 times. Last edited by idkwhatthisis, May 28, 2021, 11:51 AM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
green_leaf
225 posts
#15
Y by
For each function $f$, consider a directed graph where vertices are numbers in $S$ and there is an edge $A \to B$ iff $f(A) = B$.
i) This is equivalent to showing there is a function such that there are no directed cycles of length $k < n$. This can simply be achieved by taking $f(i) = i+1 ~~~ \forall 1 \leq i \leq n-1$ and $f(n) = 1$.

ii) Choose a function that splits $S$ into $k$ disjoint directed cycles. The number of invariant subsets are equivalent to the subsets of the set whose elements are the $k$ cycles, since the sets of cycles can be combined to form new sets which are still valid invariant sets. But the number of subsets of an set with $k$ elements is simply $2^k$ (including the empty set).
This post has been edited 1 time. Last edited by green_leaf, May 27, 2021, 3:07 PM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
quasar_lord
193 posts
#17
Y by
soln
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Gejabsk
7 posts
#18
Y by
If we're mapping one subset of k elements to itself and dearranging the rest, but S in invariant too , so total would be 2^k + 1
for deg(f) = 2^k , the invariants excluding S must be 2^k -1 , which doesn't seem possible ...
This post has been edited 1 time. Last edited by Gejabsk, Mar 18, 2025, 6:00 PM
Reason: .
Z K Y
N Quick Reply
G
H
=
a