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 June Highlights and 2025 AoPS Online Class Information
jlacosta   0
Jun 2, 2025
Congratulations to all the mathletes who competed at National MATHCOUNTS! If you missed the exciting Countdown Round, you can watch the video at this link. Are you interested in training for MATHCOUNTS or AMC 10 contests? How would you like to train for these math competitions in half the time? We have accelerated sections which meet twice per week instead of once starting on July 8th (7:30pm ET). These sections fill quickly so enroll today!

[list][*]MATHCOUNTS/AMC 8 Basics
[*]MATHCOUNTS/AMC 8 Advanced
[*]AMC 10 Problem Series[/list]
For those interested in Olympiad level training in math, computer science, physics, and chemistry, be sure to enroll in our WOOT courses before August 19th to take advantage of early bird pricing!

Summer camps are starting this 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 a transformative 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][*]June 5th, Thursday, 7:30pm ET: Open Discussion with Ben Kornell and Andrew Sutherland, Art of Problem Solving's incoming CEO Ben Kornell and CPO Andrew Sutherland host an Ask Me Anything-style chat. Come ask your questions and get to know our incoming CEO & CPO!
[*]June 9th, Monday, 7:30pm ET, Game Jam: Operation Shuffle!, Come join us to play our second round of Operation Shuffle! If you enjoy number sense, logic, and a healthy dose of luck, this is the game for you. No specific math background is required; all are welcome.[/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, Jun 15 - Oct 12
Monday, Jun 30 - Oct 20
Wednesday, Jul 16 - Oct 29
Sunday, Aug 17 - Dec 14
Tuesday, Aug 26 - Dec 16
Friday, Sep 5 - Jan 16
Monday, Sep 8 - Jan 12
Tuesday, Sep 16 - Jan 20 (4:30 - 5:45 pm ET/1:30 - 2:45 pm PT)
Sunday, Sep 21 - Jan 25
Thursday, Sep 25 - Jan 29
Wednesday, Oct 22 - Feb 25
Tuesday, Nov 4 - Mar 10
Friday, Dec 12 - Apr 10

Prealgebra 2 Self-Paced

Prealgebra 2
Monday, Jun 2 - Sep 22
Sunday, Jun 29 - Oct 26
Friday, Jul 25 - Nov 21
Sunday, Aug 17 - Dec 14
Tuesday, Sep 9 - Jan 13
Thursday, Sep 25 - Jan 29
Sunday, Oct 19 - Feb 22
Monday, Oct 27 - Mar 2
Wednesday, Nov 12 - Mar 18

Introduction to Algebra A Self-Paced

Introduction to Algebra A
Sunday, Jun 15 - Oct 12
Thursday, Jun 26 - Oct 9
Tuesday, Jul 15 - Oct 28
Sunday, Aug 17 - Dec 14
Wednesday, Aug 27 - Dec 17
Friday, Sep 5 - Jan 16
Thursday, Sep 11 - Jan 15
Sunday, Sep 28 - Feb 1
Monday, Oct 6 - Feb 9
Tuesday, Oct 21 - Feb 24
Sunday, Nov 9 - Mar 15
Friday, Dec 5 - Apr 3

Introduction to Counting & Probability Self-Paced

Introduction to Counting & Probability
Sunday, Jun 1 - Aug 24
Thursday, Jun 12 - Aug 28
Wednesday, Jul 2 - Sep 17
Sunday, Jul 27 - Oct 19
Monday, Aug 11 - Nov 3
Wednesday, Sep 3 - Nov 19
Sunday, Sep 21 - Dec 14 (1:00 - 2:30 pm ET/10:00 - 11:30 am PT)
Friday, Oct 3 - Jan 16
Tuesday, Nov 4 - Feb 10
Sunday, Dec 7 - Mar 8

Introduction to Number Theory
Monday, Jun 9 - Aug 25
Sunday, Jun 15 - Sep 14
Tuesday, Jul 15 - Sep 30
Wednesday, Aug 13 - Oct 29
Friday, Sep 12 - Dec 12
Sunday, Oct 26 - Feb 1
Monday, Dec 1 - Mar 2

Introduction to Algebra B Self-Paced

Introduction to Algebra B
Wednesday, Jun 4 - Sep 17
Sunday, Jun 22 - Oct 19
Friday, Jul 18 - Nov 14
Thursday, Aug 7 - Nov 20
Monday, Aug 18 - Dec 15
Sunday, Sep 7 - Jan 11
Thursday, Sep 11 - Jan 15
Wednesday, Sep 24 - Jan 28
Sunday, Oct 26 - Mar 1
Tuesday, Nov 4 - Mar 10
Monday, Dec 1 - Mar 30

Introduction to Geometry
Monday, Jun 16 - Dec 8
Friday, Jun 20 - Jan 9
Sunday, Jun 29 - Jan 11
Monday, Jul 14 - Jan 19
Wednesday, Aug 13 - Feb 11
Tuesday, Aug 26 - Feb 24
Sunday, Sep 7 - Mar 8
Thursday, Sep 11 - Mar 12
Wednesday, Sep 24 - Mar 25
Sunday, Oct 26 - Apr 26
Monday, Nov 3 - May 4
Friday, Dec 5 - May 29

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
Friday, Aug 8 - Feb 20
Tuesday, Aug 26 - Feb 24
Sunday, Sep 28 - Mar 29
Wednesday, Oct 8 - Mar 8
Sunday, Nov 16 - May 17
Thursday, Dec 11 - Jun 4

Intermediate Counting & Probability
Sunday, Jun 22 - Nov 2
Sunday, Sep 28 - Feb 15
Tuesday, Nov 4 - Mar 24

Intermediate Number Theory
Sunday, Jun 1 - Aug 24
Wednesday, Jun 18 - Sep 3
Wednesday, Sep 24 - Dec 17

Precalculus
Sunday, Jun 1 - Nov 9
Monday, Jun 30 - Dec 8
Wednesday, Aug 6 - Jan 21
Tuesday, Sep 9 - Feb 24
Sunday, Sep 21 - Mar 8
Monday, Oct 20 - Apr 6
Sunday, Dec 14 - May 31

Advanced: Grades 9-12

Olympiad Geometry
Tuesday, Jun 10 - Aug 26

Calculus
Wednesday, Jun 25 - Dec 17
Sunday, Sep 7 - Mar 15
Wednesday, Sep 24 - Apr 1
Friday, Nov 14 - May 22

Group Theory
Thursday, Jun 12 - Sep 11

Contest Preparation: Grades 6-12

MATHCOUNTS/AMC 8 Basics
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!)
Sunday, Aug 17 - Nov 9
Wednesday, Sep 3 - Nov 19
Tuesday, Sep 16 - Dec 9
Sunday, Sep 21 - Dec 14 (1:00 - 2:30 pm ET/10:00 - 11:30 am PT)
Monday, Oct 6 - Jan 12
Thursday, Oct 16 - Jan 22
Tues, Thurs & Sun, Dec 9 - Jan 18 (meets three times a week!)

