Art of Problem Solving
AoPS Online AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy AoPS Academy
Small live classes for advanced math
and language arts learners in grades 1-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Stay ahead of learning milestones! Enroll in a class over the summer!
No tags match your search
M
G
Topic
First Poster
Last Poster
H
k a May Highlights and 2025 AoPS Online Class Information
jlacosta   0
May 1, 2025
May is an exciting month! National MATHCOUNTS is the second week of May in Washington D.C. and our Founder, Richard Rusczyk will be presenting a seminar, Preparing Strong Math Students for College and Careers, on May 11th.

Are you interested in working towards MATHCOUNTS and don’t know where to start? We have you covered! If you have taken Prealgebra, then you are ready for MATHCOUNTS/AMC 8 Basics. Already aiming for State or National MATHCOUNTS and harder AMC 8 problems? Then our MATHCOUNTS/AMC 8 Advanced course is for you.

Summer camps are starting next month at the Virtual Campus in math and language arts that are 2 - to 4 - weeks in duration. Spaces are still available - don’t miss your chance to have an enriching summer experience. There are middle and high school competition math camps as well as Math Beasts camps that review key topics coupled with fun explorations covering areas such as graph theory (Math Beasts Camp 6), cryptography (Math Beasts Camp 7-8), and topology (Math Beasts Camp 8-9)!

Be sure to mark your calendars for the following upcoming events:
[list][*]May 9th, 4:30pm PT/7:30pm ET, Casework 2: Overwhelming Evidence — A Text Adventure, a game where participants will work together to navigate the map, solve puzzles, and win! All are welcome.
[*]May 19th, 4:30pm PT/7:30pm ET, What's Next After Beast Academy?, designed for students finishing Beast Academy and ready for Prealgebra 1.
[*]May 20th, 4:00pm PT/7:00pm ET, Mathcamp 2025 Qualifying Quiz Part 1 Math Jam, Problems 1 to 4, join the Canada/USA Mathcamp staff for this exciting Math Jam, where they discuss solutions to Problems 1 to 4 of the 2025 Mathcamp Qualifying Quiz!
[*]May 21st, 4:00pm PT/7:00pm ET, Mathcamp 2025 Qualifying Quiz Part 2 Math Jam, Problems 5 and 6, Canada/USA Mathcamp staff will discuss solutions to Problems 5 and 6 of the 2025 Mathcamp Qualifying Quiz![/list]
Our full course list for upcoming classes is below:
All classes run 7:30pm-8:45pm ET/4:30pm - 5:45pm PT unless otherwise noted.

Introductory: Grades 5-10

Prealgebra 1 Self-Paced

Prealgebra 1
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
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, 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
Thursday, May 15 - Jul 31
Sunday, Jun 1 - Aug 24
Thursday, Jun 12 - Aug 28
Wednesday, Jul 9 - Sep 24
Sunday, Jul 27 - Oct 19

Introduction to Number Theory
Friday, May 9 - Aug 1
Wednesday, May 21 - Aug 6
Monday, Jun 9 - Aug 25
Sunday, Jun 15 - Sep 14
Tuesday, Jul 15 - Sep 30

Introduction to Algebra B Self-Paced

Introduction to Algebra B
Tuesday, May 6 - Aug 19
Wednesday, Jun 4 - Sep 17
Sunday, Jun 22 - Oct 19
Friday, Jul 18 - Nov 14

Introduction to Geometry
Sunday, May 11 - Nov 9
Tuesday, May 20 - Oct 28
Monday, Jun 16 - Dec 8
Friday, Jun 20 - Jan 9
Sunday, Jun 29 - Jan 11
Monday, Jul 14 - Jan 19

Paradoxes and Infinity
Mon, Tue, Wed, & Thurs, Jul 14 - Jul 16 (meets every day of the week!)

Intermediate: Grades 8-12

Intermediate Algebra
Sunday, Jun 1 - Nov 23
Tuesday, Jun 10 - Nov 18
Wednesday, Jun 25 - Dec 10
Sunday, Jul 13 - Jan 18
Thursday, Jul 24 - Jan 22

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

Intermediate Number Theory
Sunday, Jun 1 - Aug 24
Wednesday, Jun 18 - Sep 3

Precalculus
Friday, May 16 - Oct 24
Sunday, Jun 1 - Nov 9
Monday, Jun 30 - Dec 8

Advanced: Grades 9-12

Olympiad Geometry
Tuesday, Jun 10 - Aug 26

Calculus
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
Friday, May 23 - Aug 15
Monday, Jun 2 - Aug 18
Thursday, Jun 12 - Aug 28
Sunday, Jun 22 - Sep 21
Tues & Thurs, Jul 8 - Aug 14 (meets twice a week!)

