Difference between revisions of "Cedars Proofs"
Jump to navigation
Jump to search
Line 8: | Line 8: | ||
− | *[http://www.rasmusen.org/special/Cedars_School/ | + | *[http://www.rasmusen.org/special/Cedars_School/02_08b_Prime_Proof_handout.pdf Handout] on Euclid's proof, ] and [https://primes.utm.edu/notes/proofs/infinite/euclids.html "Euclid's Proof of the Infinitude of Primes" ] and [http://www.rasmusen.org/special/Cedars_School/prime_proof.mp4 five-minute video ] of Mr. Rasmusen going through the proof. |
Latest revision as of 13:22, 14 November 2024
Click here to go back to the Cedars Math front page.
- The "All Odd Numbers Are Prime" joke and joke script. The video of part 1 (explanation of primes) and part 2 (explanation of people) and part 3 (the joke itself) and part 4 (Polya Conjecture)of the odd number joke. The Python code by Professor Connell to test the Polya Conjecture.
- Handout on Euclid's proof, ] and "Euclid's Proof of the Infinitude of Primes" and five-minute video of Mr. Rasmusen going through the proof.