Hacker News new | past | comments | ask | show | jobs | submit login

Because division is not trivial. Even computing x mod 3 for an n-bit integer x is O(n), if x is represented in the binary form.



Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: