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
Thursday at 11:16 PM
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
Thursday at 11:16 PM
0 replies
square root problem
kjhgyuio   1
N 4 minutes ago by kjhgyuio
........
1 reply
kjhgyuio
32 minutes ago
kjhgyuio
4 minutes ago
A nice and easy gem off of StackExchange
NamelyOrange   2
N 27 minutes ago by Royal_mhyasd
Source: https://math.stackexchange.com/questions/3818796/
Define $S$ as the set of all numbers of the form $2^i5^j$ for some nonnegative $i$ and $j$. Find (with proof) all pairs $(m,n)$ such that $m,n\in S$ and $m-n=1$.


Rephrased: Solve $2^a5^b-2^c5^d=1$ over $(\mathbb{N}_0)^4$, and prove that your solution(s) is/are the only one(s).
2 replies
1 viewing
NamelyOrange
Yesterday at 8:13 PM
Royal_mhyasd
27 minutes ago
Comics and triangles in perspective
srirampanchapakesan   1
N 29 minutes ago by ohiorizzler1434
Source: Own
Let a conic intersect the sides BC, CA, AB of triangle ABC at A1,A2,B1,B2,C1,C2.

T1 is the triangle formed by A1B2, B1C2, and C1A2.

T2 is the triangle formed by A2B1, B2C1 and C2A1.

Prove that the triangles ABC, T1 and T2 are pair-wise in perspective.

Also prove that all three centers of perspective coincide.
1 reply
srirampanchapakesan
an hour ago
ohiorizzler1434
29 minutes ago
Integer a_k such that b - a^n_k is divisible by k
orl   70
N 29 minutes ago by Aiden-1089
Source: IMO Shortlist 2007, N2, Ukrainian TST 2008 Problem 10
Let $b,n > 1$ be integers. Suppose that for each $k > 1$ there exists an integer $a_k$ such that $b - a^n_k$ is divisible by $k$. Prove that $b = A^n$ for some integer $A$.

Author: Dan Brown, Canada
70 replies
orl
Jul 13, 2008
Aiden-1089
29 minutes ago
Putnam 1954 A6
sqrtX   1
N Yesterday at 8:52 PM by centslordm
Source: Putnam 1954
Suppose that $u_0 , u_1 ,\ldots$ is a sequence of real numbers such that
$$u_n =  \sum_{k=1}^{\infty} u_{n+k}^{2}\;\;\; \text{for} \; n=0,1,2,\ldots$$Prove that if $\sum u_n$ converges, then $u_k=0$ for all $k$.
1 reply
sqrtX
Jul 17, 2022
centslordm
Yesterday at 8:52 PM
Putnam 1954 A3
sqrtX   2
N Yesterday at 8:49 PM by centslordm
Source: Putnam 1954
Prove that if the family of integral curves of the differential equation
$$ \frac{dy}{dx} +p(x) y= q(x),$$where $p(x) q(x) \ne 0$, is cut by the line $x=k$ the tangents at the points of intersection are concurrent.
2 replies
sqrtX
Jul 17, 2022
centslordm
Yesterday at 8:49 PM
Putnam 1954 A1
sqrtX   2
N Yesterday at 8:47 PM by centslordm
Source: Putnam 1954
Let $n$ be an odd integer greater than $1.$ Let $A$ be an $n\times n$ symmetric matrix such that each row and column consists of some permutation of the integers $1,2, \ldots, n.$ Show that each of the integers $1,2, \ldots, n$ must appear in the main diagonal of $A$.
2 replies
sqrtX
Jul 17, 2022
centslordm
Yesterday at 8:47 PM
Putnam 1953 B1
sqrtX   7
N Yesterday at 8:45 PM by centslordm
Source: Putnam 1953
Is the infinite series
$$\sum_{n=1}^{\infty} \frac{1}{n^{1+\frac{1}{n}}}$$convergent?
7 replies
sqrtX
Jul 16, 2022
centslordm
Yesterday at 8:45 PM
1953 Putnam A2
Taco12   4
N Yesterday at 8:40 PM by centslordm
Source: 1953 Putnam A2
The complete graph with 6 points and 15 edges has each edge colored red or blue. Show that we can find 3 points such that the 3 edges joining them are the same color.
4 replies
Taco12
Aug 20, 2021
centslordm
Yesterday at 8:40 PM
Putnam 1952 B4
sqrtX   1
N Yesterday at 8:37 PM by centslordm
Source: Putnam 1952
A homogeneous solid body is made by joining a base of a circular cylinder of height $h$ and radius $r,$ and the base of a hemisphere of radius $r.$ This body is placed with the hemispherical end on a horizontal table, with the axis of the cylinder in a vertical position, and then slightly oscillated. It is intuitively evident that if $r$ is large as compared to $h$, the equilibrium will be stable; but if $r$ is small compared to $h$, the equilibrium will be unstable. What is the critical value of the ratio $r\slash h$ which enables the body to rest in neutral equilibrium in any position?
1 reply
sqrtX
Jul 7, 2022
centslordm
Yesterday at 8:37 PM
Putnam 1952 B3
centslordm   2
N Yesterday at 8:32 PM by centslordm
Develop necessary and sufficient conditions that the equation \[ \begin{vmatrix} 0 & a_1 - x & a_2 - x \\ -a_1 - x & 0 & a_3 - x \\ -a_2 - x & -a_3 - x & 0\end{vmatrix} = 0 \qquad (a_i \neq 0) \]shall have a multiple root.
2 replies
centslordm
May 30, 2022
centslordm
Yesterday at 8:32 PM
Putnam 1952 A6
centslordm   1
N Yesterday at 8:29 PM by centslordm
A man has a rectangular block of wood $m$ by $n$ by $r$ inches ($m, n,$ and $r$ are integers). He paints the entire surface of the block, cuts the block into inch cubes, and notices that exactly half the cubes are completely unpainted. Prove that the number of essentially different blocks with this property is finite. (Do not attempt to enumerate them.)
1 reply
centslordm
May 29, 2022
centslordm
Yesterday at 8:29 PM
Putnam 1952 A4
centslordm   2
N Yesterday at 8:23 PM by centslordm
The flag of the United Nations consists of a polar map of the world, with the North Pole as its center, extending to approximately $45^\circ$ South Latitude. The parallels of latitude are concentric circles with radii proportional to their co-latitudes. Australia is near the periphery of the map and is intersected by the parallel of latitude $30^\circ$ S.In the very close vicinity of this parallel how much are East and West distances exaggerated as compared to North and South distances?
2 replies
centslordm
May 29, 2022
centslordm
Yesterday at 8:23 PM
Putnam 1958 November A7
sqrtX   1
N Yesterday at 5:29 PM by centslordm
Source: Putnam 1958 November
Let $a$ and $b$ be relatively prime positive integers, $b$ even. For each positive integer $q$, let $p=p(q)$ be chosen so that
$$ \left| \frac{p}{q} - \frac{a}{b}  \right|$$is a minimum. Prove that
$$ \lim_{n \to \infty} \sum_{q=1 }^{n} \frac{ q\left| \frac{p}{q} - \frac{a}{b}  \right|}{n} = \frac{1}{4}.$$
1 reply
sqrtX
Jul 19, 2022
centslordm
Yesterday at 5:29 PM
Really easy "divide the cube in cubes" problem
cyshine   4
N Nov 8, 2009 by davicoelhoamorim
Source: Brazilian Math Olympiad, Problem 4
Prove that there exists a positive integer $ n_0$ with the following property: for each integer $ n \geq n_0$ it is possible to partition a cube into $ n$ smaller cubes.
4 replies
cyshine
Oct 22, 2009
davicoelhoamorim
Nov 8, 2009
Really easy "divide the cube in cubes" problem
G H J
Source: Brazilian Math Olympiad, Problem 4
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
cyshine
236 posts
#1 • 3 Y
Y by Davi-8191, Adventure10, Mango247
Prove that there exists a positive integer $ n_0$ with the following property: for each integer $ n \geq n_0$ it is possible to partition a cube into $ n$ smaller cubes.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Mathias_DK
1312 posts
#2 • 2 Y
Y by Adventure10, Mango247
cyshine wrote:
Prove that there exists a positive integer $ n_0$ with the following property: for each integer $ n \geq n_0$ it is possible to partition a cube into $ n$ smaller cubes.
We can partion any cube into $ 8$ smaller cubes or $ 27$ smaller cubes easily.($ 2^3=8,3^3=27$)

