Comprehensive Study Notes: The Art of Problem Solving Volume 2 and Beyond
Introduction to The Art of Problem Solving
Background: For over 24 years, the classic Art of Problem Solving books (Volume 1 and Volume 2) have served as resources for the American Mathematics Competitions (AMC) and other national/local math events.
Authors: Sandor Lehoczky and Richard Rusczyk.
Community Stats (as of Sept 2017): Over 295,000 members for the online forum with over 6,000,000 messages posted.
Instructional Icons:
The Eyeball: Indicates especially important areas of the text.
The Threaded Needle: Indicates particularly difficult problems or concepts.
The Bomb: Signals a warning to facilitate avoiding common mistakes.
Chapter 0: Proof Techniques
Importance of Proofs: Essential for mathematical understanding; without knowing why a tool works, it cannot be used to its full capacity.
Common Methods:
Contradiction: To prove statement , show that if were false, an impossible statement must be true.
Example: Proving infinitely many primes by assuming a finite set and constructing , which is not divisible by any of the primes.
Mathematical Induction: Generally used for statements true for all positive or non-negative integers. Prove for , then show that if it holds for (inductive hypothesis), it must hold for .
Example: Proving Fibonacci sum identity .
Pigeonhole Principle: If objects are placed in boxes, at least one box must contain at least objects.
Example: Proving that if 5 points are selected in a unit square, some pair are no more than apart by dividing the square into four quadrants.
Chapter 1: Logarithms
Purpose: Devised to turn multiplication/division into addition/subtraction.
Core Relationship: If and , then .
Properties of Logarithms:
(Change of Base Form)
Chain Rule for Logarithms: .
Warning: The base and argument of all logarithms must be positive. Always check solutions against initial constraints.
Reciprocal Rule: .
The Big Picture: Logarithms and Music
Pitch and Vibration: Vibration rate translates to pitch ().
Harmonies: Intervals sound "good" when frequencies are nice multiples (e.g., an octave is a factor of 2; a major fifth is a ratio of ).
Even Tempering: Dividing an octave into 12 pieces where each is the same multiple of the last (). This allows a scale to work in any key.
Calculation: Logarithms determine where a tone (e.g., ) sits on the scale using .
Chapter 2: Trigonometry Beyond Right Triangles
Unit Circle Definition: Sine and cosine are Cartesian coordinates of a point on a circle of radius 1 centered at the origin. .
Quadrants and Signs:
Quadrant I: All positive.
Quadrant II: Sin positive; Cos/Tan negative.
Quadrant III: Tan positive; Sin/Cos negative.
Quadrant IV: Cos positive; Sin/Tan negative.
Identities Defined Historically:
Graphs:
Sinusoid: The wave patterns of Sine and Cosine.
Amplitude: Half the difference between the largest and smallest values. Dictated by the coefficient ().
Period: The interval after which the graph repeats ( for ).
Frequency: Reciprocal of period ().
Phase Shift: The horizontal slide of the parent function. For , the shift is .
Inverse Functions: The symbols , , and refer to principal values.
and range: .
range: .
Even and Odd Functions:
(Even)
(Odd)
Double Angle Formulas:
Half Angle Formulas:
Sum-to-Product Formulas:
Chapter 3: Advanced Triangle Geometry
Law of Cosines: For any triangle with sides , . Used to find the third side given SAS, or angles given SSS.
Law of Sines: , where is the circumradius.
Area Formulas:
(where is inradius and is semiperimeter)
Heron's Formula:
Cevians: Segments from a vertex to the opposite side (altitudes, medians, angle bisectors).
Stewart's Theorem: If cevian with length cuts side into segments and , then .
Median Length: .
Angle Bisector Length: or .
Chapter 4: Cyclic Quadrilaterals
Core Properties:
Opposite angles sum to .
Angles subtended by the same arc are equal ().
Ptolemy's Theorem: In a cyclic quadrilateral with sides and diagonals , then .
Brahmagupta's Formula (Area): For a cyclic quadrilateral, .
For general quadrilaterals: .
Chapter 5: Conic Sections and Polar Coordinates
Parabola: Set of points equidistant from a focus and directrix .
Equation: .
Vertex: , Focus: , Directrix: , Latus rectum: .
Ellipse: Set of points where the sum of distances to two foci is constant ().
Equation: .
Foci relation: . Eccentricity: . Area: .
Hyperbola: Set of points where the absolute difference of distances to two foci is constant.
Equation: .
Foci relation: . Asymptotes: .
Polar Coordinates: Point .
Translations: , , , .
Special Curves: Rosa (rose), Lemniscate (infinity symbol), Cardioid (heart), Spiral of Archimedes ().
Rotating Conics: To eliminate the term in , rotate by angle where .
Discriminant: .
If : Parabola.
If < 0: Ellipse.
If > 0: Hyperbola.
Chapter 6: Polynomials
General Form: .
Synthetic Division: A shorthand for dividing by .
Remainder Theorem: The remainder of is .
Fundamental Theorem of Algebra: A degree polynomial has exactly roots.
Rational Root Theorem: For integer coefficients, rational roots are where and .
Vieta's Formulas (Coefficients and Roots):
Product
Newton's Sums: Relates sums of powers of roots () to coefficients:
Transformations:
Roots are reciprocals: Reverse the coefficient order.
Roots are times original: Multiply by .
Roots are more than original: New polynomial is .
Chapter 7: Functions
Inverse Functions (): "Undoes" the function. . Graphic representation is a reflection over .
One-to-One (1:1): Required for a functional inverse to exist.
Functional Identities:
Logarithm: .
Cauchy Functional Equation: .
Solving Techniques:
Isolation: Move variables to different sides to imply a constant value.
Substitution: Checking specific values like or .
Cyclic Functions: Using properties like where .
Chapter 8: Limits and Continuity
Definition: .
Rational Functions: Divide by the highest power of to determine behavior at infinity.
Continuity: .
Discontinuities:
Removable: A "hole" in the function that can be filled by redefining one point.
Essential: A gap where the left and right limits do not match (e.g., step function).
Asymptotes:
Horizontal: Behavior as .
Vertical: Where the denominator is zero (and numerator is not).
Slant/Oblique: Occurs when degree of numerator is 1 higher than denominator.
Important Limits:
The constant e:
Chapter 9: Complex Numbers
Argand Plane: Plotting with real part on the x-axis and imaginary part on the y-axis.
Polar Form: .
Magnitude (Modulus): .
Properties: ; Triangle Inequality .
De Moivre's Theorem: .
Roots of Unity: Roots of . They form a regular -gon on the unit circle in the complex plane. Sum of roots: .
Euler's Formula: .
Chapter 10 & 11: Vectors and Matrices
Vector Operations: Addition (tail-to-head), Dot Product (), Cross Product ( results in a vector perpendicular to both).
Matrix Multiplication: Row of the first by column of the second.
Determinant ():
: .
Area/Volume scale factor: Determinant is the factor by which area is multiplied under transformation.
Inverse Matrix: exists iff .
For : .
Chapter 14: Inequalities
Trivial Inequality: for all real .
AM-GM Inequality: . Equality holds iff all are equal.
Cauchy-Schwarz Inequality: .
Power Mean Inequality: Root Mean Square () Harmonic Mean ().
Chapter 15 & 17: Combinatorics and Counting
Pascal's Identity: .
Vandermonde's Identity: .
Binomial Theorem: .
Principle of Inclusion-Exclusion (PIE): Used to count sets with overlap. For three sets: .
Generating Functions: Infinite series where coefficients represent counts. Multiplied to find ways to sum to a target value.
Chapter 16: Sequences and Series
Sum of Squares: .
Sum of Cubes: .
Fibonacci Closed Form (Binet's Formula): .
Telescoping Series: Fractions decomposed via partial fractions (e.g., ) to cancel middle terms.
Chapter 23 & 24: Number Theory
Fermat's Little Theorem: If is prime, . More commonly if .
Euler's Totient Theorem: for .
.
Wilson's Theorem: iff is prime.
Pythagorean Triples: Primitive solutions to are , , .
Pell Equation: . Linked to continued fractions of .
Chapter 25: Graph Theory
Euler's Formula for Planar Graphs: .
Edges Inequality: For planar graphs, .
Euler Trail: A trail using all edges. Possible iff graph has 0 or 2 vertices of odd degree.
Chromatic Number (\chi): Smallest number of colors to color vertices such that no adjacent vertices share a color.
For , .
Bipartite graphs have .