[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

**Subject**:**science jokes (12/21)****From**:**chrisman@ucdmath.ucdavis.edu (Mark Chrisman), chris@labtam.labtam.oz.au****From**:**chrisman@ucdmath.ucdavis.edu (Mark Chrisman), chris@labtam.labtam.oz.au**

Several students were asked the following problem: Prove that all odd integers higher than 2 are prime. 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." Chemist: 1 prime, 3 prime, 5 prime...hey, let's publish! Cosmologist: 3 is prime, yes it is true.... [1048 lines left ... full text available at <url:http://www.reference.com/cgi-bin/pn/go?choice=message&table=05_1997&mid=4343&hilit=DESIGNERS+FOOD> ] -------------------------------- Article-ID: 05_1997&4341 Score: 78 Subject: science jokes (10/21)

- Prev by Date:
**Trilateral 8/? by Erica MisztiTrilateral (8/?): Truth All Told** - Next by Date:
**science jokes (10/21)** - Prev by thread:
**Trilateral 8/? by Erica MisztiTrilateral (8/?): Truth All Told** - Next by thread:
**science jokes (10/21)** - Index(es):