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

G
Topic
First Poster
Last Poster
k a April Highlights and 2025 AoPS Online Class Information
jlacosta   0
Apr 2, 2025
Spring is in full swing and summer is right around the corner, what are your plans? At AoPS Online our schedule has new classes starting now through July, so be sure to keep your skills sharp and be prepared for the Fall school year! Check out the schedule of upcoming classes below.

WOOT early bird pricing is in effect, don’t miss out! If you took MathWOOT Level 2 last year, no worries, it is all new problems this year! Our Worldwide Online Olympiad Training program is for high school level competitors. AoPS designed these courses to help our top students get the deep focus they need to succeed in their specific competition goals. Check out the details at this link for all our WOOT programs in math, computer science, chemistry, and physics.

Looking for summer camps in math and language arts? Be sure to check out the video-based summer camps offered at the Virtual Campus that are 2- to 4-weeks in duration. 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 events:
[list][*]April 3rd (Webinar), 4pm PT/7:00pm ET, Learning with AoPS: Perspectives from a Parent, Math Camp Instructor, and University Professor
[*]April 8th (Math Jam), 4:30pm PT/7:30pm ET, 2025 MATHCOUNTS State Discussion
April 9th (Webinar), 4:00pm PT/7:00pm ET, Learn about Video-based Summer Camps at the Virtual Campus
[*]April 10th (Math Jam), 4:30pm PT/7:30pm ET, 2025 MathILy and MathILy-Er Math Jam: Multibackwards Numbers
[*]April 22nd (Webinar), 4:00pm PT/7:00pm ET, Competitive Programming at AoPS (USACO).[/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, 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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
Apr 2, 2025
0 replies
Definite integral with Beta Function
Reynan   0
5 hours ago
$$\int\limits_{0}^{\infty}\frac{x^{a-\frac{1}{2}}}{(1-x)^a(1+x\tan^2{\theta})^a}dx=\frac{2\Gamma\left(a+\frac{1}{2}\right)\Gamma(1-a)}{\sqrt{\pi}}\cos^{2a}{\theta}\frac{\sin{\left[(2a-1)\theta\right]}}{(2a-1)\sin{\theta}}$$for
$$\tan{\theta}<1,-\frac{1}{2}<a<1$$The source should be from Legendre, but I cannot find it.
0 replies
Reynan
5 hours ago
0 replies
binomial sum
jonny   2
N Yesterday at 5:21 PM by MS_asdfgzxcvb
for every positive integer $n,$ prove that $\sum_{k=0}^{n^2}(-1)^k\frac{\binom{n^2}{k}}{\binom{n+k}{k}} = \frac{1}{n+1}$
2 replies
jonny
Feb 24, 2012
MS_asdfgzxcvb
Yesterday at 5:21 PM
Tricky Determinant
Saucepan_man02   3
N Yesterday at 5:20 PM by rchokler
$$A=\begin{bmatrix}
1+x^2-y^2-z^2 & 2xy+2z & 2zx-2y\\
2xy-2z & 1+y^2-x^2-z^2 & 2yz+2x\\
2xz+2y & 2yz-2x & 1+z^2-x^2-y^2\\
\end{bmatrix}$$Find $\det(A)$.
3 replies
Saucepan_man02
Saturday at 12:16 PM
rchokler
Yesterday at 5:20 PM
Pyramid packing in sphere
smartvong   0
Yesterday at 4:49 PM
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).
0 replies
smartvong
Yesterday at 4:49 PM
0 replies
No more topics!
IMC 2017 Problem 5
math90   4
N Aug 10, 2017 by math90
Let $k$ and $n$ be positive integers with $n\geq k^2-3k+4$, and let
$$f(z)=z^{n-1}+c_{n-2}z^{n-2}+\dots+c_0$$be a polynomial with complex coefficients such that
$$c_0c_{n-2}=c_1c_{n-3}=\dots=c_{n-2}c_0=0$$Prove that $f(z)$ and $z^n-1$ have at most $n-k$ common roots.
4 replies
math90
Aug 2, 2017
math90
Aug 10, 2017
IMC 2017 Problem 5
G H J
G H BBookmark kLocked kLocked NReply
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
math90
1476 posts
#1 • 2 Y
Y by Adventure10, Knight2E4
Let $k$ and $n$ be positive integers with $n\geq k^2-3k+4$, and let
$$f(z)=z^{n-1}+c_{n-2}z^{n-2}+\dots+c_0$$be a polynomial with complex coefficients such that
$$c_0c_{n-2}=c_1c_{n-3}=\dots=c_{n-2}c_0=0$$Prove that $f(z)$ and $z^n-1$ have at most $n-k$ common roots.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
dgrozev
2459 posts
#2 • 4 Y
Y by pavel kozlov, adityaguharoy, Adventure10, Mango247
I tried it and then saw the official solution. It seems artificially like pulling a rabbit out of hat.
So let me share some thoughts how one can solve it in a motivated way. It's not a full solution, in fact it was a personal lesson to me why I hadn't managed a solution.

