Euclid's Orchard serves to provide high quality math handouts. The handouts below are listed in general order of increasing difficulty, beginning with AMC and AIME level contest math, and ending with college math.
A short compilation of topics in contest mathematics to study.
Written by Dylan Yu and Amol Rama. |
A nice introductory handout to the idea of forming and solving recursions.
Written by Jeffrey Chen and Dylan Yu, edited by Peter Pu. |
Goes over most concepts in modular arithmetic, although some overlapping topics with other parts of number theory may have been left out.
Written by Dylan Yu. |
Covers arithmetic, geometric, arithmetico-geometric, telescoping, and recursive sequences. Note that recursive sequences is briefly mentioned, since we already have an article on recursion.
Written by Dylan Yu and nikenissan. |
A complete guide on how to use polynomials on the AIME. Includes (almost) every polynomial problem on the AIME and also problems from other sources (such as RMO and HMMT).
Written by Dylan Yu and Amol Rama. |
Introduces proofs very nicely.
Written by Jai Sharma. |
A complete guide on how to use trigonometry on the AIME and USA(J)MO. Includes (almost) every trigonometry problem on the AIME, with worked out problems as well as more than one hundred hints to selected problems. There quite a few olympiad problems sprinkled in, too.
Written by Dylan Yu and Amol Rama. |
This handout was made by taking beamer slides by Emma Cardwell and Matthew Ho and piecing them together. It is an introductory piece with some basic ideas introduced.
|