Plan ahead for the next school year. Schedule your class 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 July Highlights and 2025 AoPS Online Class Information
jwelsh   0
Jul 1, 2025
We are halfway through summer, so be sure to carve out some time to keep your skills sharp and explore challenging topics at AoPS Online and our AoPS Academies (including the Virtual Campus)!

[list][*]Over 60 summer classes are starting at the Virtual Campus on July 7th - check out the math and language arts options for middle through high school levels.
[*]At AoPS Online, we have accelerated sections where you can complete a course in half the time by meeting twice/week instead of once/week, starting on July 8th:
[list][*]MATHCOUNTS/AMC 8 Basics
[*]MATHCOUNTS/AMC 8 Advanced
[*]AMC Problem Series[/list]
[*]Plus, AoPS Online has a special seminar July 14 - 17 that is outside the standard fare: Paradoxes and Infinity
[*]We are expanding our in-person AoPS Academy locations - are you looking for a strong community of problem solvers, exemplary instruction, and math and language arts options? Look to see if we have a location near you and enroll in summer camps or academic year classes today! New locations include campuses in California, Georgia, New York, Illinois, and Oregon and more coming soon![/list]

MOP (Math Olympiad Summer Program) just ended and the IMO (International Mathematical Olympiad) is right around the corner! This year’s IMO will be held in Australia, July 10th - 20th. Congratulations to all the MOP students for reaching this incredible level and best of luck to all selected to represent their countries at this year’s IMO! Did you know that, in the last 10 years, 59 USA International Math Olympiad team members have medaled and have taken over 360 AoPS Online courses. Take advantage of our Worldwide Online Olympiad Training (WOOT) courses
and train with the best! Please note that early bird pricing ends August 19th!
Are you tired of the heat and thinking about Fall? You can plan your Fall schedule now with classes at either AoPS Online, AoPS Academy Virtual Campus, or one of our AoPS Academies around the US.

Our full course list for upcoming classes is below:
All classes start 7:30pm ET/4:30pm PT unless otherwise noted.

Introductory: Grades 5-10

Prealgebra 1 Self-Paced

Prealgebra 1
Wednesday, Jul 16 - Oct 29
Sunday, Aug 17 - Dec 14
Tuesday, Aug 26 - Dec 16
Friday, Sep 5 - Jan 16
Monday, Sep 8 - Jan 12
Tuesday, Sep 16 - Jan 20 (4:30 - 5:45 pm ET/1:30 - 2:45 pm PT)
Sunday, Sep 21 - Jan 25
Thursday, Sep 25 - Jan 29
Wednesday, Oct 22 - Feb 25
Tuesday, Nov 4 - Mar 10
Friday, Dec 12 - Apr 10

Prealgebra 2 Self-Paced

Prealgebra 2
Friday, Jul 25 - Nov 21
Sunday, Aug 17 - Dec 14
Tuesday, Sep 9 - Jan 13
Thursday, Sep 25 - Jan 29
Sunday, Oct 19 - Feb 22
Monday, Oct 27 - Mar 2
Wednesday, Nov 12 - Mar 18

Introduction to Algebra A Self-Paced

Introduction to Algebra A
Tuesday, Jul 15 - Oct 28
Sunday, Aug 17 - Dec 14
Wednesday, Aug 27 - Dec 17
Friday, Sep 5 - Jan 16
Thursday, Sep 11 - Jan 15
Sunday, Sep 28 - Feb 1
Monday, Oct 6 - Feb 9
Tuesday, Oct 21 - Feb 24
Sunday, Nov 9 - Mar 15
Friday, Dec 5 - Apr 3

Introduction to Counting & Probability Self-Paced

Introduction to Counting & Probability
Wednesday, Jul 2 - Sep 17
Sunday, Jul 27 - Oct 19
Monday, Aug 11 - Nov 3
Wednesday, Sep 3 - Nov 19
Sunday, Sep 21 - Dec 14 (1:00 - 2:30 pm ET/10:00 - 11:30 am PT)
Friday, Oct 3 - Jan 16
Sunday, Oct 19 - Jan 25
Tuesday, Nov 4 - Feb 10
Sunday, Dec 7 - Mar 8

