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
algebraic inequality
produit   0
14 minutes ago
Positive a, b, c satisfy a + b + c = ab + bc + ca. Prove that
a + b + c + 1 ⩾ 4abc.
0 replies
produit
14 minutes ago
0 replies
J
H
pqr/uvw convert
Nguyenhuyen_AG   9
N 18 minutes ago by Rhapsodies_pro
Source: https://github.com/nguyenhuyenag/pqr_convert
Hi everyone,
As we know, the pqr/uvw method is a powerful and useful tool for proving inequalities. However, transforming an expression $f(a,b,c)$ into $f(p,q,r)$ or $f(u,v,w)$ can sometimes be quite complex. That's why I’ve written a program to assist with this process.
I hope you’ll find it helpful!

Download: pqr_convert

Screenshot:
IMAGE
IMAGE
9 replies
1 viewing
Nguyenhuyen_AG
Apr 19, 2025
Rhapsodies_pro
18 minutes ago
J
H
interesting functional
Pomegranat   0
33 minutes ago
Source: I don't know sorry
Find all functions \( f : \mathbb{R}^+ \to \mathbb{R}^+ \) such that for all positive real numbers \( x \) and \( y \), the following equation holds:
\[ \frac{x + f(y)}{x f(y)} = f\left( \frac{1}{y} + f\left( \frac{1}{x} \right) \right) \]
0 replies
Pomegranat
33 minutes ago
0 replies
J
H
Brilliant guessing game on triples
Assassino9931   0
an hour ago
Source: Al-Khwarizmi Junior International Olympiad 2025 P8
There are $100$ cards on a table, flipped face down. Madina knows that on each card a single number is written and that the numbers are different integers from $1$ to $100$. In a move, Madina is allowed to choose any $3$ cards, and she is told a number that is written on one of the chosen cards, but not which specific card it is on. After several moves, Madina must determine the written numbers on as many cards as possible. What is the maximum number of cards Madina can ensure to determine?

Shubin Yakov, Russia
0 replies
Assassino9931
an hour ago
0 replies
J
H
Sequence
Titibuuu   2
N an hour ago by Tkn
Let \( a_1 = a \), and for all \( n \geq 1 \), define the sequence \( \{a_n\} \) by the recurrence
\[ a_{n+1} = a_n^2 + 1 \]Prove that there is no natural number \( n \) such that
\[ \prod_{k=1}^{n} \left( a_k^2 + a_k + 1 \right) \]is a perfect square.
2 replies
Titibuuu
Today at 2:22 AM
Tkn
an hour ago
J
H
Combinatorics
imnotgoodatmathsorry   0
an hour ago
Source: By @irregular22104
Given two positive integers $a,b$ written on the board. We apply the following rule: At each step, we will add all the numbers that are the sum of the two numbers on the board so that the sum does not appear on the board. For example, if the two initial numbers are $2,5$; then the numbers on the board after step 1 are $2,5,7$; after step 2 are $2,5,7,9,12;...$
1) With $a = 3$; $b = 12$, prove that the number 2024 cannot appear on the board.
2) With $a = 2$; $b = 34$, prove that the number 2024 can appear on the board.
0 replies
imnotgoodatmathsorry
an hour ago
0 replies
J
H
Iranian geometry configuration
Assassino9931   0
an hour ago
Source: Al-Khwarizmi Junior International Olympiad 2025 P7
Let $ABCD$ be a cyclic quadrilateral with circumcenter $O$, such that $CD$ is not a diameter of its circumcircle. The lines $AD$ and $BC$ intersect at point $P$, so that $A$ lies between $D$ and $P$, and $B$ lies between $C$ and $P$. Suppose triangle $PCD$ is acute and let $H$ be its orthocenter. The points $E$ and $F$ on the lines $BC$ and $AD$, respectively, are such that $BD \parallel HE$ and $AC\parallel HF$. The line through $E$, perpendicular to $BC$, intersects $AD$ at $L$, and the line through $F$, perpendicular to $AD$, intersects $BC$ at $K$. Prove that the points $K$, $L$, $O$ are collinear.

Amir Parsa Hosseini Nayeri, Iran
0 replies
Assassino9931
an hour ago
0 replies
J
H
Inequality, inequality, inequality...
Assassino9931   0
an hour ago
Source: Al-Khwarizmi Junior International Olympiad 2025 P6
Let $a,b,c$ be real numbers such that \[ab^2+bc^2+ca^2=6\sqrt{3}+ac^2+cb^2+ba^2.\]Find the smallest possible value of $a^2 + b^2 + c^2$.

Binh Luan and Nhan Xet, Vietnam
0 replies
Assassino9931
an hour ago
0 replies
J
H
Prime sums of pairs
Assassino9931   0
an hour ago
Source: Al-Khwarizmi Junior International Olympiad 2025 P5
Sevara writes in red $8$ distinct positive integers and then writes in blue the $28$ sums of each two red numbers. At most how many of the blue numbers can be prime?

