# Tonelli Shanks Modular Square Root: Practice Notes
Tonelli Shanks Modular Square Root shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Factor p-1 = 2^s q, find a nonresidue, and repeatedly reduce the 2-adic valuation of the current witness until it becomes a square.
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.
## Complexity
O(log^2 p) typical.
## Common mistake
Applying it to p ≡ 3 (mod 4) the long way instead of the short a^{(p+1)/4} formula, or using it when p ≡ 1 (mod 8) without the loop.
## Practice tip
Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at https://www.linkjob.ai/.