# Pohlig Hellman Smooth Order: Study Guide
Pohlig Hellman Smooth Order shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Factor the group order, compute the discrete log modulo each prime-power factor by solving a sequence of small logs, and combine with CRT.
## 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(sum e_i (log n + sqrt p_i)) when n = product p_i^{e_i}.
## Common mistake
Solving the log only modulo p_i and skipping the higher powers p_i^{e_i}, which leaves the CRT system underdetermined.
## 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 official website.