Stay ahead of learning milestones! Enroll in a class over the summer!

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
Balkan MO 2022/1 is reborn
Assassino9931   8
N 30 minutes ago by Giant_PT
Source: Bulgaria EGMO TST 2023 Day 1, Problem 1
Let $ABC$ be a triangle with circumcircle $k$. The tangents at $A$ and $C$ intersect at $T$. The circumcircle of triangle $ABT$ intersects the line $CT$ at $X$ and $Y$ is the midpoint of $CX$. Prove that the lines $AX$ and $BY$ intersect on $k$.
8 replies
Assassino9931
Feb 7, 2023
Giant_PT
30 minutes ago
Something weird with this one FE in integers (probably challenging, maybe not)
Gaunter_O_Dim_of_math   1
N 2 hours ago by Rayanelba
Source: Pang-Cheng-Wu, FE, problem number 52.
During FE problems' solving I found a very specific one:

Find all such f that f: Z -> Z and for all integers a, b, c
f(a^3 + b^3 + c^3) = f(a)^3 + f(b)^3 + f(c)^3.

Everything what I've got is that f is odd, f(n) = n or -n or 0
for all n from 0 to 11 (just bash it), but it is very simple and do not give the main idea.
I actually have spent not so much time on this problem, but definitely have no clue. As far as I see, number theory here or classical FE solving or advanced methods, which I know, do not work at all.
Is here a normal solution (I mean, without bashing and something with a huge number of ugly and weird inequalities)?
Or this is kind of rubbish, which was put just for bash?
1 reply
Gaunter_O_Dim_of_math
3 hours ago
Rayanelba
2 hours ago
USAMO 1985 #2
Mrdavid445   6
N 2 hours ago by anticodon
Determine each real root of \[x^4-(2\cdot10^{10}+1)x^2-x+10^{20}+10^{10}-1=0\]correct to four decimal places.
6 replies
Mrdavid445
Jul 26, 2011
anticodon
2 hours ago
Inequality with rational function
MathMystic33   3
N 3 hours ago by ariopro1387
Source: Macedonian Mathematical Olympiad 2025 Problem 2
Let \( n > 2 \) be an integer, \( k > 1 \) a real number, and \( x_1, x_2, \ldots, x_n \) be positive real numbers such that \( x_1 \cdot x_2 \cdots x_n = 1 \). Prove that:

\[
\frac{1 + x_1^k}{1 + x_2} + \frac{1 + x_2^k}{1 + x_3} + \cdots + \frac{1 + x_n^k}{1 + x_1} \geq n.
\]
When does equality hold?
3 replies
MathMystic33
6 hours ago
ariopro1387
3 hours ago
k A cyclic weighted inequality
MathMystic33   2
N 3 hours ago by grupyorum
Source: 2024 Macedonian Team Selection Test P2
Let $u,v,w$ be positive real numbers. Prove that there exists a cyclic permutation $(x,y,z)$ of $(u,v,w)$ such that for all positive real numbers $a,b,c$ the following holds:
\[
\frac{a}{x\,a + y\,b + z\,c}
\;+\;
\frac{b}{x\,b + y\,c + z\,a}
\;+\;
\frac{c}{x\,c + y\,a + z\,b}
\;\ge\;
\frac{3}{x + y + z}.
\]
2 replies
MathMystic33
4 hours ago
grupyorum
3 hours ago
k Perfect squares imply GCD is a perfect square
MathMystic33   1
N 3 hours ago by grupyorum
Source: 2024 Macedonian Team Selection Test P6
Let \(a,b\) be positive integers such that \(a+1\), \(b+1\), and \(ab\) are perfect squares. Prove that $\gcd(a,b)+1$ is also a perfect square.
1 reply
MathMystic33
4 hours ago
grupyorum
3 hours ago
Divisibility condition with primes
MathMystic33   1
N 3 hours ago by grupyorum
Source: 2024 Macedonian Team Selection Test P1
Let \(p,p_2,\dots,p_k\) be distinct primes and let \(a_2,a_3,\dots,a_k\) be nonnegative integers. Define
\[
m \;=\;
\frac12
\Bigl(\prod_{i=2}^k p_i^{a_i}\Bigr)
\Bigl(\prod_{i=1}^k(p_i+1)\;+\;\sum_{i=1}^k(p_i-1)\Bigr),
\]\[
n \;=\;
\frac12
\Bigl(\prod_{i=2}^k p_i^{a_i}\Bigr)
\Bigl(\prod_{i=1}^k(p_i+1)\;-\;\sum_{i=1}^k(p_i-1)\Bigr).
\]Prove that
\[
p^2-1 \;\bigm|\; p\,m \;-\; n.
\]
1 reply
MathMystic33
4 hours ago
grupyorum
3 hours ago
Non-homogeneous degree 3 inequality
Lukaluce   4
N 3 hours ago by Nuran2010
Source: 2024 Junior Macedonian Mathematical Olympiad P1
Let $a, b$, and $c$ be positive real numbers. Prove that
\[\frac{a^4 + 3}{b} + \frac{b^4 + 3}{c} + \frac{c^4 + 3}{a} \ge 12.\]When does equality hold?

Proposed by Petar Filipovski
4 replies
Lukaluce
Apr 14, 2025
Nuran2010
3 hours ago
Circumcircle of MUV tangent to two circles at once
MathMystic33   1
N 3 hours ago by ariopro1387
Source: Macedonian Mathematical Olympiad 2025 Problem 1
Given is an acute triangle \( \triangle ABC \) with \( AB < AC \). Let \( M \) be the midpoint of side \( BC \), and let \( X \) and \( Y \) be points on segments \( BM \) and \( CM \), respectively, such that \( BX = CY \). Let \( \omega_1 \) be the circumcircle of \( \triangle ABX \), and \( \omega_2 \) the circumcircle of \( \triangle ACY \). The common tangent \( t \) to \( \omega_1 \) and \( \omega_2 \), which lies closer to point \( A \), touches \( \omega_1 \) and \( \omega_2 \) at points \( P \) and \( Q \), respectively. Let the line \( MP \) intersect \( \omega_1 \) again at \( U \), and the line \( MQ \) intersect \( \omega_2 \) again at \( V \). Prove that the circumcircle of triangle \( \triangle MUV \) is tangent to both \( \omega_1 \) and \( \omega_2 \).
1 reply
MathMystic33
6 hours ago
ariopro1387
3 hours ago
Bears making swams
NO_SQUARES   0
4 hours ago
Source: Regional Stage of ARO 2025 11.7
There are several bears living on the $2025$ islands of the Arctic Ocean. Every bear sometimes swims from one island to another. It turned out that every bear made at least one swim in a year, but no two bears made equal swams. At the same time, exactly one swim was made between each two islands $A$ and $B$: either from $A$ to $B$ or from $B$ to $A$. Prove that there were no bears on some island at the beginning and at the end of the year.
A. Kuznetsov
0 replies
NO_SQUARES
4 hours ago
0 replies
((n-1)!-n)(n-2)!=m(m-2)
NO_SQUARES   0
4 hours ago
Source: Regional Stage of ARO 2025 9.5=11.4
Find all pairs of integer numbers $m$ and $n>2$ such that $((n-1)!-n)(n-2)!=m(m-2)$.
A. Kuznetsov
0 replies
NO_SQUARES
4 hours ago
0 replies
Maximum number of edge‐colors for strong monochromatic connectivity
MathMystic33   0
4 hours ago
Source: 2024 Macedonian Team Selection Test P5
Let \(P\) be a convex polyhedron with the following properties:
1) \(P\) has exactly \(666\) edges.
2) The degrees of all vertices of \(P\) differ by at most \(1\).
3) There is an edge‐coloring of \(P\) with \(k\) colors such that for each color \(c\) and any two distinct vertices \(V_1,V_2\), there exists a path from \(V_1\) to \(V_2\) all of whose edges have color \(c\).
Determine the largest positive integer \(k\) for which such a polyhedron \(P\) exists.
0 replies
MathMystic33
4 hours ago
0 replies
Functional equation with extra divisibility condition
MathMystic33   1
N 4 hours ago by grupyorum
Source: 2025 Macedonian Team Selection Test P4
Find all functions $f:\mathbb{N}_0\to\mathbb{N}$ such that
1) \(f(a)\) divides \(a\) for every \(a\in\mathbb{N}_0\), and
2) for all \(a,b,k\in\mathbb{N}_0\) we have
\[
    f\bigl(f(a)+kb\bigr)\;=\;f\bigl(a + k\,f(b)\bigr).
  \]
1 reply
MathMystic33
5 hours ago
grupyorum
4 hours ago
Concurrency of tangent touchpoint lines on thales circles
MathMystic33   0
4 hours ago
Source: 2024 Macedonian Team Selection Test P4
Let $\triangle ABC$ be an acute scalene triangle. Denote by $k_A$ the circle with diameter $BC$, and let $B_A,C_A$ be the contact points of the tangents from $A$ to $k_A$, chosen so that $B$ and $B_A$ lie on opposite sides of $AC$ and $C$ and $C_A$ lie on opposite sides of $AB$. Similarly, let $k_B$ be the circle with diameter $CA$, with tangents from $B$ touching at $C_B,A_B$, and $k_C$ the circle with diameter $AB$, with tangents from $C$ touching at $A_C,B_C$.
Prove that the lines $B_AC_A, C_BA_B, A_CB_C$ are concurrent.
0 replies
MathMystic33
4 hours ago
0 replies
Strategy game based modulo 3
egxa   1
N Apr 18, 2025 by Euler8038
Source: All Russian 2025 9.7
The numbers \( 1, 2, 3, \ldots, 60 \) are written in a row in that exact order. Igor and Ruslan take turns inserting the signs \( +, -, \times \) between them, starting with Igor. Each turn consists of placing one sign. Once all signs are placed, the value of the resulting expression is computed. If the value is divisible by $3$, Igor wins; otherwise, Ruslan wins. Which player has a winning strategy regardless of the opponent’s moves?
1 reply
egxa
Apr 18, 2025
Euler8038
Apr 18, 2025
Strategy game based modulo 3
G H J
G H BBookmark kLocked kLocked NReply
Source: All Russian 2025 9.7
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
egxa
210 posts
#1
Y by
The numbers \( 1, 2, 3, \ldots, 60 \) are written in a row in that exact order. Igor and Ruslan take turns inserting the signs \( +, -, \times \) between them, starting with Igor. Each turn consists of placing one sign. Once all signs are placed, the value of the resulting expression is computed. If the value is divisible by $3$, Igor wins; otherwise, Ruslan wins. Which player has a winning strategy regardless of the opponent’s moves?
This post has been edited 1 time. Last edited by egxa, Apr 18, 2025, 5:24 PM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Euler8038
5 posts
#2
Y by
Igor can just put the multiplication sign between 59 and 60 as his first move and he's guaranteed to win.
Z K Y
N Quick Reply
G
H
=
a