Deck · IOI — Competitive Programming

Number Theory for Competitive Programming

Sieves, modular arithmetic and inverses, extended Euclid, CRT, Euler's totient and theorems, Mobius inversion, multiplicative functions, divisor functions, Miller-Rabin, Pollard's rho, Lucas' theorem, discrete logarithm, primitive roots, quadratic residues, and modular equations for the IOI.

69 cards · audited · SM-2 spaced repetition

or go All-Access →

Included with the full IOI — Competitive Programming program — 14 decks, 964 cards.

Sample cards

Linear sieve

Linear sieve inner loop condition

Sieve of Eratosthenes complexity

Segmented sieve

Segmented sieve memory advantage

Showing 5 of 69 cards. Unlock the program to study them all.

More in IOI — Competitive Programming

Advanced Computational Geometry49 cards Advanced Graph Algorithms, Flows & Matching63 cards General Algorithmic Techniques & Analysis79 cards Combinatorics & Counting66 cards Fundamental Data Structures78 cards Dynamic Programming81 cards

Master number theory for competitive programming — and the rest of IOI — Competitive Programming.

One program. 964 audited cards across 14 decks.

or go All-Access →

See the full program →