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
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
Alice in Wonderland
ilovemath04   26
N 2 minutes ago by atdaotlohbh
Source: ISL 2019 C8
Alice has a map of Wonderland, a country consisting of $n \geq 2$ towns. For every pair of towns, there is a narrow road going from one town to the other. One day, all the roads are declared to be “one way” only. Alice has no information on the direction of the roads, but the King of Hearts has offered to help her. She is allowed to ask him a number of questions. For each question in turn, Alice chooses a pair of towns and the King of Hearts tells her the direction of the road connecting those two towns.

Alice wants to know whether there is at least one town in Wonderland with at most one outgoing road. Prove that she can always find out by asking at most $4n$ questions.
26 replies
ilovemath04
Sep 22, 2020
atdaotlohbh
2 minutes ago
Geometry
Captainscrubz   0
19 minutes ago
Source: Own
Let $D$ be any point on side $BC$ of $\triangle ABC$ .Let $E$ and $F$ be points on $AB$ and $AC$ such that $EB=ED$ and $FD=FC$ respectively. Prove that the locus of circumcenter of $(DEF)$ is a line.
Prove without using moving points :D
0 replies
+1 w
Captainscrubz
19 minutes ago
0 replies
Pebble Game
oVlad   6
N an hour ago by The5within
Source: KöMaL A. 790
Andrew and Barry play the following game: there are two heaps with $a$ and $b$ pebbles, respectively. In the first round Barry chooses a positive integer $k,$ and Andrew takes away $k$ pebbles from one of the two heaps (if $k$ is bigger than the number of pebbles in the heap, he takes away the complete heap). In the second round, the roles are reversed: Andrew chooses a positive integer and Barry takes away the pebbles from one of the two heaps. This goes on, in each round the two players are reversing the roles. The player that takes the last pebble loses the game.

Which player has a winning strategy?

Submitted by András Imolay, Budapest
6 replies
oVlad
Mar 24, 2022
The5within
an hour ago
Equality with Fermat Point
nsato   13
N an hour ago by Nari_Tom
Source: 2012 Baltic Way, Problem 11
Let $ABC$ be a triangle with $\angle A = 60^\circ$. The point $T$ lies inside the triangle in such a way that $\angle ATB = \angle BTC = \angle CTA = 120^\circ$. Let $M$ be the midpoint of $BC$. Prove that $TA + TB + TC = 2AM$.
13 replies
nsato
Nov 22, 2012
Nari_Tom
an hour ago
China 2017 TSTST1 Day 2 Geometry Problem
HuangZhen   46
N an hour ago by ihategeo_1969
Source: China 2017 TSTST1 Day 2 Problem 5
In the non-isosceles triangle $ABC$,$D$ is the midpoint of side $BC$,$E$ is the midpoint of side $CA$,$F$ is the midpoint of side $AB$.The line(different from line $BC$) that is tangent to the inscribed circle of triangle $ABC$ and passing through point $D$ intersect line $EF$ at $X$.Define $Y,Z$ similarly.Prove that $X,Y,Z$ are collinear.
46 replies
HuangZhen
Mar 7, 2017
ihategeo_1969
an hour ago
Cool combinatorial problem (grid)
Anto0110   1
N 2 hours ago by Anto0110
Suppose you have an $m \cdot n$ grid with $m$ rows and $n$ columns, and each square of the grid is filled with a non-negative integer. Let $a$ be the average of all the numbers in the grid. Prove that if $m >(10a+10)^n$ the there exist two identical rows (meaning same numbers in the same order).
1 reply
Anto0110
Yesterday at 1:57 PM
Anto0110
2 hours ago
one nice!
teomihai   2
N 2 hours ago by teomihai
3 girls and 4 boys must be seated at a round table. In how many distinct ways can they be seated so that the 3 girls do not sit next to each other and there can be a maximum of 2 girls next to each other. (The table is round so the seats are not numbered.)
2 replies
teomihai
Yesterday at 7:32 PM
teomihai
2 hours ago
Find the constant
JK1603JK   0
2 hours ago
Source: unknown
Find all $k$ such that $$\left(a^{3}+b^{3}+c^{3}-3abc\right)^{2}-\left[a^{3}+b^{3}+c^{3}+3abc-ab(a+b)-bc(b+c)-ca(c+a)\right]^{2}\ge 2k\cdot(a-b)^{2}(b-c)^{2}(c-a)^{2}$$forall $a,b,c\ge 0.$
0 replies
1 viewing
JK1603JK
2 hours ago
0 replies
IMO ShortList 1999, number theory problem 1
orl   61
N 2 hours ago by cursed_tangent1434
Source: IMO ShortList 1999, number theory problem 1
Find all the pairs of positive integers $(x,p)$ such that p is a prime, $x \leq 2p$ and $x^{p-1}$ is a divisor of $ (p-1)^{x}+1$.
61 replies
orl
Nov 13, 2004
cursed_tangent1434
2 hours ago
(2^n + 1)/n^2 is an integer (IMO 1990 Problem 3)
orl   105
N 3 hours ago by cursed_tangent1434
Source: IMO 1990, Day 1, Problem 3, IMO ShortList 1990, Problem 23 (ROM 5)
Determine all integers $ n > 1$ such that
\[ \frac {2^n + 1}{n^2}
\]is an integer.
105 replies
orl
Nov 11, 2005
cursed_tangent1434
3 hours ago
Maximum angle ratio
miiirz30   2
N 3 hours ago by zuzuzu222
Source: 2025 Euler Olympiad, Round 1
Given any arc $AB$ on a circle and points $C$ and $D$ on segment $AB$, such that $$CD = DB = 2AC.$$Find the ratio $\frac{CM}{MD}$, where $M$ is a point on arc $AB$, such that $\angle CMD$ is maximized.

IMAGE

Proposed by Andria Gvaramia, Georgia
2 replies
miiirz30
Mar 31, 2025
zuzuzu222
3 hours ago
S must be the incentre of triangle ABC
WakeUp   3
N 3 hours ago by Nari_Tom
Source: Baltic Way 2007
In triangle $ABC$ let $AD,BE$ and $CF$ be the altitudes. Let the points $P,Q,R$ and $S$ fulfil the following requirements:
i) $P$ is the circumcentre of triangle $ABC$.
ii) All the segments $PQ,QR$ and $RS$ are equal to the circumradius of triangle $ABC$.
iii) The oriented segment $PQ$ has the same direction as the oriented segment $AD$. Similarly, $QR$ has the same direction as $BE$, and $Rs$ has the same direction as $CF$.
Prove that $S$ is the incentre of triangle $ABC$.
3 replies
WakeUp
Nov 30, 2010
Nari_Tom
3 hours ago
Two midpoints and the circumcenter are collinear.
ricarlos   1
N 4 hours ago by Luis González
Let $ABC$ be a triangle with circumcenter $O$. Let $P$ be a point on the perpendicular bisector of $AB$ (see figure) and $Q$, $R$ be the intersections of the perpendicular bisectors of $AC$ and $BC$, respectively, with $PA$ and $PB$. Prove that the midpoints of $PC$ and $QR$ and the point $O$ are collinear.

1 reply
ricarlos
Yesterday at 5:52 PM
Luis González
4 hours ago
¿10^n-1 is a divisor of 11^n-1?
EmersonSoriano   2
N 4 hours ago by Giant_PT
Source: 2017 Peru Southern Cone TST P2
Determine if there exists a positive integer $n$ such that $10^n - 1$ is a divisor of $11^n - 1$.
2 replies
EmersonSoriano
Yesterday at 6:32 PM
Giant_PT
4 hours ago
Olympiad Combinatorics Book
Pascal96   126
N Dec 27, 2023 by zaahir
Hi everyone, I am currently writing a book on combinatorics for people preparing for national and international math competitions, especially the IMO and selection tests leading up to it. The book is intended to expose readers to a variety of ideas, techniques and problem solving strategies, ranging from the intuitive “greedy algorithms” in the first chapter to the powerful Probabilistic Method in chapter nine.
I am uploading chapter one here, and would appreciate your feedback and any suggestions. Over the coming weeks, I will be uploading the remaining chapters one at a time.
The only prerequisites are familiarity with basic graph theoretic concepts and terminology, algebraic inequalities, induction and the pigeonhole principle. Experience with invariants and the extremal principle is also helpful.
EDIT: CHAPTER 9 IS OUT! Since only 3 attachments are allowed per post, I have uploaded chapters 4, 5 and 6 in my comment below (10th on this page), and chapters 7, 8, and 9 further below (comment number 49 on this page).
NOTE: The solution to example 8 in chapter 1 is incorrect, and will be corrected in the final version of the book. For now, ignore this example.