Introduction to Number Theory
Tuesday, Jul 15 - Sep 30
Wednesday, Aug 13 - Oct 29
Friday, Sep 12 - Dec 12
Sunday, Oct 26 - Feb 1
Monday, Dec 1 - Mar 2

Introduction to Algebra B Self-Paced

Introduction to Algebra B
Friday, Jul 18 - Nov 14
Thursday, Aug 7 - Nov 20
Monday, Aug 18 - Dec 15
Sunday, Sep 7 - Jan 11
Thursday, Sep 11 - Jan 15
Wednesday, Sep 24 - Jan 28
Sunday, Oct 26 - Mar 1
Tuesday, Nov 4 - Mar 10
Monday, Dec 1 - Mar 30

Introduction to Geometry
Monday, Jul 14 - Jan 19
Wednesday, Aug 13 - Feb 11
Tuesday, Aug 26 - Feb 24
Sunday, Sep 7 - Mar 8
Thursday, Sep 11 - Mar 12
Wednesday, Sep 24 - Mar 25
Sunday, Oct 26 - Apr 26
Monday, Nov 3 - May 4
Friday, Dec 5 - May 29

Paradoxes and Infinity
Mon, Tue, Wed, & Thurs, Jul 14 - Jul 16 (meets every day of the week!)
Sat & Sun, Sep 13 - Sep 14 (1:00 - 4:00 PM PT/4:00 - 7:00 PM ET)

Intermediate: Grades 8-12

Intermediate Algebra
Sunday, Jul 13 - Jan 18
Thursday, Jul 24 - Jan 22
Friday, Aug 8 - Feb 20
Tuesday, Aug 26 - Feb 24
Sunday, Sep 28 - Mar 29
Wednesday, Oct 8 - Mar 8
Sunday, Nov 16 - May 17
Thursday, Dec 11 - Jun 4

Intermediate Counting & Probability
Sunday, Sep 28 - Feb 15
Tuesday, Nov 4 - Mar 24

Intermediate Number Theory
Wednesday, Sep 24 - Dec 17

Precalculus
Wednesday, Aug 6 - Jan 21
Tuesday, Sep 9 - Feb 24
Sunday, Sep 21 - Mar 8
Monday, Oct 20 - Apr 6
Sunday, Dec 14 - May 31

Advanced: Grades 9-12

Calculus
Sunday, Sep 7 - Mar 15
Wednesday, Sep 24 - Apr 1
Friday, Nov 14 - May 22

Contest Preparation: Grades 6-12

MATHCOUNTS/AMC 8 Basics
Tues & Thurs, Jul 8 - Aug 14 (meets twice a week!)
Sunday, Aug 17 - Nov 9
Wednesday, Sep 3 - Nov 19
Tuesday, Sep 16 - Dec 9
Sunday, Sep 21 - Dec 14 (1:00 - 2:30 pm ET/10:00 - 11:30 am PT)
Monday, Oct 6 - Jan 12
Thursday, Oct 16 - Jan 22
Tues, Thurs & Sun, Dec 9 - Jan 18 (meets three times a week!)

MATHCOUNTS/AMC 8 Advanced
Tues & Thurs, Jul 8 - Aug 14 (meets twice a week!)
Sunday, Aug 17 - Nov 9
Tuesday, Aug 26 - Nov 11
Thursday, Sep 4 - Nov 20
Friday, Sep 12 - Dec 12
Monday, Sep 15 - Dec 8
Sunday, Oct 5 - Jan 11
Tues, Thurs & Sun, Dec 2 - Jan 11 (meets three times a week!)
Mon, Wed & Fri, Dec 8 - Jan 16 (meets three times a week!)

AMC 10 Problem Series
Tues & Thurs, Jul 8 - Aug 14 (meets twice a week!)
Sunday, Aug 10 - Nov 2
Thursday, Aug 14 - Oct 30
Tuesday, Aug 19 - Nov 4
Mon & Wed, Sep 15 - Oct 22 (meets twice a week!)
Mon, Wed & Fri, Oct 6 - Nov 3 (meets three times a week!)
Tue, Thurs & Sun, Oct 7 - Nov 2 (meets three times a week!)

AMC 10 Final Fives
Friday, Aug 15 - Sep 12
Sunday, Sep 7 - Sep 28
Tuesday, Sep 9 - Sep 30
Monday, Sep 22 - Oct 13
Sunday, Sep 28 - Oct 19 (1:00 - 2:30 pm ET/10:00 - 11:30 am PT)
Wednesday, Oct 8 - Oct 29
Thursday, Oct 9 - Oct 30

AMC 12 Problem Series
Wednesday, Aug 6 - Oct 22
Sunday, Aug 10 - Nov 2
Monday, Aug 18 - Nov 10
Mon & Wed, Sep 15 - Oct 22 (meets twice a week!)
Tues, Thurs & Sun, Oct 7 - Nov 2 (meets three times a week!)

AMC 12 Final Fives
Thursday, Sep 4 - Sep 25
Sunday, Sep 28 - Oct 19
Tuesday, Oct 7 - Oct 28

AIME Problem Series A
Thursday, Oct 23 - Jan 29

AIME Problem Series B
Tuesday, Sep 2 - Nov 18

F=ma Problem Series
Tuesday, Sep 16 - Dec 9
Friday, Oct 17 - Jan 30

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
Thursday, Aug 14 - Oct 30
Sunday, Sep 7 - Nov 23
Tuesday, Dec 2 - Mar 3

Intermediate Programming with Python
Friday, Oct 3 - Jan 16

USACO Bronze Problem Series
Wednesday, Sep 3 - Dec 3
Thursday, Oct 30 - Feb 5
Tuesday, Dec 2 - Mar 3

Physics

Introduction to Physics
Tuesday, Sep 2 - Nov 18
Sunday, Oct 5 - Jan 11
Wednesday, Dec 10 - Mar 11

Physics 1: Mechanics
Sunday, Sep 21 - Mar 22
Sunday, Oct 26 - Apr 26
0 replies
jwelsh
Jul 1, 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
IMO Shortlist 2012, Geometry 3
lyukhson   78
N 24 minutes ago by blueprimes
Source: IMO Shortlist 2012, Geometry 3
In an acute triangle $ABC$ the points $D,E$ and $F$ are the feet of the altitudes through $A,B$ and $C$ respectively. The incenters of the triangles $AEF$ and $BDF$ are $I_1$ and $I_2$ respectively; the circumcenters of the triangles $ACI_1$ and $BCI_2$ are $O_1$ and $O_2$ respectively. Prove that $I_1I_2$ and $O_1O_2$ are parallel.
78 replies
lyukhson
Jul 29, 2013
blueprimes
24 minutes ago
equal segments concerning circumcircle
parmenides51   5
N 35 minutes ago by Fly_into_the_sky
Source: IGO Elementary 2016 2
Let $\omega$ be the circumcircle of triangle $ABC$ with $AC > AB$. Let $X$ be a point on $AC$ and $Y$ be a point on the circle $\omega$, such that $CX = CY = AB$. (The points $A$ and $Y$ lie on different sides of the line $BC$). The line $XY$ intersects $\omega$ for the second time in point $P$. Show that $PB = PC$.

by Iman Maghsoudi
5 replies
parmenides51
Jul 22, 2018
Fly_into_the_sky
35 minutes ago
Peru IMO TST 2024
diegoca1   2
N an hour ago by RagvaloD
Source: Peru IMO TST 2024 D2 P2
Consider the system of equations:
\[
    \begin{cases} 
    b^2 + 1 = ac, \\ 
    c^2 + 1 = bd, 
    \end{cases}
    \qquad (1)
    \]where \( a, b, c, d \) are positive integers.
a) Prove that there are infinitely many positive integer solutions to system (1).
b) Prove that if \((a, b, c, d)\) is a solution of (1), then
\[
        a = 3b - c, \quad d = 3c - b.
        \]
