IOQM
IOQM
Basic Math
1. Number System
2. Basic Inequality
3. Logarithm
4. Modulus
5. Greatest Integer; Fractional Part Function
Number Theory
1. Prime Numbers
a. Prime Factorization
b. Prime Counting Functions
c. Sieve Methods
d. Properties of Prime Numbers
2. Divisibility
a. Divisibility Rules & Tricks
b. HCF and LCM
c. Euclidean Algorithm
d. Special Cases: Squares etc.
3. Modular Arithmetic
a. Congruences and Modular Arithmetic
b. Residues and Non-Residues
c. Chinese Remainder Theorem
4. Diophantine Equations
a. Linear Diophantine Equations
b. Second Degree Diophantine Equations
c. Pell’s Equation
d. Fermat’s Last Theorem
5. Number Bases
a. Binary, Octal, Hexadecimal and Bases
b. Base Conversion
6. Arithmetic Functions
a. Euler’s Totient Function
b. Mobius Function
c. Number of Divisors Function
d. Sum of Divisors Function
7. Fermat’s Little Theorem, Euler’s Totient Theorem
Algebra
1. Basic Manipulations
a. Simplification
b. Factorization
i. Weierstrass Factorization Theorem
c. Solving
2. Inequalities
a. AM-GM Inequality
b. Cauchy-Schwarz Inequality
c. Rearrangement Inequality
d. Jensen’s Inequality
e. Triangle Inequalities
f. Holder’s Inequality
g. Muihead’s Inequality
3. Polynomials
a. Fundamental Theorem of Algebra
b. Vieta’s Formulas
c. Newton’s Identities
d. Eisenstein’s Criterion
4. Complex Numbers
a. Operations with Complex Numbers
b. De Moivre’s Theorem
c. Roots of Unity
5. Sequences and Series
a. AP, GP, AGP
b. Logarithmic and Exponential Series
c. Convergent and Divergent Series
d. Infinite Series
e. Fibonacci Sequence
6. Functional Equations
a. Cauchy’s, Jensen’s Functional Equation
b. Functional equation - Wikipedia
7. Polynomial Equations
a. Roots and Coefficients of Polynomial Equations
b. Factor Theorem
c. Rational Root Theorem
Combinatorics
1. Binomial Theorem
a. Binomial Coefficients
b. Multinomial Coefficients
2. Counting Principles
a. Multiplication Principle
b. Addition Principle
c. Inclusion-Exclusion Principle
3. Permutations and Combinations:
a. Arrangements
b. Selections
c. Combinatorial Identities
4. Pigeonhole Principle
a. Driichlet’s Principle
b. Applications
5. Recurrence Relations
a. Linear Recurrence Relations
b. Homogenous and Non-Homogenous
c. Solving Recurrence Relations
d. https://www.geeksforgeeks.org/recurrence-relations-a-complete-guide/
6. Graph Theory
a. Basics of Graph Theory
b. Graph Coloring
c. Trees and Spanning Trees
d. Connectivity and Eulerian Graphs
e. Hamiltonian Cycles and Paths
7. Combinatorial Geometry
a. Geometric Counting Problems
b. Theorems like Sylvester-Gallai Theorem
8. Generating Functions
a. Generating Functions for Combinatorial Sequences
b. Operations on Generating Functions
9. Combinatorial Identities
a. Vandermonde’s Identity
b. Hockey Stick Identity (Combinatorial Sum)
c. Catalan Numbers
d. Other Combinatorial Sequences
Geometry
1. Euclidean Geometry:
a. Points, lines, and planes
b. Angle measurement and properties
c. Congruence and similarity of triangles
d. Quadrilaterals (properties and theorems)
e. Circles (tangents, secants, angles, and theorems)
f. Polygons (properties and interior/exterior angles)
2. Geometric Transformations:
a. Reflection, rotation, translation, and dilation
b. Isometries and similarities
c. Symmetry and tessellations
3. Coordinate Geometry:
a. Distance formula
b. Slope and equations of lines
c. Midpoint formula
d. Conic sections (parabola, ellipse, hyperbola)
4. Trigonometry:
a. Sine, cosine, tangent, and their properties
b. Trigonometric identities and equations
c. Applications in geometry