Full book (uploaded by green_dog_7983): Dead Link
[Amir: new link]
126 replies
Pascal96
Aug 6, 2014
zaahir
Dec 27, 2023
Olympiad Combinatorics Book
G H J
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Pascal96
124 posts
#1 • 454 Y
Y by bcp123, Konigsberg, gobathegreat, utkarshgupta, frill, sabbasi, professordad, rgreenanswers, AndrewKwon97, thkim1011, PatrikP, fclvbfm934, happiface, fireonice18, El_Ectric, TheCrafter, minimario, shivangjindal, Cyclicduck, raptorw, sicilianfan, misgiven, tau172, ABCDE, wcao9311, CalcCrunch, TheMaskedMagician, acupofmath, Wawowiee, debjit1999, Em80, socrates, Boomer, Amir Hossein, AnonymousBunny, Ashutoshmaths, ThePathOfWar, mbrc, Philip7086, flamefoxx99, NormanWho, Chaos_Theory, Uagu, RishabhDahale, Anish_S, RadioActive, explogabloger, hnhuongcoi, ARCH999, kenneth102099, Debdut, Kezer, blippy1998, DominicanAOPSer, mihajlon, Higgsboson79, rigor, AdithyaBhaskar, drkim, 24iam24, DrMath, sheripqr, ATimo, ssk9208, champion999, AdBondEvent, huricane, trumpeter, Wave-Particle, joey8189681, amplreneo, yojan_sushi, shinichiman, aops777, hwl0304, Eugenis, bearytasty, pican, FTW, nikolapavlovic, fractals, Rubaiya, NHN, Tintarn, randomusername, InCtrl, anantmudgal09, MathPanda1, Knin2820, yimingz89, GoJensenOrGoHome, monkeyl, SHARKYBOY, quantummath, WOOT2016er, rkm0959, Devesh14, TheOneYouWant, mathtastic, simos20, quangminhltv99, Hydrogen-Helium, madmathlover, K6160, tarzanjunior, Ankoganit, mewtwomew, jam10307, lucasxia01, m1234567, brianapa, pinetree1, fireclaw105, NTA1907, babu2001, shiningsunnyday, mathwizard888, ankitsnigam, dtxiong, stan23456, Plasma_Vortex, Generic_Username, wu2481632, mrowhed, Temp456, rterte, DeathLlama9, Flash12, andrei_cdr29, gradysocool, purpleapples, always_correct, nsato, 62861, Natsu_Dragneel, skys, math90, pi_Plus_45x23, Snowfractals, Number1, Vietnamisalwaysinmyheart, Churent, thunderz28, JasperL, mathcrazymj, rafayaashary1, MathSlayer4444, Phie11, steppewolf, tenplusten, vsathiam, Swag00, TYERI, tiwarianurag021999, Weakinmath, bluephoenix, Problem_Penetrator, kk108, user2324335345, shawnee03, claserken, div5252, Kayak, nmd27082001, Gh324, Sids2k, ThisIsASentence, ArijitViswananthan, targo___, samuel, fatant, rodamaral, Tawan, AnArtist, QWERTYphysics, dram, enhanced, ccx09, 277546, Uros, integrated_JRC, tapir1729, NotKris, Kagebaka, Wizard_32, Vrangr, rmtf1111, Zoom, opplakat, e_plus_pi, lifeisgood03, taisan, lazysnorlax, MNJ2357, Supercali, mathlogician, samoha, gmail.com, Durjoy1729, illogical_21, MEGAKNIGHT, ultralako, allinnohesitation, InfiniteAnswers, AlastorMoody, TheMagician, math-o-enthu, bhargav13baruah13, biomathematics, NOLF, mathisreal, Aspirant-to-IMO, niyu, Arhaan, Saikat002, Drunken_Master, Mathisfun04, doitsudoitsu, nikhil.mudumbi, BinomialMoriarty, magicarrow, MathInfinite, TheDarkPrince, sriraamster, MathbugAOPS, AbsoluteZer0, aadhitya, Twistya, PhysicsMonster_01, MathPassionForever, SoumikNayak, RAMUGAUSS, NoDealsHere, TheCoolDinosuar, mathleticguyyy, Guardiola, Mathotsav, Math_Is_Life_03, Spiralflux789, Vietjung, MelonGirl, Math-wiz, FISHMJ25, meet18, MathematicalPhysicist, Systematicworker, p_square, duttaditya18, hellomath010118, Varuneshwara, Kaisun, fjm30, Atpar, lilavati_2005, heidi3003, Loppukilpailija, Aarth, GeronimoStilton, SHREYAS333, Greenleaf5002, whatRthose, Sumgato, Polipo2704, mathsworm, WindTheorist, BigSams, khina, Feridimo, Martin007B, ErijonHasi1, yaseenmollik, Bassiskicking, RudraRockstar, Gumnaami_1945, amar_04, Math_olympics, Kamran011, freeman66, Toinfinity, a2048, tree_3, OlympusHero, Zorger74, AmirKhusrau, Dem0nfang, The_Conjecturer, mueller.25, MintTea, Bltbob, tastymath75025, Aspiring_Mathletes, Kanep, Abbas11235, The_Giver, char2539, adityaguharoy, Purple_Planet, Orangensaft12, CaptainLevi16, khan.academy, NePtUnEMaTh, smartkmd1, matinyousefi, TwilightZone, Aryan-23, scimaths, Kgxtixigct, myh2910, Yusrizal, Han1728, Imayormaynotknowcalculus, Awesome_guy, Googolplexian, heheXD1, leibnitz, ghu2024, Gaussian_cyber, Pluto1708, Invert_DOG_about_centre_O, PROA200, Bumblebee60, ilovepizza2020, Nathanisme, itslumi, A-Thought-Of-God, Congruentisogonal44, DievilOnlyM, A_Math_Lover, NJOY, IAmTheHazard, captainsnake, Talgat05, Pitagar, Geo_alphan, anonman, TsunamiStorm08, Didier, lazybean123, ProblemSolver2048, Hamroldt, babygrogu, Ucchash, k12byda5h, MathsMadman, tigerzhang, Euler1728, 606234, phoenixfire, EmilXM, Aritra12, Ninjasolver0201, Rg230403, superagh, Andrei246, IceWolf10, sotpidot, NumberX, EllipticSWAN, samrocksnature, EZmath2006, Jerry122805, hakN, Siddharth03, 554183, Wizard0001, srijonrick, parmenides51, N1RAV, mathlearner2357, MathJams, Taco12, NealShrestha, abvk1718, violin21, megarnie, Nymoldin, guavaSeabird, john0512, sklf023, Timmy456, IMUKAT, Elnuramrv, Flying-Man, TheCollatzConjecture, Pranav1056, CyclicISLscelesTrapezoid, Superguy, AwesomeYRY, MrOreoJuice, Sprites, Hexagon_6-, Nuterrow, ALM_04, pikapika007, polynomialian, rayfish, skyguy88, Seicchi28, wasikgcrushedbi, Gacac, Jndd, Miku_, DPS, PHSH, HamstPan38825, mathking999, Zaro23, Blast_S1, a-dumb-math-kid, rama1728, Quidditch, somebodyyouusedtoknow, Mathlover_1, David-Vieta, sehgalsh, userr.7, matharcher, Mogmog8, adorefunctionalequation, howcanicreateacccount, thepigod762, GeoKing, EpicBird08, ab2024, huashiliao2020, peelybonehead, s12d34, Rainmaker2627, wenwenma, Adventure10, Mango247, cursed_tangent1434, Tafi_ak, johnlee1234, anonymouzzz, ATGY, TestX01, ohiorizzler1434, ehuseyinyigit, Lhaj3, Fah2008, and 13 other users
Hi everyone, I am currently writing a book on combinatorics for people preparing for national and international math competitions, especially the IMO and selection tests leading up to it. The book is intended to expose readers to a variety of ideas, techniques and problem solving strategies, ranging from the intuitive “greedy algorithms” in the first chapter to the powerful Probabilistic Method in chapter nine.
I am uploading chapter one here, and would appreciate your feedback and any suggestions. Over the coming weeks, I will be uploading the remaining chapters one at a time.
The only prerequisites are familiarity with basic graph theoretic concepts and terminology, algebraic inequalities, induction and the pigeonhole principle. Experience with invariants and the extremal principle is also helpful.
EDIT: CHAPTER 9 IS OUT! Since only 3 attachments are allowed per post, I have uploaded chapters 4, 5 and 6 in my comment below (10th on this page), and chapters 7, 8, and 9 further below (comment number 49 on this page).
NOTE: The solution to example 8 in chapter 1 is incorrect, and will be corrected in the final version of the book. For now, ignore this example.

