Summer is a great time to explore cool problems to keep your skills sharp!  Schedule a class today!

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
Line bisects a segment
buratinogigle   0
a few seconds ago
Source: Own, Entrance Exam for Grade 10 Admission, HSGS 2025
Let $ABC$ be a triangle with $AB = AC$. A circle $(O)$ is tangent to sides $AC$ and $AB$, and $O$ is the midpoint of $BC$. Points $E$ and $F$ lie on sides $AC$ and $AB$, respectively, such that segment $EF$ is tangent to circle $(O)$ at point $P$. Let $H$ and $K$ be the orthocenters of triangles $OBF$ and $OCE$, respectively. Prove that line $OP$ bisects segment $HK$.
0 replies
buratinogigle
a few seconds ago
0 replies
Inspired by sadwinter
sqing   0
3 minutes ago
Source: Own
Let $ 0<a <\frac{3}{2}$. Prove that
$$ \sqrt{ka+a^3}+\sqrt{ka+(3-2a)^3}+\sqrt{k(3-2a)+a^3} \geq 3\sqrt{k+1}$$Where $ 0\leq k\leq 10.5668462.$
$$ \sqrt{3a+a^3}+\sqrt{3a+(3-2a)^3}+\sqrt{3(3-2a)+a^3} \geq 6$$
0 replies
2 viewing
sqing
3 minutes ago
0 replies
A prime graph
Eyed   44
N 9 minutes ago by ezpotd
Source: ISL N2
For each prime $p$, construct a graph $G_p$ on $\{1,2,\ldots p\}$, where $m\neq n$ are adjacent if and only if $p$ divides $(m^{2} + 1-n)(n^{2} + 1-m)$. Prove that $G_p$ is disconnected for infinitely many $p$
44 replies
Eyed
Jul 20, 2021
ezpotd
9 minutes ago
Problem 12
SlovEcience   1
N 21 minutes ago by Mathzeus1024
Find all functions \( f: \mathbb{N} \to \mathbb{N} \) such that
\[
f(x^4 + 5y^4 + 10z^4) = f(x)^4 + 5f(y)^4 + 10f(z)^4
\]for all \( x, y, z \in \mathbb{N} \).
1 reply
SlovEcience
Today at 3:46 AM
Mathzeus1024
21 minutes ago
No more topics!
The Tetrahedral Space Partition
jannatiar   7
N Apr 3, 2025 by sami1618
Source: 2025 AlborzMO Day 2 P3
Is it possible to partition three-dimensional space into tetrahedra (not necessarily regular) such that there exists a plane that intersects the edges of each tetrahedron at exactly 4 or 0 points?

Proposed by Arvin Taheri
7 replies
jannatiar
Mar 9, 2025
sami1618
Apr 3, 2025
The Tetrahedral Space Partition
G H J
Source: 2025 AlborzMO Day 2 P3
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
jannatiar
21 posts
#1 • 2 Y
Y by sami1618, cubres
Is it possible to partition three-dimensional space into tetrahedra (not necessarily regular) such that there exists a plane that intersects the edges of each tetrahedron at exactly 4 or 0 points?

Proposed by Arvin Taheri
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
alinazarboland
172 posts
#3 • 2 Y
Y by sami1618, cubres
Hint
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
sami1618
920 posts
#4 • 1 Y
Y by cubres
does the partition need to be locally finite?
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
jannatiar
21 posts
#5 • 2 Y
Y by sami1618, cubres
sami1618 wrote:
does the partition need to be locally finite?
NO
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
sami1618
920 posts
#6 • 2 Y
Y by Sedro, cubres
Consider cartesian axes and specifically the $xy$-plane and a tiling of this plane with white and red unit squares in a checkerboard pattern (ensure the vertices of the squares are at lattice points). For each square, draw a regular tetrahedron with the property that each vertex of the square coincides with the midpoint of one of the edges of the tetrahedron. Notice for every square there are exactly two distinct possible ways the tetrahedron could be drawn. On the white squares ensure that the upper edge of the tetrahedron is parallel to the $x$-axis and for the red squares ensure that the upper edge of the tetrahedron is parallel to the $y$-axis.

Shown below are the tetrahedrons corresponding to four adjacent squares. By $180^{\circ}$ rotation about the $x$ or $y$ axis it is clear that the tetrahedrons fit together seamlessly and their vertices coincide with the midpoints of the edges of adjacent tetrahedron.
[asy]
size(200);
import three;
currentprojection = perspective(3,5,7);
draw(surface((-4,-4,0)--(4,-4,0)--(4,4,0)--(-4,4,0)--cycle), gray+opacity(0.2));
draw((-4,0,0)--(4,0,0), black);  // x-axis
draw((0,-4,0)--(0,4,0), black);  // y-axis
triple[] tetra1 = {(1,-1,1), (1,3,1), (-1,1,-1), (3,1,-1)};
triple[] tetra2 = {(-1,-3,1), (-1,1,1), (-3,-1,-1), (1,-1,-1)};
triple[] tetra3 = {(-3,1,1), (1,1,1), (-1,-1,-1), (-1,3,-1)};
triple[] tetra4 = {(-1,-1,1), (3,-1,1), (1,-3,-1), (1,1,-1)};
void drawTetra(triple[] T, pen color) {
    draw(surface(T[0]--T[1]--T[2]--cycle), color+opacity(0.4));
    draw(surface(T[0]--T[1]--T[3]--cycle), color+opacity(0.4));
    draw(T[0]--T[2]--T[1]--T[3]--cycle, black+linewidth(0.8));
    draw(T[0]--T[1], black+linewidth(0.8));}
