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

G
Topic
First Poster
Last Poster
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
Interesting inequality
sqing   4
N 7 minutes ago by sqing
Source: Own
Let $ a,b,c\geq 2  . $ Prove that
$$(a^2-1)(b-1)(c^2-1) -\frac{9}{4}abc\geq -9$$$$(a^2-1)(b-1)(c^2-1) -\frac{11}{5}abc\geq -\frac{43}{5}$$$$(a^2-1)(b-1)(c^2-1) -2abc\geq -7$$$$(a-1)(b^2-1)(c-1) -\frac{3}{4}abc\geq -3$$$$(a-1)(b^2-1)(c-1) -\frac{3}{5}abc\geq -\frac{9}{5}$$$$(a-1)(b^2-1)(c-1) -\frac{1}{2}abc\geq -1$$
4 replies
1 viewing
sqing
2 hours ago
sqing
7 minutes ago
Orthocentre is collinear with two tangent points
vladimir92   42
N 11 minutes ago by AshAuktober
Source: Chinese MO 1996
Let $\triangle{ABC}$ be a triangle with orthocentre $H$. The tangent lines from $A$ to the circle with diameter $BC$ touch this circle at $P$ and $Q$. Prove that $H,P$ and $Q$ are collinear.
42 replies
vladimir92
Jul 29, 2010
AshAuktober
11 minutes ago
Problem 4
den_thewhitelion   3
N 15 minutes ago by DensSv
Source: Second Romanian JBMO TST 2016
We have a 4x4 board.All 1x1 squares are white.A move is changing colours of all squares of a 1x3 rectangle from black to white and from white to black.It is possible to make all the 1x1 squares black after several moves?
3 replies
den_thewhitelion
Jun 15, 2016
DensSv
15 minutes ago
Find the period
Anto0110   2
N 18 minutes ago by YaoAOPS
Let $a_1, a_2, ..., a_k, ...$ be a sequence that consists of an initial block of $p$ positive distinct integers that then repeat periodically. This means that $\{a_1, a_2, \dots, a_p\}$ are $p$ distinct positive integers and $a_{n+p}=a_n$ for every positive integer $n$. The terms of the sequence are not known and the goal is to find the period $p$. To do this, at each move it possible to reveal the value of a term of the sequence at your choice.
If $p$ is one of the first $k$ prime numbers, find for which values of $k$ there exist a strategy that allows to find $p$ revealing at most $8$ terms of the sequence.
2 replies
Anto0110
Yesterday at 7:37 PM
YaoAOPS
18 minutes ago
No more topics!
degree of f=2^k
Sayan   15
N Yesterday at 5:57 PM by Gejabsk
Source: ISI 2012 #8
Let $S = \{1,2,3,\ldots,n\}$. Consider a function $f\colon S\to S$. A subset $D$ of $S$ is said to be invariant if for all $x\in D$ we have $f(x)\in D$. The empty set and $S$ are also considered as invariant subsets. By $\deg (f)$ we define the number of invariant subsets $D$ of $S$ for the function $f$.

i) Show that there exists a function $f\colon S\to S$ such that $\deg (f)=2$.

ii) Show that for every $1\leq k\leq n$ there exists a function $f\colon S\to S$ such that $\deg (f)=2^{k}$.
15 replies
Sayan
May 13, 2012
Gejabsk
Yesterday at 5:57 PM
degree of f=2^k
G H J
Source: ISI 2012 #8
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Sayan
2130 posts
#1 • 2 Y
Y by mathbuzz, Adventure10
Let $S = \{1,2,3,\ldots,n\}$. Consider a function $f\colon S\to S$. A subset $D$ of $S$ is said to be invariant if for all $x\in D$ we have $f(x)\in D$. The empty set and $S$ are also considered as invariant subsets. By $\deg (f)$ we define the number of invariant subsets $D$ of $S$ for the function $f$.

i) Show that there exists a function $f\colon S\to S$ such that $\deg (f)=2$.