MATHCOUNTS/AMC 8 Advanced
Sunday, May 11 - Aug 10
Tuesday, May 27 - Aug 12
Wednesday, Jun 11 - Aug 27
Sunday, Jun 22 - Sep 21
Tues & Thurs, Jul 8 - Aug 14 (meets twice a week!)

AMC 10 Problem Series
Friday, May 9 - Aug 1
Sunday, Jun 1 - Aug 24
Thursday, Jun 12 - Aug 28
Tuesday, Jun 17 - Sep 2
Sunday, Jun 22 - Sep 21 (1:00 - 2:30 pm ET/10:00 - 11:30 am PT)
Monday, Jun 23 - Sep 15
Tues & Thurs, Jul 8 - Aug 14 (meets twice a week!)

AMC 10 Final Fives
Sunday, May 11 - Jun 8
Tuesday, May 27 - Jun 17
Monday, Jun 30 - Jul 21

AMC 12 Problem Series
Tuesday, May 27 - Aug 12
Thursday, Jun 12 - Aug 28
Sunday, Jun 22 - Sep 21
Wednesday, Aug 6 - Oct 22

AMC 12 Final Fives
Sunday, May 18 - Jun 15

AIME Problem Series A
Thursday, May 22 - Jul 31

AIME Problem Series B
Sunday, Jun 22 - Sep 21

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
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
Wednesday, May 21 - Aug 6
Sunday, Jun 15 - Sep 14
Monday, Jun 23 - Sep 15

Physics 1: Mechanics
Thursday, May 22 - Oct 30
Monday, Jun 23 - Dec 15

Relativity
Mon, Tue, Wed & Thurs, Jun 23 - Jun 26 (meets every day of the week!)
0 replies
jlacosta
May 1, 2025
0 replies
J
H
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
J
H
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
J
H
I need the technique
DievilOnlyM   15
N 35 minutes ago by sqing
Let a,b,c be real numbers such that: $ab+7bc+ca=188$.
FInd the minimum value of: $5a^2+11b^2+5c^2$
15 replies
DievilOnlyM
May 23, 2019
sqing
35 minutes ago
J
H
Geometry
Lukariman   8
N 42 minutes ago by Lukariman
Given circle (O) and point P outside (O). From P draw tangents PA and PB to (O) with contact points A, B. On the opposite ray of ray BP, take point M. The circle circumscribing triangle APM intersects (O) at the second point D. Let H be the projection of B on AM. Prove that $\angle HDM$ = 2∠AMP.
8 replies
1 viewing
Lukariman
Tuesday at 12:43 PM
Lukariman
42 minutes ago
J
H
Linear colorings mod 2^n
vincentwant   1
N 43 minutes ago by vincentwant
Let $n$ be a positive integer. The ordered pairs $(x,y)$ where $x,y$ are integers in $[0,2^n)$ are each labeled with a positive integer less than or equal to $2^n$ such that every label is used exactly $2^n$ times and there exist integers $a_1,a_2,\dots,a_{2^n}$ and $b_1,b_2,\dots,b_{2^n}$ such that the following property holds: For any two lattice points $(x_1,y_1)$ and $(x_2,y_2)$ that are both labeled $t$, there exists an integer $k$ such that $x_2-x_1-ka_t$ and $y_2-y_1-kb_t$ are both divisible by $2^n$. How many such labelings exist?
1 reply
vincentwant
Apr 30, 2025
vincentwant
43 minutes ago
J
H
sqrt(n) or n+p (Generalized 2017 IMO/1)
vincentwant   1
N 44 minutes ago by vincentwant
Let $p$ be an odd prime. Define $f(n)$ over the positive integers as follows:
$$f(n)=\begin{cases} \sqrt{n}&\text{ if n is a perfect square} \\ n+p&\text{ otherwise} \end{cases}$$
Let $p$ be chosen such that there exists an ordered pair of positive integers $(n,k)$ where $n>1,p\nmid n$ such that $f^k(n)=n$. Prove that there exists at least three integers $i$ such that $1\leq i\leq k$ and $f^i(n)$ is a perfect square.
1 reply
vincentwant
Apr 30, 2025
vincentwant
44 minutes ago
J
H
Flight between cities
USJL   5
N an hour ago by Photaesthesia
Source: 2025 Taiwan TST Round 1 Mock P5
A country has 2025 cites, with some pairs of cities having bidirectional flight routes between them. For any pair of the cities, the flight route between them must be operated by one of the companies $X, Y$ or $Z$. To avoid unfairly favoring specific company, the regulation ensures that if there have three cities $A, B$ and $C$, with flight routes $A \leftrightarrow B$ and $A \leftrightarrow C$ operated by two different companies, then there must exist flight route $B \leftrightarrow C$ operated by the third company different from $A \leftrightarrow B$ and $A \leftrightarrow C$ .