MATHCOUNTS/AMC 8 Advanced
Wednesday, Jun 11 - Aug 27
Sunday, Jun 22 - Sep 21
Tues & Thurs, Jul 8 - Aug 14 (meets twice a week!)
Sunday, Aug 17 - Nov 9
Tuesday, Aug 26 - Nov 11
Thursday, Sep 4 - Nov 20
Friday, Sep 12 - Dec 12
Monday, Sep 15 - Dec 8
Sunday, Oct 5 - Jan 11
Tues, Thurs & Sun, Dec 2 - Jan 11 (meets three times a week!)
Mon, Wed & Fri, Dec 8 - Jan 16 (meets three times a week!)

AMC 10 Problem Series
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!)
Sunday, Aug 10 - Nov 2
Thursday, Aug 14 - Oct 30
Tuesday, Aug 19 - Nov 4
Mon & Wed, Sep 15 - Oct 22 (meets twice a week!)
Mon, Wed & Fri, Oct 6 - Nov 3 (meets three times a week!)
Tue, Thurs & Sun, Oct 7 - Nov 2 (meets three times a week!)

AMC 10 Final Fives
Monday, Jun 30 - Jul 21
Friday, Aug 15 - Sep 12
Sunday, Sep 7 - Sep 28
Tuesday, Sep 9 - Sep 30
Monday, Sep 22 - Oct 13
Sunday, Sep 28 - Oct 19 (1:00 - 2:30 pm ET/10:00 - 11:30 am PT)
Wednesday, Oct 8 - Oct 29
Thursday, Oct 9 - Oct 30

AMC 12 Problem Series
Thursday, Jun 12 - Aug 28
Sunday, Jun 22 - Sep 21
Wednesday, Aug 6 - Oct 22
Sunday, Aug 10 - Nov 2
Monday, Aug 18 - Nov 10
Mon & Wed, Sep 15 - Oct 22 (meets twice a week!)
Tues, Thurs & Sun, Oct 7 - Nov 2 (meets three times a week!)

AMC 12 Final Fives
Thursday, Sep 4 - Sep 25
Sunday, Sep 28 - Oct 19
Tuesday, Oct 7 - Oct 28

AIME Problem Series A
Thursday, Oct 23 - Jan 29

AIME Problem Series B
Sunday, Jun 22 - Sep 21
Tuesday, Sep 2 - Nov 18

F=ma Problem Series
Wednesday, Jun 11 - Aug 27
Tuesday, Sep 16 - Dec 9
Friday, Oct 17 - Jan 30

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
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
Thursday, Aug 14 - Oct 30
Sunday, Sep 7 - Nov 23
Tuesday, Dec 2 - Mar 3

Intermediate Programming with Python
Sunday, Jun 1 - Aug 24
Monday, Jun 30 - Sep 22
Friday, Oct 3 - Jan 16

USACO Bronze Problem Series
Sunday, Jun 22 - Sep 1
Wednesday, Sep 3 - Dec 3
Thursday, Oct 30 - Feb 5
Tuesday, Dec 2 - Mar 3

Physics

Introduction to Physics
Sunday, Jun 15 - Sep 14
Monday, Jun 23 - Sep 15
Tuesday, Sep 2 - Nov 18
Sunday, Oct 5 - Jan 11
Wednesday, Dec 10 - Mar 11

Physics 1: Mechanics
Monday, Jun 23 - Dec 15
Sunday, Sep 21 - Mar 22
Sunday, Oct 26 - Apr 26

Relativity
Mon, Tue, Wed & Thurs, Jun 23 - Jun 26 (meets every day of the week!)
0 replies
jlacosta
Jun 2, 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
A function on a 2D grid
Rijul saini   2
N 30 minutes ago by Supercali
Source: India IMOTC 2025 Day 4 Problem 2
Does there exist a function $f:\{1,2,...,2025\}^2 \rightarrow \{1,2,...,2025\}$ such that:

$\bullet$ for any positive integer $i \leqslant 2025$, the numbers $f(i,1),f(i,2),...,f(i,2025)$ are all distinct, and
$\bullet$ for any positive integers $i \leqslant 2025$ and $j \leqslant 2024$, $f(f(i,j),f(i,j+1))=i$?

Proposed by Shantanu Nene
2 replies
Rijul saini
Wednesday at 6:46 PM
Supercali
30 minutes ago
ISI UGB 2025 P8
SomeonecoolLovesMaths   7
N an hour ago by Ilovesumona
Source: ISI UGB 2025 P8
Let $n \geq 2$ and let $a_1 \leq a_2 \leq \cdots \leq a_n$ be positive integers such that $\sum_{i=1}^{n} a_i = \prod_{i=1}^{n} a_i$. Prove that $\sum_{i=1}^{n} a_i \leq 2n$ and determine when equality holds.
7 replies
SomeonecoolLovesMaths
May 11, 2025
Ilovesumona
an hour ago
k colorings and triangles
Rijul saini   1
N an hour ago by YaoAOPS
Source: LMAO Revenge 2025 Day 1 Problem 3
In the city of Timbuktu, there is an orphanage. It shelters children from the new mysterious disease that causes children to explode. There are m children in the orphanage. To try to cure this disease, a mad scientist named Myla has come up with an innovative cure. She ties every child to every other child using medicinal ropes. Every child is connected to every other child using one of $k$ different ropes. She then performs a experiment that causes $3$ children, each connected to each other with the same type of rope, to be cured. Two experiments are said to be of the same type, if each of the ropes connecting the children has the same medicine imbued in it. She then unties them and lets them go back home.

We let $f(n, k)$ be the minimum m such that Myla can perform at least $n$ experiments of the same type. Prove that:

$i.$ For every $k \in \mathbb N$ there exists a $N_k \in N$ and $a_k, b_k \in \mathbb Z$ such that for all $n > N_k$, \[f(n, k) = a_kn + b_k.\]
$ii.$ Find the value of $a_k$ for every $k \in \mathbb N$.
1 reply
Rijul saini
Wednesday at 7:11 PM
YaoAOPS
an hour ago
A beautiful Lemoine point problem
phonghatemath   2
N an hour ago by HyperDunteR
Source: my teacher
Given triangle $ABC$ inscribed in a circle with center $O$. $P$ is any point not on (O). $AP, BP, CP$ intersect $(O)$ at $A', B', C'$. Let $L, L'$ be the Lemoine points of triangle $ABC, A'B'C'$ respectively. Prove that $P, L, L'$ are collinear.
2 replies
phonghatemath
4 hours ago
HyperDunteR
an hour ago
Iran TST Starter
M11100111001Y1R   9
N an hour ago by Giabach298
Source: Iran TST 2025 Test 1 Problem 1
Let \( a_n \) be a sequence of positive real numbers such that for every \( n > 2025 \), we have:
\[
a_n = \max_{1 \leq i \leq 2025} a_{n-i} - \min_{1 \leq i \leq 2025} a_{n-i}
\]Prove that there exists a natural number \( M \) such that for all \( n > M \), the following holds:
\[
a_n < \frac{1}{1404}
\]
9 replies
M11100111001Y1R
May 27, 2025
Giabach298
an hour ago
A scalene triangle and nine point circle
ariopro1387   3
N 2 hours ago by Giabach298
Source: Iran Team selection test 2025 - P12
In a scalene triangle $ABC$, points $Y$ and $X$ lie on $AC$ and $BC$ respectively such that $BC \perp XY$. Points $Z$ and $T$ are the reflections of $X$ and $Y$ with respect to the midpoints of sides $BC$ and $AC$, respectively. Point $P$ lies on segment $ZT$ such that the circumcenter of triangle $XZP$ coincides with the circumcenter of triangle $ABC$.
Prove that the nine-point circle of triangle $ABC$ passes through the midpoint of segment $XP$.
3 replies
ariopro1387
May 27, 2025
Giabach298
2 hours ago
inequality
SunnyEvan   0
2 hours ago
Let $ a,b > 0 ,$ such that : $ a+b \geq \frac{3(a^4+b^4)}{a^2+b^2+1}\sqrt{\frac{\frac{1}{a}+\frac{1}{b}}{a+b}}.$
Prove that: $$ \frac{a^2+b^2+2}{a^6b^2+a^2b^6} \geq 2 $$
0 replies
SunnyEvan
2 hours ago
0 replies
inequality
SunnyEvan   6
N 2 hours ago by SunnyEvan
Let $ x,y \geq 0 ,$ such that : $ \frac{x^2}{x^3+y}+\frac{y^2}{x+y^3} \geq 1 .$
Prove that : $$ x^2+y^2-xy \leq x+y $$$$ (x+\frac{1}{2})^2+(x+\frac{1}{2})^2 \leq \frac{5}{2} $$$$ (x+1)^2+(y+1)^2 \leq 5 $$$$ (x+2)^2+(y+2)^2 \leq 13 $$
6 replies
SunnyEvan
Yesterday at 1:51 PM
SunnyEvan
2 hours ago
Bushy and Jumpy and the unhappy walnut reordering
popcorn1   54
N 2 hours ago by monval
Source: IMO 2021 P5
Two squirrels, Bushy and Jumpy, have collected 2021 walnuts for the winter. Jumpy numbers the walnuts from 1 through 2021, and digs 2021 little holes in a circular pattern in the ground around their favourite tree. The next morning Jumpy notices that Bushy had placed one walnut into each hole, but had paid no attention to the numbering. Unhappy, Jumpy decides to reorder the walnuts by performing a sequence of 2021 moves. In the $k$-th move, Jumpy swaps the positions of the two walnuts adjacent to walnut $k$.

Prove that there exists a value of $k$ such that, on the $k$-th move, Jumpy swaps some walnuts $a$ and $b$ such that $a<k<b$.
54 replies
popcorn1
Jul 20, 2021
monval
2 hours ago
Write down sum or product of two numbers
Rijul saini   3
N 2 hours ago by math_comb01
Source: India IMOTC Practice Test 2 Problem 3
Suppose Alice's grimoire has the number $1$ written on the first page and $n$ empty pages. Suppose in each of the next $n$ seconds, Alice can flip to the next page, and write down the sum or product of two numbers (possibly the same) which are already written in her grimoire.

Let $F(n)$ be the largest possible number such that for any $k < F(n)$, Alice can write down the number $k$ on the last page of her grimoire. Prove that there exists a positive integer $N$ such that for all $n>N$, we have that \[n^{0.99n}\leqslant F(n)\leqslant n^{1.01n}.\]
Proposed by Rohan Goyal and Pranjal Srivastava
3 replies
Rijul saini
Wednesday at 6:56 PM
math_comb01
2 hours ago
Trig fractions integration
smartvong   1
N 3 hours ago by alexheinis
Evaluate $$\int^{\pi/2}_{0} \frac{\left(\frac{\sin{x} + 1}{\cos{x} + 2}\right)}{\left(\frac{\sin{x} - 3}{\cos{x} - 4}\right)} \,dx.$$
1 reply
smartvong
Today at 12:32 AM
alexheinis
3 hours ago
half angle trigonometric differential equation
CatalinBordea   1
N Today at 2:05 AM by alexheinis
Differential equation to solve: $ \tan\frac{\text{arctan} \left( f'(x)\right)}{2} =f(x) . $
1 reply
CatalinBordea
Yesterday at 6:14 PM
alexheinis
Today at 2:05 AM
Japanese Olympiad
parkjungmin   9
N Today at 1:47 AM by Gauler
It's about the Japanese Olympiad

I can't solve it no matter how much I think about it.

If there are people who are good at math

Please help me.
9 replies
parkjungmin
May 10, 2025
Gauler
Today at 1:47 AM
A Brutal Bashy Integral from Austria Integration Bee
Silver08   1
N Yesterday at 11:30 PM by Silver08
Source: Livestream Austria Integration Bee Spring 2025
Compute:
$$\int \frac{\cos^2(x)}{\sin(x)+\sqrt{3}\cos(x)}dx$$
1 reply
Silver08
Yesterday at 11:12 PM
Silver08
Yesterday at 11:30 PM
Pyramid packing in sphere
smartvong   2
N Apr 20, 2025 by smartvong
Source: own
Let $A_1$ and $B$ be two points that are diametrically opposite to each other on a unit sphere. $n$ right square pyramids are fitted along the line segment $\overline{A_1B}$, such that the apex and altitude of each pyramid $i$, where $1\le i\le n$, are $A_i$ and $\overline{A_iA_{i+1}}$ respectively, and the points $A_1, A_2, \dots, A_n, A_{n+1}, B$ are collinear.

(a) Find the maximum total volume of $n$ pyramids, with altitudes of equal length, that can be fitted in the sphere, in terms of $n$.

(b) Find the maximum total volume of $n$ pyramids that can be fitted in the sphere, in terms of $n$.

(c) Find the maximum total volume of the pyramids that can be fitted in the sphere as $n$ tends to infinity.

Note: The altitudes of the pyramids are not necessarily equal in length for (b) and (c).
2 replies
smartvong
Apr 13, 2025
smartvong
Apr 20, 2025
Pyramid packing in sphere
G H J
G H BBookmark kLocked kLocked NReply
Source: own
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
smartvong
483 posts
#1
Y by
Let $A_1$ and $B$ be two points that are diametrically opposite to each other on a unit sphere. $n$ right square pyramids are fitted along the line segment $\overline{A_1B}$, such that the apex and altitude of each pyramid $i$, where $1\le i\le n$, are $A_i$ and $\overline{A_iA_{i+1}}$ respectively, and the points $A_1, A_2, \dots, A_n, A_{n+1}, B$ are collinear.

(a) Find the maximum total volume of $n$ pyramids, with altitudes of equal length, that can be fitted in the sphere, in terms of $n$.

(b) Find the maximum total volume of $n$ pyramids that can be fitted in the sphere, in terms of $n$.

(c) Find the maximum total volume of the pyramids that can be fitted in the sphere as $n$ tends to infinity.

Note: The altitudes of the pyramids are not necessarily equal in length for (b) and (c).
This post has been edited 2 times. Last edited by smartvong, Apr 13, 2025, 5:09 PM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
smartvong
483 posts
#2
Y by
bump on this problem
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
smartvong
483 posts
#3
Y by
bump again
Z K Y
N Quick Reply
G
H
=
a