Reviewed by Aditya Kumar · Last reviewed 2026-03-24
**Logic:** Prime if no divisor in [2, √n]. **Code:** `for i in range(2, int(n**0.5)+1): if n%i==0: return False`. O(√n). **Optimize:** Check 2, then odds. **Large n:** Miller-Rabin probabilistic. **Why:** Validation, sampling....
Pro-Move: Miller-Rabin for large n. Red Flag: Trial division for 10^18.
Logic: Prime if no divisor in [2, √n]. Code: for i in range(2, int(n0.5)+1): if n%i==0: return False. O(√n). Optimize: Check 2, then odds. Large n: Miller-Rabin probabilistic. Why: Validation, sampling. Production:** Use for bounded ranges; library for big numbers.
Pro-Move: Miller-Rabin for large n. Red Flag: Trial division for 10^18.
According to DataEngPrep.tech, this is one of the most frequently asked Python/Coding interview questions, reported at 1 company. DataEngPrep.tech maintains an editor-reviewed database of 1,863 data engineering interview questions across 7 categories.