Scribd
Upload
24 views2 pages

Prerequisites For Problem Primer

Uploaded by

hello.weaklings
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
24 views2 pages

Prerequisites For Problem Primer

Uploaded by

hello.weaklings
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
You are on page 1/ 2

1.

Number Theory

Divisibility Rules: Understanding properties of integers, divisibility, and


prime numbers.
Greatest Common Divisor (GCD) & Least Common Multiple (LCM): Techniques for
finding GCD and LCM.
Modular Arithmetic: Mastery of congruences, remainders, and solving linear
congruences.
Prime Factorization: Fundamental theorem of arithmetic, use in problem solving.
Diophantine Equations: Integer solutions to equations (e.g., solving ax + by =
c).
Fermat's Little Theorem and Euler's Theorem: Basic application in problems.

2. Algebra

Basic Algebraic Identities: Factorization, expansion, and manipulation of


expressions.
Quadratic Equations: Solving quadratics, sum and product of roots,
discriminants.
Polynomials: Roots, factor theorem, and Vieta's formulas.
Inequalities: AM-GM inequality, Cauchy-Schwarz inequality, and their
applications.
Sequences and Series: Arithmetic and geometric progressions, telescoping
series.
Functional Equations: Simple functional equations and their properties.

3. Geometry

Triangles and Circles: Properties, similarity, congruence, and basic theorems


(Pythagoras, etc.).
Coordinate Geometry: Equation of lines, circles, distances, and midpoints.
Basic Trigonometry: Sine, cosine, tangent, and solving right triangles.
Constructions and Loci: Using compass and straightedge.
Menelaus and Ceva Theorems: More advanced theorems for triangle geometry.

4. Combinatorics

Basic Counting Principles: Permutations, combinations, and binomial


coefficients.
Pigeonhole Principle: Simple applications to counting problems.
Inclusion-Exclusion Principle: Overlapping sets and counting distinct objects.
Recurrence Relations: Solving basic recurrence relations.
Graphs and Trees: Basic concepts of graphs, vertices, edges, and simple
properties of trees.

5. Probability

Basic Probability: Classical definition of probability, conditional


probability.
Counting Methods in Probability: Application of combinatorics in probability
problems.

6. Problem-Solving Techniques

Induction: Proof by mathematical induction.


Invariants: Keeping track of constant properties.
Pigeonhole Principle: Applications in problem-solving.
Parity (Even-Odd) Problems: Identifying patterns in numbers based on parity.
7. Familiarity with Olympiad Problems

Solve past papers of IOQM, RMO, and similar competitive exams to understand
problem types and difficulty levels

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy