IOQM EXAM SYLLABUS
BASIC MATHEMATICS ALGEBRA
Number System 1. Basic Algebraic Manipulations:
Basic Inequality Simplification of algebraic expressions
Log Concept Factorization of polynomials
Modulus Concept Solving algebraic equations
Greatest Intege 2. Inequalities:
NUMBER THEORY Arithmetic Mean-Geometric Mean (AM-GM) inequality
Prime Numbers: Cauchy-Schwarz inequality
Prime factorization Rearrangement inequality
Prime counting functions 3. Polynomials:
Sieve methods (e.g., Eratosthenes’ sieve) Fundamental theorem of algebra
Properties of prime numbers Vieta’s formulas
Divisibility: Newton’s identities
Divisibility rules Eisenstein’s criterion
Greatest Common Divisor (GCD) and Least Common Multiple (LCM) 4. Complex Numbers:
Euclidean algorithm Operations with complex numbers
Modular Arithmetic: De Moivre’s Theorem
Congruences and modular arithmetic Roots of unity
Residues and non-residues 5. Sequences and Series:
Chinese Remainder Theorem Arithmetic progressions
Diophantine Equations: Geometric progressions
Linear Diophantine equations Convergent and divergent series
Pell’s equation Infinite series summation (e.g., geometric series)
Fermat’s Last Theorem 6. Inequalities:
Number Bases: Arithmetic Mean-Geometric Mean (AM-GM) inequality
Binary, octal, hexadecimal, and other bases Cauchy-Schwarz inequality
Base conversion Jensen’s inequality
Arithmetic Functions: 7. Functional Equations:
Euler’s totient function (φ) Cauchy’s functional equation
Mobius function (μ) Jensen’s functional equation
Number of divisors function (σ) Other functional equations
Sum of divisors function (σ) 8. Binomial Theorem and Combinatorics:
Fermat’s Little Theorem and Euler’s Totient Theorem Binomial coefficients
COMINATORICS Multinomial coefficients
1. Counting Principles: Combinatorial identities
Multiplication principle 9. Polynomial Equations:
Addition principle Roots and coefficients of polynomial equations
Inclusion-Exclusion principle Factor theorem
2. Permutations and Combinations: Rational root theorem
Arrangements (permutations) 10. Inequalities:
Selections (combinations) Triangle inequalities
Combinatorial identities Holder’s inequality
3. Pigeonhole Principle: Muirhead’s inequality
Dirichlet’s principle GEOMETRY
Application in solving problems Euclidean Geometry:
4. Recurrence Relations: Points, lines, and planes
Linear recurrence relations Angle measurement and properties
Homogeneous and non-homogeneous recurrences Congruence and similarity of triangles
Solving recurrence relations Quadrilaterals (properties and theorems)
5. Principle of Inclusion and Exclusion: Circles (tangents, secants, angles, and theorems)
Solving problems with PIE Polygons (properties and interior/exterior angles)
Counting problems with constraints Geometric Transformations:
6. Graph Theory: Reflection, rotation, translation, and dilation
Basics of graph theory Isometries and similarities
Graph coloring Symmetry and tessellations
Trees and spanning trees Coordinate Geometry:
Connectivity and Eulerian graphs Distance formula
Hamiltonian cycles and paths Slope and equations of lines
7. Combinatorial Geometry: Midpoint formula
Geometric counting problems Conic sections (parabola, ellipse, hyperbola)
Theorems like the Sylvester-Gallai theorem Trigonometry:
8. Generating Functions: Sine, cosine, tangent, and their properties
Generating functions for combinatorial sequences Trigonometric identities and equations
Operations on generating functions Applications in geometry
9. Combinatorial Identities:
Vandermonde’s identity
Hockey stick identity (Combinatorial sum)
Catalan numbers and other combinatorial sequences