Thursday, 18 February 2010

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.

Thursday, 11 February 2010

On Thursday, we discussed multiplication and division of whole numbers (Section 2.3). Specifically we discussed two models for multiplication (repeated addition and the area model) and one model for division (repeated subtraction). We noticed the the concept of division is challenging and not always very easy to understand. Keep in mind that elementary students will have similar difficulties with division. On Tuesday, we will finish the discussion of Sections 2.2 and 2.3 by considering other models for these operations.

Thursday, 4 February 2010

Test 1 and Quiz 1 will be returned at the end of class on Tuesday.

Quiz 2 will be on Tuesday, 4 February 2010 and will cover Section 2.1:  Sets and Whole Numbers.

You should be able to complete all the homework from Section 2.1:

Section 2.1: #1-6, 12, 13, 22, 24, 25, 31

Today we covered addition and subtraction and showed how to represent place values with cubes, rods, and flats (Section 2.2). The website that I was using during class is located at http://www.arcytech.org/java/b10blocks/. We will cover more ideas from Section 2.2 on Tuesday and start Section 2.3 on Tuesday.

Tuesday, 2 February 2010

Today the class took Test 1.

For the next class period, please bring in the workbook and/or bag o’ manipulatives. If you do not have these, then do not worry because I will bring enough for everyone. We will start Section 2.2 – Addition and Subtraction of Whole Numbers.

Thursday, 28 January 2010

Reminder: Test 1 is on Tuesday, 2 February 2010 and will cover Chapter 1. You should know all definitions from any section this chapter. Also, you should be able to answer any question regarding the concepts we discussed from Section 1.2.

As you are preparing for the test, please email me if you have any questions.

HW 1 is due at the beginning of class on Tuesday, 2 February 2010 and consists of:

Section 1.2 #1-25 odd, 40, 49, 62, 64, 69, 71.

On Thursday’s class we completed the discussion on the concepts of sets (Section 2.1). This section will not be on Test 1. You are able to start working on the homework assignment for this section.

On Thursday, 4 February 2010, bring in the packet of manipulatives and workbook, if you have them – if you do not have them, don’t worry, I will have enough for everyone.

Thursday, 22 January 2010

The schedule of topics has been posted at http://stats.jjw3.com/math1431/Sp10math1431HAssigns.htm and has been uploaded to iCollege.

The first Quiz is on Thursday, 28 January 2010 and will cover anything from Sections 1.1, 1.2, and 1.3.

Here is a brief description of the topics we have covered in class:

Tuesday, 12 January 2010

We discussed the how the concepts will be presented in class throughout the semester. Also we talked about mathematical problems and problem-solving (Section 1.3).

Thursday, 14 January 2010

We discussed Project 1 (http://mathed.jjw3.com/math2008/math2008proj1.htm). We discussed how to classify a mathematical sequence (arithmetic, geometric, fibonacci, or none of these) and how to find the next term in a sequence (Section 1.2). Lastly, we discussed types of mathematical statements (conditional, converse, inverse and contrapositive), how to write the latter three types of statements from a given conditional statement, and how to determine if the statements are true or false (Section 1.2).

Tuesday, 21 January 2010

We discussed several more examples of mathematical statements (Section 1.2) and how to use one counterexample to show a statement is false. Lastly, we considered the difference between mathematical deduction and mathematical induction. I showed how to use mathematical induction to prove the “sum of the first n odd integers is n²“; however, you are not responsible for mathematical induction. Even so, since we proved the sum of the first n odd integers is n² in class, you should be able to find this sum.

The first homework assignment is due on 1 February 2010. For homework, you should be able to complete the following so far:

Section 1.1 #3-10, 22, 25, 26, 31, 33 – these questions will not collected since Project 1 covers the concepts from this section;

Section 1.2 #1-25 odd, 40, 49, 62, 64, 69, 71

Section 1.3 #3-17 odd, 21, 23, 29, 33 – these questions will not collected since Project 1 covers the concepts from this section.

We will start discussing Section 2.1 on Tuesday.

Welcome!

Welcome to Foundations of Numbers and Operations! I will post updates and general information about the course in this blog. I hope everyone has a successful semester in all your courses.