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

G
Topic
First Poster
Last Poster
k a My Retirement & New Leadership at AoPS
rrusczyk   1571
N Mar 26, 2025 by SmartGroot
I write today to announce my retirement as CEO from Art of Problem Solving. When I founded AoPS 22 years ago, I never imagined that we would reach so many students and families, or that we would find so many channels through which we discover, inspire, and train the great problem solvers of the next generation. I am very proud of all we have accomplished and I’m thankful for the many supporters who provided inspiration and encouragement along the way. I'm particularly grateful to all of the wonderful members of the AoPS Community!

I’m delighted to introduce our new leaders - Ben Kornell and Andrew Sutherland. Ben has extensive experience in education and edtech prior to joining AoPS as my successor as CEO, including starting like I did as a classroom teacher. He has a deep understanding of the value of our work because he’s an AoPS parent! Meanwhile, Andrew and I have common roots as founders of education companies; he launched Quizlet at age 15! His journey from founder to MIT to technology and product leader as our Chief Product Officer traces a pathway many of our students will follow in the years to come.

Thank you again for your support for Art of Problem Solving and we look forward to working with millions more wonderful problem solvers in the years to come.

And special thanks to all of the amazing AoPS team members who have helped build AoPS. We’ve come a long way from here:IMAGE
1571 replies
+1 w
rrusczyk
Mar 24, 2025
SmartGroot
Mar 26, 2025
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
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
Sequence of functions
mathlover1231   0
17 minutes ago
Source: Own
Let f:N->N be a function such that f(1) = 1, f(n+1) = f(n) + 2^f(n) for every positive integer n. Prove that all numbers f(1), f(2), …, f(3^2023) give different remainders when divided by 3^2023
0 replies
mathlover1231
17 minutes ago
0 replies
Geo challenge on finding simple ways to solve it
Assassino9931   1
N 18 minutes ago by MathLuis
Source: Bulgaria Spring Mathematical Competition 2025 9.2
Let $ABC$ be an acute scalene triangle inscribed in a circle \( \Gamma \). The angle bisector of \( \angle BAC \) intersects \( BC \) at \( L \) and \( \Gamma \) at \( S \). The point \( M \) is the midpoint of \( AL \). Let \( AD \) be the altitude in \( \triangle ABC \), and the circumcircle of \( \triangle DSL \) intersects \( \Gamma \) again at \( P \). Let \( N \) be the midpoint of \( BC \), and let \( K \) be the reflection of \( D \) with respect to \( N \). Prove that the triangles \( \triangle MPS \) and \( \triangle ADK \) are similar.
1 reply
Assassino9931
2 hours ago
MathLuis
18 minutes ago
Infinite integer sequence problem
mathlover1231   2
N 20 minutes ago by mathlover1231
Let a_1, a_2, … be an infinite sequence of pairwise distinct positive integers and c be a real number such that 0 < c < 3/2. Prove that there exist infinitely many positive integers k such that lcm(a_k, a_{k+1}) > ck.
2 replies
mathlover1231
Friday at 6:04 PM
mathlover1231
20 minutes ago
Minimize this in any way you like
Assassino9931   3
N 25 minutes ago by Assassino9931
Source: Bulgaria Spring Mathematical Competition 2025 12.1
In terms of the real numbers $a$ and $b$ determine the minimum value of $$ \sqrt{(x+a)^2+1}+\sqrt{(x+1-a)^2+1}+\sqrt{(x+b)^2+1}+\sqrt{(x+1-b)^2+1}$$as well as all values of $x$ which attain it.
3 replies
1 viewing
Assassino9931
an hour ago
Assassino9931
25 minutes ago
The ratio between two integral
Butterfly   3
N 33 minutes ago by Butterfly



Prove $\frac{I_1}{I_2}=\sqrt{2}$ where $I_1=\int_{0}^{\frac{\sqrt{3}-1}{\sqrt{2}}} \frac{1-x^2}{\sqrt{x^8-14x^4+1}}dx$ and $I_2=\int_{0}^{\sqrt{2}-1} \frac{1+x^2}{\sqrt{x^8+14x^4+1}}dx.$
3 replies
Butterfly
Mar 28, 2025
Butterfly
33 minutes ago
nice integral
Martin.s   2
N 39 minutes ago by Figaro
$$\int_0^\infty \frac{\tanh x}{4x (1+\cosh(2x))} dx$$
2 replies
Martin.s
Friday at 8:09 PM
Figaro
39 minutes ago
Very hard FE problem
steven_zhang123   0
41 minutes ago
Source: 0
Given a real number \(C\) such that \(x + y + z = C\) (where \(x, y, z \in \mathbb{R}\)), and a functional equation \(f: \mathbb{R} \rightarrow \mathbb{R}\) that satisfies \((f^x(y) + f^y(z) + f^z(x))((f(x))^y + (f(y))^z + (f(z))^x) \geq 2025\) for all \(x, y, z \in \mathbb{R}\), has a finite number of solutions. Find such \(C\).
(Here, $f^{n}(x)$ is the function obtained by composing $f(x)$ $n$ times, that is, $(\underbrace{f \circ f \circ \cdots \circ f}_{n \ \text{times}})(x)$)
0 replies
steven_zhang123
41 minutes ago
0 replies
Train yourself on folklore NT FE ideas
Assassino9931   1
N an hour ago by bin_sherlo
Source: Bulgaria Spring Mathematical Competition 2025 9.4
Determine all functions $f: \mathbb{Z}_{>0} \to \mathbb{Z}_{>0}$ such that $f(a) + 2ab + 2f(b)$ divides $f(a)^2 + 4f(b)^2$ for any positive integers $a$ and $b$.
1 reply
Assassino9931
2 hours ago
bin_sherlo
an hour ago
FE f(x)f(y)+1=f(x+y)+f(xy)+xy(x+y-2)
steven_zhang123   4
N an hour ago by steven_zhang123
Find all functions $f: \mathbb{R} \rightarrow \mathbb{R}$ such that for all $x,y \in \mathbb{R}$, we have $f(x)f(y)+1=f(x+y)+f(xy)+xy(x+y-2)$.
4 replies
steven_zhang123
Yesterday at 11:27 PM
steven_zhang123
an hour ago
Heavy config geo involving mixtilinear
Assassino9931   0
an hour ago
Source: Bulgaria Spring Mathematical Competition 2025 12.4
Let $ABC$ be an acute-angled triangle \( ABC \) with \( AC > BC \) and incenter \( I \). Let \( \omega \) be the mixtilinear circle at vertex \( C \), i.e. the circle internally tangent to the circumcircle of \( \triangle ABC \) and also tangent to lines \( AC \) and \( BC \). A circle \( \Gamma \) passes through points \( A \) and \( B \) and is tangent to \( \omega \) at point \( T \), with \( C \notin \Gamma \) and \( I \) being inside \( \triangle ATB \). Prove that:
$$\angle CTB + \angle ATI = 180^\circ + \angle BAI - \angle ABI.$$
0 replies
Assassino9931
an hour ago
0 replies
Put this on a new Jane Street T-shirt
Assassino9931   0
an hour ago
Source: Bulgaria Spring Mathematical Competition 2025 12.3
Given integers \( m, n \geq 2 \), the points \( A_1, A_2, \dots, A_n \) are chosen independently and uniformly at random on a circle of circumference \( 1 \). That is, for each \( i = 1, \dots, n \), for any \( x \in (0,1) \), and for any arc \( \mathcal{C} \) of length \( x \) on the circle, we have $\mathbb{P}(A_i \in \mathcal{C}) = x$. What is the probability that there exists an arc of length \( \frac{1}{m} \) on the circle that contains all the points \( A_1, A_2, \dots, A_n \)?
0 replies
Assassino9931
an hour ago
0 replies
Easy problem
Hip1zzzil   0
an hour ago
$(C,M,S)$ is a pair of real numbers such that

