Difference between revisions of "Cedars Math:Handouts"
Jump to navigation
Jump to search
| Line 13: | Line 13: | ||
* The [http://www.rasmusen.org/special/Cedars_School/Polya_python_Connell.pdf Python code] by Professor Connell to test the Polya Conjecture. | * The [http://www.rasmusen.org/special/Cedars_School/Polya_python_Connell.pdf Python code] by Professor Connell to test the Polya Conjecture. | ||
| − | *[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, ] |
*[http://www.rasmusen.org/special/Cedars_School/02_08b_Writing_letters_and_Emails.pdf Handout] on writing emails | *[http://www.rasmusen.org/special/Cedars_School/02_08b_Writing_letters_and_Emails.pdf Handout] on writing emails | ||
Revision as of 11:08, 12 April 2022
Click here to go back to the Cedars Math front page.
- The "All Odd Numbers Are Prime" joke
- I've written up a handout of some Python code for testing divisibility by 2,3,5, and 7.
- The Python code by Professor Connell to test the Polya Conjecture.
- Handout on Euclid's proof, ]
- Handout on writing emails
