Contests & Programs AMC and other contests, summer programs, etc.
AMC and other contests, summer programs, etc.
3 M G
BBookmark  VNew Topic kLocked
Contests & Programs AMC and other contests, summer programs, etc.
AMC and other contests, summer programs, etc.
3 M G
BBookmark  VNew Topic kLocked
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
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
Orange MOP Opportunity
blueprimes   7
N 9 minutes ago by fake123
Hello AoPS,

A reputable source that is of a certain credibility has communicated me about details of Orange MOP, a new pathway to qualify for MOP. In particular, 3 rounds of a 10-problem proof-style examination, covering a variety of mathematical topics that requires proofs will be held from September 27, 2025 12:00 AM - November 8, 2025 11:59 PM EST. Each round will occur biweekly on a Saturday starting from September 27 as described above. The deadline for late submissions will be November 20, 2025 11:59 PM EST.

Solutions can be either handwritten or typed digitally with $\LaTeX$. If you are sending solutions digitally through physical scan, please make sure your handwriting is eligible. Inability to discern hand-written solutions may warrant point deductions.

As for rules, digital resources and computational intelligence systems are allowed. Textbooks, reference handouts, and calculators are also a freedom provided by the MAA.

The link is said to be posted on the MAA website during the summer, and invites aspiring math students of all grade levels to participate. As for scoring, solutions will be graded on a $10$-point scale, and solutions will be graded in terms of both elegance and correctness.

As for qualification for further examinations, the Orange MOP examination passes both the AIME and USAJMO/USAMO requirement thresholds, and the top 5 scorers will receive the benefits and prestige of participating at the national level in the MOP program, and possibly the USA TST and the USA IMO team.

I implore you to consider this rare oppourtunity.

Warm wishes.
7 replies
blueprimes
2 hours ago
fake123
9 minutes ago
New Competition Series: The Million!
Mathdreams   5
N 40 minutes ago by jkim0656
Hello AOPS Community,

Recently, me and my friend compiled a set of the most high quality problems from our imagination into a problem set called the Million. This series has three contests, called the whun, thousand and Million respectively.

Unfortunately, it did not get the love it deserved on the OTIS discord. Hence, we post it here to share these problems with the AOPS community and hopefully allow all of you to enjoy these very interesting problems.

Good luck! Lastly, remember that MILLION ORZ!

Edit: We have just been informed this will be the Orange MOP series. Please pay close attention to these problems!
5 replies
Mathdreams
an hour ago
jkim0656
40 minutes ago
euler line and midpoint tangents
Thelink_20   3
N an hour ago by hectorleo123
Source: My problem
Let the medians of a triangle $\Delta ABC$ intersect its circumcircle $\Gamma$ at $N_A, N_B, N_C$. The tangets to $\Gamma$ from $N_A,N_B,N_C$ determine a triangle $\Delta X_AX_BX_C$, where $X_A$ is relative to $A$ and so on. Prove that lines $AX_A,BX_B,CX_C$ are concurrent at a point $P$ and that $P$ belongs to the euler line of $\Delta ABC$.
Remark:Click to reveal hidden text

3 replies
Thelink_20
Jan 24, 2025
hectorleo123
an hour ago
MOP Cutoffs Out?
Mathandski   24
N 2 hours ago by smbellanki
MAA has just emailed a press release announcing the formula they will be using this year to come up with the MOP cutoff that applies to you! Here's the process:

1. Multiply your age by $1434$, let $n$ be the result.

2. Calculate $\varphi(n)$, where $\varphi$ is the Euler's totient theorem, which calculates the number of integers less than $n$ relatively prime to $n$.

3. Multiply your result by $1434$ again because why not, let the result be $m$.

4. Define the Fibonacci sequence $F_0 = 1, F_1 = 1, F_n = F_{n-1} + F_{n-2}$ for $n \ge 2$. Let $r$ be the remainder $F_m$ leaves when you divide it by $69$.

5. Let $x$ be your predicted USA(J)MO score.

6. You will be invited if your score is at least $\lfloor \frac{x + \sqrt[r]{r^2} + r \ln(r)}{r} \rfloor$.

7. Note that there may be additional age restrictions for non-high schoolers.

See here for MAA's original news message. If you are interested, try finding, with proof, whether a high-school aged student would be able to qualify for MOP following this rubric.