ii) Show that for every $1\leq k\leq n$ there exists a function $f\colon S\to S$ such that $\deg (f)=2^{k}$.
This post has been edited 3 times. Last edited by Sayan, May 16, 2012, 7:18 AM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
iarnab_kundu
866 posts
#2 • 3 Y
Y by mathbuzz, Adventure10, and 1 other user
pls post it in combinatorics; I wrote it fully but someone erased everything :furious:

writing again :

lets take f to be a permutation. consider a permutation where

(n-t+2,...,n) are fixed points. and consider the biggest of the remaining elements; assign the biggest i.e (n-t+1) to f(1) ; and the smallest to f(2), second smallest to f(3)(if it is possible ) and so on

this works (easy to prove)


for example the required permutation of (1,2,..,5) with degree 2^3 is (3,1,2,4,5)
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
mavropnevma
15142 posts
#3 • 6 Y
Y by Abhinandan18, opptoinfinity, math_and_me, Adventure10, Mango247, PRMOisTheHardestExam
As a first observation, one must allow $\emptyset$ to be (vacuously) considered as an invariant subset, for any $f$ (otherwise point ii) would fail for $k=n$).

Now, the idea from above can be written more simply, with the permutation $f_k = (1)(2)\cdots(k-1)(k,k+1,\ldots,n)$, written as a product of cycles, having $\deg(f) = 2^{k}$ for all $1\leq k \leq n$.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
iarnab_kundu
866 posts
#4 • 2 Y
Y by Adventure10, Mango247
In the actual paper it was mentioned that the empty set and the set {1,...,n} are ''invariant'' subset. So I request Sayan to edit it.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
mathbuzz
803 posts
#5 • 4 Y
Y by ISI4, agirlhasnoname, Adventure10, Mango247
well, for part (1) , we may take a cycle permutation.i.e. take f(1)=2 , f(2)=3 ,...,f(n-1)=n,f(n)=1.this clearly satisfies deg.(f)=2
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Irfan
389 posts
#6 • 2 Y
Y by Adventure10, Mango247
Can we simply not use f(1)=1 f(2)=4.... argument for (1) ?
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
JackXD
151 posts
#7 • 2 Y
Y by Adventure10, Mango247
ignore this post
This post has been edited 1 time. Last edited by JackXD, May 9, 2017, 1:00 PM
Reason: faulty post in another forum
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
stranger_02
337 posts
#9 • 2 Y
Y by Madhavi, PRMOisTheHardestExam
Sayan wrote:
Let $S = \{1,2,3,\ldots,n\}$. Consider a function $f\colon S\to S$. A subset $D$ of $S$ is said to be invariant if for all $x\in D$ we have $f(x)\in D$. The empty set and $S$ are also considered as invariant subsets. By $\deg (f)$ we define the number of invariant subsets $D$ of $S$ for the function $f$.

i) Show that there exists a function $f\colon S\to S$ such that $\deg (f)=2$.

ii) Show that for every $1\leq k\leq n$ there exists a function $f\colon S\to S$ such that $\deg (f)=2^{k}$.

For the second part, we can simply consider a function defined piecewise as
$f(x)=x$ when $x\leq{k}$
$f(x)=1$ $($or any number in this range$)$, otherwise

Therefore, we see that $f(x)$ has exactly $2^k$ subsets..

Q.E.D $\square$
This post has been edited 1 time. Last edited by stranger_02, Jun 18, 2020, 3:25 PM
Reason: Latex
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Titttu
7 posts
#10
Y by
I can give a hint sumation of binomial coffecient wii helpful.. breka as required in 2,3,4,...n parts the total set and for every break u get the required 2^k
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Titttu
7 posts
#11
Y by
I can give a hint sumation of binomial coffecient wii helpful.. breka as required in 2,3,4,...n parts the total set and for every break u get the required 2^k
I gave one example which help you .
Let, k=3 then break S in 3 parts.
The break is going to happen like this=
f(x)=x+1 and f(b) =a ( where a is the first element of the partion and b is the last element of the partion . and for rest of the elemnets of the element it will tak care by the f(x) =x+1 )
Now if we choose one partition we can do it by 3c1 ways , we can choose 2 partition by 3c2 ways and 3 partition(which is total set for this case) 3c3 ways . And we can choose no partition in 3co ways ( which is empty set) .
The sum of all the cases is 2^3 .And you can do it 4 partition(u get 2^4) and so on ..upto n partition (after some partition u have to consider 1 element as partition & always shuffle the partition like that inside the partition there is no kind of subset which can satisfy our requirements .


Sorry guys I can't use the latex format .
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
ftheftics
651 posts
#12 • 1 Y
Y by Gerninza
It will enough to show a construction of a function to prove the existence.

For a fixed positive integer $k \in [1,n]$ consider the function

\[f(x) = \begin{cases}  
 x + 1 &  \text{for} ,  1\le x\le n-k-1
\\
1 & \text{for}    ,  x\ge n-k \end{cases} \]
Now consider $A =\{ 1 ,2,\cdots , n-k \}$ and $B =\{n-k+1,\cdots ,n\}$

Now Any subset $D$ of $S$ with $D= A \cup R$ (Where $R$ is subset of $B$) is invariant Under $f$ .

Since there is $2^k$ subsets of $B$ thus , There can have $2^k$ subset $D$ of $S$ for which $D$ is invariant under $f$ .

By definition $ \deg (f) =2^k$


Now for part (i) just take $k=1$
This post has been edited 1 time. Last edited by ftheftics, May 20, 2021, 1:07 PM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
allofme
2 posts
#13
Y by
@ftheftics the subsets you have considered as AUR where R is subset of B, all of them essentially consist A and some additional elements. So we get 2^k subsets all containing at least A. But apart from this there is phi which does not include anything making the deg(f)=2^k+1. Kindly enlighten me on this aspect.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
idkwhatthisis
44 posts
#14
Y by
I believe induction should work, for $\deg(f) = 2$ just take a cycle, and to get to a permutation with $\deg(f) = 2^m$ from $n$ to $n+1$ just take $f(n+1) = n+1$ and a permutation $g$ of $\{1,\ldots,n\}$ such that $\deg(g) = 2^{m-1}$ and we should be done.

EDIT: I just realised that by fixing $k-1$ points and applying the same construction in (i) to the remaining numbers then everything is cool
This post has been edited 2 times. Last edited by idkwhatthisis, May 28, 2021, 11:51 AM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
green_leaf
225 posts
#15
Y by
For each function $f$, consider a directed graph where vertices are numbers in $S$ and there is an edge $A \to B$ iff $f(A) = B$.
i) This is equivalent to showing there is a function such that there are no directed cycles of length $k < n$. This can simply be achieved by taking $f(i) = i+1 ~~~ \forall 1 \leq i \leq n-1$ and $f(n) = 1$.

ii) Choose a function that splits $S$ into $k$ disjoint directed cycles. The number of invariant subsets are equivalent to the subsets of the set whose elements are the $k$ cycles, since the sets of cycles can be combined to form new sets which are still valid invariant sets. But the number of subsets of an set with $k$ elements is simply $2^k$ (including the empty set).
This post has been edited 1 time. Last edited by green_leaf, May 27, 2021, 3:07 PM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
quasar_lord
142 posts
#17
Y by
soln
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Gejabsk
7 posts
#18
Y by
If we're mapping one subset of k elements to itself and dearranging the rest, but S in invariant too , so total would be 2^k + 1
for deg(f) = 2^k , the invariants excluding S must be 2^k -1 , which doesn't seem possible ...
This post has been edited 1 time. Last edited by Gejabsk, Yesterday at 6:00 PM
Reason: .
Z K Y
N Quick Reply
G
H
=
a