2 replies
diegoca1
Yesterday at 11:30 PM
RagvaloD
an hour ago
Symmetric inequality
nexu   9
N an hour ago by Rhapsodies_pro
Source: own
Let $x,y,z \ge 0$. Prove that:
$$  \sum_{\mathrm{cyc}}{\left( y-z \right) ^2\left( 7x^2-y^2-z^2 \right) ^2}\ge 112\left( x-y \right) ^2\left( y-z \right) ^2\left( z-x \right) ^2. $$
9 replies
nexu
Feb 12, 2023
Rhapsodies_pro
an hour ago
Peru IMO TST 2023
diegoca1   3
N an hour ago by RagvaloD
Source: Peru IMO TST 2023 pre-selection P1
Let $x, y, z$ be non-negative real numbers such that $x + y + z \leq 1$. Prove the inequality
\[
6xyz \leq x(1 - x) + y(1 - y) + z(1 - z),
\]and determine when equality holds.
3 replies
diegoca1
Yesterday at 7:22 PM
RagvaloD
an hour ago
Four variables and n variables
Nguyenhuyen_AG   0
an hour ago
(1) Let $a,\,b,\,c,\,d$ be non-negative real numbers, such that
\[a+b+c+d = a^2+b^2+c^2+d^2.\]Prove that
\[ab+bc+ca+da+db+dc \geqslant a^2b^2+b^2c^2+c^2a^2+d^2a^2+d^2b^2+d^2c^2.\](2) Let $a_1,a_2,\ldots,n_n \, (n \geqslant 1)$ be non-negative real numbers, such that
\[\sum_{i=1}^{n} a_i = \sum_{i=1}^{n} a_i^2.\]Prove that
\[\left( \sum_{i=1}^{n} a_i \right)^2 - \sum_{i=1}^{n} a_i^2 \geqslant \left( \sum_{i=1}^{n} a_i^2 \right)^2 - \sum_{i=1}^{n} a_i^4 .\]
0 replies
Nguyenhuyen_AG
an hour ago
0 replies
A sequence must be bounded
math90   43
N an hour ago by Assassino9931
Source: IMO Shortlist 2017 A4
A sequence of real numbers $a_1,a_2,\ldots$ satisfies the relation
$$a_n=-\max_{i+j=n}(a_i+a_j)\qquad\text{for all}\quad n>2017.$$Prove that the sequence is bounded, i.e., there is a constant $M$ such that $|a_n|\leq M$ for all positive integers $n$.
43 replies
math90
Jul 10, 2018
Assassino9931
an hour ago
Tangent intersect intersect tangent intersect
cjquines0   7
N an hour ago by Fly_into_the_sky
Source: Iranian Geometry Olympiad 2016 Medium 2
Let two circles $C_1$ and $C_2$ intersect in points $A$ and $B$. The tangent to $C_1$ at $A$ intersects $C_2$ in $P$ and the line $PB$ intersects $C_1$ for the second time in $Q$ (suppose that $Q$ is outside $C_2$). The tangent to $C_2$ from $Q$ intersects $C_1$ and $C_2$ in $C$ and $D$, respectively. (The points $A$ and $D$ lie on different sides of the line $PQ$.) Show that $AD$ is the bisector of $\angle CAP$.

Proposed by Iman Maghsoudi
7 replies
cjquines0
May 26, 2017
Fly_into_the_sky
an hour ago
Iran geometry
Dadgarnia   20
N 2 hours ago by Aiden-1089
Source: Iranian TST 2020, second exam day 1, problem 3
Given a triangle $ABC$ with circumcircle $\Gamma$. Points $E$ and $F$ are the foot of angle bisectors of $B$ and $C$, $I$ is incenter and $K$ is the intersection of $AI$ and $EF$. Suppose that $T$ be the midpoint of arc $BAC$. Circle $\Gamma$ intersects the $A$-median and circumcircle of $AEF$ for the second time at $X$ and $S$. Let $S'$ be the reflection of $S$ across $AI$ and $J$ be the second intersection of circumcircle of $AS'K$ and $AX$. Prove that quadrilateral $TJIX$ is cyclic.

Proposed by Alireza Dadgarnia and Amir Parsa Hosseini
20 replies
Dadgarnia
Mar 11, 2020
Aiden-1089
2 hours ago
D1053 : Set of Dirichlet
Dattier   1
N 2 hours ago by Dattier
Source: les dattes à Dattier
We say a set $D$ have the Dirichlet propriety, if $\forall (a,b) \in (\mathbb N^*)^2,\gcd(a,b)=1, a<b$, $\text{card}(\{ n \in\mathbb N, n \mod b=a  \} \cap D)=+\infty$.

