Math 230 Homework Assignments

True/false questions must be answered in complete sentences that provide justification (see the helpful paragraphs on pp. 12, 65, A23, A25, A29, and the suggestions in the Study Guide).  Only stating true or false is not enough.  See other Homework Hints below.
 
Problems to turn in Date Due
Section 1.1: 6-12 even, 18, 22, 26, 28, 29, 30, 32-35 Tuesday, August 29
Section 1.2: 2, 6, 10, 12, 14, 20, 23, 24, 28, 30, 32, 35 Thursday, August 31
Section 1.3: 4, 6, 10, 12, 16, 20-26 even, 28a,b, 29, 30c, 31, 32 Thursday, September 7
Section 1.4: 2, 4, 8, 14, 18, 20, 23, 28-30, 32, 38 Thursday, September 14
Section 1.5: 6, 8, 10, 14, 16, 21, 22, 24, 28, 30, 32, 38, 40 Tuesday, September 19
Section 1.6: 6, 8, 14, 16, 20, 24, 25, 27, 28, 30, 34, 38, 40 Thursday, September 21
Section 1.9: 1, 3, 5, 9, 11, 13 (not to be turned in)
Section 1.7: 2, 6-16 even, 20, 22, 24, 28, 31, 32 Thursday, October 5
Section 1.8: 4-18 even, 22-28 even, 31, 32 Tuesday, October 10
Section 2.1: 2-16 even, 25, 26 Tuesday, October 17
Section 2.2: 4, 7, 10, 14, 15, 18, 20, 27, 28, 32, 38, 40 Thursday, October 19
Section 2.3: 6, 8, 10, 14-16, 20-26 even, 30, 34 Thursday, October 26
Section 2.9: 2-18 even, 19, 20, 22, 28, 32-38 even Up to #22 due Tuesday, October 31 by 5pm
Section 3.1: 4, 10, 12, 38, 40-42 Rest of 2.9 and 3.1 due Thursday, November 2
Section 3.2: 8, 12, 16-24 even, 28, 40 Tuesday, November 7
Section 3.3: 3, 5, 19, 21, 23 (not to be turned in)
Section 5.1: 2-18 even, 22-24, 31, 32 Tuesday, November 28
Section 5.2: 6-20 even, 22, 24 Thursday, November 30
Section 5.3: 2-14 even, 22, 24, 26, 30

If time permits, we will cover a couple of sections during Closed Week, probably either 6.1 and 6.2 or some applications.  Those sections and suggested homework will be determined later, announced in class, and posted on this web page.

Homework Hints:

Work the Practice Problems at the end of each section as completely as possible, then check the Solutions at the end of the Exercises yourself.  If you still feel uncertain, work some similar odd numbered problems as completely as possible and then check the solutions at the back of the text.  To be fully prepared for the exams, you will need to be able to work similar problems without using the book or the solutions.

Work turned in should be clear and complete.  Show organized computations and/or a description of steps involved in arriving at your solution.  Solutions in the back of the text are generally not complete.

You should do computations by hand and show all steps in your work if
1. you are working problems in the first section in which a concept is introduced, or
2. you are specifically asked to do so.
For example, when we study row reduction in Section 1.2, you should do the reduction by hand and show notation for enough steps so that it is easy for me or the grader to follow your work.  You are welcome to use a calculator or computer to check that your final answer is correct, but you will be graded on the steps involved.  When using row reduction later, say in Section 1.6 to check whether sets of vectors are independent, you may do the row reduction on a calculator or computer as long as you provide a printout or a description of what you did.  However, you must still be able to perform row reduction by hand if asked to do so on an exam for instance.

To prove a universal statement is true requires a general proof, while to prove a universal statement is false requires only a single counterexample.  For instance, the statement "The sum of  two even integers is even." cannot be proven by just testing a couple of specific numbers.  We must use that the two (possibly different) even integers can be written as 2n and 2m, then check that 2n+2m=2(n+m), which is again an even integer. In contrast, the statement "All prime numbers are odd." can be shown false by finding the counterexample 2.  Often universal statements contain words like "any", "all", "for all", "every", "always", "none", but like the first example, the universal nature may just be implied.

To prove an existence statement is true requires only a single example, while proving an existence statement is false requires a general proof or theorem. For instance, the statement "Some integer is odd." can be shown true by exhibiting one specific odd integer, say 3.  In contrast, the statement "There exists an even integer that is also odd" cannot be shown false by testing a specific number like 3.  But it can be shown false by showing that 2n cannot equal 2m+1 no matter what n and m are.  Often existence statements contain words like "some", "there exist(s)", "is possible", but again the nature of the statement could be implicit rather than explicit.

Remember, solutions to True/False questions must have explanations written in complete sentences.