Prove that all odd integers higher than 2 are prime.

 

(Amateur)Mathematician: 3 is prime, 5 is prime, 7 is prime, and by induction, we have that all the odd integers are prime."

 

Statistician: 100% of the sample 5, 13, 37, 41 and 53 is prime, so all odd numbers must be prime.

 

Mechanical Statistician: 3 is prime, 5 is prime, 7 is prime, 9 is an outlier, 11 is prime, 13 is prime, .... all odd numbers are prime.

 

Measure nontheorist: there are exactly as many odd numbers as primes (Euclid, Cantor), and exactly one even prime (namely 2), so there must be exactly one odd nonprime (namely 1).

 

Physicist: 3 is prime, 5 is prime, 7 is prime, 9 is ... uh, 9 is an experimental error, 11 is prime, 13 is prime... Well, it seems that you're right."

 

Wouldn't a modern physicist employ something like renormalization?: 3 is prime, 5 is prime, 7 is prime, 9 is ...9/3 is prime 11 is prime, 13 is prime, 15 is ... 15/3 is prime

17 is prime, 19 is prime, 21 is ... 21/3 is prime.

 

Quantum Physicist: All numbers are equally prime and non-prime until observed.

 

Chemist: "3 is prime, 5 is prime, 7 is prime.. that's enough." 1 prime, 3 prime, 5 prime...hey, let's publish!

 

Cosmologist: 3 is prime, yes it is true....

 

First Engineer: 3 is prime, 5 is prime, 7 is prime, 9 is ..., 9 is ..., well if you approximate, 9 is prime, 11 is prime, 13 is prime...Well, it does seem right."

 

Engineer: 3 is prime, 5 is prime, 7 is prime, 9 is not working, fetch toolbox.

 

Professor: 3 is prime, 5 is prime, 7 is prime, and the rest are left as an exercise for the student.

 





Back

Home
Hosted by www.Geocities.ws

1