Happy Memorial Day! Please note that AoPS Online is closed May 24-26th.

G
Topic
First Poster
Last Poster
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
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
Combinatorial
|nSan|ty   7
N 14 minutes ago by SomeonecoolLovesMaths
Source: RMO 2007 problem
How many 6-digit numbers are there such that-:
a)The digits of each number are all from the set $ \{1,2,3,4,5\}$
b)any digit that appears in the number appears at least twice ?
(Example: $ 225252$ is valid while $ 222133$ is not)
[weightage 17/100]
7 replies
|nSan|ty
Oct 10, 2007
SomeonecoolLovesMaths
14 minutes ago
pairs (m, n) such that a fractional expression is an integer
cielblue   0
33 minutes ago
Find all pairs $(m,\ n)$ of positive integers such that $\frac{m^3-mn+1}{m^2+mn+2}$ is an integer.
0 replies
cielblue
33 minutes ago
0 replies
the same prime factors
andria   6
N an hour ago by MathLuis
Source: Iranian third round number theory P4
$a,b,c,d,k,l$ are positive integers such that for every natural number $n$ the set of prime factors of $n^k+a^n+c,n^l+b^n+d$ are same. prove that $k=l,a=b,c=d$.
6 replies
andria
Sep 6, 2015
MathLuis
an hour ago
Inspired by RMO 2006
sqing   1
N an hour ago by SomeonecoolLovesMaths
Source: Own
Let $ a,b >0  . $ Prove that
$$  \frac {a^{2}+1}{b+k}+\frac { b^{2}+1}{ka+1}+\frac {2}{a+kb}  \geq \frac {6}{k+1}  $$Where $k\geq 0.03 $
$$  \frac {a^{2}+1}{b+1}+\frac { b^{2}+1}{a+1}+\frac {2}{a+b}  \geq 3  $$
1 reply
sqing
6 hours ago
SomeonecoolLovesMaths
an hour ago
Problem 4 of RMO 2006 (Regional Mathematical Olympiad-India)
makar   7
N an hour ago by SomeonecoolLovesMaths
Source: Combinatorics (Box Principle)
A $ 6\times 6$ square is dissected in to 9 rectangles by lines parallel to its sides such that all these rectangles have integer sides. Prove that there are always two congruent rectangles.
7 replies
makar
Sep 13, 2009
SomeonecoolLovesMaths
an hour ago
Simple FE
oVlad   52
N an hour ago by Sadigly
Source: BMO Shortlist 2022, A1
Find all functions $f : \mathbb{R} \to \mathbb{R}$ such that
\[f(x(x + f(y))) = (x + y)f(x),\]for all $x, y \in\mathbb{R}$.
52 replies
oVlad
May 13, 2023
Sadigly
an hour ago
Cool Functional Equation
Warideeb   1
N an hour ago by maromex
Find all functions real to real such that
$f(xy+f(x))=xf(y)+f(x)$
for all reals $x,y$.
1 reply
Warideeb
3 hours ago
maromex
an hour ago
Functional equation
socrates   10
N 2 hours ago by MathLuis
Source: Inspired by another
Determine all functions $f : \mathbb{R}^+ \to \mathbb{R}^+$ such that \[ \forall x, y \in \mathbb{R}^+ \ , \  \ f(x+f(xy))=f(x)+xf(y).\]
10 replies
socrates
Oct 28, 2014
MathLuis
2 hours ago
Find f
Redriver   7
N 2 hours ago by aaravdodhia
Find all $: R \to R : \ \ f(x^2+f(y))=y+f^2(x)$
7 replies
Redriver
Jun 25, 2006
aaravdodhia
2 hours ago
IMO Shortlist 2011, G5
WakeUp   72
N 2 hours ago by ItsBesi
Source: IMO Shortlist 2011, G5
Let $ABC$ be a triangle with incentre $I$ and circumcircle $\omega$. Let $D$ and $E$ be the second intersection points of $\omega$ with $AI$ and $BI$, respectively. The chord $DE$ meets $AC$ at a point $F$, and $BC$ at a point $G$. Let $P$ be the intersection point of the line through $F$ parallel to $AD$ and the line through $G$ parallel to $BE$. Suppose that the tangents to $\omega$ at $A$ and $B$ meet at a point $K$. Prove that the three lines $AE,BD$ and $KP$ are either parallel or concurrent.

Proposed by Irena Majcen and Kris Stopar, Slovenia
72 replies
WakeUp
Jul 13, 2012
ItsBesi
2 hours ago
Hard Functional Equation in the Complex Numbers
yaybanana   5
N 2 hours ago by aaravdodhia
Source: Own
Find all functions $f:\mathbb {C}\rightarrow \mathbb {C}$, s.t :

$f(xf(y)) + f(x^2+y) = f(x+y)x + f(f(y))$

for all $x,y \in \mathbb{C}$
5 replies
yaybanana
Apr 9, 2025
aaravdodhia
2 hours ago
Power tower sum
Rijul saini   9
N 2 hours ago by ihategeo_1969
Source: India IMOTC 2024 Day 3 Problem 2
Let $a$ and $n$ be positive integers such that:
1. $a^{2^n}-a$ is divisible by $n$,
2. $\sum\limits_{k=1}^{n} k^{2024}a^{2^k}$ is not divisible by $n$.

Prove that $n$ has a prime factor smaller than $2024$.

Proposed by Shantanu Nene
9 replies
Rijul saini
May 31, 2024
ihategeo_1969
2 hours ago
Nice "if and only if" function problem
ICE_CNME_4   7
N 2 hours ago by ICE_CNME_4
Let $f : [0, \infty) \to [0, \infty)$, $f(x) = \dfrac{ax + b}{cx + d}$, with $a, d \in (0, \infty)$, $b, c \in [0, \infty)$. Prove that there exists $n \in \mathbb{N}^*$ such that for every $x \geq 0$
\[
f_n(x) = \frac{x}{1 + nx}, \quad \text{if and only if } f(x) = \frac{x}{1 + x}, \quad \forall x \geq 0.
\](For $n \in \mathbb{N}^*$ and $x \geq 0$, the notation $f_n(x)$ represents $\underbrace{(f \circ f \circ \dots \circ f)}_{n \text{ times}}(x)$. )

Please do it at 9th grade level. Thank you!
7 replies
ICE_CNME_4
Yesterday at 7:23 PM
ICE_CNME_4
2 hours ago
Cauchy-Schwarz 2
prtoi   8
N 2 hours ago by mrtheory
Source: Handout by Samin Riasat
if $a^2+b^2+c^2+d^2=4$, prove that:
$\frac{a^2}{b}+\frac{b^2}{c}+\frac{c^2}{d}+\frac{d^2}{a}\ge4$
8 replies
prtoi
Mar 26, 2025
mrtheory
2 hours ago
Colouring digits to make a rational Number
Rg230403   3
N Apr 26, 2025 by quantam13
Source: India EGMO 2022 TST P4
Let $N$ be a positive integer. Suppose given any real $x\in (0,1)$ with decimal representation $0.a_1a_2a_3a_4\cdots$, one can color the digits $a_1,a_2,\cdots$ with $N$ colors so that the following hold:
1. each color is used at least once;
2. for any color, if we delete all the digits in $x$ except those of this color, the resulting decimal number is rational.
Find the least possible value of $N$.

~Sutanay Bhattacharya
3 replies
Rg230403
Nov 28, 2021
quantam13
Apr 26, 2025
Colouring digits to make a rational Number
G H J
G H BBookmark kLocked kLocked NReply
Source: India EGMO 2022 TST P4
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Rg230403
222 posts
#1
Y by
Let $N$ be a positive integer. Suppose given any real $x\in (0,1)$ with decimal representation $0.a_1a_2a_3a_4\cdots$, one can color the digits $a_1,a_2,\cdots$ with $N$ colors so that the following hold:
1. each color is used at least once;
2. for any color, if we delete all the digits in $x$ except those of this color, the resulting decimal number is rational.
Find the least possible value of $N$.

~Sutanay Bhattacharya
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Rg230403
222 posts
#2
Y by
The answer is $N=10$. Let us first prove that $N\ge 10$ always works. Take the decimal expansion of $x$, color the first $N$ digits with the $N$ colors in any order, and from that point on, color every $0$ with the first color, every $1$ with the second color, \dots, and every $9$ with the tenth color (if $x$ has a finite decimal expansion, we assume there are infinitely many zeros after the last non-zero digit; clearly this changes nothing). Now for every color, the decimal formed by digits of that colors eventually becomes a single digit repeated, so it's rational.

Now we will prove that $N\le 9$ cannot work. Take $x$ to be the following number:
$$x=0.0123456789001122\cdots 8899000111\cdots 9990000\cdots.$$The $i$-th block has $0$ $i$ times, $1$ $i$ times, \dots, $9$ $i$ times; then the $(i+1)$-th block begins. Now suppose we can color this with $N$ colors as stipulated. Let $x_i$ be the decimal formed by all the digits with the $i$-th color. Since $x_i$ is rational, it's decimal expansion is eventually periodic; suppose it's period length is $d_i$. Suppose the last digit in $x$ that occurs in any of the non-periodic parts of the $x_i$s is at position $A$.

Let $M=\max\{d_1,\cdots, d_N\}$. In the decimal expansion of $x$, one can find a string of at least $N(M+1)$ consecutive zeros that occurs after the $A$-th place. Then some color must have at least $M$ zeros from this part, say the $j$-th color. Then $x_j$ has a string of at least $d_j$ zeros after its non-periodic part; so the entire period must be a string of zeros. In other words, after some point, all the digits of $x_j$ are $0$.

Similarly, for every digit $d$ in $\{0,1,\cdots, 9\}$, one can find some $x_j$ so that all digits of $x_j$ are $d$ after some point. But there are ten possible $d$'s, and only $N<10$ possible $x_j$'s, so this is impossible.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
L567
1184 posts
#5
Y by
Consider the number $x$ containing every digit $1,2,3,\cdots,9,0$ once, then twice, thrice etc.

If a color has only one digit eventually, then it has density at most $\frac{1}{10}$.

If a color has more than one digit, there are two consecutive digits, WLOG let it be $01$. Consider the first $5M(M+1) + c$ numbers for sufficiently large constant $c$ so that after $c$ it is periodic, it has at most $M+c$ instances of $01$. Take $M$ large so we have density of this color is $0$.

So there must be at least $10$ colors. And $N = 10$ works by giving each digit its own color.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
quantam13
113 posts
#6
Y by
$N=10$ is achievable by giving each digit its own color. To see why $N=9$ is not, all we need to do is consider the rational
$$x=0.0123456789001122\cdots 8899000111\cdots 9990000\cdots$$The rest is left as an exercise to the reader
Z K Y
N Quick Reply
G
H
=
a