We have your learning goals covered with Spring and Summer courses available. Enroll today!

G
Topic
First Poster
Last Poster
k a March Highlights and 2025 AoPS Online Class Information
jlacosta   0
Mar 2, 2025
March is the month for State MATHCOUNTS competitions! Kudos to everyone who participated in their local chapter competitions and best of luck to all going to State! Join us on March 11th for a Math Jam devoted to our favorite Chapter competition problems! Are you interested in training for MATHCOUNTS? Be sure to check out our AMC 8/MATHCOUNTS Basics and Advanced courses.

Are you ready to level up with Olympiad training? Registration is open with early bird pricing available for our WOOT programs: MathWOOT (Levels 1 and 2), CodeWOOT, PhysicsWOOT, and ChemWOOT. What is WOOT? WOOT stands for Worldwide Online Olympiad Training and is a 7-month high school math Olympiad preparation and testing program that brings together many of the best students from around the world to learn Olympiad problem solving skills. Classes begin in September!

Do you have plans this summer? There are so many options to fit your schedule and goals whether attending a summer camp or taking online classes, it can be a great break from the routine of the school year. Check out our summer courses at AoPS Online, or if you want a math or language arts class that doesn’t have homework, but is an enriching summer experience, our AoPS Virtual Campus summer camps may be just the ticket! We are expanding our locations for our AoPS Academies across the country with 15 locations so far and new campuses opening in Saratoga CA, Johns Creek GA, and the Upper West Side NY. Check out this page for summer camp information.