Let $D=\{d_1,....,d_n,...\}$ with $\forall i \in \mathbb N^*,d_{i+1}>d_{i}$ subset of $\mathbb N$ and have the Dirichlet propriety.


1) Is it true that $\lim \dfrac{d_{n+1}}{d_n}=1$ ?

2) Is it true that $\liminf \dfrac{d_{n+1}}{d_n}=1$ ?
1 reply
Dattier
Jul 22, 2025
Dattier
2 hours ago
USAJMO #5 - points on a circle
hrithikguy   234
N 2 hours ago by TPColor
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$.
234 replies
hrithikguy
Apr 28, 2011
TPColor
2 hours ago
Segment has Length Equal to Circumradius
djmathman   75
N Today at 5:36 AM by alexanderchew
Source: 2014 USAMO Problem 5
Let $ABC$ be a triangle with orthocenter $H$ and let $P$ be the second intersection of the circumcircle of triangle $AHC$ with the internal bisector of the angle $\angle BAC$. Let $X$ be the circumcenter of triangle $APB$ and $Y$ the orthocenter of triangle $APC$. Prove that the length of segment $XY$ is equal to the circumradius of triangle $ABC$.
75 replies
djmathman
Apr 30, 2014
alexanderchew
Today at 5:36 AM
OpenAI won gold on 2025 IMO
centslordm   137
N Today at 2:58 AM by Andyluo
it got 35/42
3 years ago it got 2; aura imo

[its solutions]
137 replies
centslordm
Jul 20, 2025
Andyluo
Today at 2:58 AM
The MathGauss 2025 Summer Math Competition (AMC/AIME Level)
MathandPhysics-Life   5
N Today at 2:55 AM by Andyluo
Hey AoPS Community,

*Pretty sure this is allowed in Contests and Programs, asked in the Site Support to make sure.

With the summer winding down, the team at MathGauss wanted to give everyone a chance to tackle one last big challenge before heading back to school. We are thrilled to announce our first-ever MathGauss 2025 Summer Math Competition! We've poured a lot of effort into creating a unique set of problems designed to be both fun and challenging for everyone who loves the thrill of competition math. :cool:

Why Participate?
This is more than just a contest; it's a perfect opportunity to:

Sharpen your skills: Get in some high-quality practice before the official fall competition season begins.

Test your knowledge: See how you stack up on problems ranging from the cleverness of AMC 10 to the deeper insights required for early to mid AIME.

Have fun: Enjoy a set of 10 creative problems in a low-pressure, high-reward environment.

Contest Format
Structure: You will have 45 minutes to solve 10 short-answer problems.

Difficulty & Style: The problems are crafted to test a broad range of skills, mirroring the style of official competitions. Expect to see questions that require clever thinking and elegant solutions. Ranges from early AMC 10 to mid AIME.

Answer Format: All answers are positive integers. There is no need to input units or any special formatting.

Scoring: Your final rank is determined by the number of correct answers. To break ties, we will use the time of your final submission(when you click the submit button). There is no penalty for incorrect guesses, so we encourage you to attempt every problem!

Prizes
We believe in rewarding hard work, so we've put together a great prize package for our top competitors!

Top 3 Finishers :first: : Receive a 6-month MathGauss Olympian Subscription completely free. This is your all-access pass to our most advanced training materials.

Places 4-10 : Receive a 50% discount on a yearlong MathGauss Olympian Subscription.

Places 11-20 : Receive a 25% discount on a one-month MathGauss Olympian Subscription.

Contest Window
The submission window is open! The contest officially closes on August 10th, 2025, at 12:00 AM Pacific Time. Make sure to give yourself enough time to complete your attempt before the deadline!

How to Participate :pilot:
Getting started is simple:

1. Navigate to the official contest page here(will be up soon): MathGauss Contest

2. Log in to your existing MathGauss account or create a new one.

3. Take the contest.

Crucially, please use your real email address when registering. This is the only way we can contact you to deliver your prize if you place in the top 20.

We're incredibly excited to see the clever solutions you all come up with. We hope you enjoy the challenge!

Good luck to everyone,
The MathGauss Team
5 replies
MathandPhysics-Life
Yesterday at 11:57 PM
Andyluo
Today at 2:55 AM
Integer Quadratic
mgao   25
N May 23, 2025 by megahertz13
Source: 2010 AIME II #10
Find the number of second-degree polynomials $ f(x)$ with integer coefficients and integer zeros for which $ f(0)=2010$.
25 replies
mgao
Apr 1, 2010
megahertz13
May 23, 2025
Integer Quadratic
G H J
Source: 2010 AIME II #10
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
mgao
1599 posts
#1 • 1 Y
Y by Adventure10
Find the number of second-degree polynomials $ f(x)$ with integer coefficients and integer zeros for which $ f(0)=2010$.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
BarbieRocks
1102 posts
#2 • 1 Y
Y by Adventure10
EDIT: You know what, disregard this post.
This post has been edited 1 time. Last edited by BarbieRocks, Apr 1, 2010, 5:21 PM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
AIME15
7892 posts
#3 • 3 Y
Y by abracadabra1234, Adventure10, and 1 other user
$ f(x) = a(x-r_1)(x-r_2)$, $ r_1, r_2 \in \mathbb{Z}$.

And $ f(0) = a \cdot r_1 \cdot r_2 = 2010$.

So we want to split $ 2010$ into three factors, which is easily done.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
SnowEverywhere
801 posts
#4 • 2 Y
Y by Adventure10, Mango247
I got $ 123 = 3/2(82)$. I guess that I was wrong... :(
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
RminusQ
171 posts
#5 • 4 Y
Y by Binomial-theorem, Adventure10, Mango247, and 1 other user
Let $ f(x) = a(x-r)(x-s)$. Then $ ars=2010=2\cdot3\cdot5\cdot67$. First consider the case where r and s (and thus a) are positive.
There are $ 3^4 = 81$ ways to split up the prime factors between a, r, and s. However, r and s are indistinguishable. In one case, $ (a,r,s) = (2010,1,1)$, we have $ r=s$. The other 80 cases are double counting, so there are 40.
This, sadly, is where I stopped during the contest, and wrote 041. However negative numbers and numbers, too.

We must now consider the various cases of signs. For the 40 cases where $ |r|\neq |s|$, there are a total of four possibilities, e.g. $ (r,s) = (2,3); (-2,3); (2,-3); (-2,-3)$. For the case $ |r|=|s|=1$, there are only three possibilities, $ (r,s) = (1,1); (1,-1); (-1,-1)$ as $ (-1,1)$ is not distinguishable from the second of those three.
Thus the grand total is $ 4\cdot40 + 3 = \underline{163}$
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
BarbieRocks
1102 posts
#6 • 2 Y
Y by Adventure10, Mango247
can you (or someone else) post some other problems?


Do I have to wait all the way 'till tomorrow's Math Jam?
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
PI-Dimension
824 posts
#7 • 2 Y
Y by Adventure10, Mango247
Can anyone find my mistake?

Click to reveal hidden text
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
RminusQ
171 posts
#8 • 2 Y
Y by Adventure10, Mango247
If I'm understanding correctly, your 2 * (2*2*2*2/2) * 2 comes from [2 options for a] * [2*2*2*2 factors of 2010/a] / [but they come in pairs] * [but b can be + or -], correct?

When a = 2010, there is one factor for 2010/a, namely one. It DOESN'T come in pairs, so you WOULDN'T have the /2 factor. You would still have the *2 at the end, BUT, one of your sum/differences is 0, which can't be + and -. In short, in the last case, you have three solutions, not two and not four.
2010x^2 + 4020x + 2010
2010x^2 - 4020x + 2010
-2010x^2 + 2010
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
FightTheTide
140 posts
#9 • 2 Y
Y by Adventure10, Mango247
Shouldn't there be an equal number with a negative lead coefficient as there are with a positive lead coefficient? I don't see how the answer can be odd.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Yongyi781
2142 posts
#10 • 3 Y
Y by Adventure10, Mango247, and 1 other user
$ -2010(x-1)(x+1)$ and $ -2010(x+1)(x-1)$ are the same polynomial but $ 2010(x-1)^2$ and $ 2010(x+1)^2$ are different polynomials.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
FightTheTide
140 posts
#11 • 2 Y
Y by Adventure10, Mango247
I had the same solution as PI-Dimension and I will be extremely ticked if I end up not making USAMO because I missed this problem by 1. I also guessed 219 on #15.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Vworldv
276 posts
#12 • 4 Y
Y by jh235, Adventure10, Mango247, and 1 other user
Just to comment, Burnside's Lemma makes it more obvious (almost no possibility of a casework mistake) that the answer is $ \frac{3^4+1}{2}+\frac{3^4+1}{2}+3^4$ -- it's just the group action of $ \mathbb{Z}_2$. If you don't know what Burnside's Lemma is, you should go learn it now. :)
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
yugrey
2326 posts
#13 • 1 Y
Y by Adventure10
wait, what if a is negative????
Oh, a is just a function of r and s; you can identify a solution by its r and s, you don't need to know what a is!
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Solid Snake
5 posts
#14 • 2 Y
Y by Adventure10, Mango247
Yeah, that's right.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
bigman
557 posts
#15 • 3 Y
Y by Adventure10, Mango247, and 1 other user
RminusQ wrote:
Let $ f(x) = a(x-r)(x-s)$. Then $ ars=2010=2\cdot3\cdot5\cdot67$. First consider the case where r and s (and thus a) are positive.
There are $ 3^4 = 81$ ways to split up the prime factors between a, r, and s. However, r and s are indistinguishable. In one case, $ (a,r,s) = (2010,1,1)$, we have $ r=s$. The other 80 cases are double counting, so there are 40.
This, sadly, is where I stopped during the contest, and wrote 041. However negative numbers and numbers, too.

