Problem: Prove that all odd positive integers besides 1 are prime numbers.

Proof by a physicist:

"3 true, 5 true, 7 true, 9... measure error, 11 true, 13 true, random test 23, done."

Proof by a mathematician:

"3 is prime, 5 is prime, 7 is prime... therefore, by induction on 2n-1, all odd numbers are prime."

Proof by an engineer:

"3 is prime... 5 is prime... 7 is prime... 9 is prime... 11 is prime..."

Proof by a chemist:

"3 is prime, 5 is prime, 7 is prime; well, I guess that's enough data!"

Proof by a Biologist:

"What's a prime?"

Proof by a programmer:

"Wait a minute, I think I have an algorithm from Knuth on finding prime numbers... just a little bit longer, I've found the last bug... no, that's not it... ya know, I think there may be a compiler bug here - oh, did you want IEEE-998.0334 rounding or not? - was that in the spec? - hold on, I've almost got it - I was up all night working on this program, ya know... now if management would just get me that new workstation tha just came out, I'd be done by now... etc., etc. ..."

Proof by a computer scientist:

"3 is prime... 5 is prime... 7 is prime... 7 is prime... 7 is prime... 7 is prime... ..."

Proof by a psychologist:

"3 is prime... 5 is prime... 7 is prime... 9 is latently prime but repressing it... 11 is prime... ..."

Proof by a social scientist:

"3 is prime... 5 is prime... 7 is prime... we'll pretend 9 is prime... 11 is prime... ..."

Proof by a sociologist:

"2 true, 4 true, 6 true, 8 true, ..."