Let $n_X$, $n_Y$ and $n_Z$ denote the number of flight routes operated by companies $X, Y$ and $Z$, respectively. It is known that, starting from a city, we can arrive any other city through a series of flight routes (not necessary operated by the same company). Find the minimum possible value of $\max(n_X, n_Y , n_Z)$.

Proposed by usjl and YaWNeeT
5 replies
USJL
Mar 8, 2025
Photaesthesia
an hour ago
J
H
A problem from Le Anh Vinh book.
minhquannguyen   0
an hour ago
Source: LE ANH VINH, DINH HUONG BOI DUONG HOC SINH NANG KHIEU TOAN TAP 1 DAI SO
Let $n$ is a positive integer. Determine all functions $f:(1,+\infty)\to\mathbb{R}$ such that
\[f(x^{n+1}+y^{n+1})=x^nf(x)+y^nf(y),\forall x,y>1.\]
0 replies
minhquannguyen
an hour ago
0 replies
J
H
IMO ShortList 1999, algebra problem 1
orl   42
N 2 hours ago by ihategeo_1969
Source: IMO ShortList 1999, algebra problem 1
Let $n \geq 2$ be a fixed integer. Find the least constant $C$ such the inequality

\[\sum_{i<j} x_{i}x_{j} \left(x^{2}_{i}+x^{2}_{j} \right) \leq C \left(\sum_{i}x_{i} \right)^4\]

holds for any $x_{1}, \ldots ,x_{n} \geq 0$ (the sum on the left consists of $\binom{n}{2}$ summands). For this constant $C$, characterize the instances of equality.
42 replies
orl
Nov 13, 2004
ihategeo_1969
2 hours ago
J
H
q(x) to be the product of all primes less than p(x)
orl   19
N 2 hours ago by ihategeo_1969
Source: IMO Shortlist 1995, S3
For an integer $x \geq 1$, let $p(x)$ be the least prime that does not divide $x$, and define $q(x)$ to be the product of all primes less than $p(x)$. In particular, $p(1) = 2.$ For $x$ having $p(x) = 2$, define $q(x) = 1$. Consider the sequence $x_0, x_1, x_2, \ldots$ defined by $x_0 = 1$ and \[ x_{n+1} = \frac{x_n p(x_n)}{q(x_n)} \] for $n \geq 0$. Find all $n$ such that $x_n = 1995$.
19 replies
orl
Aug 10, 2008
ihategeo_1969
2 hours ago
J
H
Interesting inequality
sealight2107   2
N 2 hours ago by arqady
Source: Own
Let $a,b,c>0$ such that $a+b+c=3$. Find the minimum value of:
$Q=\frac{a}{b}+\frac{b}{c}+\frac{c}{a}+\frac{1}{a^3+b^3+abc}+\frac{1}{b^3+c^3+abc}+\frac{1}{c^3+a^3+abc}$
2 replies
sealight2107
Tuesday at 4:53 PM
arqady
2 hours ago
J
H
Cyclic Quads and Parallel Lines
gracemoon124   16
N 4 hours ago by ohiorizzler1434
Source: 2015 British Mathematical Olympiad?
Let $ABCD$ be a cyclic quadrilateral. Let $F$ be the midpoint of the arc $AB$ of its circumcircle which does not contain $C$ or $D$. Let the lines $DF$ and $AC$ meet at $P$ and the lines $CF$ and $BD$ meet at $Q$. Prove that the lines $PQ$ and $AB$ are parallel.
16 replies
gracemoon124
Aug 16, 2023
ohiorizzler1434
4 hours ago
J
H
Radical Center on the Euler Line (USEMO 2020/3)
franzliszt   37
N 4 hours ago by Ilikeminecraft
Source: USEMO 2020/3
Let $ABC$ be an acute triangle with circumcenter $O$ and orthocenter $H$. Let $\Gamma$ denote the circumcircle of triangle $ABC$, and $N$ the midpoint of $OH$. The tangents to $\Gamma$ at $B$ and $C$, and the line through $H$ perpendicular to line $AN$, determine a triangle whose circumcircle we denote by $\omega_A$. Define $\omega_B$ and $\omega_C$ similarly.
Prove that the common chords of $\omega_A$,$\omega_B$ and $\omega_C$ are concurrent on line $OH$.

Proposed by Anant Mudgal
37 replies
franzliszt
Oct 24, 2020
Ilikeminecraft
4 hours ago
J
H
Functional equation with powers
tapir1729   13
N 4 hours ago by ihategeo_1969
Source: TSTST 2024, problem 6
Determine whether there exists a function $f: \mathbb{Z}_{> 0} \rightarrow \mathbb{Z}_{> 0}$ such that for all positive integers $m$ and $n$,
\[f(m+nf(m))=f(n)^m+2024! \cdot m.\]Jaedon Whyte
13 replies
tapir1729
Jun 24, 2024
ihategeo_1969
4 hours ago
J
H
Powers of a Prime
numbertheorist17   34
N 4 hours ago by KevinYang2.71
Source: USA TSTST 2014, Problem 6
Suppose we have distinct positive integers $a, b, c, d$, and an odd prime $p$ not dividing any of them, and an integer $M$ such that if one considers the infinite sequence \begin{align*} ca &- db \\ ca^2 &- db^2 \\ ca^3 &- db^3 \\ ca^4 &- db^4 \\ &\vdots \end{align*} and looks at the highest power of $p$ that divides each of them, these powers are not all zero, and are all at most $M$. Prove that there exists some $T$ (which may depend on $a,b,c,d,p,M$) such that whenever $p$ divides an element of this sequence, the maximum power of $p$ that divides that element is exactly $p^T$.
34 replies
numbertheorist17
Jul 16, 2014
KevinYang2.71
4 hours ago
J
H
IMO 2018 Problem 5
orthocentre   80
N 5 hours ago by OronSH
Source: IMO 2018
Let $a_1$, $a_2$, $\ldots$ be an infinite sequence of positive integers. Suppose that there is an integer $N > 1$ such that, for each $n \geq N$, the number
$$\frac{a_1}{a_2} + \frac{a_2}{a_3} + \cdots + \frac{a_{n-1}}{a_n} + \frac{a_n}{a_1}$$is an integer. Prove that there is a positive integer $M$ such that $a_m = a_{m+1}$ for all $m \geq M$.

Proposed by Bayarmagnai Gombodorj, Mongolia
80 replies
orthocentre
Jul 10, 2018
OronSH
5 hours ago
J
H
J
H
True or false?
Nguyenngoctu   3
N Apr 19, 2025 by MathsII-enjoy
Let $a,b,c > 0$ such that $ab + bc + ca = 3$. Prove that ${a^3} + {b^3} + {c^3} \ge {a^3}{b^3} + {b^3}{c^3} + {c^3}{a^3}$
3 replies
Nguyenngoctu
Nov 17, 2017
MathsII-enjoy
Apr 19, 2025
J
True or false?
G H J
Reveal topic tags
inequalities
inequalities proposed
L
G H BBookmark kLocked kLocked NReply
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Nguyenngoctu
499 posts
Nguyenngoctu
#1 h  Nov 17, 2017, 4:02 PM • 2 Y
Y by Adventure10, Mango247
Let $a,b,c > 0$ such that $ab + bc + ca = 3$. Prove that ${a^3} + {b^3} + {c^3} \ge {a^3}{b^3} + {b^3}{c^3} + {c^3}{a^3}$
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
scrabbler94
7554 posts
scrabbler94
#2 h  Nov 17, 2017, 4:17 PM • 1 Y
Y by Adventure10
False. Let $a = b = \frac{3}{2}$ and $c = \frac{1}{4}$.

Or better yet, let $a = b = \sqrt{3} - \varepsilon_1$, $c = \varepsilon_2$ for some small $\varepsilon_i $.
This post has been edited 1 time. Last edited by scrabbler94, Nov 17, 2017, 4:17 PM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
sqing
42045 posts
sqing
#3 h  Apr 17, 2025, 1:20 PM
Y by
Let $a,b,c\ge 0 $ and $ a^2+b^2+c^2\le 3. $ Prove that$$a^3+b^3+c^3\ge a^3b^3+b^3c^3+c^3a^3.$$Let $ a,b,c\geq0 $ and $ a+b+c=3 $. Prove that
$$9(a^2+b^2+c^2) \geq 8(a^2b^2+c^2a^2+c^2b^2)$$
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
MathsII-enjoy
34 posts
MathsII-enjoy
#4 h  Apr 19, 2025, 9:27 AM
Y by
sqing wrote:
Let $a,b,c\ge 0 $ and $ a^2+b^2+c^2\le 3. $ Prove that$$a^3+b^3+c^3\ge a^3b^3+b^3c^3+c^3a^3.$$How to do this, I have tried $P.Q.R$ but can't solve the problem :(
This post has been edited 1 time. Last edited by MathsII-enjoy, Apr 19, 2025, 9:27 AM
Z K Y
N Quick Reply
G
H
=
a