AppliedAIPrep logoAppliedAI/Prep
← Coding & DSA / 112
mediumGoogleAmazonMicrosoft

Number theory toolkit: sieve of Eratosthenes, fast modular exponentiation, and gcd.

Sieving primes, fast modular power, and Euclid's gcd are the number-theory primitives that quietly power crypto, hashing, and combinatorics problems. The signal is the O(n log log n) sieve and O(log e) binary exponentiation. Here is the answer.

Updated Aug 2026 · Grounded in real Applied AI Engineer interview loops and written to a senior-engineer editorial bar.

Sieving primes, fast modular power, and Euclid's gcd are the number-theory primitives that quietly power crypto, hashing, and combinatorics problems. The signal is the O(n log log n) sieve and O(log e) binary exponentiation. Here is the answer.

Unlock the other 750 answers · ₹2,000 / $25Your progress and mastery stay saved · 6 months · one payment · no auto-renew
UP NEXT ON YOUR JOURNEY
Next in this trackMatrix exponentiation: compute the nth term of a linear recurrence in O(log n).Next in this trackDesign a time-based key-value store: set with a timestamp, get the value as of a time.Next in this trackBuild a decision tree classifier from scratch: pick splits by Gini or entropy, then predict.
DISCUSSION · 0

No comments yet — be the first to share your approach.