Marin Hristov, Bulgaria
0 replies
Assassino9931
an hour ago
0 replies
J
H
help me solve this problem. Thanks
tnhan.129   0
an hour ago
Find f:R+ -> R such that:
(x+1/x).f(y) = f(xy) + f(y/x)
0 replies
tnhan.129
an hour ago
0 replies
J
H
Line passing through orthocenter
pokmui9909   4
N an hour ago by Tkn
Source: KMO 2024 P7
In an acute triangle $ABC$, let a line $\ell$ pass through the orthocenter and not through point $A$. The line $\ell$ intersects line $BC$ at $P(\neq B, C)$. A line passing through $A$ and perpendicular to $\ell$ meets the circumcircle of triangle $ABC$ at $R(\neq A)$. Let the feet of the perpendiculars from $A, B$ to $\ell$ be $A', B'$, respectively. Define line $\ell_1$ as the line passing through $A'$ and perpendicular to $BC$, and line $\ell_2$ as the line passing through $B'$ and perpendicular to $CA$. Prove that if $Q$ is the reflection of the intersection of $\ell_1$ and $\ell_2$ across $\ell$, then $\angle PQR = 90^{\circ}$.
4 replies
pokmui9909
Nov 9, 2024
Tkn
an hour ago
J
H
Inequality with number of divisors
MathLuis   12
N an hour ago by Grasshopper-
Source: Iberoamerican MO 2024 Day 1 P1
For each positive integer $n$, let $d(n)$ be the number of positive integer divisors of $n$.
Prove that for all pairs of positive integers $(a,b)$ we have that:
\[ d(a)+d(b) \le d(\gcd(a,b))+d(\text{lcm}(a,b)) \]and determine all pairs of positive integers $(a,b)$ where we have equality case.
12 replies
MathLuis
Sep 21, 2024
Grasshopper-
an hour ago
J
H
No three collinear
USJL   1
N 2 hours ago by Photaesthesia
Source: 2025 Taiwan TST Round 3 Mock P6
Given a positive integer $n\geq 3$. A convex polygon is said to be $n$-good if it contains $n$ lattice points where any three of them are not collinear.

(a) Show that there exists an $n$-good convex polygon with area at most $4n^2$.
(b) Show that there exists a constant $c>0$ so that any $n$-good convex polygon has area at least $cn^2$.

Proposed by usjl
1 reply
USJL
Apr 26, 2025
Photaesthesia
2 hours ago
J
H
Concentric Circles
MithsApprentice   61
N 2 hours ago by endless_abyss
Source: USAMO 1998
Let ${\cal C}_1$ and ${\cal C}_2$ be concentric circles, with ${\cal C}_2$ in the interior of ${\cal C}_1$. From a point $A$ on ${\cal C}_1$ one draws the tangent $AB$ to ${\cal C}_2$ ($B\in {\cal C}_2$). Let $C$ be the second point of intersection of $AB$ and ${\cal C}_1$, and let $D$ be the midpoint of $AB$. A line passing through $A$ intersects ${\cal C}_2$ at $E$ and $F$ in such a way that the perpendicular bisectors of $DE$ and $CF$ intersect at a point $M$ on $AB$. Find, with proof, the ratio $AM/MC$.
61 replies
MithsApprentice
Oct 9, 2005
endless_abyss
2 hours ago
J
H
J
H
An fe based off of another trivial problem
benjaminchew13   1
N Apr 25, 2025 by Mathzeus1024
Source: Own
Find all functions $f:\mathbb{R}\rightarrow\mathbb{R}$ such that for all real numbers $x$ and $y$, $f(x+y-f(x))f(f(x+y)-y)=f(xy)$
1 reply
benjaminchew13
Apr 25, 2025
Mathzeus1024
Apr 25, 2025
J
An fe based off of another trivial problem
G H J
Reveal topic tags
function
algebra
L
G H BBookmark kLocked kLocked NReply
Source: Own
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
benjaminchew13
11 posts
benjaminchew13
#1 h  Apr 25, 2025, 7:10 AM
Y by
Find all functions $f:\mathbb{R}\rightarrow\mathbb{R}$ such that for all real numbers $x$ and $y$, $f(x+y-f(x))f(f(x+y)-y)=f(xy)$
This post has been edited 1 time. Last edited by benjaminchew13, Apr 25, 2025, 7:10 AM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Mathzeus1024
865 posts
Mathzeus1024
#2 h  Apr 25, 2025, 9:52 AM
Y by
It works for $\textcolor{red}{f(x)=0,1,x}$.
Z K Y
N Quick Reply
G
H
=
a