Difference between revisions of "Cedars Math:Handouts"
Jump to navigation
Jump to search
(→Miscellaneous Skills) |
|||
Line 21: | Line 21: | ||
*CLT tests: [http://www.rasmusen.org/special/Cedars_School/CLT2018FallCLT8.pdf Fall 2018 questions] and [http://www.rasmusen.org/special/Cedars_School/CLTFall2018_CLT_answers.pdf Fall 2018 answers] and [http://www.rasmusen.org/special/Cedars_School/CLT2021SpringCLT8.pdf Spring 2021 questions.] | *CLT tests: [http://www.rasmusen.org/special/Cedars_School/CLT2018FallCLT8.pdf Fall 2018 questions] and [http://www.rasmusen.org/special/Cedars_School/CLTFall2018_CLT_answers.pdf Fall 2018 answers] and [http://www.rasmusen.org/special/Cedars_School/CLT2021SpringCLT8.pdf Spring 2021 questions.] | ||
+ | |||
+ | *[https://twitter.com/SteveStuWill/status/1578777239641944066 Psychology tweet: the mind filling in color gaps] (2022). | ||
===Using LaTeX to Write Equations and Symbols=== | ===Using LaTeX to Write Equations and Symbols=== |
Revision as of 09:31, 9 October 2022
Click here to go back to the Cedars Math front page.
Contents
General Skills
Python Coding
- 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.
Miscellaneous Skills
- Handout on writing emails
- CLT tests: Fall 2018 questions and Fall 2018 answers and Spring 2021 questions.
Using LaTeX to Write Equations and Symbols
Proofs
- The "All Odd Numbers Are Prime" joke and the joke script and the Python code by Professor Connell to test the Polya Conjecture.
- Proofs without Words of three infinite sums.
Chapters 1: Integers
- The "All Odd Numbers Are Prime" joke and the joke script and the Python code by Professor Connell to test the Polya Conjecture.
- [1] Defining New Kinds of Exponents]
Chapters 2 and 3: Fractions
Chapters 4, 5, and 6
Chapter 8, Geometry
- Prefaces to Euclid's Elements in the first English translation (1570).
- Shooting the Bird from the Mahabharata.
Chapter 9, Algebra