For simplicity only assume $n$ is even. The corresponding coefficients of the polynomial $c_{n-2}x^{n-2}+\dots + c_0 x^0$ , that are equally distant from left and right, can not be both non zero. So it seems a natural thing(i did it right away) to divide the equation by $x^{(n-2)/2}$. Denoting $m:=n/2$ and $I := \{0,1,\dots,m\}$, our equality transforms like:
\[\sum_{i\in I_1} c_i z^i = \sum_{i\in I_2} c_i z^{-i}\]where $I_1, I_2\subset I$ and $I_1\cap I_2=\emptyset$.
We want to consider only the roots that are $n$-th roots of unity, so we set $z=e^{it}, t\in [0,2\pi)$ and get:
\[(1)\,\,\,\,\,\,\,\, \sum_{\ell\in I_1} c_{\ell} e^{i\ell t} = \sum_{\ell\in I_2} c_{\ell} e^{-i\ell t}\]
From here, we must somehow conclude that there is a some substantially many $t_j$'s among $\{t_j : t_j= j\cdot 2\pi/n, j=0,1,\dots,n-1\}$ that don't satisfy $(1)$. The fact that the set of indecies $I_1$ and $I_2$ are disjoint should play a crucial point, since otherwise in general case it's not true. That's, the key question is how to use the fact $I_1$ and $I_2$ are disjoint.

Now I will speak very loosely. If $(1)$ were some kind of identity, we could multiply both sides by the conjugate of the RHS and integrate over $[0,2\pi]$ and using the fact $\{e^{i\ell t}, \ell=0,1,\dots,m\}$ are orthogonal on $[0,2\pi]$ and get a contradiction, since the LHS would be $0$ exactly due to the fact $I_1\cap I_2=0$. Since this approach strongly uses the fact $I_1,I_2$ are disjoint it is a very good indicator.
Fortunately $\{e^{i\ell t}, \ell=0,1,\dots,m\}$ are orthogonal also in a discrete sense, namely:
\[(2)\,\,\,\,\,\,\,\,\sum_{j=0}^{n-1} e^{i\ell t_j} e^{ir t_j}= \begin{cases}
0\,,\, \ell+r \not\equiv 0\pmod{n}\\
n\,,\,\ell+r \equiv 0\pmod{n}
\end{cases}
\]It right away yields all $t_j,j=0,1,\dots,n-1$ cannot be roots of $(1)$. (which btw is trivial since that equality is of degree $n-1$). Indeed assume on the contrary:
\[(3)\,\,\,\,\,\,\,\, \sum_{\ell\in I_1} c_{\ell} e^{i\ell t_j} = \sum_{\ell\in I_2} c_{\ell} e^{-i\ell t_j}\,,\,j=0,1,\dots,n-1\]Multiplying by conjugate of the $RHS$ and summing over $j$, using $(2)$,we get: $0=n\cdot \sum_{\ell\in I_2}|a_{\ell}|^2\neq 0$. (because the case all $a_{\ell}, \ell\in I_2$ are zeroes is trivial, since the $(1)$ has only $n/2$ solutions).

The next question- is it possible only one $t_j$ to breach $(3)$ ?. Assuming so, we can rewrite $(3)$ and then again with some offset $\varphi$ with respect to $t$, where $\varphi\in \{t_j:j=0,1,\dots,n-1\}$, that's:

