Reminder: Test 2 is on Tuesday, 23 February 2010. It will cover Sections 2.1, 2.2, and 2.3. You should know all the various models and algorithms of the four operations that we discussed in class or are in the textbook. Homework is also due on Tuesday and consists of:
- Section 2.1 #1-6, 12, 13, 22, 24, 25, 31
- Section 2.2 #1-15 odd, 24, 27, 30, 34
- Section 2.3 #1-10, 13-21 odd, 26, 27, 32, 35, 37
In your submitted assignment, please make sure that you provide explanations.
Today we discussed how the area model for multiplication can help you determine if a number is prime, we discussed two additional algorithms for multiplication (lattice multiplication and russian peasant multiplication), we discussed the Euclidean algorithm for division, and we discussed how the Euclidean algorithm can be used to find the greatest common divisor (GCD) of two whole numbers.
Advertisement