Enjoy this low-effort april fool's joke. I was kinda disappointed there wasn't any here this year.
24 replies
Mathandski
Yesterday at 11:02 PM
smbellanki
2 hours ago
2025 USAMO Rubric
plang2008   12
N 2 hours ago by Ilikeminecraft
1. Let $k$ and $d$ be positive integers. Prove that there exists a positive integer $N$ such that for every odd integer $n>N$, the digits in the base-$2n$ representation of $n^k$ are all greater than $d$.

Rubric for Problem 1

2. Let $n$ and $k$ be positive integers with $k<n$. Let $P(x)$ be a polynomial of degree $n$ with real coefficients, nonzero constant term, and no repeated roots. Suppose that for any real numbers $a_0,\,a_1,\,\ldots,\,a_k$ such that the polynomial $a_kx^k+\cdots+a_1x+a_0$ divides $P(x)$, the product $a_0a_1\cdots a_k$ is zero. Prove that $P(x)$ has a nonreal root.

Rubric for Problem 2

3. Alice the architect and Bob the builder play a game. First, Alice chooses two points $P$ and $Q$ in the plane and a subset $\mathcal{S}$ of the plane, which are announced to Bob. Next, Bob marks infinitely many points in the plane, designating each a city. He may not place two cities within distance at most one unit of each other, and no three cities he places may be collinear. Finally, roads are constructed between the cities as follows: for each pair $A,\,B$ of cities, they are connected with a road along the line segment $AB$ if and only if the following condition holds:
[center]For every city $C$ distinct from $A$ and $B$, there exists $R\in\mathcal{S}$ such[/center]
[center]that $\triangle PQR$ is directly similar to either $\triangle ABC$ or $\triangle BAC$.[/center]
Alice wins the game if (i) the resulting roads allow for travel between any pair of cities via a finite sequence of roads and (ii) no two roads cross. Otherwise, Bob wins. Determine, with proof, which player has a winning strategy.

Note: $\triangle UVW$ is directly similar to $\triangle XYZ$ if there exists a sequence of rotations, translations, and dilations sending $U$ to $X$, $V$ to $Y$, and $W$ to $Z$.

Rubric for Problem 3

4. Let $H$ be the orthocenter of acute triangle $ABC$, let $F$ be the foot of the altitude from $C$ to $AB$, and let $P$ be the reflection of $H$ across $BC$. Suppose that the circumcircle of triangle $AFP$ intersects line $BC$ at two distinct points $X$ and $Y$. Prove that $C$ is the midpoint of $XY$.

Rubric for Problem 4

5. Determine, with proof, all positive integers $k$ such that \[\frac{1}{n+1} \sum_{i=0}^n \binom{n}{i}^k\]is an integer for every positive integer $n$.

Rubric for Problem 5

6. Let $m$ and $n$ be positive integers with $m\geq n$. There are $m$ cupcakes of different flavors arranged around a circle and $n$ people who like cupcakes. Each person assigns a nonnegative real number score to each cupcake, depending on how much they like the cupcake. Suppose that for each person $P$, it is possible to partition the circle of $m$ cupcakes into $n$ groups of consecutive cupcakes so that the sum of $P$'s scores of the cupcakes in each group is at least $1$. Prove that it is possible to distribute the $m$ cupcakes to the $n$ people so that each person $P$ receives cupcakes of total score at least $1$ with respect to $P$.

Rubric for Problem 6
12 replies
plang2008
4 hours ago
Ilikeminecraft
2 hours ago
inequalities
Cobedangiu   4
N 2 hours ago by sqing
Source: own
$a,b>0$ and $a+b=1$. Find min P:
$P=\sqrt{\frac{1-a}{1+7a}}+\sqrt{\frac{1-b}{1+7b}}$
4 replies
Cobedangiu
Yesterday at 6:10 PM
sqing
2 hours ago
Problem 4: ISL 2008/G3 Constructed Four Times
ike.chen   25
N 2 hours ago by Yiyj1
Source: USEMO 2022/4
Let $ABCD$ be a cyclic quadrilateral whose opposite sides are not parallel. Suppose points $P, Q, R, S$ lie in the interiors of segments $AB, BC, CD, DA,$ respectively, such that $$\angle PDA = \angle PCB, \text{ } \angle QAB = \angle QDC, \text{ } \angle RBC = \angle RAD, \text{ and } \angle SCD = \angle SBA.$$Let $AQ$ intersect $BS$ at $X$, and $DQ$ intersect $CS$ at $Y$. Prove that lines $PR$ and $XY$ are either parallel or coincide.

Tilek Askerbekov
25 replies
ike.chen
Oct 23, 2022
Yiyj1
2 hours ago
Inspired by old results
sqing   8
N 2 hours ago by sqing
Source: Own
Let $ a,b,c> 0 $ and $ abc=1 $. Prove that
$$\frac1{a^2+a+k}+\frac1{b^2+b+k}+\frac1{c^2+c+k}\geq \frac{3}{k+2}$$Where $ 0<k \leq 1.$
8 replies
sqing
Monday at 1:42 PM
sqing
2 hours ago
function
REGNA   2
N 2 hours ago by jasperE3
find all $f : \mathbb{R^+}\rightarrow \mathbb{R^+}$ such that :
$f(x+3f(y))=f(x)+f(y)+2y)$
2 replies
REGNA
Mar 19, 2023
jasperE3
2 hours ago
sum(ab/4a^2+b^2) <= 3/5
truongphatt2668   3
N 2 hours ago by Nguyenhuyen_AG
Source: I remember I read it somewhere
Let $a,b,c>0$. Prove that:
$$\dfrac{ab}{a^2+4b^2} + \dfrac{bc}{b^2+4c^2} + \dfrac{ca}{c^2+4a^2} \le \dfrac{3}{5}$$
3 replies
truongphatt2668
Monday at 1:23 PM
Nguyenhuyen_AG
2 hours ago
Inspired by old results
sqing   2
N 3 hours ago by sqing
Source: Own
Let $ a,b $ be reals such that $ a^2+b^2 +ab =1.$ Prove that $$9\geq (a^2-a+1)(b^2-b+1) (a^2-ab+b^2) \geq \frac{19-8\sqrt 3}{27}$$Let $ a,b $ be reals such that $ a^3+b^3 -2ab =1.$ Prove that $$  (a^2-a+1)(b^2-b+1) (a^2-ab+b^2) \geq 1$$
2 replies
sqing
3 hours ago
sqing
3 hours ago
Painting Beads on Necklace
amuthup   45
N 3 hours ago by maromex
Source: 2021 ISL C2
Let $n\ge 3$ be a fixed integer. There are $m\ge n+1$ beads on a circular necklace. You wish to paint the beads using $n$ colors, such that among any $n+1$ consecutive beads every color appears at least once. Find the largest value of $m$ for which this task is $\emph{not}$ possible.

Carl Schildkraut, USA
45 replies
amuthup
Jul 12, 2022
maromex
3 hours ago
Inclusion Exclusion Principle
chandru1   1
N 4 hours ago by onofre.campos
How does one prove the identity $$1=\sum_{k=0}^{n}(-1)^{k}\binom{n}{k}2^{n-k}$$This easy via the binomial theorem for the quantity is just $(2-1)^{k}$, but how do we arrive at this using the I-E-P?
1 reply
chandru1
Dec 4, 2020
onofre.campos
4 hours ago
Olympiad Geometry problem-second time posting
kjhgyuio   0
4 hours ago
Source: smo problem
In trapezium ABCD,AD is parallel to BC and points E and F are midpoints of AB and DC respectively. If
Area of AEFD/Area of EBCF =√3 + 1/3-√3 and the area of triangle ABD is √3 .find the area of trapezium ABCD
0 replies
kjhgyuio
4 hours ago
0 replies
Cyclic Quad
worthawholebean   128
N Jun 21, 2024 by ihatemath123
Source: USAMO 2008 Problem 2
Let $ ABC$ be an acute, scalene triangle, and let $ M$, $ N$, and $ P$ be the midpoints of $ \overline{BC}$, $ \overline{CA}$, and $ \overline{AB}$, respectively. Let the perpendicular bisectors of $ \overline{AB}$ and $ \overline{AC}$ intersect ray $ AM$ in points $ D$ and $ E$ respectively, and let lines $ BD$ and $ CE$ intersect in point $ F$, inside of triangle $ ABC$. Prove that points $ A$, $ N$, $ F$, and $ P$ all lie on one circle.
128 replies
worthawholebean
May 1, 2008
ihatemath123
Jun 21, 2024
Source: USAMO 2008 Problem 2
G
H
=
a