Hacker News new | ask | show | jobs
by MathMonkeyMan 522 days ago
Better to use TCP, but I like your approach.
1 comments
belter 522 days ago
- Attempt to factor your integer n into primes...

- Once you have the complete prime factorization, check whether 2 is among its prime factors...

- If 2 is a factor, it’s even; if not, odd.

link
TZubiri 522 days ago
It's just 2 lines of code, therefore it's fast.

Also I only use the step over command in the debugger

link