Full book (uploaded by green_dog_7983): Dead Link
[Amir: new link]
Attachments:
OlympiadCombinatoricsChapter1.pdf (869kb)
OlympiadCombinatoricsChapter2.pdf (814kb)
OlympiadCombinatoricsChapter3.pdf (924kb)
This post has been edited 15 times. Last edited by Amir Hossein, Jan 23, 2020, 7:55 PM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
utkarshgupta
2280 posts
#2 • 5 Y
Y by Pascal96, Math_olympics, samrocksnature, Adventure10, and 1 other user
Thanx a lot !!!!!!

That is exactly what I need !

I will be eagerly waiting for subsequent chapters !!!!
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Konigsberg
2205 posts
#3 • 11 Y
Y by droid347, mathcrazymj, dram, Math_olympics, samrocksnature, IceWolf10, Adventure10, Mango247, and 3 other users
I would be reading the first chapter when I have time, but a quick glance to me says that it is quite good. It seems a good (combinatorial) counterpart to v_Enhance's geometry book. Will there be solutions to the exercise problems, or we have to search them ourselves?

May I ask when would the other chapters be posted?

Thanks!
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Pascal96
124 posts
#4 • 9 Y
Y by samuel, mathcrazymj, hibiscus, Math_olympics, samrocksnature, Adventure10, Mango247, and 2 other users
Thank you for your positive feedback! To answer your questions, there may be a gap of about a week before I put up the next chapter since I will be out of town, but after that I should be putting up two to three per week. There will be nine chapters in total, covering algorithms (two chapters), processes, existence, games, counting in two ways, extremal combinatorics, graph theory and the probabilistic method. Eventually I will put them all into a single, complete pdf with a brief appendix on prerequisites as well. I thought I would initially post chapters individually to get some feedback and make changes where required.
As of now I do not have any plans to write solutions to exercise problems, but if you would like a hint/solution sketch to a particular problem you have been working on feel free to pm me. It may also be useful to know that the exercises are (for the most part) arranged in increasing order of difficulty (with exercise 10 being an exception as it is a lemma needed for 11).
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
deepesh
59 posts
#5 • 4 Y
Y by blackwave, Math_olympics, samrocksnature, Adventure10
I cant find the link for some reason
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
utkarshgupta
2280 posts
#6 • 4 Y
Y by Math_olympics, samrocksnature, Adventure10, Mango247
Maybe you are on a tab or mobile
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Konigsberg
2205 posts
#7 • 4 Y
Y by Math_olympics, samrocksnature, Adventure10, Mango247
could you give links for the solutions to the informatics olympiad problems? the others could be found either through google or aops resources.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Pascal96
124 posts
#8 • 3 Y
Y by Math_olympics, samrocksnature, Adventure10
Most of them should be under greedy algorithms at this link: http://www.iarcs.org.in/inoi/online-study-material/topics/
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Konigsberg
2205 posts
#9 • 4 Y
Y by Math_olympics, samrocksnature, Adventure10, Mango247
oh ok. When would the other chapters be posted?
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Pascal96
124 posts
#10 • 4 Y
Y by Math_olympics, samrocksnature, Adventure10, and 1 other user
I just uploaded chapter 2. Chapters 3, 4 and 5 should be ready within the next 3 or 4 days
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Pascal96
124 posts
#11 • 29 Y
Y by bcp123, fclvbfm934, PatrikP, acupofmath, hungrycap, RishabhDahale, RadioActive, ARCH999, huricane, trumpeter, bearytasty, pican, TheOneYouWant, 62861, thunderz28, e_plus_pi, samuel, mathrabbit812, allinnohesitation, Math_olympics, Pluto1708, samrocksnature, Adventure10, EpicBird08, and 5 other users
It turns out I'm only allowed 3 attachments in one post, so here are chapters 4 and5.
EDIT: Chapter 6 is out!
Attachments:
OlympiadCombinatoricsChapter4.pdf (867kb)
Chapter5 Games Aug 2014.pdf (801kb)
Chapter6 Aug 2014.pdf (884kb)
This post has been edited 2 times. Last edited by Pascal96, Sep 4, 2014, 12:15 PM
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
thkim1011
3135 posts
#12 • 3 Y
Y by samrocksnature, Adventure10, and 1 other user
Thank you! I hardly know any olympiad combinatorics, so I guess this is a good chance to learn. Just wondering, what did you use to write this book?
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
mentalgenius
1020 posts
#13 • 4 Y
Y by Math_olympics, samrocksnature, Adventure10, and 1 other user
It looks like Microsoft Word.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
v_Enhance
6871 posts
#14 • 35 Y
Y by butter67, zmyshatlp, Pascal96, bearytasty, TheOneYouWant, madmathlover, CQYIMO42, CeuAzul, mcmcphie, mathcrazymj, samuel, mathrabbit812, Spiralflux789, lemon94, RudraRockstar, Math_olympics, Pi-is-3, myh2910, amar_04, Nathanisme, Euler1728, samrocksnature, primesarespecial, Thapakazi, abvk1718, Hypatia1728, weili4216, rayfish, AOPSUser2357, EpicBird08, Adventure10, NicoN9, and 3 other users
This work is really impressive! You are very fast.

Here are some comments as I read through the first chapter. Most of these are just little nitpicks and may not be worth weighting very heavily. The stuff I believe more firmly is in italics. If you want to discuss more, you are welcome to email me at $\text{evanchen}@\text{mit.edu}$.

Introduction
Second paragraph: "Often an algorithm can ... field of number theory". This feels like "fluff" to me, doesn't contribute much to the paragraph and the first sentence seems vacuously true. Also not sure how much I agree with the claim that the Euclidean algorithm is the basis of NT, but that's beside the point ;)

Third paragraph: Perhaps you might want to put this in a preface / chapter 0 of some sort.

Greedy Algorithms
Nice quote :)

"in each step" might be better as "at each step"

"They aren't always the optimal algorithm in the long run" is kind of awkward and "they" seems not so well-defined.
I suggest "Greedy algorithms are not always optimal in the long run".

Example 1
Solution: You may prefer to use $c_1$, $c_2$, for colors and $v_1$, $v_2$, for vertices.

Remark: This is good. You might also want to note something to the effect that the greedy algorithms are also _dumb_; they don't take a lot of things into account. To illustrate this point, you might mention Brook's Theorem, which shows that $\Delta +1$ is usually not tight. I think it's useful to point out in this way that the greedy algorithm usually does not always perform optimally.

