Can you show that perfect compression is impossible?
A waiter at a restaurant gets a group's order completely wrong. Can you turn the table to get two or more orders right?
Is it true that every integer you can think of has a multiple written out only with \(0\)s and \(1\)s?
The 2 hardest problems in programming are naming, cache invalidation, and off-by-one errors.