We must now consider the various cases of signs. For the 40 cases where $ |r|\neq |s|$, there are a total of four possibilities, e.g. $ (r,s) = (2,3); (-2,3); (2,-3); (-2,-3)$. For the case $ |r|=|s|=1$, there are only three possibilities, $ (r,s) = (1,1); (1,-1); (-1,-1)$ as $ (-1,1)$ is not distinguishable from the second of those three.
Thus the grand total is $ 4\cdot40 + 3 = \underline{163}$

Ca you explain the $81$ and then the $40$?
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
viperstrike
1198 posts
#16 • 2 Y
Y by dasdhajskhd, Adventure10
This is hopefully a more understandable solution:

Click to reveal hidden text
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Amad271
186 posts
#17 • 2 Y
Y by Adventure10, Mango247
Why are $p$ and $q$ indistinguishable? They are different roots aren't they?
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
macandcheese
70 posts
#18 • 2 Y
Y by Adventure10, Mango247
If you switch the $p$ and $q$ values, you end up with the same polynomial. For example, if $a=1, p= 201, q= 10$ we have the polynomial $(x-201)(x-10)$. If we switch p and q we get $(x-10)(x-201)$. Since these are the same polynomial, and the question asks for the number of polynomials, $p$ and $q$ are indistinguishable.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Wave-Particle
3690 posts
#19 • 1 Y
Y by Adventure10
Amad271 wrote:
Why are $p$ and $q$ indistinguishable? They are different roots aren't they?

great answer by macandcheese but just incase it wasn't clear, here is my answer:

Yes $p$ and $q$ are indistinguishable (they are both roots, it doesn't matter which you label p and q) but that does not mean the polynomial is going to be different. As stated above by the communitive property we have that $(x-201)(x-10)=(x-10)(x-201)=(x-p)(x-q)$ but they asked how many different polynomials there are and those two both give the same polynomial though $p$ and $q$ are interchanged.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Amad271
186 posts
#20 • 2 Y
Y by Adventure10, Mango247
Got it, thanks mac&cheese and anadiyer12.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
jasperE3
11449 posts
#21
Y by
Let $f(x)=a(x+r)(x+s)=ax^2+bx+2010$, then $b=a(r+s)$ and $ars=2010$. WLOG $r\ge s$. Finding $a,r,s$ uniquely determines the polynomial, so we just need the number of such $a,r,s$.

Claim: the number of solutions to $ijk=2010$ in positive integers is $81$, of which $41$ satisfy $j\ge k$.
Note that $2010=2\cdot3\cdot5\cdot67$, so there are $3^4$ total solutions in positive integers.
If $j=k$, then since $2010$ is squarefree $j=k=1$, so $i=2010$. This is one solution. By symmetry half of the $81$ remaining solutions satisfy $j>k$.

Case 1: $r>0$, $s>0$
Note $a>0$. Let $(i,j,k)=(a,r,s)$, then we have $41$ solutions.

Case 2: $r<0$, $s<0$
Note $a>0$. Let $(i,j,k)=(a,-s,-r)$, then we have $41$ solutions.

Case 3: $r>0$, $s<0$
Note $a<0$. Let $(i,j,k)=(-a,r,-s)$, then we have $81$ solutions.

In total, there are $81+40+40=\boxed{163}$ such polynomials.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
OlympusHero
17020 posts
#22 • 3 Y
Y by Mango247, Mango247, Mango247
Denote $f(x) = a(x-b)(x-c)$ for integers $a, b, c$ and $abc = 2010$. We have $2010 = 2 \cdot 3 \cdot 5 \cdot 67$, so via stars and bars there are $\binom{3}{2}^4 = 81$ positive integer solutions. For the signs, they are either all negative (one way) or we select two to be negative (three ways) for a total of four ways. That gives $81 \cdot 4 = 324$, but the order of $b$ and $c$ doesn't matter and if we have $b = c$ then we overcounted, and we do with $(2010,-1,-1)$ and $(2010,1,1)$. Therefore, the answer is $\frac{322}{2}+2 = \boxed{163}$ (we add back the 2 pairs at the end).
This post has been edited 1 time. Last edited by OlympusHero, Jan 4, 2023, 10:58 PM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
AngeloChu
472 posts
#23 • 3 Y
Y by Mango247, Mango247, Mango247
$$f(x)=a_1(x-a_2)(x-a_3)$$$$a_1a_2a_3=2010$$$$2010=2\cdot3\cdot5\cdot67$$There are $3^4=81$ ways to distribute the $4$ prime factors to the three $a$'s
We can choose all of $a_1$,$a_2$, and $a_3$ to be positive or exactly $2$ to be negative.
We then have $324$ triples, and we divide by $2$ because $a_2$ and $a_3$ are distinguishable.
We add back $\frac{2}{2}=1$ for $(a_1,a_2,a_3)=(2010,1,1)$ and $(a_1,a_2,a_3)=(2010,-1,-1)$ where $a_2=a_3$
we end up with $\frac{324+2}{2}=163$
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
MathWizard10
1428 posts
#24
Y by
This is the most trivial AIME P10
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
CoolJupiter
925 posts
#25 • 3 Y
Y by Mango247, Mango247, Mango247
MathWizard10 wrote:
This is the most trivial AIME P10

Agreed
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
megahertz13
3201 posts
#26
Y by
mgao wrote:
Find the number of second-degree polynomials $ f(x)$ with integer coefficients and integer zeros for which $ f(0)=2010$.

Let $f(x)=a(x-r)(x-s)$. The condition is equivalent to $ars=2010=2\cdot 3\cdot 5\cdot 67$.

Case 1: $r=s$. Thus $(r,s)=(1,1)$ or $(r,s)=(-1,-1)$. Both of these yield one solution, so there are $2$ cases here.

Case 2: $r\ne s$. There are $3^4$ ways to pick $(a,r,s)$ so that all of them are positive (ignoring the condition specifying this case), and we subtract $1$ since $r\ne s$. Therefore, there are $80$ ways if $r,s>0$. However, it's also possible that some of the numbers are negative: if $r,s<0$, then there's $80$ cases by symmetry. If $r<0$ and $s>0$ or vice versa, then there are $2\cdot 81=162$ cases here. However, $r$ and $s$ are symmetrical (flipping them does not change the quadratic), so we divide by $2$ to yield $161$.

The final answer is $2+161=163$.
This post has been edited 1 time. Last edited by megahertz13, May 23, 2025, 9:29 PM
Z K Y
N Quick Reply
G
H
=
a