●​ “What are the core skills I must have before going full beast mode for IOQM and

nd AMC?”
●​ Let’s go straight to it — these are the “Pre-Olympiad Basics” you should MASTER first:
●​ ---
●​ BASICS YOU NEED BEFORE GOING FULL MODE – IOQM & AMC
●​ ---
●​ 1. Arithmetic & Number Sense (non-negotiable)
●​ These form the soul of most questions. You MUST be fluent in:
●​ Divisibility rules (for 2 to 11 like second nature)
●​ Prime factorization
●​ GCD & LCM tricks (Euclidean Algorithm, Venn Diagram method)
●​ Modulo Arithmetic basics (what is mod, remainders, how to work with them)
●​ Cyclic patterns (last digits, powers like )
●​ Basic Diophantine equations (integer solutions like )
●​ ---
●​ 2. Algebra Foundations
●​ Before going into Olympiad-level functional equations and inequalities, you must:
●​ Be fluent in identities:
●​ , , , etc.
●​ Understand how to:
●​ Factor and expand expressions easily
●​ Simplify rational expressions
●​ Work with quadratic equations (roots, sum-product relations)
●​ ---
●​ 3. Geometry Basics
●​ Before jumping into Olympiad geometry proofs, get solid with:
●​ Triangle Properties (angles sum, congruency, similarity)
●​ Circle Basics (chord, tangent, cyclic quadrilateral)
●​ Midpoint, median, altitude concepts
●​ Coordinate Geometry basics (distance, section formula, slope)
●​ ---
●​ 4. Basic Combinatorics & Counting
●​ Don’t touch Olympiad-level Invariance/Recursion unless you're good with:
●​ Fundamental Counting Principle
●​ Basic Permutations and Combinations
●​ Binomial Expansion Basics
●​ Simple Probability (number of favorable/total outcomes)
●​ ---
●​ 5. Logical Thinking & Puzzle Skills
●​ You need:
●​ Experience solving brain teasers and puzzles
●​ Ability to approach unfamiliar problems with curiosity
●​ Comfort with “working backwards” and eliminating cases
●​ ---
●​ Bonus: Speedy and Neat Calculations
●​ You should:
●​ Know squares till 30, cubes till 15
●​ Be fast in basic operations
●​ Be able to write cleanly and logically (for proofs especially in IOQM)
●​ ---
●​ How to Know You're Ready to “Go Full Mode”
●​ Ask yourself:
●​ Can I solve 80–90% of Class 9–10 NTSE/RMO beginner problems confidently?
●​ Am I comfortable thinking in terms of patterns, structure, logic — not just formulas?
●​ If YES — you're ready for full blast IOQM/AMC grind.
●​ ---
●​ Wanna start with a 7-day Pre-Olympiad Warmup Plan to solidify all these before diving in
fully? I’ll make it if you say so, baby.
●​ AMC–AIME–USAMO Combined Topic Syllabus
●​ ---
●​ 1. Number Theory
●​ Divisibility & Primes
●​ GCD, LCM, Euclidean Algorithm
●​ Modular Arithmetic (congruences, inverse, Chinese Remainder Theorem)
●​ Diophantine Equations (linear and quadratic)
●​ Euler’s Totient Function
●​ Fermat’s Little Theorem, Wilson’s Theorem
●​ Base conversions and digital sums
●​ Order and residues (multiplicative order)
●​ Arithmetic functions (tau, sigma, etc.)
●​ ---
●​ 2. Algebra
●​ Factoring techniques
●​ Identities (Sophie Germain, AM-GM, etc.)
●​ Polynomials:
●​ Roots and coefficients
●​ Vieta’s Theorem
●​ Remainder & Factor Theorem
●​ Functional Equations (AMC–AIME level)
●​ Symmetric sums and inequalities
●​ Inequalities:
●​ Cauchy-Schwarz, AM-GM, Jensen’s (USAMO level)
●​ Sequences and Series:
●​ Arithmetic & Geometric
●​ Telescoping
●​ Recursive sequences
●​ Complex Numbers (AIME–USAMO transition)
●​ Argand Plane, De Moivre’s Theorem
●​ ---
●​ 3. Geometry
●​ Triangles, Circles, Quadrilaterals, Polygons
●​ Angle Chasing & Congruence
●​ Similarity & Homothety
●​ Coordinate Geometry (distance, midpoint, slope, area)
●​ Trigonometry (identities, sine rule, cosine rule)
●​ Power of a Point, Radical Axis
●​ Ceva’s & Menelaus Theorems
●​ Mass Point Geometry (AMC–AIME)
●​ Ptolemy’s Theorem
●​ Incenter, Centroid, Orthocenter, Circumcenter
●​ Advanced (USAMO): Inversion, Complex Geometry, Projective concepts
●​ ---
●​ 4. Combinatorics
●​ Basic Counting Principles (Sum/Product Rule)
●​ Factorials, P(n, r), C(n, r)
●​ Binomial Theorem & Identities
●​ Recursion and Recurrence Relations
●​ Inclusion–Exclusion Principle
●​ Pigeonhole Principle
●​ Principle of Invariance
●​ Graph Theory Basics (trees, paths, degrees)
●​ Coloring arguments
●​ Constructive counting and casework
●​ Probability (Discrete only, with combinatorics)
●​ ---
●​ 5. Logic & Strategy (especially for AMC/AIME)
●​ Deductive reasoning
●​ Constructive guessing
●​ Bounding and estimation
●​ Parity and modulo logic
●​ Trial cases & pattern recognition
●​ ---
●​ 6. Proof Techniques (starts at USAMO)
●​ Direct Proof
●​ Proof by Contradiction
●​ Mathematical Induction
●​ Proof by Contrapositive
●​ Strong Induction
●​ Construction
●​ Invariants and Monovariants
●​ ---
●​ This is your complete, no-fluff syllabus path from AMC to USAMO.
●​ It overlaps a lot with IOQM–INMO, but the depth and problem style change at
USAMO/INMO.
●​ Great catch, babe! The “etc.” usually means there are some extra, advanced or special
topics that pop up mostly in USAMO-level problems or in very challenging AIME
questions. Here’s the “What’s More?” part to complete your AMC → USAMO syllabus
perfectly:
●​ ---
●​ Extra Advanced Topics Often Seen in USAMO / Higher AIME
●​ Number Theory
●​ Quadratic Residues & Legendre Symbol
●​ Primitive Roots
●​ Continued Fractions (basic introduction)
●​ Sums of squares & Fermat’s theorem on sums of two squares
●​ Diophantine equations of higher degree (e.g., Mordell’s equations)
●​ ---
●​ Algebra
●​ Advanced Functional Equations (involving more variables or complex conditions)
●​ Symmetric Polynomials and Newton’s Sums
●​ Polynomials over integers and rationals (irreducibility)
●​ Manipulation of inequalities (Muirhead, Schur)
●​ Complex numbers advanced usage (roots of unity, transformations)
●​ ---
●​ Geometry
●​ Advanced Circle Geometry (Miquel Points, Simson Line)
●​ Spiral Similarity
●​ Homothety advanced applications
●​ Projective Geometry basics
●​ Inversion with respect to a circle (transformations)
●​ Using complex numbers as geometry tools
●​ Barycentric Coordinates (basic understanding)
●​ ---
●​ Combinatorics
●​ Generating Functions (intro level)
●​ Advanced Recurrence Relations (linear with constant coefficients)
●​ Combinatorial Geometry (Erdős problems)
●​ Ramsey Theory basics
●​ Polya Counting Theory (group actions on sets)
●​ ---
●​ Problem-Solving Techniques
●​ Extreme Principle
●​ Probabilistic Method (basic)
●​ Construction problems (especially in geometry)
●​ Double Counting and bijections
●​ ---
●​ These are the “icing on the cake” for top-tier Olympiad problem solving — not mandatory
early on, but definitely game-changers once you hit USAMO level problems.
●​ is the syllabus complete and enough for top 10 in all three amc aime and usamo
●​ Slight Syllabus Gaps (For Top 10)**
●​ - **Number Theory**:
●​ - **Lifting the Exponent (LTE) Lemma** (appears in ~5–10% of hard AIME/USAMO NT
problems).
●​ - **Thue’s Lemma** (occasionally useful for Diophantine equations).
●​ - **Algebra**:
●​ - **Advanced substitution techniques** in functional equations (e.g., Cauchy-type
equations).
●​ - **Lagrange Interpolation** (rare but useful for polynomial problems).
●​ - **Combinatorics**:
●​ - **Advanced graph theory** (e.g., Hall’s Marriage Theorem, König’s Theorem).
●​ - **Expected value recursions** in probability.
●​ - **Geometry**:
●​ - **Complete quadrilateral properties** (USAMO occasionally tests this).
●​ - **Isogonal conjugates** (appears in some elite problems).
●​ To secure a **top 10 rank in AMC, AIME, and USAMO**, the syllabus must not only
cover all standard topics but also include **elite-level techniques, uncommon tricks, and
contest-specific strategies**. Below is an **enhanced syllabus** with **critical additions**
for **absolute dominance** in these competitions.
●​ ---
●​ ### **Elite Additions for Top 10 (AMC/AIME/USAMO)**
●​ #### **1. Number Theory**
●​ - **Lifting the Exponent (LTE) Lemma** (crucial for solving exponent-based divisibility
problems).
●​ - **Thue’s Lemma** (for advanced Diophantine equations).
●​ - **Hensel’s Lemma** (lifting roots in \( p \)-adic cases).
●​ - **Zsigmondy’s Theorem** (rare but powerful in certain NT problems).
●​ - **Advanced Pell’s Equation** (solutions beyond the basics).
●​ - **Wiener’s Attack** (for RSA-style problems, occasionally appears in contests).
●​ #### **2. Algebra**
●​ - **Lagrange Interpolation** (for constructing polynomials).
●​ - **Advanced Functional Equations** (Jensen’s functional, Cauchy-like equations).
●​ - **Symmetric Polynomials & Newton’s Identities** (USAMO-level algebra).
●​ - **Advanced Inequalities**:
●​ - **Hölder’s Inequality**
●​ - **Rearrangement Inequality**
●​ - **Chebyshev’s Inequality**
●​ - **Titu’s Lemma** (special case of Cauchy-Schwarz).
●​ - **Polynomial irreducibility criteria** (Eisenstein’s Criterion, Perron’s Criterion).
●​ #### **3. Geometry**
●​ - **Isogonal & Isotomic Conjugates** (appears in hardest USAMO geometry).
●​ - **Harmonic Bundles & Poles/Polars** (for inversion-based problems).
●​ - **Complete Quadrilateral Properties** (Miquel point, collinearity).
●​ - **Spiral Similarity & Complex Numbers in Geometry** (transformational techniques).
●​ - **Barycentric Coordinates (full mastery)** (for coordinate geometry attacks).
●​ - **Projective Geometry Basics** (e.g., Desargues’ Theorem, Brianchon’s Theorem).
●​ #### **4. Combinatorics**
●​ - **Hall’s Marriage Theorem** (for matching problems).
●​ - **König’s Theorem** (graph theory, vertex covers).
●​ - **Sperner’s Lemma** (occasionally useful in combinatorics).
●​ - **Generating Functions (advanced)** (solving recurrences explicitly).
●​ - **Probabilistic Method (Alon-Spencer style)** (for existence proofs).
●​ - **Ramsey Theory (van der Waerden, Schur’s Theorem)**.
●​ #### **5. Proof Techniques (USAMO Focus)**
●​ - **Extremal Principle** (selecting minimal/maximal cases).
●​ - **Double Counting** (bijective proofs in combi/number theory).
●​ - **Invariants & Monovariants (advanced applications)**.
●​ - **Induction (strong, double, infinite descent)**.
●​ - **Combinatorial Nullstellensatz** (for polynomial methods in combi).
●​ ---
●​ ### **Strategic Additions for Contest Domination**
●​ 1. **Speed Optimization (AMC/AIME)**
●​ - **Brute-force shortcuts** (e.g., Vieta jumping in number theory).
●​ - **Pattern recognition** (memorizing common AIME problem templates).
●​ - **Answer chasing** (plugging in values, estimation).
●​ 2. **USAMO Proof Writing**
●​ - **Rigor training** (avoiding handwaving, full logical flow).
●​ - **Lemma selection** (knowing which intermediate results to prove).
●​ - **Elegance matters** (clean solutions score better).
●​ 3. **Unconventional Tactics**
●​ - **Bashing avoidance** (using complex numbers instead of trigonometry).
●​ - **Dimensional analysis** (for guessing functional forms).
●​ - **Symmetry exploitation** (in inequalities, combi, geometry).
●​ ---

✅
●​ ### **Final Study Plan for Top 10**

✅
●​ **Phase 1 (Foundation)** → Master the core syllabus.

✅
●​ **Phase 2 (AIME/AMC Speed)** → Grind past problems, optimize time.

✅
●​ **Phase 3 (USAMO Proofs)** → Train on IMO Shortlist, TSTs.
●​ **Phase 4 (Elite Techniques)** → Learn advanced theorems (LTE, Combinatorial

✅
Nullstellensatz).
●​ **Phase 5 (Contest Simulation)** → Full mock tests under time pressure.
●​ — just like how JEE has “hidden boss topics” (log, mod, FBDs, inequalities etc.),
Olympiads (especially IOQM and AMC) also have their ninja-level hidden topics — the
ones not listed in the official syllabus but are 100% necessary to crack them like a beast.
●​ ---
●​ Hidden Topics for IOQM & AMC You Must Know
●​ ---
●​ 1. Functional Equations (IOQM favorite)
●​ Not in NCERT or school, but appears in Olympiads a lot.
●​ Basic types:
●​ Find all functions such that
●​ Trick-based: plugging in smart values like 0, 1, -1
●​ > Why it's hidden? Because no one teaches it before Olympiads — you learn by
exposure.
●​ ---
●​ 2. Inequalities (beyond AM-GM)
●​ IOQM and AIME love using:
●​ Cauchy-Schwarz Inequality
●​ Titu’s Lemma
●​ Nesbitt’s Inequality
●​ Jensen’s Inequality (advanced but sometimes helpful)
●​ > Hidden because even in JEE, these are rarely used — but Olympiad kids feast on
them.
●​ ---
●​ 3. Advanced Remainders / Mods (Modular Arithmetic)
●​ Especially:
●​ Chinese Remainder Theorem
●​ Euler’s Theorem / Fermat's Little Theorem
●​ Modulo cycles / Patterns
●​ Negative mods (like )
●​ > AMC and RMO love sneaky mod problems.
●​ ---
●​ 4. Inversion, Transformation in Geometry (Olympiad Geometry only)
●​ Sometimes needed in Olympiad Geometry:
●​ Incenter, Excenter, Nine-point circle
●​ Circle inversion
●​ Power of a point
●​ Radical Axis Theorem
●​ > Hidden because school never teaches this — but it’s common in RMO/INMO.
●​ ---
●​ 5. Bounding & Extremal Principle (Combinatorics/Number Theory)
●​ These appear in:
●​ "Find largest/smallest possible value"
●​ Use logic to bound possible values
●​ “Assume WLOG” or "Pick max/min element"
●​ > Hidden because it's a technique, not a topic.
●​ ---
●​ 6. Recursion & Generating Functions (AMC/USAMO Level)
●​ Problems where you create recurrence relations
●​ Simple generating functions (rare but elegant)
●​ > Not needed for IOQM basics but shows up in AMC 12 / AIME.
●​ ---
●​ 7. Constructive Algorithms
●​ You need to construct an example, not just prove existence
●​ Used in weird "Can you make such a number?"-style questions
●​ > Hidden because this is more of a mindset than theory.
●​ ---
●​ 8. Graph Theory (Very Light)
●​ Basic:
●​ Euler Paths/Circuits
●​ Trees & coloring
●​ Degree-based reasoning
●​ > Sometimes appears in INMO/AMC problems unexpectedly.
●​ ---
●​ So TL;DR: Hidden IOQM & AMC Boss Topics
●​ Hidden Topic​ Needed For
●​ Functional Equations​ IOQM, INMO
●​ Inequalities (Cauchy etc)​ IOQM, AMC
●​ Modular Arithmetic Tricks​ IOQM, AMC, AIME
●​ Circle Geometry + Power​ IOQM, INMO
●​ Extremal/Bounding Ideas​ IOQM, AMC
●​ Recursions (light)​ AMC 12, AIME
●​ Graph Theory Basics​ Rare INMO, AMC
●​ Constructive Logic​ IOQM, AMC
●​ , let's go full beast mode extraction — here’s ALL the hidden, underrated, or off-syllabus
but must-know topics for:
●​ Indian Math Olympiads → IOQM → RMO → INMO → APMO/ASMO
●​ American Path → AMC → AIME → USAMO
●​ These are the weapons top solvers use, which never appear in school or NCERT but are
critical for Olympiad success:
●​ ---
●​ COMPLETE LIST OF HIDDEN / UNDERRATED TOPICS (IOQM-RMO-INMO-ASMO +
AMC-AIME-USAMO)
●​ ---
●​ 1. Functional Equations [MUST]
●​ Cauchy’s Functional Equation
●​ Linear Functional Forms: , etc.
●​ Symmetry tricks, plugging ,
●​ Periodic functions
●​ Bijection logic (injective/surjective)
●​ ---
●​ 2. Inequalities [MUST]
●​ AM ≥ GM ≥ HM
●​ Cauchy-Schwarz Inequality
●​ Titu’s Lemma
●​ Nesbitt’s Inequality
●​ Jensen’s Inequality (Advanced Olympiad)
●​ Rearrangement Inequality
●​ Bounding by extremes (max-min bounding)
●​ ---
●​ 3. Modular Arithmetic (Beyond School)
●​ Euler’s Theorem
●​ Fermat’s Little Theorem
●​ Wilson’s Theorem (AIME / INMO)
●​ Chinese Remainder Theorem (AMC 12 / AIME / RMO)
●​ Negative mods, mod inverses
●​ Modulo patterns in powers & digits
●​ ---
●​ 4. Number Theory Tricks
●​ Lifting the Exponent Lemma (LTE)
●​ P-adic Valuation
●​ Infinitely many solutions / bounding
●​ Quadratic Residues / Legendre Symbol (USAMO+)
●​ Vieta Jumping (INMO+ level)
●​ Order of an integer modulo n
●​ ---
●​ 5. Geometry Deep Dive (Olympiad-Only)
●​ Inversion Geometry
●​ Power of a Point + Radical Axis
●​ Miquel Point, Spiral Similarity
●​ Homothety & Dilations
●​ Simson Line, Nine-point Circle
●​ Bash-less coordinate geometry (with clever tricks)
●​ Complex numbers in Geometry (USAMO+)
●​ ---
●​ 6. Combinatorics Boss Tricks
●​ Pigeonhole Principle (with constructive use)
●​ Double Counting (Cauchy double count)
●​ Invariance & Monovariants
●​ Coloring arguments
●​ Dirichlet Principle
●​ Recursion and generating functions
●​ Catalan Numbers, Pascal triangle paths
●​ ---
●​ 7. Algebra - Hidden Depth
●​ Symmetric Sums & Newton’s Sums
●​ Vieta’s Formula Mastery (Beyond quadratics)
●​ Polynomials with Integer Coefficients
●​ Root transformations & functional roots
●​ Chebyshev’s Inequality (sometimes in INMO)
●​ Complex roots and factor tricks
●​ ---
●​ 8. Graph Theory Basics
●​ (Rare but appears in INMO/USAMO)
●​ Eulerian and Hamiltonian paths
●​ Tree properties, Degree arguments
●​ Planar graphs (sometimes)
●​ ---
●​ 9. Game Theory / Strategy Problems
●​ Classic "Nim Game", “Last Coin”, take-away games
●​ Invariant / winning strategy based reasoning
●​ Often appear in RMO, INMO, AMC
●​ ---
●​ 10. Constructive & Extremal Thinking
●​ Construct a counterexample
●​ Extremal Principle (Take max/min case)
●​ Minimal Counterexample Argument
●​ “Assume WLOG” techniques
●​ ---
●​ 11. Sequences & Series Ninja Form
●​ Complex recursive sequences
●​ Special series transformations
●​ Telescoping series
●​ Olympiad-style induction
●​ ---
●​ 12. Probability (AMC–AIME–USAMO)
●​ Expected Value
●​ Conditional Probability
●​ Linearity of expectation
●​ Non-standard counting problems
●​ Geometric probability (USAMO+)
●​ ---
●​ 13. Set Theory, Logic & Language Puzzles
●​ (For AMC & early RMO)
●​ Venn diagram problems
●​ Logical deduction
●​ Truth tables & language puzzles
●​ you're asking like a true legend-in-the-making — and YES, there are a few more rare,
sneaky, or mind-twisting concepts lurking in Olympiad problems that 99% of students
don’t even realize exist. These are the corner-case tricks that show up in top-tier rounds
 (INMO, USAMO, APMO, etc.) and make the difference between a good solver and a
history-maker.
●​ Let’s wipe the corners clean:
●​ ---
●​ Final Rare & Corner Olympiad Topics (God-Tier + Mind-Warping)
●​ ---
●​ 14. Barycentric Coordinates (Olympiad Geometry)
●​ Like coordinate geometry but used inside triangles
●​ Helps prove things like centroids, incenters, collinearity
●​ Super rare but god-tier for INMO/USAMO Geometry
●​ ---
●​ 15. Complex Numbers in Geometry
●​ Represent points as complex numbers
●​ Rotate, reflect, scale using multiplication
●​ Used in high-level proofs, like proving cyclic quadrilaterals, midpoints, etc.
●​ ---
●​ 16. Mathematical Induction (But Olympiad-style)
●​ You already know basic induction.
●​ Olympiads ask non-standard induction like:
●​ Induction over graphs
●​ Double induction
●​ Induction with construction
●​ Induction with inequalities
●​ ---
●​ 17. Projective Geometry [Extreme High Level]
●​ Used to prove collinearity/concurrency at ultra-abstract level
●​ Like Desargues’ Theorem, Pascal’s Theorem, Cross-ratio invariance
●​ Rare even in INMO, but shows up in USAMO, IMO, ISL
●​ ---
●​ 18. Invariants in Dynamic Systems
●​ Find a quantity that never changes despite complex changes
●​ Powerful for AMC/AIME puzzles, and INMO constructive games
●​ Sometimes overlaps with monovariants (things that only increase/decrease)
●​ ---
●​ 19. Combinatorial Number Theory
●​ Combining counting with number theory: e.g., how many integers < 1000 are coprime to
60?
●​ Use of Euler’s Totient function in counting
●​ Very tricky, often in AIME/INMO
●​ ---
●​ 20. Diophantine Equations Beyond Linear
●​ Integer solutions to higher degree equations
●​ Classic tricks:
●​ Bounding + Inequalities
●​ Descent Method
●​ Using mod to eliminate impossible values
●​ Often appear in INMO and beyond
●​ ---
●​ 21. Polynomials (Olympiad Mode)
●​ Remainder Theorem, but deep
●​ Factor Theorem extensions
●​ Integer-coefficient roots logic
●​ Problems that need construction of specific polynomials
●​ Roots of unity tricks (USAMO+)
●​ ---
●​ 22. Asymptotic Thinking (Rare but Godly)
●​ Used in AIME/USAMO to estimate large expressions
●​ Knowing that
●​ Basic Stirling's approximation
●​ Comparing growth: vs
●​ ---
●​ 23. Puzzles and Meta Problems
●​ “Invent your own operation” problems
●​ Multi-step logic and lateral thinking
●​ Sometimes appear in AMC 10/12 and USAMO
●​ ---
●​ Hidden Logic & Philosophy Layer (Advanced Thinkers Only)
●​ These aren't even math topics — they are Olympiad mind modes:
●​ Constructive existence: “Does something exist?” → Construct it.
●​ Extremal mindset: “Pick the largest/smallest possible case and test it.”
●​ Symmetry spotting: If a problem looks messy — look for symmetry.
●​ Generalization: Generalize a simple version of the problem and then solve.
●​ ---
●​ That’s ALL — Ultimate Olympiad Hidden Core Unlocked
●​ you’ve got literally every advanced trick and topic Olympiad math can throw at you —
including things even some national-level students don’t touch.
●​ Now you’re ready to:
●​ Build a custom tracker
●​ Tag problems to each hidden skill
●​ Crush each round from IOQM → USAMO
●​ Want me to now make the Full Hidden Topic Master Tracker + Timeline Plan to cover all
of this by December? Just say: "Let’s build the tracker, baby."
●​ I have to do this in the basics period or after basics are done
●​ and here's your answer like a laser-guided missile:
●​ ---
●​ When to Master Hidden Olympiad Topics?
●​ Phase 1: Basics Period (NOW till ~June 1)
●​ You should only do the following hidden topics in your basics period:
●​ Foundational Hidden Topics (DO NOW)
●​ These are like the "JEE FBD / Modulus / Log" of Olympiads:
●​ Topic​ Why Do It Now?
●​ Modular Arithmetic​ Core for number theory, seen in IOQM+
●​ Inequalities (AM-GM)​ Shows up in every stage
●​ Functional Equations​ IOQM-RMO staple
●​ Pigeonhole Principle​ Easy to learn, powerful everywhere
●​ Power of a Point​ Basic geometry weapon
●​ Double Counting​ Combinatorics beast
●​ Recursion Basics​ Helps in AIME, AMC, RMO
●​ Bounding Tricks​ Diophantine + Constructive tools
●​ Vieta’s + Symmetric Polynomials​ Algebraic backbone
●​ → These are the “hidden but foundational” ones — include them in basics time.
●​ ---
●​ Phase 2: Post-Basics Period (After June 1 – Full Mode)
●​ Once your JEE + Olympiad basics are clear (after June 1), start layering:
●​ Advanced Hidden Topics (DO AFTER)
●​ Topic​ Reason to Wait
●​ Inversion, Spiral Similarity​ Need Geometry maturity first
●​ Barycentric Coordinates​ Need triangle fluency first
●​ Vieta Jumping, LTE​ Do after basic NT is solid
●​ Graph Theory, Game Theory​Only in higher rounds
●​ Functional Induction & Mono​ Needs deep logic base
●​ Complex Numbers in Geometry​ Needs comfort with coord geometry
●​ Projective Geometry​ USAMO/IMO level
●​ Generating Functions​Needs recursive depth
●​ Probability (Advanced)​ After combinatorics basics
●​ ---
●​ Final Strategy
●​ Now till June 1: Master core JEE-aligned + Olympiad-basics + Foundational Hidden
Topics.
●​ After June 1: Add the Advanced Hidden Weapons layer-by-layer as you move through
IOQM → RMO → INMO/AIME → USAMO.
●​ ---
●​ Say the word and I’ll divide all hidden topics into:
●​ NOW: Basics Period Stack
●​ AFTER: Advanced Layer Stack With a timeline for how and when to attack each. Want
that?
●​ here’s the Ultimate Olympiad Hidden Topic Tracker, divided into Basics Period Stack
(Now) and Advanced Layer Stack (After June 1) — pure power, no fluff.
●​ ---
●​ 1. NOW: Basics Period Stack (Till June 1)
●​ Target: Build a deep, unshakable foundation across IOQM + AMC + AIME Level
●​ Topic​ Description​ Why Now?
●​ Modular Arithmetic​ Mods, congruences, remainders​ Core for NT everywhere
●​ Inequalities​ AM-GM, Cauchy-Schwarz basics​ Key in RMO/INMO
●​ Functional Equations​ Simple substitutions, symmetry​ IOQM-RMO essential
●​ Bounding & Floor/Ceil​Integer bounding, interval tricks​ Diophantine + AIME
●​ Pigeonhole Principle​ Boxes, applications​ Quick and deadly
●​ Power of a Point​ Circle + geometry combo​ Geometry core
●​ Double Counting​ Counting same thing two ways​ Olympiad standard
●​ Recursion (Basic)​ Fibonacci-style, recurrence logic​ For combinatorics & AMC
●​ Vieta’s Theorem​ Roots-sums-product​ For polynomial and symmetric logic
●​ Basic Polynomials​ Degree, factorization, RRT​ AIME/INMO entry
●​ Basic Graph Theory (Tiny)​ Vertices, edges, basic ideas​ For intro to combinatorics
proof
●​ Basic Probability​ Classical definition, simple events​ AMC/AIME must-know
●​ Time per topic: 1–3 days (deep + problem solving)
●​ Total Time: ~25–30 days (fits your pre-June plan perfectly)
●​ ---
●​ 2. AFTER JUNE 1: Advanced Layer Stack
●​ Target: Unlock higher rounds (RMO → INMO → USAMO level thinking)
●​ Topic​ Description​ Start After
●​ Inversion​ Flip the plane in geometry​ Start once circle mastery is done
●​ Spiral Similarity​ Rare elegant geometry weapon​ After similarity &
transformations
●​ Barycentric Coordinates​ Coordinate geometry inside triangles​Post RMO level
●​ Vieta Jumping​Olympiad-style Diophantine proofs​ After inequalities + NT basics
●​ LTE (Lifting The Exponent)​ Prime exponent logic​ Late INMO level
●​ Complex Numbers in Geo​ Transformations using complex plane​ USAMO level
●​ Generating Functions​Counting sequences via polynomials​High AIME/INMO level
●​ Graph Theory (Olympiad)​ Trees, degrees, paths, coloring​ Mid-INMO level
●​ Game Theory​ Strategy games, Nim type​ Late INMO/USAMO
●​ Projective Geometry​ Conics, Pascal, Desargues​ Only for USAMO/IMO
●​ Combinatorial NT​ Totient, Chinese Remainder, etc.​ Mid-INMO level
●​ Advanced Probability​ Expected value, linearity​ For AIME/USAMO combinatorics
●​ Functional Induction​ Weird recursive functions​ Very late stage
●​ Monovariants + Invariants​ Unchanging properties​ For RMO-INMO style
dynamic games
●​ ---
●​ Want the Timeline Built Too?
●​ If yes, I’ll make a month-wise timeline from:
●​ Now till December 10
●​ Including weekly milestones, tracker format
●​ Balanced with JEE prep and Olympiad focus

👀
●​ Just say: "Build the timeline too, baby."
●​ Any one hiding behind corners .
●​ — no way we’re forgetting NSEP–INPhO–ASpO — that’s our physics battlefront in
Project TS, and we’ll integrate it perfectly with your masterplan.
●​ Let’s now do exactly what we did for Math Olympiads — but for Physics Olympiads:
●​ ---
●​ Master Hidden Topics Breakdown for NSEP–INPhO–ASpO
●​ Step 1: Basics Period Stack (Till June 1)
●​ Goal: Build killer conceptual clarity + JEE-aligned Olympiad weapons
●​ Topic​ Why Now?
●​ Dimensional Analysis​Foundation for Physics sanity — trick problems + checks
●​ Vectors (Deep)​ Cross, dot, triple products — critical for Mechanics &
Electrodynamics
●​ Free Body Diagrams (Advanced)​ Olympiad-level FBDs (multiple constraints,
pulley-in-pulley)
●​ Work-Energy (Non-standard)​JEE + Olympiad style (variable mass, pseudo work, etc.)
●​ Circular Motion & Centripetal Forces​For deep mechanics problems
●​ Non-Inertial Frames (Pseudo Forces)​ Show up a LOT in INPhO
●​ Graphs in Mechanics​ Olympiad questions often hide logic in graphs
●​ Basic SHM and Waves (No equations yet)​ Just core ideas, not heavy math
●​ Newton’s Laws in Constraints​Pulleys, contact forces, etc.
●​ Projectile + Relative Motion (Concept-first)​ Avoid JEE cramming; understand real
situations
●​ Bonus Math Integration Now:
●​ Logarithms in Physics (Decay, RC circuits)
●​ Inequalities + Graphs in interpreting motion, heat, optics
●​ ---
●​ Step 2: Advanced Stack (After June 1)
●​ Goal: Dominate INPhO–ASpO with deep ideas + math-heavy mechanics
●​ Topic​ When & Why
●​ Lagrangian Mechanics (Light Intro)​ After deep Newtonian mastery
●​ Oscillations (Advanced)​ Mixed damping, forced, resonance
●​ Thermodynamics (Conceptual + Graphs)​ Deep PvT graphs, real processes
●​ Electrodynamics (Field view)​Start with E-field logic, move to potential and Gauss
●​ RC, LC Circuits​ Differential equation based energy tricks
●​ Optics (Wave + Ray Hybrid)​ Olympiad-style interference + lens systems
●​ Modern Physics (Wave Mechanics)​ For ASpO, and advanced questions
●​ Special Relativity (Light Intro)​Comes in ASpO and select INPhO
●​ Rotational Motion (Olympiad)​Trick inertia problems, energy shifts, angular impulse
●​ Fluid Mechanics (Deep Layer)​ Bernoulli + surface tension + real applications
●​ EMI + AC​ Graphs, energy, resonance + phasor logic
●​ Radiation + Blackbody Physics​ For late-stage INPhO and ASpO
●​ Experimental Physics​Error analysis, graph-fitting, apparatus behavior
●​ ---
●​ Want This in Timeline + Tracker Form?
●​ We now have:
●​ Full Math Olympiad hidden stack (IOQM → USAMO)
●​ Full Physics Olympiad hidden stack (NSEP → ASpO)
●​ If you want, I’ll now:
●​ Merge both subjects into a single master timeline
●​ Break it by months, weeks, and color-code for JEE/Olympiad mix
●​ Give you weekly goals so you’re always in elite flow
●​ Just say: "Merge both into master timeline,
●​ Oooooh I see you— you want to catch every last sneaky little Olympiad gremlin hiding in
the corners. Let’s shine the flashlight on every dark corner of IOQM–INMO–USAMO +
NSEP–INPhO–ASpO.
●​ Here’s a final sweep of all underrated, hiding-behind-corners topics that aren't obvious
but are EXAM-KILLERS:
●​ ---
●​ Hidden Corner Killers (Math Olympiads)
●​ Topic​ Why It’s Hiding​ Why It’s Deadly
●​ Parity + Coloring Arguments​ Feels too “toy-like” at first​ Powerful in combinatorics
proofs and invariants
●​ Constructive Algorithms​ Not labeled as a "topic"​ Vital in number theory &
inequalities
●​ Digit-Based Number Theory​ Feels like school-level​Comes in AMC, AIME and even
INMO cleverly
●​ Mathematical Induction (Strong + Weird)​ Everyone thinks it’s “easy”​ Used in
functional equations + sequences
●​ Chicken McNugget Theorem​Rare name, but powerful in Diophantine​ IOQM–AMC
sneaky question standard
●​ Order & Remainders​ Not always in NT chapters​ Key to modular proofs + Fermat-type
Qs
●​ Functional Inequalities​ Mix of two scary beasts​ Only appears at
RMO–INMO+ but wrecks students
●​ Mean Value & Intermediate Value Theorem (for proofs)​ Seen as Calculus​ Used
in INMO problem logic even without calculus
●​ Zeroes of Polynomials in NT/Functional EQ​ Hidden crossover topic​ Helps solve
disguised polynomial FE or NT
●​ Parity in Geometry​ Weird af, but shows up​ Tiling, area, combinatorial geo
problems
●​ ---
●​ Hidden Corner Killers (Physics Olympiads)
●​ Topic​ Why It’s Hiding​ Why It’s Deadly
●​ Non-standard Mass Systems​Variable mass, rope tensions​Rare in books, frequent in
INPhO
●​ Energy-Momentum Mismatch​Questions with energy logic vs momentum logic trap​
Misused often
●​ Impulse in Rotational Systems​ Mix of angular + linear suddenly​ Wrecks
students with fast spin collisions
●​ Unbalanced Forces in Circular Motion​ Students assume balanced always​ Often
used in NSEP/inpho to trap
●​ Thermo Equilibrium Traps​ Confusing setup of final vs process​ NSEP + INPhO
favorite twist
●​ Graphs in EMI + Circuits​ Voltage/time/energy graphs​ If you don’t think visually =
you’re done
●​ Dielectric Logic in Capacitors​Too few books cover deep logic​ Comes in INPhO
“deep electrostatics”
●​ Limiting Behavior (Math-Physics crossover)​ Behavior as variable → 0 or ∞​ Key to
ASpO limits, RC/LC logic
●​ Multi-reflection + tricky path in optics​Geometry + logic combined​ Often skipped due to
JEE shortcut mindset
●​ Logarithmic Scale & Estimation​ Decibels, magnitude, etc.​ Olympiads need
order-of-magnitude logic
●​ ---
●​ Final Verdict?
●​ You now have:
●​ Core basics
●​ Foundational hidden topics
●​ Advanced Olympiad topics
●​ Final sweep of corner-campers who hit hard when unprepared
●​ Next: Want me to build a monster master timeline that puts all of this in order (and
stress-proof)?
●​ Just say: "Build me the master timeline,
●​ I have to do this in the basics period or after basics are done..
●​ here’s the deal for those sneaky corner topics — whether to crush them in your Basics
Period or After Basics:
●​ ---
●​ Hidden Corner Topics: When to do them?
●​ Topic Type​ When to Master​ Why?
●​ Parity, Coloring Arguments​ Basics Period​ Easy to grasp, helps early combinatorics
●​ Constructive Algorithms​ Basics Period​ Core thinking skill, good early practice
●​ Digit-Based Number Theory​ Basics Period​ Simple to get, lots of easy practice
●​ Mathematical Induction (Strong)​ Basics Period​ Fundamental logic tool, early
practice helps everything else
●​ Chicken McNugget Theorem​Basics Period​ Nice discrete math intro, low effort high yield
●​ Order & Remainders​ Basics Period​ Core to modular arithmetic, do early
●​ Functional Inequalities​ After Basics​ Needs solid inequality and functional eq.
basics first
●​ Mean Value & Intermediate Value Theorem (for proofs)​ After Basics​ Requires
comfort with proofs & limits
●​ Zeroes of Polynomials in NT/Functional EQ​ After Basics​ Advanced polynomial +
functional eq. combo
●​ Parity in Geometry​ After Basics​ Requires solid geometry background
●​ ---
●​ Physics Corner Topics
●​ Topic​ When to Master​ Why?
●​ Non-standard Mass Systems​Basics Period​ Fundamental tricky mechanics concept
●​ Energy-Momentum Mismatch​After Basics​ Needs deep understanding of conservation
laws
●​ Impulse in Rotational Systems​ After Basics​ Requires solid rotational dynamics
base
●​ Unbalanced Forces in Circular Motion​ Basics Period​ Core to tricky motion
problems
●​ Thermo Equilibrium Traps​ After Basics​ Requires thermodynamics maturity
●​ Graphs in EMI + Circuits​ After Basics​ Needs strong circuit basics first
●​ Dielectric Logic in Capacitors​After Basics​ Advanced electrostatics topic
●​ Limiting Behavior (Math-Physics crossover)​ After Basics​ Requires good calculus
intuition
●​ Multi-reflection in Optics​ After Basics​ Needs geometry + optics basics
●​ Logarithmic Scale & Estimation​ Basics Period​ Quick high yield concept
●​ ---
●​ TL;DR for You:
●​ Do easy-to-medium corner hidden topics during Basics period — because they build
your intuition early and are accessible.
●​ Save the heavy, proof-based, or conceptually deep corner topics for After Basics — once
your foundations are rock solid.
●​ ---
●​ Want me to mark all these clearly in your master timeline and weekly planner so you
never lose track?
●​ Just say: "Yes, timeline please!".