Be sure to mark your calendars for the following events:
[list][*]March 5th (Wednesday), 4:30pm PT/7:30pm ET, HCSSiM Math Jam 2025. Amber Verser, Assistant Director of the Hampshire College Summer Studies in Mathematics, will host an information session about HCSSiM, a summer program for high school students.
[*]March 6th (Thursday), 4:00pm PT/7:00pm ET, Free Webinar on Math Competitions from elementary through high school. Join us for an enlightening session that demystifies the world of math competitions and helps you make informed decisions about your contest journey.
[*]March 11th (Tuesday), 4:30pm PT/7:30pm ET, 2025 MATHCOUNTS Chapter Discussion MATH JAM. AoPS instructors will discuss some of their favorite problems from the MATHCOUNTS Chapter Competition. All are welcome!
[*]March 13th (Thursday), 4:00pm PT/7:00pm ET, Free Webinar about Summer Camps at the Virtual Campus. Transform your summer into an unforgettable learning adventure! From elementary through high school, we offer dynamic summer camps featuring topics in mathematics, language arts, and competition preparation - all designed to fit your schedule and ignite your passion for learning.[/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
Sunday, Mar 2 - Jun 22
Friday, Mar 28 - Jul 18
Sunday, Apr 13 - Aug 10
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
Tuesday, Mar 25 - Jul 8
Sunday, Apr 13 - Aug 10
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, Mar 23 - Jul 20
Monday, Apr 7 - Jul 28
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
Sunday, Mar 16 - Jun 8
Wednesday, Apr 16 - Jul 2
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
Monday, Mar 17 - Jun 9
Thursday, Apr 17 - Jul 3
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
Sunday, Mar 2 - Jun 22
Wednesday, Apr 16 - Jul 30
Tuesday, May 6 - Aug 19
Wednesday, Jun 4 - Sep 17
Sunday, Jun 22 - Oct 19
Friday, Jul 18 - Nov 14

Introduction to Geometry
Tuesday, Mar 4 - Aug 12
Sunday, Mar 23 - Sep 21
Wednesday, Apr 23 - Oct 1
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

Intermediate: Grades 8-12

Intermediate Algebra
Sunday, Mar 16 - Sep 14
Tuesday, Mar 25 - Sep 2
Monday, Apr 21 - Oct 13
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
Sunday, Mar 23 - Aug 3
Wednesday, May 21 - Sep 17
Sunday, Jun 22 - Nov 2

Intermediate Number Theory
Friday, Apr 11 - Jun 27
Sunday, Jun 1 - Aug 24
Wednesday, Jun 18 - Sep 3

Precalculus
Sunday, Mar 16 - Aug 24
Wednesday, Apr 9 - Sep 3
Friday, May 16 - Oct 24
Sunday, Jun 1 - Nov 9
Monday, Jun 30 - Dec 8

Advanced: Grades 9-12

Olympiad Geometry
Wednesday, Mar 5 - May 21
Tuesday, Jun 10 - Aug 26

Calculus
Sunday, Mar 30 - Oct 5
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
Sunday, Mar 23 - Jun 15
Wednesday, Apr 16 - Jul 2
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
Friday, Apr 11 - Jun 27
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
Tuesday, Mar 4 - May 20
Monday, Mar 31 - Jun 23
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

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

Physics 1: Mechanics
Tuesday, Mar 25 - Sep 2
Thursday, May 22 - Oct 30
Monday, Jun 23 - Dec 15

Relativity
Sat & Sun, Apr 26 - Apr 27 (4:00 - 7:00 pm ET/1:00 - 4:00pm PT)
Mon, Tue, Wed & Thurs, Jun 23 - Jun 26 (meets every day of the week!)
0 replies
jlacosta
Mar 2, 2025
0 replies
i need help
MR.1   1
N 3 minutes ago by MR.1
Source: help
can you guys tell me problems about fe in $R+$(i know $R$ well). i want to study so if you guys have some easy or normal problems please send me
1 reply
+1 w
MR.1
2 hours ago
MR.1
3 minutes ago
D1010 : How it is possible ?
Dattier   4
N 5 minutes ago by whwlqkd
Source: les dattes à Dattier
Is it true that$$\forall n \in \mathbb N^*, (24^n \times B \mod A) \mod 2 = 0 $$?

A=172840090421781518678763921675392141786000436658021921275090402437796947824966464426797102
59525308036470431210259590181720483369539690621515342820528633073982816814653666658107757108
67856720572225880311472925624694183944650261079955759251769111321319421445397848518597584590
900951222557860592579005088853698315463815905425095325508106272375728975

B=227564340154808184720778276049144229526648735475052708528935496537676518846805227119017278
70644188547893224843051453107076145465733981826429238937805270372241433808862604677609912285
67577953725945090125797351518670892779468968705801340068681556238850340398780828104506916965
606659768601942798676554332768254089685307970609932846902
4 replies
Dattier
Mar 10, 2025
whwlqkd
5 minutes ago
If a^2024, b^2024, c^2024--- triangle, then (a/2024), b, c also (or similar)
NO_SQUARES   1
N 23 minutes ago by NO_SQUARES
Source: Kvant 2025 no. 1 M2827 and The XIX Southern Mathematical Tournament
It is known about positive numbers $a, b, c$ that it is possible to form a triangle from segments of length $a^{2024}, b^{2024}, c^{2024}$. Prove that it is possible to reduce one of the numbers $a, b, c$ by $2024$ times and obtain the numbers $a', b', c'$ so that segments with lengths $a', b', c'$ can also be formed into a triangle.
L. Shatunov
1 reply
NO_SQUARES
Yesterday at 3:18 PM
NO_SQUARES
23 minutes ago
Inspired by Kazakhstan 2017
sqing   2
N 37 minutes ago by Ash_the_Bash07
Source: Own
Let $a,b,c\ge \frac{1}{2}$ and $a^2+b^2+c^2=2. $ Prove that
$$\left(\frac{2}{a}+\frac{1}{b}-\frac{1}{c}\right)\left(\frac{2}{a}-\frac{1}{b}+\frac{1}{c}\right)\ge \frac{8}{3}$$
2 replies
sqing
an hour ago
Ash_the_Bash07
37 minutes ago
No more topics!
Dragon moving in a board
Jutaro   3
N Sep 15, 2007 by daniel73
Source: Iberoamerican Olympiad 2007, problem 4
In a $ 19\times 19$ board, a piece called dragon moves as follows: It travels by four squares (either horizontally or vertically) and then it moves one square more in a direction perpendicular to its previous direction. It is known that, moving so, a dragon can reach every square of the board.

The draconian distance between two squares is defined as the least number of moves a dragon needs to move from one square to the other.

Let $ C$ be a corner square, and $ V$ the square neighbor of $ C$ that has only a point in common with $ C$. Show that there exists a square $ X$ of the board, such that the draconian distance between $ C$ and $ X$ is greater than the draconian distance between $ C$ and $ V$.
3 replies
Jutaro
Sep 14, 2007
daniel73
Sep 15, 2007
Dragon moving in a board
G H J
Source: Iberoamerican Olympiad 2007, problem 4
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Jutaro
388 posts
#1 • 4 Y
Y by Adventure10, Mango247, Mango247, Mango247
In a $ 19\times 19$ board, a piece called dragon moves as follows: It travels by four squares (either horizontally or vertically) and then it moves one square more in a direction perpendicular to its previous direction. It is known that, moving so, a dragon can reach every square of the board.

The draconian distance between two squares is defined as the least number of moves a dragon needs to move from one square to the other.

Let $ C$ be a corner square, and $ V$ the square neighbor of $ C$ that has only a point in common with $ C$. Show that there exists a square $ X$ of the board, such that the draconian distance between $ C$ and $ X$ is greater than the draconian distance between $ C$ and $ V$.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
daniel73
253 posts
#2 • 2 Y
Y by Adventure10, Mango247
Consider a set of coordinates so that corner $ C$ is $ (0,0)$, the opposite corner of the $ 19\times19$ grid is $ (18,18)$, $ V$ is obviously $ (1,1)$ and wlog because of symmetry the first coordinate is horizontal and the second coordinate is vertical. We will call "horizontal" a move that changes the horizontal coordinate by 4 and the vertical coordinate by 1; "vertical" moves are defined reciprocally.

Since from $ (0,0)$ to $ (1,1)$, the horizontal coordinate changes by 1, the number of vertical moves must be odd. Likewise, the number of horizontal moves must be odd. Assume that the dragon may move from $ (0,0)$ to $ (1,1)$ with less than 8 moves. Then it must be able to do it with 6 or less, i.e., at most 3 moves in each direction. So, the net change introduced by horizontal moves in the vertical coordinate is at most 3 (at most 3 times 1), while the change introduced by vertical moves in the vertical direction is at least 4 (odd number of times 4). Since the net change in the vertical coordinate is $ +1$, we would necessarily need two "upward" vertical moves, one "downward" vertical move and three horizontal moves so that in the three of them the change in the vertical coordinate is downward. Similarly, we would need two "rightbound" horizontal moves, one "leftbound" horizontal move and three vertical moves so that in the three of them the change in the horizontal coordinate is to the left (assuming 0 is the leftmost column, 18 the rightmost column). But this is impossible, since the first move must be horizontal righbound and up, or vertical upward and rightbound. So at least 8 moves are necessary. With 8 moves it is possible: $ (0,0)\rightarrow(4,1)\rightarrow(8,0)\rightarrow(7,4)\rightarrow(6,8)\rightarrow(2,7)\rightarrow(1,3)\rightarrow(5,2)\rightarrow(1,1)$.

So we need to find a square such that the dragon takes at least 9 moves to get to it, and one such square is $ (18,17)$. Since the change in vertical coordinates is odd, an odd number of horizontal moves is needed; similarly, an even number of vertical moves is needed. So if it is possible to get from $ (0,0)$ to $ (18,17)$ in 8 moves or less, it is possible to do it in at most 7 moves. If the change in both coordinates is added in absolute value, the net change in the sum of coordinates is at most 5, so 7 moves may bring a sum of changes in both coordinates of at most 35. But the net change in coordinates from $ (0,0)$ to $ (18,17)$ is exactly 35, so all changes in the horizontal direction (be it through horizontal or vertical moves) must be of the same sign, and likewise in the vertical direction. Or, if we have exactly $ h$ horizontal moves and $ v$ vertical moves, it must hold that $ 18 = 4h+v$ and $ 17 = h+4v$, yielding $ 1 = 3(h-v)$, absurd. So at least 9 moves are needed to get from $ (0,0)$ to $ (18,17)$. Such a sequence of 9 moves is $ (0,0)\rightarrow(4,1)\rightarrow(8,0)\rightarrow(9,4)\rightarrow(10,8)\rightarrow(11,12)\rightarrow(12,16)\rightarrow(13,12)\rightarrow(14,16)\rightarrow(18,17)$.

I just realized that I have actually gone beyond the scope of the problem, since it was enough to show that it is not possible to get from $ (0,0)$ to $ (18,17)$ in less than 9 moves (I have shown that it is actually possible to do it in exactly 9 moves) and that it is possible to get from $ (0,0)$ to $ (1,1)$ in no more than 8 moves (I have shown that 8 is the minimum number of moves required)... :wink:
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Umut Varolgunes
279 posts
#3 • 2 Y
Y by Adventure10, Mango247
same solution and i like this question. good number 4 i think.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
daniel73
253 posts
#4 • 2 Y
Y by Adventure10, Mango247
Yep, numbers 1 and 4 problems in Ibero are typically problems where no "heavy equipment" is necessary at all, but if you fail to see the "essence" of the problem (in this case I would say parity is this "essence"), you bang your head against the wall to no avail... :( Overall very simple (to IMO standards) problems, but good fun nonetheless :)
Z K Y
N Quick Reply
G
H
=
a