Scribd
Upload
918 views

IOQM Syllabus

The document outlines the syllabus for the IOQM (Indian Olympiad Qualifier in Mathematics) exam. It details the main topics covered in the exam including number theory, algebra, combinatorics, and geometry. Some of the key concepts listed are prime numbers, modular arithmetic, sequences and series, counting principles, and coordinate geometry.

Uploaded by

Abid Junaid
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
918 views

IOQM Syllabus

The document outlines the syllabus for the IOQM (Indian Olympiad Qualifier in Mathematics) exam. It details the main topics covered in the exam including number theory, algebra, combinatorics, and geometry. Some of the key concepts listed are prime numbers, modular arithmetic, sequences and series, counting principles, and coordinate geometry.

Uploaded by

Abid Junaid
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

IOQM Syllabus

Syllabus for IOQM is everything except Calculus but there are certain concept which
every students should know while preparing Mathematics Olympiad.

Please refer following chapter and concept inside it

Basic Maths

• Number System
• Basic Inequality
• Log Concept
• Modulus Concept
• Greatest Integer

Number Theory

• Prime Numbers:
o Prime factorization
o Prime counting functions
o Sieve methods (e.g., Eratosthenes’ sieve)
o Properties of prime numbers
• Divisibility:
o Divisibility rules
o Greatest Common Divisor (GCD) and Least Common Multiple (LCM)
o Euclidean algorithm
• Modular Arithmetic:
o Congruences and modular arithmetic
o Residues and non-residues
o Chinese Remainder Theorem
• Diophantine Equations:
o Linear Diophantine equations
o Pell’s equation
o Fermat’s Last Theorem
• Number Bases:
o Binary, octal, hexadecimal, and other bases
o Base conversion
• Arithmetic Functions:
o Euler’s totient function (φ)
o Mobius function (μ)
o Number of divisors function (σ)
o Sum of divisors function (σ)
• Fermat’s Little Theorem and Euler’s Totient Theorem

Algebra
• Basic Algebraic Manipulations:
o Simplification of algebraic expressions
o Factorization of polynomials
o Solving algebraic equations
• Inequalities:
o Arithmetic Mean-Geometric Mean (AM-GM) inequality
o Cauchy-Schwarz inequality
o Rearrangement inequality
• Polynomials:
o Fundamental theorem of algebra
o Vieta’s formulas
o Newton’s identities
o Eisenstein’s criterion
• Complex Numbers:
o Operations with complex numbers
o De Moivre’s Theorem
o Roots of unity
• Sequences and Series:
o Arithmetic progressions
o Geometric progressions
o Convergent and divergent series
o Infinite series summation (e.g., geometric series)
• Inequalities:
o Arithmetic Mean-Geometric Mean (AM-GM) inequality
o Cauchy-Schwarz inequality
o Jensen’s inequality
• Functional Equations:
o Cauchy’s functional equation
o Jensen’s functional equation
o Other functional equations
• Binomial Theorem and Combinatorics:
o Binomial coefficients
o Multinomial coefficients
o Combinatorial identities
• Polynomial Equations:
o Roots and coefficients of polynomial equations
o Factor theorem
o Rational root theorem
• Inequalities:
o Triangle inequalities
o Holder’s inequality
o Muirhead’s inequality

Combinatorics

• Counting Principles:
o Multiplication principle
o Addition principle
o Inclusion-Exclusion principle
• Permutations and Combinations:
o Arrangements (permutations)
o Selections (combinations)
o Combinatorial identities
• Pigeonhole Principle:
o Dirichlet’s principle
o Application in solving problems.
• Recurrence Relations:
o Linear recurrence relations
o Homogeneous and non-homogeneous recurrences
o Solving recurrence relations
• Principle of Inclusion and Exclusion:
o Solving problems with PIE
o Counting problems with constraints
• Graph Theory:
o Basics of graph theory
o Graph coloring
o Trees and spanning trees
o Connectivity and Eulerian graphs
o Hamiltonian cycles and paths
• Combinatorial Geometry:
o Geometric counting problems
o Theorems like the Sylvester-Gallai theorem
• Generating Functions:
o Generating functions for combinatorial sequences
o Operations on generating functions
• Combinatorial Identities:
o Vandermonde’s identity
o Hockey stick identity (Combinatorial sum)
o Catalan numbers and other combinatorial sequences

Geometry

• Euclidean Geometry:
o Points, lines, and planes
o Angle measurement and properties
o Congruence and similarity of triangles
o Quadrilaterals (properties and theorems)
o Circles (tangents, secants, angles, and theorems)
o Polygons (properties and interior/exterior angles)
• Geometric Transformations:
o Reflection, rotation, translation, and dilation
o Isometries and similarities
o Symmetry and tessellations
• Coordinate Geometry:
o Distance formula
o Slope and equations of lines
o Midpoint formula
o Conic sections (parabola, ellipse, hyperbola)
• Trigonometry:
o Sine, cosine, tangent, and their properties
o Trigonometric identities and equations
o Applications in geometry

You might also like