Instructor: Dr. Nancy Eaton
E-mail me: email@example.com
Office: Rm 222, Tyler Hall
Office hours: Monday 2:00-5:00, or by apt.
Visit my web page: WEB PAGE
Meets MWF: 11:00-11:50, Wales 224
Students who require accommodations
and who have documentation from
Disability Services (874-2098) should make arrangements with me as soon as possible.
Text: Mathematical Thinking, by D'Angelo and West, 2nd Edition
Course Content and Goals:
As you progress in the study of mathematics, it becomes necessary to learn the theory of mathematics which requires being able to understand the proofs of mathematical theorems and to prove results yourself. In this course, you will learn proof techniques and use these techniques to prove theorems in many areas of mathematics. We will cover the following topics: axioms of number systems, sets, fields, quantifiers, logical statements, induction, the Well-Ordering Property, proof by contradiction, injective functions, surjective functions, and permutaions. Also, we will cover selected topics from number theory, abstract algebra, discrete math, and continuous math in our overview of mathematics.
While learning the skills of proving theorems, you will also be achieving the goals of learning to communicate mathematics both in writing and verbally.
Motivation is a key concept in the way we will approach this course. It is my belief that there are many theorems, examples, and puzzles that are fun and interesting, even amazing, that are elementary enough to be proved by a student who is just learning proof techniques. In order to prove the statements, it becomes necessary to learn proper techniques. Hopefully many of these problems will interest you and motivate you. I will choose examples to illustrate and practice a wide variety of proof techniques. The book Mathematical Thinking contains many fun examples, so that you will be motivated to learn sound proof technique. We will draw problems from many mathematical disciplines so that you will also get an overview of the many different areas of mathematics. Here are some examples:
A positve integer is palindromic if reversing the digits of its base 10 representation doesn't change the number. Why is every palindromic integer with an even number of digits divisible by 11? What happens in other bases?
Repeatedly pushing the ``x^2" button on a calculator generates a sequence tending to 0 if the initial positive value is less than 1 and tending to infinity if it is greater than 1. What happens with other quadratic functions?
Suppose each dot in an n by n grid of dots is colored black or white. How large must n be to guarantee the existence of a rectangle whose corners have the same color?
Homework Assignments: (25%
of your grade)
I assign many problems from the book. You are expected to do them all. We will go over some of the solutions in class. I will select from those assigned a few to hand in from time to time. I will grade them and return them with written comments on your work.
(25% of your grade)
From those exercises collected and returned to you, I will select 10 for you to rewrite and hand in as your portfolio for the class. This is intended to be a collection of well thought out proofs from the course. This will be due Nov 27.
I encourage you to work together
under the following
circumstances. Each person tries every problem before talking it over with someone else. Each
problem that is written up and handed in should be essentially your own work. There are benefits to discussing the problems with your classmates. If you become stuck on a problem, fresh ideas from someone else might provide you with some new angles to try. In the academic community as well as in business and industry, people often work in teams. So, it is good to get some practice working in groups. Working with someone from class will help you to improve your math communication skills as well.
Also, to improve your verbal communication skills, you will be asked from time to time to present the solution of a homework problem to the class. You will be given extra points toward your homework grade for this.
(Tests 25%, Final 25%)
There will be two one-hour tests on Oct. 21st and Dec. 2nd and a final exam on Monday Dec. 16, 8:00 - 11:00 AM. The exams will be taken from material that we covered in class, so take careful notes.
We will draw material from the following chapters in the book.
1 Numbers, Sets, and Functions
2 Language and Proofs
4 Bijections and Cardinality
5 Combinatorial Reasoning
7 Modular Arithmetic
10 Two Principles of Counting
11 Graph Theory
Dates to remember:
Exam 1: Oct 21
Portfolio due: Nov 27
Exam 2: Dec 2
Final Exam: Dec 16
|Ch||Section||Exercises||In class||Hand In||Due||#|
|Sets||13,14,16,18,20,21,22,24, 36,40,41,44||14, 20, 24, 41||22||9/18||1|
|EXTRA CREDIT||dominoe puzzle||dominoe puzzle||9/30|
|4||Bijections||2,4,6,7,8,9,10,11,12, 22, 23, 25, 29, 33||7,9,11||11/4||6|
|Cardinality||21,43, 45, 47, 49||47|
|Prisoner's Dilemma||Prisoner's Dilem||11/1|
|extra credit||13, 15,||11/18|
|5||1, 5, 11||1,5,11||11/25||8|
The portfolio is due on Dec 6. Give
complete questions to each problem. Write the solution as formally
as you can. Use complete sentences. Write it as if it would
be published. In fact, I will publish selected solutions on the web!
Either type or write very neatly. If you type, it is okay to type
the sentences and leave spaces for writing equations by hand. If
you have access to an equation editor, that would be best.
Chapter 1: 29, 50 Sample solutions Fall 2002
Chapter 2: 45, 51 Sample solutions Fall 2002
Chapter 3: 10 (only the product), 16 Sample solutions Fall 2002
Chapter 4: 12(a,b,c,d), 33, 47 Sample solutions Fall 2002
Chapter 5: 11