\begin{align*}&(4)\,\,\,\,\,\,\,\, \sum_{\ell\in I_1} c_{\ell} e^{i\ell t_j} - \sum_{\ell\in I_2} c_{\ell} e^{-i\ell t_j}=0\,,\,j=0,1,\dots,n-1\\
&(4')\,\,\,\,\,\,\,\, \sum_{\ell\in I_1} c_{\ell} e^{i\ell (t_j+\varphi)} - \sum_{\ell\in I_2} c_{\ell} e^{-i\ell (t_j+\varphi)}=0\,,\,j=0,1,\dots,n-1 \end{align*}
Then if for each $j$ either the LHS of $(4)$ or the LHS of $(4')$ is zero, we can multiply them, taking first the conjugate of LHS of $(4')$ and sum over $j=0,1,\dots,n-1$ and due to orthogonality again to get a contradiction like $\sum_{\ell\in I_2}|a_{\ell}|^2=0$.

It means for every offset $\varphi\in \{t_i:i=0,1,\dots,n-1\}$, there exists $j$ such that neither $t_j$ is a solution of $(4)$ nor $t_j+\varphi$ is solution of $(4')$. That cracks the problem, since then for the set $A\subset \{t_j:j=0,1,\dots,n-1\}$ of non-solutions of $(4)$ we can say that every offset $\varphi$ belongs to $A-A$, which can hold only when $|A|$ is not too small. The rest is a routine.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
somepersonoverhere
1313 posts
#3 • 2 Y
Y by Adventure10, Mango247
Hmm...the first thing I thought of was mathematical induction. I wonder if there's a solution under those lines.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Tintarn
9036 posts
#4 • 4 Y
Y by pavel kozlov, Bonaparte, ywq233, Adventure10
Here is an attempt to motivate the official solution which is not at all as mysterious, artificial or complicated as it looks at first glance (although, admittedly, I didn't solve the problem in the competition and I thought the same when reading the official solution for the first time).
To start with, we obviously need to forget about the strange size condition on $n$ and see later where it comes in.
Let us even go further and forget about what we are about to prove. Let's just try to take into account the condition $c_ic_{n-2-i}=0$ in a useful way.
The first thing that comes to mind is that these products appear as a convolution i.e. when multiplying two polynomials.
More specifically, $c_0c_{n-2}+c_1c_{n-3}+\dotsc$ is the coefficient of $z^{n-2}$ in $f(z)^2$. So we conclude that this coefficient equals $1$ (with the understanding that all the indices and the exponents are to be read $\mod n$ and $c_{-1}=c_{n-1}=1$).
This is of course equivalent to the constant coefficient of $z^2f(z)^2$ being one which by the root-of-unity filter means that $\sum_{\omega} \omega^2f(\omega)^2=n$.
This already seems to be a resonable start as the identity somehow "contains" information on the values of $P(\omega)$ and therefore on them being roots. In particular, we obtain the easy observation that not all roots of unity are also roots of $f$.
However, this interpretation of the condition has some serious drawback: It only manages to take into account information on the sum of these products which is considerably weaker than all these products already being zero.
So what do do? Well, a sequence of numbers being zero means that the polynomial with these coefficients is the zero polynomial! More specifically, we have $x^{n-1}=\sum_{i} c_ic_{n-2-i}x^i$ as a polynomial identity (to be very precise: as an identity in $\mathbb{C}[x]/(x^n-1)$.)
Now, can we do the same trick as above and interpret that as a coefficient of a certain polynomial product? Yes, we can! In exactly the same way as above, this is the coefficient of $z^{n-2}$ in $f(z)f(xz)$ i.e. the coefficient of $z^n$ in $z^2f(z)f(xz)$ and as above, we then find
\[\sum_{\omega} \omega^2f(\omega)f(x\omega)=nx^{n-1}\]as an identity in $\mathbb{C}[x]/(x^n-1)$ and in particular for $x$ being a root of unity. The first thing we tried above was exactly the case $x=1$.
And again it is reasonable to expect this to be useful since it contains even more information on the amount of values where $f$ vanishes.
More precisely, it tells us that for any $x$ there is one $\omega$ such that both $\omega$ and $x\omega$ are not roots of $f$.
And well, that is exactly the claim in the official solution.
From here, it is already clear that this gives an upper bound on the number of roots in terms of $n,k$ and the exact estimate then follows from an easy combinatorial double-counting argument where the condition $n \ge k^2-3k+4$ turns out to be exactly the estimate we need.
This post has been edited 5 times. Last edited by Tintarn, Aug 10, 2017, 10:12 AM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
math90
1476 posts
#5 • 4 Y
Y by Tintarn, Fedor Petrov, ywq233, Adventure10
The bound can be sharpened as follows:
Let $S$ be the set of all roots of $z^n-1$.
Let $\omega\in S$.
Take a similar polynomial to that in the official solution, but now take
$\sum_{z\in S}z^2\bar{f}(z)f(\omega z)$
Where $\bar{f}$ is $f$ with all coefficients conjugated.
The same reasoning as in the official solution shows that
$\sum_{z\in S}z^2\bar{f}(z)f(\omega z)=n$
Hence for all $\omega\in S$ there exists $\alpha\in S$ such that
$\bar{f}(\alpha)\neq 0$ and
$f(\alpha\omega)\neq 0$
Observe that
$\overline{\bar{f}(\alpha)}=f(\bar{\alpha})=f(\frac{1}{\alpha})$
Hence for all $\omega\in S$, there exists $\beta,\gamma\in S$ such that $\beta,\gamma$ are not roots of $f$ and $\beta\gamma=\omega$
Assume for contradiction that at most $k-1$ roots of $z^n-1$ are not roots of $f$. Hence
$n\leq k-1+\binom{k-1}{2}=\binom{k}{2}$
Hence the condition $n>\binom{k}{2}$ is sufficient. Also it's a better bound than the original one.
This post has been edited 4 times. Last edited by math90, Mar 29, 2024, 2:48 PM
Z K Y
N Quick Reply
G
H
=
a