Cedars Math:Chapter 1

Click here to go back to the Cedars Math front page.

Chapter 1: Whole Numbers

1.1 Counting

• "THE BIGGEST NUMBERS IN THE UNIVERSE," BRYAN CLAIR (2001). Not used in class.

1.4 Multiplication

• "How to Solve It: Ways to Compute 5x15"

1.6 Long Division

• Handout: City Council districts in Bloomington.

• "Ali Baba and the Forty Thieves," in the Lang retelling (best) and the Richard Burton translation of the original (not as good).

• Proofs that the sum of its digits being divisible by three shows that a number is divisible by three at Math Stack Exchange. (not done in class)

1.8 Order of operations, exponents

• exponents homework handout

Graphics

• T and T Repairables, a used car dealership out west in the country.

• Homework 8 (graphics, Python)

1.9 Word problems

• Homework 9 (word problems).

From previous years:

• Here is a good blog post on prayer flags and prayer wheels, with gorgeous photographs if the Himalayan Mountains. Someone came up with the idea of the "prayer wagon": drawings here and here. Relatedly, the parable of Lazarus and the Rich Man (Luke) came up in class.
• WORDS: Amiable, endless loop.

• "When I was a boy of fourteen, my father was so ignorant I could hardly stand to have the old man around. But when I got to be twenty-one, I was astonished at how much he had learned in seven years." Mark Twain, "Old Times on the Mississippi," Atlantic Monthly, 1874.

• Homework 7 (exponents, neatness)
• Python Code

  print("Buddhist  code.")
  x = 4
  item=1
  while x<6:
  print("Glory to God in the highest!",item)
  item = item +1
  print ("The End.") 

• Steps in solving word problems: 1. Figure out what the question is and what kind of number is supposed to be the answer. 2. Figure out which numbers in the question are relevant--- some numbers might well be irrelevant to getting to the answer. 3. Figure out what techniques you are going to need, e.g., addition, division, Python coding, looking up something on the Internet.

• 1/2-hour Zoom lecture on Python plotting.