So if we can split a cube into $ m$ smaller cubes we can also split it into $ m+7$ and $ m+26$ smaller cubes. Since we can "split" it into $ 1$ cube we can split it into $ 1+7x+26y$ for any $ x,y \in \mathbb{N}_0$. $ 1+7x+26y = n \iff x = \frac{n-1-26y}{7}$. Let $ 0 \le y \le 6$ be such that $ 26y \equiv n-1 \bmod 7 \iff y \equiv 3n-3 \bmod 7$. Let $ n_0 = 1 + 26 \cdot 6$, then $ x \ge 0$ and we can split it into $ n$ smaller cubes whenever $ n \ge n_0$. QED
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
mszew
1044 posts
#3 • 1 Y
Y by Adventure10
check http://www.research.att.com/~njas/sequences/A014544

for minimum $ n_0=48$[/hide]
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
jmerry
12096 posts
#4 • 4 Y
Y by Adventure10, Mango247, and 2 other users
Mathias' argument gives us that $ n_0=1+(7-1)(26-1)+1=152$ works; $ 150$ is the largest positive integer that can't be written as a sum of sevens and 26s. Obviously, we can do better.

First, that $ 26$ could be $ 19$; rather than replacing a $ 1\times 1\times 1$ cube with $ 27$ $ \frac13\times\frac13\times\frac13$ cubes, we replace it with one $ \frac23\times\frac23\times\frac23$ and $ 19$ $ \frac13\times\frac13\times\frac13$ cubes. Since adding $ 26$ is possible by doing the above and then splitting the large cube into eight pieces, we don't need to include it separately. From sevens and nineteens, we get a new estimate of $ n_0\ge 6\cdot 18+2=110$.
For the next improvement, consider breaking a $ 1\times 1\times 1$ into a $ \frac34\times\frac34\times\frac34$ and $ 37$ $ \frac14\times\frac14\times\frac14$ cubes; this allows us to add $ 37$. This is very useful, since $ 19\equiv -2\mod 7$ and $ 37\equiv 2\mod 7$. The multiples $ 0,19,38,57,76,37,74$ form a complete system of residues mod $ 7$, and $ 69$ is the last number we can't get as a sum of copies of $ 7,19,37$. The new estimate is $ n_0\ge 71$.

Finally, there are ways to dissect a cube into $ 49$, $ 51$, or $ 54$ smaller cubes, which effectively replace my dissections into $ 77,$ $ 58,$ and $ 75$ cubes respectively. You can look them up at mszew's link, or try to find them yourself if you're feeling clever. That gets $ n_0$ down to $ 48$.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
davicoelhoamorim
2 posts
#5 • 1 Y
Y by Adventure10
We can partion any cube into 8 and 27 cubes. So, we can partion any cube into 8+7k, 8k+26, 27+7K and 27+7k.
8+26k and 27+26k form a complete set of residue classes modulo 7. So, we form all numbers greater than 152 (n0=152).. If we can partion any cube into x cubes, we can partion into x+7k
Z K Y
N Quick Reply
G
H
=
a