There are two hard problems in computer science: naming things, cache invalidation, and off-by-one errors.
There are actually only two hard problems in computer science:
0) Cache invalidation
1) Naming things
4) Asynchronous callbacks
2) Off-by-one errors
3) Scope creep
6) Bounds checking
* https://news.ycombinator.com/item?id=38806257Most-nearly-prime number under 100 is.... 91.
13 x 7. You've either memorized that or you're going to have fun deciding it's not prime. And if you did times tables up to 13, congratulations, you're special.
because 10x7 = 70, i'm left with 21. everyone knows 21 is divisible by 7.