Example 2
The comment about how the trivial greedy algorithm fails is IMO very good. I don't know why so few books make comments like this.
Actually the entire solution is just very well-explained.

And that remark at the end about boring calculations is hilarious. Please keep it!

Example 3
You might be pushing a little here with the amount of graph theory to assume, but that's probably fine.
You should mention that $H$ must be nonempty.
Is there a missing space between "$V$" and "vertices" in the problem statement?

The solution feels a bit more dense here than the preceding solutions. Some paragraph breaks might help, at least.
Moreover, I think the wording in terms of edges/vertices instead of average degree is both confusing and counterintuitive (at one point, I thought that the value of $E$ and $V$ were changing). I think the following phrasing might be more intuitive:
"If $d$ is the average degree, then we want to delete vertices until the minimum degree is at least $d/2$.
Call a vertex bad if the degree is less than $d/2$, and begin deleting bad vertices arbitrarily.
... more text ...
Notice that as we delete bad vertices, the average degree of the graph increases, because BLAH "
and then proceed to show the resulting $H$ is nonempty. At the very least, I don't think the "(it started as $E/V$ ...)" should be stuffed into a parenthetical.

Is the bound $d/2$ tight? I feel like looking at a case where equality occurs would be useful for understanding what is happening.
Actually I can't tell from reading your solution why $d/2$ can't be replaced by something else, so I think you should definitely elaborate on why the average degree is strictly increasing.

Example 4
Let $a=1776$ seems more conventional than $1776=a$. Also, spacing issues. Would appreciate a paragraph break after "call these small sets and big sets respectively".

The explanation of heuristics is very good here in my opinion. So is the remark at the end.

"Suppose the algorithm fails (that is ..." -- Again, I object to the stuffing of content in parentheses, though not quite as strongly as the previous issue.

Invariants / Monovariants
"... and an invariant is quantity that doesn't change." maybe append "at all" to the end of this sentence.
You might also like to talk briefly about how monovariants / invariants are used, namely
(i) monovariants are often used to show that some process terminates, and
(ii) invariants are often used to show that some state cannot be achieved.

Example 5
How would you think of the black/white coloring?

"... making all but the last 2 entries 0 ..." use "two" instead of "2".

Example 6
Oh man this is a really good example problem. You might want to explain more towards the beginning that we choose the weights in such a way that passing towards $A_0$ does not change the sum of the weights.

The $W_+$ and $W_-$ is actually tricky, initially I thought that $A_n$ could just pass in either direction and it would still work. You might want to show explicitly that this is not the case -- that is, explain why $A_n$ actually needs to be careful by showing an example where $A_n$ passes the wrong way and everyone is sad, then go into the $W_+$ and $W_-$ distinction.

Example 7
"The second part of the question is trivial" -- I think a little more here would be appreciated. It would probably be sufficient to add something of the form "the sum of the money is invariant".

Example 8
I'm not thinking very well right now, but why is this algorithm optimal? You have this $X$ which decreases by $1$ for most transfers, but decreases by more if one transfers from $n$ to $1$. But the "full algorithm" you specified involves doing the second operation whenever possible; in other words, greedily. Why is that sufficient?

Example 9
"Let the sum of a position ... maximum of the 6 numbers" The wording is a bit clumsy here.
Maybe you want "Let the sum and maximum of a position denote the sum and maximum, respectively, of the six numbers".
And again you may want to use "six" instead of "6".

The explanation of the sub-algorithms is good. Some diagrams might be appreciated.

Misc
At this point my mom is telling me I'm going to a doctor appointment soon, so I'm just skimming now.
The fact that I can still pick up the main idea of the solution is a very positive sign.

Example 10
Nitpick: you ought to be consistent with your (a), (b), (c), (d), since you use double-parens (b) for the label but single-parens b) in the main text.

However, I think your dissection into the (a), (b), (c), (d) observations is very, very good.

Example 11
Now you have a), b), c), d) in the labels. Again, you should try and be consistent.

The prose is very clear though. Again, you motivate the solution very well.

The remark is quite good. I recall being surprised at the low scores for the Problem 6 that year until I remembered what Problem 5 was.
Deputy leaders too good :P

Example 12
The notation here is really dense. Diagrams would be really helpful here, especially for a problem this difficult.

Exercises
The mixture with CS algorithm flavoring is interesting; I personally like it but don't know if others will. It might be worth defining stuff like $O(n^2)$ so that you don't have to keep repeating yourself now or later.

Problem 4 is from some Putnam, but I don't remember which year. It's possible that Putnam stole it though.

You might be interested in providing hints to the problems: just one or two sentences that outlines the main idea. I can attest that this takes much, much less time than writing full solutions, and has a similarly useful effect.

That's all for now, will write more later. And again, feel free to email me if you want to follow up on anything.
Z K Y
The post below has been deleted. Click to close.
This post has been deleted. Click here to see post.
Pascal96
124 posts
#15 • 17 Y
Y by Eugenis, mathcrazymj, Problem_Penetrator, samuel, RudraRockstar, Math_olympics, Pi-is-3, Nathanisme, samrocksnature, Adventure10, Mango247, winniep008hfi, and 5 other users
Thank you for all your detailed advice Evan. I'll definitely make the relevant changes in the final book. I agree with all of it apart from a few points.
Introduction: The sentences "Often an algorithm... field of number theory" are intended to contrast with the first paragraph. While the first paragraph asserts that algorithms have several "external" uses - uses outside of mathematics - the second paragraph indicates that the focus of this chapter will be to use algorithms as tools to solve mathematical problems. In fact, I do not think it is that obvious that existence problems like example 3 and 4 can be solved by designing algorithms. Perhaps I should reword these sentences a little to make this clearer.
Example 3: No there's no space missing. It just looks like that because of the italics. But I agree with your other remarks about this problem.
Invariants/monovariants: In the final book there will be a chapter introducing some prerequisites, which will define invariants and monovariants, and also introduce the idea of black and white colorings.
Example 7: Isn't it clear that the total money is invariant? He can only transfer money between accounts, not make or destroy money.
Exercises: I agree with what you said about the "CS algorithm flavoring". Do you think I should put these into a separate section at the end? Also, I think problems 7, 9, 10 and 11 are okay since no algorithm design is required, only analysis.
Z K Y
G
H
=
a