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

Contests & Programs AMC and other contests, summer programs, etc.
AMC and other contests, summer programs, etc.
3 M G
BBookmark  VNew Topic kLocked
Contests & Programs AMC and other contests, summer programs, etc.
AMC and other contests, summer programs, etc.
3 M G
BBookmark  VNew Topic kLocked
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 Adding contests to the Contest Collections
dcouchman   1
N Apr 5, 2023 by v_Enhance
Want to help AoPS remain a valuable Olympiad resource? Help us add contests to AoPS's Contest Collections.

Find instructions and a list of contests to add here: https://artofproblemsolving.com/community/c40244h1064480_contests_to_add
1 reply
dcouchman
Sep 9, 2019
v_Enhance
Apr 5, 2023
k i Zero tolerance
ZetaX   49
N May 4, 2019 by NoDealsHere
Source: Use your common sense! (enough is enough)
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]$lim_{n\to 1}^{+\infty}\frac{1}{n}-lnn$[/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 $x^{3}+y^{3}=z^{3}$, do not answer with "$x=y=z=0$ is a solution" only. Either you post any kind of proof or at least something unexpected (like "$x=1337, y=481, z=42$ is the smallest solution). Someone that does not see that $x=y=z=0$ 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.
49 replies
ZetaX
Feb 27, 2007
NoDealsHere
May 4, 2019
Maximum number of Sets
pokmui9909   3
N 12 minutes ago by Acorn-SJ
Source: FKMO 2025 P5
For a subset $T$ of the set $S = \{1, 2, \dots, 1000\}$, let $\tilde{T} = \{1001 - t \ | \ t \in T\}$. Find the maximum number of elements in the set $\mathcal{P}$ that satisfies all of the three following conditions:
[list]
[*] All elements of $\mathcal{P}$ are subsets of $S$.
[*] For any two elements $A, B$ of $\mathcal{P}$, $A\cap B$ is not empty.
[*] For any element $A$ of $\mathcal{P}$, $\tilde{A} \in \mathcal{P}$.
[/list]
3 replies
pokmui9909
2 hours ago
Acorn-SJ
12 minutes ago
Equality case being all distinct reals?
navi_09220114   2
N 12 minutes ago by AN1729
Source: Own. Malaysian IMO TST 2025 P7
Given a real polynomial $P(x)=a_{2024}x^{2024}+\cdots+a_1x+a_0$ with degree $2024$, such that for all positive reals $b_1, b_2,\cdots, b_{2025}$ with product $1$, then; $$P(b_1)+P(b_2)+\cdots +P(b_{2025})\ge 0$$Suppose there exist positive reals $c_1, c_2, \cdots, c_{2025}$ with product $1$, such that; $$P(c_1)+P(c_2)+ \cdots +P(c_{2025})=0$$Is it possible that the values $c_1, c_2, \cdots, c_{2025}$ are all distinct?

Proposed by Ivan Chan Kai Chin
2 replies
navi_09220114
Mar 22, 2025
AN1729
12 minutes ago
closure subsets
lgx57   0
12 minutes ago
Let $S_1,S_2 \cdots S_n$ are proper subsets of $\mathbb{R}$ and they are closed for addition and subtraction. Try to prove that:

$$\displaystyle\bigcup_{i=1}^n S_i \ne \mathbb{R}$$
0 replies
lgx57
12 minutes ago
0 replies
FE f(x)f(y)+1=f(x+y)+f(xy)+xy(x+y-2)
steven_zhang123   1
N 13 minutes ago by pco
Find all functions $f: \mathbb{R} \rightarrow \mathbb{R}$ such that for all $x,y \in \mathbb{R}$, we have $f(x)f(y)+1=f(x+y)+f(xy)+xy(x+y-2)$.
1 reply
steven_zhang123
Yesterday at 11:27 PM
pco
13 minutes ago
Inspired by KHOMNYO2
sqing   1
N 15 minutes ago by truongphatt2668
Source: Own
Let $ a,b,c>0 $ and $ a^2+b^2+c^2=3. $ Prove that $$ \frac{2}{a} + \frac{2}{b} + \frac{2}{c}  +a +  b +c+ abc\geq 10$$
1 reply
sqing
Friday at 2:46 PM
truongphatt2668
15 minutes ago
Graph vertices with degree
MetaphysicalWukong   0
20 minutes ago
Source: Qianrong Hao
For a graph $G=\left(V,E\right)$, what is the largest possible value of |V| if |E|=35 and $deg\left(v\right)\ge3$
0 replies
1 viewing
MetaphysicalWukong
20 minutes ago
0 replies
Functional Equations Marathon March 2025
Levieee   25
N 26 minutes ago by Jupiterballs
1. before posting another problem please try your best to provide the solution to the previous solution because we don't want a backlog of many problems
2.one is welcome to send functional equations involving calculus (mainly basic real analysis type of proofs) as long it is of the form $\text{"find all functions:"}$
25 replies
Levieee
Mar 17, 2025
Jupiterballs
26 minutes ago
A checkered square consists of dominos
nAalniaOMliO   2
N 42 minutes ago by weamher
Source: Belarusian National Olympiad 2025
A checkered square $8 \times 8$ is divided into rectangles with two cells. Two rectangles are called adjacent if they share a segment of length 1 or 2. In each rectangle the amount of adjacent with it rectangles is written.
Find the maximal possible value of the sum of all numbers in rectangles.
2 replies
nAalniaOMliO
Friday at 8:21 PM
weamher
42 minutes ago
Great orz
Hip1zzzil   3
N an hour ago by Acorn-SJ
Source: FKMO 2025 P5
$S={1,2,...,1000}$ and $T'=\left\{ 1001-t|t \in T\right\}$.
A set $P$ satisfies the following three conditions:
$1.$ All elements of $P$ are a subset of $S$.
$2. A,B \in P \Rightarrow A \cap B \neq \O$
$3. A \in P \Rightarrow A' \in P$
Find the maximum of $|P|$.
3 replies
Hip1zzzil
2 hours ago
Acorn-SJ
an hour ago
Age proof
Mathskidd   1
N an hour ago by ohiorizzler1434
$$
$$

As the diagram shown

By means of contrusting semi circle with diamieter as length of $a+b$, then

Its radius is $\frac {a+b}2 $. Half chord $GQ=\sqrt {ab}$

Obviously, ie. When $n=2, \frac {a+b}2 \geq \sqrt {ab}$
Equality holds when $a=b$
1 reply
Mathskidd
an hour ago
ohiorizzler1434
an hour ago
Practice AMC 10A
freddyfazbear   59
N 2 hours ago by Andrew2019
Practice AMC 10A

1. Find the sum of the infinite geometric series 1 + 7/18 + 49/324 + …
A - 36/11, B - 9/22, C - 18/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 + 4 + 20d, where a, b, 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 - 63/1024, B - 63/512, C - 63/256, D - 63/128, E - 0

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

9. Find the value of 0.9 * 0.97 + 0.5 * 0.1 * (0.5 * 0.97 + 0.5 * 0.2) rounded to the nearest tenth of a percent.
A - 89.9%, B - 90.0%, C - 90.1%, D - 90.2%, E - 90.3%

10. Two painters are painting a room. Painter 1 takes 52:36 to paint the room, and painter 2 takes 26:18 to paint the room. With these two painters working together, how long should the job take?
A - 9:16, B - 10:52, C - 17:32, D - 35:02, E - 39:44

11. Suppose that on the coordinate grid, the x-axis represents climate, and the y-axis represents landscape, where -1 <= x, y <= 1 and a higher number for either coordinate represents better conditions along that particular axis. Accordingly, the points (0, 0), (1, 1), (-1, 1), (-1, -1), and (1, -1) represent cities, plains, desert, snowy lands, and mountains, respectively. An area is classified as whichever point it is closest to. Suppose a theoretical new area is selected by picking a random point within the square bounded by plains, desert, snowy lands, and mountains as its vertices. What is the probability that it is a plains?
A - 1 - (1/4)pi, B - 1/5, C - (1/16)pi, D - 1/4, E - 1/8

12. Statistics show that people who work out n days a week have a (1/10)(n+2) chance of getting a 6-pack, and the number of people who exercise 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 is selected. Find the probability that they have a 6-pack.
A - 13/30, B - 17/30, C - 19/30, D - 23/30, E - 29/30

13. A factory must produce 3,000 items today. The manager of the factory initially calls over 25 employees, each producing 5 items per hour starting at 9 AM. However, he needs all of the items to be produced by 9 PM, and realizes that he must speed up the process. At 12 PM, the manager then encourages his employees to work faster by increasing their pay, in which they then all speed up to 6 items per hour. At 1 PM, the manager calls in 15 more employees which make 5 items per hour each. Unfortunately, at 3 PM, the AC stops working and the hot sun starts taking its toll, which slows every employee down by 2 items per hour. At 4 PM, the technician fixes the AC, and all employees return to producing 5 items per hour. At 5 PM, the manager calls in 30 more employees, which again make 5 items per hour. At 6 PM, he calls in 30 more employees. At 7 PM, he rewards all the pickers again, speeding them up to 6 items per hour. But at 8 PM, n employees suddenly crash out and stop working due to fatigue, and the rest all slow back down to 5 items per hour because they are tired. The manager does not have any more employees, so if too many of them drop out, he is screwed and will have to go overtime. Find the maximum value of n such that all of the items can still be produced on time, done no later than 9 PM.
A - 51, B - 52, C - 53, D - 54, E - 55

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 right rectangular prisms stand near each other. Both have the same orientation and altitude. A plane that cuts both prisms into two pieces passes through the vertical axes of symmetry of both prisms and does not cross the bottom or top faces of either prism. Let the point that the plane crosses the axis of symmetry of the first prism be A, and the point that the plane crosses the axis of symmetry of the second prism be B. A is 81% of the way from the bottom face to the top face of the first prism, and B is 69% of the way from the bottom face to the top face of the second prism. What percent of the total volume of both prisms 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 the shot?
A - 3/128, B - 3/64, C - 3/32, D - 3/16, E - 3/8
59 replies
freddyfazbear
Mar 24, 2025
Andrew2019
2 hours ago
PROM^2 for Girls 2025
mathisfun17   18
N 2 hours ago by mpcnotnpc
Hi everyone!

The Princeton International School of Math and Science (PRISMS) Math Team is delighted that $PROM^2$ for Girls, PRISMS Online Math Meet for Girls, is happening this spring! https://www.prismsus.org/events/prom/home/index

We warmly invite all middle school girls to join us! This is a fantastic opportunity for young girls to connect with others interested in math as well as prepare for future math contests.

This contest will take place online from 12:00 pm to 3:00 pm EST on Saturday, April 26th, 2025.

The competition will include a team and individual round as well as activities like origami. You can see a detailed schedule here. https://prismsus.org/events/prom/experience/schedule.

Registration is FREE, there are cash prizes for participants who place in the top 10 and cool gifts for all participants.

1st place individual: $500 cash
2nd place individual: $300 cash
3rd place individual: $100 cash
4th-10th place individual: $50 cash each

Some FAQs:
Q: How difficult are the questions?
A: The problem difficulty is around AMC 8 or Mathcounts level.

Q: Are there any example problems?
A: You can find some archived here: https://www.prismsus.org/events/prom/achieve/achieve

Registration is open now. https://www.prismsus.org/events/prom/register/register. Email us at prom2@prismsus.org with any questions.

The PRISMS Peregrines Math Team welcomes you!
18 replies
mathisfun17
Feb 22, 2025
mpcnotnpc
2 hours ago
MAA finally wrote sum good number theory
IAmTheHazard   95
N 2 hours ago by Magnetoninja
Source: 2021 AIME I P14
For any positive integer $a,$ $\sigma(a)$ denotes the sum of the positive integer divisors of $a.$ Let $n$ be the least positive integer such that $\sigma(a^n)-1$ is divisible by $2021$ for all positive integers $a.$ Find the sum of the prime factors in the prime factorization of $n.$
95 replies
IAmTheHazard
Mar 11, 2021
Magnetoninja
2 hours ago
Practice AMC 12A
freddyfazbear   50
N 2 hours ago by fake123
Practice AMC 12A

1. Find the sum of the infinite geometric series 1 + 7/18 + 49/324 + …
A - 36/11, B - 9/22, C - 18/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. 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

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

5. 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 - 63/1024, B - 63/512, C - 63/256, D - 63/128, E - 0

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

7. Find the value of 0.9 * 0.97 + 0.5 * 0.1 * (0.5 * 0.97 + 0.5 * 0.2) rounded to the nearest tenth of a percent.
A - 89.9%, B - 90.0%, C - 90.1%, D - 90.2%, E - 90.3%

8. Two painters are painting a room. Painter 1 takes 52:36 to paint the room, and painter 2 takes 26:18 to paint the room. With these two painters working together, how long should the job take?
A - 9:16, B - 10:52, C - 17:32, D - 35:02, E - 39:44

9. Statistics show that people who work out n days a week have a (1/10)(n+2) chance of getting a 6-pack, and the number of people who exercise 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 is selected. Find the probability that they have a 6-pack.
A - 13/30, B - 17/30, C - 19/30, D - 23/30, E - 29/30

10. A factory must produce 3,000 items today. The manager of the factory initially calls over 25 employees, each producing 5 items per hour starting at 9 AM. However, he needs all of the items to be produced by 9 PM, and realizes that he must speed up the process. At 12 PM, the manager then encourages his employees to work faster by increasing their pay, in which they then all speed up to 6 items per hour. At 1 PM, the manager calls in 15 more employees which make 5 items per hour each. Unfortunately, at 3 PM, the AC stops working and the hot sun starts taking its toll, which slows every employee down by 2 items per hour. At 4 PM, the technician fixes the AC, and all employees return to producing 5 items per hour. At 5 PM, the manager calls in 30 more employees, which again make 5 items per hour. At 6 PM, he calls in 30 more employees. At 7 PM, he rewards all the pickers again, speeding them up to 6 items per hour. But at 8 PM, n employees suddenly crash out and stop working due to fatigue, and the rest all slow back down to 5 items per hour because they are tired. The manager does not have any more employees, so if too many of them drop out, he is screwed and will have to go overtime. Find the maximum value of n such that all of the items can still be produced on time, done no later than 9 PM.
A - 51, B - 52, C - 53, D - 54, E - 55

11. Two congruent right rectangular prisms stand near each other. Both have the same orientation and altitude. A plane that cuts both prisms into two pieces passes through the vertical axes of symmetry of both prisms and does not cross the bottom or top faces of either prism. Let the point that the plane crosses the axis of symmetry of the first prism be A, and the point that the plane crosses the axis of symmetry of the second prism be B. A is 81% of the way from the bottom face to the top face of the first prism, and B is 69% of the way from the bottom face to the top face of the second prism. What percent of the total volume of both prisms combined is above the plane?
A - 19%, B - 25%, C - 50%, D - 75%, E - 81%

12. 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

13. 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

14. 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

15. 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 the shot?
A - 3/128, B - 3/64, C - 3/32, D - 3/16, E - 3/8

16. Amy purchases 6 fruits from a store. At the store, they have 5 of each of 5 different fruits. How many different combinations of fruits could Amy buy?
A - 210, B - 205, C - 195, D - 185, E - 180

17. Find the area of a cyclic quadrilateral with side lengths 6, 9, 4, and 2, rounded to the nearest integer.
A - 16, B - 19, C - 22, D - 25, E - 28

18. Find the slope of the line tangent to the graph of y = x^2 + x + 1 at the point (2, 7).
A - 2, B - 3, C - 4, D - 5, E - 6

19. Let f(n) = 4096n/(2^n). Find f(1) + f(2) + … + f(12).
A - 8142, B - 8155, C - 8162, D - 8169, E - 8178

20. Find the sum of all positive integers n greater than 1 and less than 16 such that (n-1)! + 1 is divisible by n.
A - 41, B - 44, C - 47, D - 50, E - 53

21. In a list of integers where every integer in the list ranges from 1 to 200, inclusive, and the chance of randomly drawing an integer n from the list is proportional to n if n <= 100 and to 201 - n if n >= 101, what is the sum of the numerator and denominator of the probability that a random integer drawn from the list is greater than 30, when expressed as a common fraction in lowest terms?
A - 1927, B - 2020, C - 2025, D - 3947, E - 3952

22. In a small town, there were initially 9 people who did not have a certain bacteria and 3 people who did. Denote this group to be the first generation. Then those 12 people would randomly get into 6 pairs and reproduce, making the second generation, consisting of 6 people. Then the process repeats for the second generation, where they get into 3 pairs. Of the 3 people in the third generation, what is the probability that exactly one of them does not have the bacteria? Assume that if at least one parent has the bacteria, then the child is guaranteed to get it.
A - 8/27, B - 1/3, C - 52/135, D - 11/27, E - 58/135

23. Amy, Steven, and Melissa each start at the point (0, 0). Assume the coordinate axes are in miles. At t = 0, Amy starts walking along the x-axis in the positive x direction at 0.6 miles per hour, Steven starts walking along the y-axis in the positive y direction at 0.8 miles per hour, and Melissa starts walking along the x-axis in the negative x direction at 0.4 miles per hour. However, a club that does not like them patrols the circumference of the circle x^2 + y^2 = 1. Three officers of the club, equally spaced apart on the circumference of the circle, walk counterclockwise along its circumference and make one revolution every hour. At t = 0, one of the officers of the club is at (1, 0). Any of Amy, Steven, and Melissa will be caught by the club if they walk within 50 meters of one of their 3 officers. How many of the three will be caught by the club?
A - 0, B - 1, C - 2, D - 3, E - Not enough info to determine

24.
A list of 9 positive integers consists of 100, 112, 122, 142, 152, and 160, as well as a, b, and c, with a <= b <= c. The range of the list is 70, both the mean and median are multiples of 10, and the list has a unique mode. How many ordered triples (a, b, c) are possible?
A - 1, B - 2, C - 3, D - 4, E - 5

25. What is the integer closest to the value of tan(83)? (The 83 is in degrees)
A - 2, B - 3, C - 4, D - 6, E - 8
50 replies
freddyfazbear
Mar 28, 2025
fake123
2 hours ago
Erecting Rectangles
franchester   102
N Mar 26, 2025 by endless_abyss
Source: 2021 USAMO Problem 1/2021 USAJMO Problem 2
Rectangles $BCC_1B_2,$ $CAA_1C_2,$ and $ABB_1A_2$ are erected outside an acute triangle $ABC.$ Suppose that \[\angle BC_1C+\angle CA_1A+\angle AB_1B=180^{\circ}.\]Prove that lines $B_1C_2,$ $C_1A_2,$ and $A_1B_2$ are concurrent.
102 replies
franchester
Apr 15, 2021
endless_abyss
Mar 26, 2025
Erecting Rectangles
G H J
G H BBookmark kLocked kLocked NReply
Source: 2021 USAMO Problem 1/2021 USAJMO Problem 2
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
franchester
1487 posts
#1 • 14 Y
Y by FaThEr-SqUiRrEl, vvluo, samrocksnature, icematrix2, megarnie, mathleticguyyy, mathlearner2357, centslordm, HWenslawski, Lamboreghini, jmiao, Rounak_iitr, Mr_GermanCano, MS_asdfgzxcvb
Rectangles $BCC_1B_2,$ $CAA_1C_2,$ and $ABB_1A_2$ are erected outside an acute triangle $ABC.$ Suppose that \[\angle BC_1C+\angle CA_1A+\angle AB_1B=180^{\circ}.\]Prove that lines $B_1C_2,$ $C_1A_2,$ and $A_1B_2$ are concurrent.
This post has been edited 1 time. Last edited by franchester, Apr 15, 2021, 5:18 PM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Orestis_Lignos
555 posts
#2 • 15 Y
Y by FaThEr-SqUiRrEl, samrocksnature, A-Thought-Of-God, srijonrick, icematrix2, mijail, megarnie, Creative_Username123, rayfish, Matherer9654, Lamboreghini, jmiao, fura3334, Mr_GermanCano, Tem8
Let the circumcircles of $BB_2C_1C$ and $AA_1C_2C$ meet again at $P$.

Claim: $P$ belongs to the circumcircle of $ABB_1A_2$.
Proof: Note that $$\angle APB=360^\circ-\angle APC-\angle BPC=\angle AA_1C+\angle BC_1C=180^\circ-\angle AB_1B$$hence $P$ belongs to circumcircle of $AB_1B$ as well $\blacksquare$

Hence, the three circles concur at $P$. Now,
$$\angle APA_2+\angle APC+\angle CPC_1=\angle AB_1A_2+180^\circ-\angle AA_1C+\angle CBC_1=90^\circ-\angle AB_1B+180^\circ-\angle AA_1C+90^\circ-\angle BC_1C=180^\circ,$$so $P$ belongs to $A_2C_1$ and similarly it belongs to $A_1B_2$ and $B_2C_1$, so we are done.
This post has been edited 1 time. Last edited by Orestis_Lignos, Apr 15, 2021, 5:08 PM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
ppanther
160 posts
#4 • 10 Y
Y by FaThEr-SqUiRrEl, samrocksnature, A-Thought-Of-God, srijonrick, icematrix2, timgu, jmiao, Math4Life7, Mr_GermanCano, ihatemath123
[asy]
size(8cm); defaultpen(fontsize(9pt)); pair A = dir(120), B = dir(180+30), C = dir(-30), P = (A+B+C)/2, D = circumcenter(B,P,C), E = circumcenter(A,P,C), F = circumcenter(A,P,B), B2=2*D-C, C1=2*D-B, C2=2*E-A, A1=2*E-C, A2=2*F-B, B1=2*F-A; draw(A--B--C--cycle, red+linewidth(1)); draw(A--A2--B1--B--B2--C1--C--C2--A1--A, lightblue); draw(circumcircle(B, P, C)^^circumcircle(A, P, C)^^circumcircle(A, P, B), deepcyan); draw(A1--B2, orange+dashed); string[] names = {"$A$", "$B$", "$C$", "$A_1$", "$B_1$", "$C_1$", "$A_2$", "$B_2$", "$C_2$", "$P$"}; pair[] points = {A, B, C, A1, B1, C1, A2, B2, C2, P}; pair[] ll = {dir(110), B, dir(-25), A1, B1, C1, A2, B2, C2, dir(-90)}; for (int i=0; i<names.length; ++i) dot(names[i], points[i], dir(ll[i]));
[/asy]

Claim. The circumcircles of the three rectangles $BCC_1B_2$, $CAA_1C_2$, and $ABB_1A_2$ concur at a point $P$.

Proof. Let $(CAA_1C_2)$ and $(ABB_1A_2)$ intersect again at $P \neq A$. We will show that $P$ also lies on $(BCC_1B_2)$. Indeed, we have
\[
\angle APC = 180^\circ - \angle CA_1A \quad \text{and} \quad \angle BPA = 180^\circ - \angle AB_1B.
\]Therefore,
\begin{align*}
\angle CPB &= 360^\circ - \angle APC - \angle BPA \\ &= \angle CA_1A + \angle AB_1B \\ &= 180^\circ - \angle BC_1C,
\end{align*}as claimed. $\blacksquare$

Claim. $A_1,P,B_2$ are collinear; similarly, so are $B_1,P,C_2$ and $C_1,P,A_2$.

Proof. We compute
\begin{align*}
\angle A_1PB_2 &= \angle A_1PA + \angle APB + \angle BPB_2 \\ &= \angle A_1CA + (180^\circ - \angle AB_1B) + \angle BC_1B_2 \\ &= (90^\circ - \angle CA_1A) + (180^\circ - \angle AB_1B) + (90^\circ - \angle BC_1C) \\ &= 360^\circ - (\angle CA_1A + \angle AB_1B + \angle BC_1C) \\ &= 180^\circ,
\end{align*}and analogous angle chases prove the other two collinearities. $\blacksquare$

The last claim reveals that $P$ is our desired point of concurrency, so we are done. $\square$
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
nikenissan
1943 posts
#5 • 3 Y
Y by FaThEr-SqUiRrEl, samrocksnature, icematrix2
This was also Problem 2 on JMO.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
mathisawesome2169
1823 posts
#6 • 7 Y
Y by FaThEr-SqUiRrEl, samrocksnature, icematrix2, mango5, mathlearner2357, aidan0626, ninjaforce
first four words of my solution
:coolspeak: :dry: it's actually nicer than you would expect though :huh:
I did initially try to complex bash this, but that didn't exactly work... :rotfl:
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
bryanguo
1032 posts
#7 • 5 Y
Y by FaThEr-SqUiRrEl, samrocksnature, icematrix2, centslordm, Mango247
Sketch: Construct circumcircles of the rectangles, you will find the circumcircles mutually concur at a certain point (shown with angle chasing). Then with basic cyclic quadrilateral properties we can find the lines will all concur at that certain point, meaning they're concurrent.

(full solution coming soon)
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Awesome_360
210 posts
#8 • 7 Y
Y by FaThEr-SqUiRrEl, samrocksnature, icematrix2, Justpassingby, centslordm, jmiao, Rounak_iitr
[asy]
defaultpen(fontsize(10pt));
dotfactor*=1.2;
size(300);
pair A,B,C,A1,A2,B1,B2,C1,C2,X;
A = dir(120);
B = dir(210);
C = dir(330);
A1 = extension(dir(150),A,dir(10),C);
C1 = extension(dir(-70),B,dir(30),C);
X = intersectionpoints(circumcircle(A,C,A1),circumcircle(B,C,C1))[0];
A2 = intersectionpoints(C1--extension(C1,X,(10,10),(-10,10)),circumcircle(A,B,X))[1];
B1 = rotate(180,(B+A2)/2)*A; 
B2 = rotate(180,(B+C1)/2)*C;
C2 = rotate(180,(C+A1)/2)*A; 

pen r = red;

filldraw(A--B--C--cycle,r+white+white+white+white,r); 
filldraw(B--B2--C1--C--cycle,r+white+white+white+white+white+white+white,r); filldraw(A--A1--C2--C--cycle,r+white+white+white+white+white+white+white,r); filldraw(A--A2--B1--B--cycle,r+white+white+white+white+white+white+white,r); 
draw(circumcircle(A,B,B1)^^circumcircle(A,C,A1)^^circumcircle(B,C,C1),orange+orange+red);
draw(A1--B2^^B1--C2^^A2--C1,red+linewidth(1.05));  draw(A--X^^B--X^^C--X,fuchsia); draw(A--A2--B1--B--B2--C1--C--C2--A1--A, r);



dot("$A$",A,dir(125));
dot("$B$",B,dir(215));
dot("$C$",C,dir(315));
dot("$A_1$",A1,dir(A1));
dot("$B_1$",B1,dir(B1));
dot("$C_1$",C1,dir(C1));
dot("$X$",X,dir(280));
dot("$A_2$",A2,dir(A2));
dot("$B_2$",B2,dir(B2));
dot("$C_2$",C2,dir(C2));


[/asy]

Claim: $(BCC_1B_2), (ABB_1A_2), (CAA_1C_2)$ concur at a point $X$.

Proof: Let the second intersection of $(ABB_1A_2)$ and $(BCC_1B_2)$ be $X$. Note that $\angle AXB = 180^{\circ} - \angle AB_1B$ and $\angle BXC = 180^{\circ} - \angle BC_1C$, implying that $\angle AXC =360^{\circ} - \angle AXB - \angle BXC = 180^{\circ} - \angle AA_1C$.

Claim: $X\in B_1C_2$.

Proof: We have that $\angle AXB_1 = 90^{\circ} = \angle AXC_2$, implying the collinearity.

Similarly, $X\in A_2C_1, A_1B_2$, as needed.
This post has been edited 1 time. Last edited by Awesome_360, Apr 15, 2021, 10:27 PM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
SnowPanda
186 posts
#9 • 4 Y
Y by FaThEr-SqUiRrEl, samrocksnature, icematrix2, megarnie
Solution
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
divij04
6 posts
#10 • 6 Y
Y by JNEW, FaThEr-SqUiRrEl, samrocksnature, icematrix2, megarnie, lrjr24
Possible complex bash motivation: If $\frac{C_1C}{CB}=k$, $\frac{A_1A}{AC}=l$, and $\frac{B_1B}{BA}=m$, then the angle condition implies that $kl+lm+mk=1$ (complex bash didn't actually pan out for me lol i went with a synthetic solution).
This post has been edited 2 times. Last edited by divij04, Apr 15, 2021, 5:24 PM
Reason: more typo
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
hliu1
939 posts
#11 • 3 Y
Y by FaThEr-SqUiRrEl, samrocksnature, icematrix2
circleless solution outline (srry don't have time to write out in full)
This post has been edited 1 time. Last edited by hliu1, Apr 16, 2021, 3:24 PM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
brianzjk
1201 posts
#12 • 3 Y
Y by FaThEr-SqUiRrEl, samrocksnature, icematrix2
The key of this problem is noticing that the concurrency point, $P$, lies on the circumcircles of $BCC_1B_2$, $CAA_2C_2$, and $ABB_1A_2$. We first prove that the three circumcircles are indeed concurrent, and then show that the concurrency implies the problem.

[asy]
 /* Geogebra to Asymptote conversion, documentation at artofproblemsolving.com/Wiki go to User:Azjps/geogebra */
import graph; size(10cm); 
real labelscalefactor = 0.5; /* changes label-to-point distance */
pen dps = linewidth(0.7) + fontsize(10); defaultpen(dps); /* default pen style */ 
pen dotstyle = black; /* point style */ 
real xmin = -16.852914910450526, xmax = 34.390095350576566, ymin = -8.12314938684212, ymax = 18.42519130633257;  /* image dimensions */

pair A = (3.,8.), B = (2.,0.), C = (10.,0.), B_2 = (2.,-4.), C_1 = (10.,-4.), C_2 = (17.908680279445264,6.920095244514606), A_1 = (10.908680279445264,14.920095244514606), B_1 = (-0.7171913168911064,0.33964891461138835), A_2 = (0.2828086831088937,8.33964891461139), P = (4.993661449478577,2.357439927495782); 
 /* draw figures */
draw(A--B, linewidth(1.)); 
draw(B--C, linewidth(1.)); 
draw(C--A, linewidth(1.)); 
draw(B--B_2, linewidth(1.)); 
draw(B_2--C_1, linewidth(1.)); 
draw(C_1--C, linewidth(1.)); 
draw(A--A_1, linewidth(1.)); 
draw(A_1--C_2, linewidth(1.)); 
draw(C_2--C, linewidth(1.)); 
draw(B_1--B, linewidth(1.)); 
draw(A--A_2, linewidth(1.)); 
draw(A_2--B_1, linewidth(1.)); 
draw(circle((1.141404341554447,4.169824457305695), 4.257302257233597), linewidth(1.)); 
draw(circle((6.,-2.), 4.47213595499958), linewidth(1.)); 
draw(circle((10.454340139722632,7.460047622257303), 7.473870181432778), linewidth(1.)); 
draw(A_2--C_1, linewidth(1.)); 
draw(B_2--A_1, linewidth(1.)); 
draw(B_1--C_2, linewidth(1.)); 
draw(B--P, linewidth(1.)); 
draw(P--A, linewidth(1.)); 
draw(P--C, linewidth(1.)); 
 /* dots and labels */
dot(A,dotstyle); 
label("$A$", (2.3,8.465636277058753), NE * labelscalefactor); 
dot(B,dotstyle); 
label("$B$", (2,-0.8), NE * labelscalefactor); 
dot(C,dotstyle); 
label("$C$", (9.852516556056544,0.3911705277736686), NE * labelscalefactor); 
dot(B_2,dotstyle); 
label("$B_2$", (0.9,-4.6), NE * labelscalefactor); 
dot(C_1,dotstyle); 
label("$C_1$", (10.166698102721334,-4.415807136197607), NE * labelscalefactor); 
dot(C_2,dotstyle); 
label("$C_2$", (18.398254625338808,6.674801461069453), NE * labelscalefactor); 
dot(A_1,linewidth(4.pt) + dotstyle); 
label("$A_1$", (10.763643041384432,15.3), NE * labelscalefactor); 
dot(B_1,linewidth(4.pt) + dotstyle); 
label("$B_1$", (-1.395182814542903,-0.6), NE * labelscalefactor); 
dot(A_2,linewidth(4.pt) + dotstyle); 
label("$A_2$", (-0.20129293721670466,8.81123597839002), NE * labelscalefactor); 
dot(P,linewidth(4.pt) + dotstyle); 
label("$P$", (4.6,1.3), NE * labelscalefactor); 
clip((xmin,ymin)--(xmin,ymax)--(xmax,ymax)--(xmax,ymin)--cycle); 
 /* end of picture */
[/asy]

We let $P$ be $(BCC_1B_2)\cap (CAA_2C_2)$, and we wish to show that $P$ does indeed lie on $(ABB_1C_2)$. But note that
\begin{align*}
\angle AB_1B&=180^\circ-(\angle BC_1C+\angle CA_1A)\\
&=\angle BPC+\angle APC-180^\circ\\
&=180^\circ - \angle APB
\end{align*}which is what we wanted.

Now, we show that $A_2PC_1$ is collinear. But this is clear from
\[\angle A_2PB=\angle BPC_1=90^\circ\]Similarly, $P$ lies on $B_2A_1$ and $B_1C_2$, so we are done.

Remarks + Motivation: This problem is definitely an ``Art School" problem, because its very hard to synthetic this without guessing the circumcircles (at least in my opinion). It does kind of feel like IMO 2020/1, in the sense that both of them have a very weird contrived angle condition, and they are both about ``guess the point". Once you notice the cyclic quads, it's basically given that you set $P$ as the intersections of 2 circles, and the way you prove the cyclic is super obvious by the angle conditions. After that, it's just 2 90 degree angles, and you win.
This post has been edited 2 times. Last edited by brianzjk, Apr 16, 2021, 4:45 PM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
freeman66
452 posts
#13 • 3 Y
Y by Zorger74, samrocksnature, icematrix2
Solution: https://yu-dylan.github.io/Writeups/USAMO-2021-1.pdf
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
IAmTheHazard
5000 posts
#14 • 4 Y
Y by samrocksnature, FaThEr-SqUiRrEl, icematrix2, centslordm
I am literally so bad at geometry. Spent 2 hours on this one.
With 30 minutes left on the contest, I decided to write my observation that if the lines concurred then the concurrency point was concyclic with $(BCC_1B_2),(CAA_1C_2),(ABB_1A_2)$, thinking I'd get a bit of partial. After writing it, I realized that I had a proof and, with 20 minutes left, proceeded to write the rest of the solution.
If MAA decides to implement style score tiebreakers this year I'm probably dead.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
bryanguo
1032 posts
#15 • 5 Y
Y by samrocksnature, icematrix2, centslordm, Mango247, Rounak_iitr
Solution: We begin by constructing a diagram:
[asy]
import olympiad;
unitsize(13);
 /* Geogebra to Asymptote conversion, documentation at artofproblemsolving.com/Wiki go to User:Azjps/geogebra */
import graph; size(0cm); 
real labelscalefactor = 0.5; /* changes label-to-point distance */
pen dps = linewidth(0.7) + fontsize(10); defaultpen(dps); /* default pen style */ 
pen dotstyle = black; /* point style */ 
real xmin = -10.252427827191417, xmax = 15.150472936867494, ymin = -3.4167712881064825, ymax = 11.241299387760378;  /* image dimensions */
pen cqcqcq = rgb(0.7529411764705882,0.7529411764705882,0.7529411764705882); 
 /* draw figures */
draw(circle((0.2801492142784242,1.5), 4.481884633503346)); 
draw(circle((3.2738086301390403,7.2491118286162095), 3.3297516312587083)); 
draw((-3.454001382502029,3.9785901614824524)--(4,4)); 
draw((4,4)--(4,-1)); 
draw((4,-1)--(-3.420838326674272,-1.0456127964221371)); 
draw((-3.420838326674272,-1.0456127964221371)--(-3.454001382502029,3.9785901614824524)); 
draw((-3.454001382502029,3.9785901614824524)--(0.06810107679554245,8.14949230836156)); 
draw((-3.454001382502029,3.9785901614824524)--(-5.709089178789237,5.8523028157505035)); 
draw((-5.709089178789237,5.8523028157505035)--(-2,10)); 
draw((0.06810107679554245,8.14949230836156)--(-2,10)); 
draw((0.06810107679554245,8.14949230836156)--(4,4)); 
draw((0.06810107679554245,8.14949230836156)--(2.3992779710964074,10.461967575808181)); 
draw((-3.454001382502029,3.9785901614824524)--(4,-1)); 
draw((4,4)--(2.3992779710964074,10.461967575808181)); 
draw((0.06810107679554245,8.14949230836156)--(-5.709089178789237,5.8523028157505035)); 
draw((4,-1)--(-2,10)); 
draw((2.3992779710964074,10.461967575808181)--(-3.420838326674272,-1.0456127964221371)); 
draw((2.3992779710964074,10.461967575808181)--(6.428589254168415,6.183933374028034)); 
draw((6.428589254168415,6.183933374028034)--(4,4)); 
draw(circle((-2.820834296659645,7.001753244155373), 3.108577255193373)); 
draw((-5.709089178789237,5.8523028157505035)--(6.428589254168415,6.183933374028034)); 
draw((-3.454001382502029,3.9785901614824524)--(0.1949568576384766,5.981074885605413)); 
draw((4.000284475054789,3.9995766660700363)--(0.1949568576384766,5.981074885605413)); 
draw((0.06810107679554245,8.14949230836156)--(0.1949568576384766,5.981074885605413)); 
 /* dots and labels */
dot((6.428589254168415,6.183933374028034),dotstyle); 
label("$C_{2}$", (6.494915365823923,6.349748653166799), NE * labelscalefactor); 
dot((4,-1),dotstyle); 
label("$C_{1}$", (4.074012290397943,-0.8300529335417423), NE * labelscalefactor); 
dot((-3.454001382502029,3.9785901614824524),dotstyle); 
label("$B$", (-3.387675270846515,4.144405440621219), NE * labelscalefactor); 
dot((4,4),dotstyle); 
label("$C$", (4.04084923457019,4.277057663932232), NE * labelscalefactor); 
dot((0.06810107679554245,8.14949230836156),dotstyle); 
label("$A$", (0.12760864689531848,8.322950474918107), NE * labelscalefactor); 
dot((2.3992779710964074,10.461967575808181),dotstyle); 
label("$A_{1}$", (2.4987671385796686,10.71069049451633), NE * labelscalefactor); 
dot((-3.420838326674272,-1.0456127964221371),dotstyle); 
label("$B_{2}$", (-3.354512215018762,-0.8797975172833719), NE * labelscalefactor); 
dot((-5.709089178789237,5.8523028157505035),dotstyle); 
label("$B_{1}$", (-5.908067513755754,6.3994932369084285), NE * labelscalefactor); 
dot((-2,10),dotstyle); 
label("$A_{2}$", (-1.7792670632004874,10.196663129186156), NE * labelscalefactor); 
dot((4.000284475054789,3.9995766660700363),linewidth(4pt) + dotstyle);  
dot((0.1949568576384766,5.981074885605413),linewidth(4pt) + dotstyle); 
label("$X$", (0.24367934229245447,6.117607262372528), NE * labelscalefactor); 
clip((xmin,ymin)--(xmin,ymax)--(xmax,ymax)--(xmax,ymin)--cycle); 
 /* end of picture */
 [/asy]
Claim 1: Circumcircles of $B_1A_2AB, AA_1C_2C,$ and $BCC_1B_2$ mutually intersect at some point $X.$

Proof: Start by letting $X$ be the intersection of two circumcircles such that $X \neq A.$ By some simple cyclic quad angle properties, we see \[ \angle AXC = 180^{\circ} - \angle AA_1C, \angle BXA = 180^{\circ} - \angle AB_1B.\]It follows that $\angle CXB = 180^{\circ} - BC_1C,$ and so our claim is proven.

Claim 2: Lines $B_1C_2, C_1A_2,$ and $A_1B_2$ concur at $X.$

Proof: We proceed with angle chasing. Note that \[\angle AA_1C_2= \angle AXC_2 = 90^{\circ}, \angle B_1A_2A = \angle AXB_1 = 90^{\circ},\]meaning $B_1, X, C_2,$ are collinear. Then, we may similarly obtain \[\angle BB_2C_1 = \angle BXC_1 = 90^{\circ}, \angle A_2B_1B = \angle A_2XB = 90^{\circ},\]meaning $A_2, X, C_1$ are collinear. Finally, we have \[\angle A_1C_2C = A_1XC=90^{\circ}, \angle CC_1B_2 = \angle B_2XC = 90^{\circ},\]meaning $A_1, X , B_2$ are collinear. Putting these three results together, it is clear that $B_1C_2, C_1A_2,$ and $A_1B_2$ are concurrent at $X. \qquad \square$
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
rcorreaa
238 posts
#16 • 4 Y
Y by samrocksnature, icematrix2, caicasso, MathFan335
Cute problem! ;)

Let $P= (AB_1B) \cap (AA_1C)$, with $P \neq A$. Observe that $\angle BPA+ \angle CPA= 180º- \angle AB_1B+ 180º - \angle AA_1C= 360º-(\angle AB_1B + \angle AA_1C)=180º+ \angle BC_1C$, by the problem's condition. Hence, $\angle BPC= 360º- \angle BPA - \angle CPA= 180º- \angle BC_1C$, so $P$ lies on $(BC_1C)$.

Now, obseve that since $(AB_1B),(AA_1C)$ have diameter $AB_1,AC_2$, respectively (since $AA_2B_1B$ and $AA_1C_2C$ are rectangles), then $\angle APB_1+ \angle APC_2= 90º+90º= 180º$, so $P$ lies on $B_1C_2$. Similarly, $P$ lies on $C_1A_2$ and $A_1B_2$, so we are done.

$\blacksquare$
Z K Y
G
H
=
a