drawTetra(tetra2, red);
drawTetra(tetra4, grey);
drawTetra(tetra1, red);
drawTetra(tetra3, grey);
draw(surface((-1,-1,1)--(-1,1,1)--(0,0,0)--cycle), red+opacity(0.4));
draw(surface((-1,-1,1)--(-1,1,1)--(-2,0,0)--cycle), red+opacity(0.4));
draw((-1,-1,1)--(-1,1,1), linewidth(0.8));
draw((2,2,0)--(2,-2,0)--(-2,-2,0)--(-2,2,0)--cycle);
draw((2,0,0)--(-2,0,0));
draw((0,2,0)--(0,-2,0));
draw((0,0,0)--(-1,1,1), linewidth(0.8));
draw((0,0,0)--(-1,-1,1), linewidth(0.8));
draw((-2,0,0)--(-1,1,1), linewidth(0.8));
draw((0,0,-4)--(0,0,4), black, Arrow3);
label("$z$", (0,0,4.5), N);
label("$x$", (4.5,0,0), E);
label("$y$", (0,4.5,0), N);
[/asy]
Now that this has been done to the $xy$-plane do this for all planes $z=k$ where $k$ is a non-zero integer (we are "stacking" the sheets of tetrahedron). It is not hard to see that after drawing such tetrahedron, we are left with a collection of octahedron in space. We now go through a separate procedure for partitioning each of these octahedron into tetrahedron.

If the octahedron does not touch the $xy$-plane we can simply divide it into four tetrahedron. Otherwise let the octahedron touch the $xy$-plane at $P$. Call the octahedron $\mathcal{O}$. Then let $\mathcal{O}_1$ be the result of $\mathcal{O}$ after applying the homothety centered at $P$ with factor $1/2$. Then $\mathcal{O}-\mathcal{O}_1$ can be tiled with a finite number of tetrahedron (specifically $14$). Then repeat this process with $\mathcal{O}_1$ and so on.

It can be shown that these tetrahedron do indeed form a partition of space. Since the $xy$-plane intersects each of the original tetrahedron at exactly $4$ points and non of the tetrahedron formed by portioning the octahedron touch the $xy$-plane, we are finished.
This post has been edited 3 times. Last edited by sami1618, Apr 3, 2025, 2:00 PM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
jannatiar
21 posts
#7 • 3 Y
Y by MS_asdfgzxcvb, sami1618, cubres
The answer is yes.

Lemma 1:A cube can be partitioned into a finite number of tetrahedra.

Proof: As shown in the figure below, a cube can be divided into six tetrahedra.

https://i.imgur.com/MB0Hzn3.png

First, consider a plane in three-dimensional space. Then, imagine two lines parallel to the plane, one on each side, arranged in such a way that the two lines are skew (non-parallel and non-intersecting) and perpendicular to each other. Next, consider infinitely many points on each of these two lines (as shown in the figure below).

https://i.imgur.com/lkdUw2G.png

Now, consider two consecutive points on one of the lines (for example, points A and B) and all the tetrahedra formed by A, B, and every pair of consecutive points on the other line. Clearly, this defines an infinitely long strip covering the original plane (as shown in the figure below).

https://i.imgur.com/0iIcawj.png

Now, we repeat the same process for every pair of consecutive points on the first line, thereby completely covering the original plane. Finally, it suffices to fill the two half-spaces (above and below the plane). According to Lemma 1, this can be achieved using a collection of cubes. This partitioning yields the desired result stated in the problem.
This post has been edited 3 times. Last edited by jannatiar, Apr 1, 2025, 3:47 PM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
jannatiar
21 posts
#8 • 1 Y
Y by cubres
sami1618 wrote:
incorrect solution

Where was this solution wrong?
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
sami1618
920 posts
#9 • 1 Y
Y by jannatiar
jannatiar wrote:
sami1618 wrote:
incorrect solution

Where was this solution wrong?

The part that went wrong was tiling the octahedron. For a set of polyhedron to partition space it must be that their union cover space and their interiors are non intersecting. My solution fell short of the first condition. This similar problem explains why. Consider an equilateral triangle. Divide it into four congruent equilateral triangles and add all but the central triangle to the partition. Repeat this process indefinitely with the remaining equilateral triangle. Then this is not a partition because the center of the equilateral triangle does not lie in the interior or on the boundary of any of the triangles in the partition.
[asy]
import geometry;
size(2cm);
pair A=dir(90); pair B=dir(210); pair C=dir(330);
pair A1=.5(C+B); pair B1=.5(A+C); pair C1=.5(A+B);
pair A2=.5(B1+C1); pair B2=.5(A1+C1); pair C2=.5(A1+B1);
pair A3=.5(B2+C2); pair B3=.5(A2+C2); pair C3=.5(A2+B2);
pair A4=.5(B3+C3); pair B4=.5(A3+C3); pair C4=.5(A3+B3);
filldraw(A--B1--C1--cycle, red+opacity(.5));
filldraw(B--A1--C1--cycle, red+opacity(.5));
filldraw(C--B1--A1--cycle, red+opacity(.5));
filldraw(A1--B2--C2--cycle, red+opacity(.5));
filldraw(B1--A2--C2--cycle, red+opacity(.5));
filldraw(C1--B2--A2--cycle, red+opacity(.5));
filldraw(A2--B3--C3--cycle, red+opacity(.5));
filldraw(B2--A3--C3--cycle, red+opacity(.5));
filldraw(C2--B3--A3--cycle, red+opacity(.5));
filldraw(A3--B4--C4--cycle, red+opacity(.5));
filldraw(B3--A4--C4--cycle, red+opacity(.5));
filldraw(C3--B4--A4--cycle, red+opacity(.5));
dot((0,0));
[/asy]
But this can be fixed if we ensure that the "limit points" lies on the boundary of the region we want to partition. I went back and fixed my original solution.
Z K Y
N Quick Reply
G
H
=
a