$2C+M+S-2C^{2}-2CM-2MS-2SC=0$
$C+2M+S-3M^{2}-3CM-3MS-3SC=0$
$C+M+2S-4S^{2}-4CM-4MS-4SC=0$

Find $2C+3M+4S$.
0 replies
Hip1zzzil
an hour ago
0 replies
Gheorghe Țițeica 2025 Grade 12 P4
AndreiVila   2
N 2 hours ago by MS_asdfgzxcvb
Source: Gheorghe Țițeica 2025
Let $R$ be a ring. Let $x,y\in R$ such that $x^2=y^2=0$. Prove that if $x+y-xy$ is nilpotent, so is $xy$.

Janez Šter
2 replies
AndreiVila
Friday at 10:05 PM
MS_asdfgzxcvb
2 hours ago
AB=BA if A-nilpotent
KevinDB17   1
N 5 hours ago by RobertRogo
Let A,B 2 complex n*n matrices such that AB+I=A+B+BA
If A is nilpotent prove that AB=BA
1 reply
KevinDB17
5 hours ago
RobertRogo
5 hours ago
Putnam 1950 B1
centslordm   2
N Mar 25, 2025 by KAME06
In each of $n$ houses on a straight street are one or more boys. At what point should all the boys meet so that the sum of the distances that they walk is as small as possible?
2 replies
centslordm
May 25, 2022
KAME06
Mar 25, 2025
Putnam 1950 B1
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.
centslordm
4736 posts
#1 • 2 Y
Y by Mogmog8, the_mathmagician
In each of $n$ houses on a straight street are one or more boys. At what point should all the boys meet so that the sum of the distances that they walk is as small as possible?
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
DottedCaculator
7322 posts
#2 • 1 Y
Y by centslordm
the median
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
KAME06
123 posts
#3 • 1 Y
Y by centslordm
Consider the street as a line and the houses as ordered points $H_1, H_2, ..., H_n$. Let $M$ the meeting point.
If $n=2k$, notice that if $M$ is not on $H_iH_{2k+1-i}$, we can say $|H_i-M|>|H_i-H_{2k+1-i}|$ or $|H_{2k+1-i}-M|>|H_i-H_{2k+1-i}|$. If $M$ is on $H_iH_{2k+1-i}$, $|H_i-M|+|H_{2k+1-i}-M| = |H_i-H_{2k+1-i}|$. We conclude that $|H_i-M|+|H_{2k+1-i}-M| \ge |H_i-H_{2k+1-i}|$, for all $i=1, 2, ..., k$.
Adding: $\sum_{i=1}^{2k} |H_i-M| \ge \sum_{i=1}^k |H_i-H_{2k+1-i}|$. To achieve the equality note that, by definition, $ H_{i+1}H_{2k+1-(i+1)} \in H_iH_{2k+1-i}$ for $i=1, 2, ..., k-1$. $M$ must be on $H_kH_{k+1}$.
If $n=2k+1$, notice that if $M$ is not on $H_iH_{2k+2-i}$, we can say $|H_i-M|>|H_i-H_{2k+2-i}|$ or $|H_{2k+2-i}-M|>|H_i-H_{2k+2-i}|$. If $M$ is on $H_iH_{2k+2-i}$, $|H_i-M|+|H_{2k+2-i}-M| = |H_i-H_{2k+2-i}|$. We conclude that $|H_i-M|+|H_{2k+2-i}-M| \ge |H_i-H_{2k+2-i}|$, for all $i=1, 2, ..., k$. Moreover, $|H_{k+1}-M| \ge 0$.
Adding: $\sum_{i=1}^{2k} |H_i-M| \ge \sum_{i=1}^k |H_i-H_{2k+2-i}| + 0$. To achieve the equality note that, by definition, $ H_{i+1}H_{2k+2-(i+1)} \in H_iH_{2k+2-i}$ for $i=1, 2, ..., k-1$ and $|H_{k+1}-M| = 0$ if and only if $M=H_{k+1}$.
$H_{k+1}$ is on $H_kH_{k+2}$, so $M$ must be on $H_{k+1}$.
Z K Y
N Quick Reply
G
H
=
a