Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

A mathematician, a physicist, an engineer, and a computer scientists are all asked to test the hypothesis that all odd numbers greater than 2 are prime. (Apologies in advance to engineers.)

The mathematician: 3 is prime, 5 is prime, 7 is prime, 9 is composite. The hypothesis is false.

The physicist: 3 is prime, 5 is prime, 7 is prime, 9 is composite, hmm, 11 is prime, 13 is prime, 15 is composite, 17 is prime, 19 is prime. The hypothesis is true within the margin of error.

The engineer: 3 is prime, 5 is prime, 7 is prime, 9 is prime, 11 is prime, 13 is prime, 15 is prime, ...

The computer scientist: 3 is prime, 5 is prime, 5 is prime, 5 is prime, 5 is prime, 5 is prime, ...



I heard a version that went

Mathematician: “3 is prime, 5 is prime, 7 is prime, therefore by induction we know all odd numbers are prime.”

Physicist: “3 is prime, 5 is prime, 7 is prime, 9 must be experimental error.”

Computer scientist: “3 is prime, 5 is prime, 7 is prime, 9 is prime …”




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

Search: