MHF2300–Logic and Proof in Mathematics
Contact:James Lang 407-582-2490
Textbook:Mathematical Reasoning Writing and Proof, 2nd editionby Ted Sundstrom
Suggested textbook homework:
Day 1 (1/8/07) Section 1.1
1) Do exercises #2, #3, #5, #7.
Day 2 (1/10/07) Section 1.2
1) Read preview activities 1 and 2 on pages 13 and 14.
2) Do exercise #2 parts (b) and (c) by writing out a formal proof for each part using the definition of odd and even integers.
3) Do #3 part (a) by writing out a proof similar to the proof for Theorem 1.6 found at the bottom of page 19.
4) Do all of exercise #9
5) Do problem #10 parts (a) and (b) only
6) Read the article given out in class and be prepared to discuss it next time we meet.
Day 3 (1/17/07)
1) Do preview activity 1 on pages 76 - 77
2) Read pages 79 - 83
3) Do exercise #1 part a, b, and d on page 89
4) Read "Additional Writing Guidelines 1-4" on page 87
Day 4 (1/22/07)
1) Read pgs. 129-133 (The Division Algorithm material). Pay special attention to the proof of Proposition 3.28 and bring questions about it to discuss in class on Wed.
2) Do Preview Activities 1 and 2 of section 2.1
3) Do exercise 3 from section 3.4 on page 125.
4) Print out and read the directions for the Proof Portfolio and the Number Theory Portfolio.
5) Start working on ONE problem for the portfolio.
Day 5 (1/24/07)
1) Do preview activity 1 on pg. 120
2) Do exercise #5 on pg. 125 (this exercise uses preview activity 1 on page 120)
3) Do preview activity 3 on page 38
4) Read examples 2.6 and 2.7 on pages 40 - 41
5) Do exercises #1, 2, 3, 8, 11 in section 2.2
6) Submit a problem for the proof portfolio (be sure to use an equation editor).
Day 6 (1/29/07)
1) Read pages 41-43 (Do Progress Check 2.8 AND Activity 2.10 on page 43)
2) Do Preview Activities 1 AND 2 on pages 93 - 94
3) Read Theorem 3.6 (and its proof) on page 96 - 97.
4) Do # 10 on page 105. You may find it helpful to APPLY the contra-positive of problem #3b on page 24 when working this problem.
5) Prove the following statement: If n is an integer then n(n+1)(n+2) is divisible by 3. Hint: apply The Division Algorithm on the integers n and 3 and use cases on the remainder.
Day 7 (1/31/07)
1) Read ALL of section 3.3 EXCEPT for (Progress check 3.17 and Activity 3.19)
2) In section 3.2 do HW exercises #2d, #8, and #9.
3) In section 3.3 do HW exercises #1 (very important), #5, and #7c,d. Note: for your proof of #5 in section 3.3 you will need to use the results from #2d in section 3.2. Also you will want to use the proof of Theorem 3.18 on pg. 113 as a "template" and guide when you write up the proof for #5.
4) Submit a 2nd problem for the Proof Portfolio.
Day 8 (2/6/07)
1) Do preview activity 3 on page 77 - 78
2) Read the section on "Congruence" on pages 84 - 85. Pay special attention to the definition on page 85 and commit this to memory.
3) Do progress check 3.3 at the bottom of page 85.
4) Come to class with questions about the proof of theorem 3.4 starting on page 86.
5) Do exercise #7 (both parts) in section 3.1
6) Use proof by contradiction to prove that any integer n cannot be both even and odd. We proved this result before using direct proof in conjunction with the division algorithm. Recall that the unique remainder guaranteed by the division algorithm upon division of a given integer by 2 is either 0 or 1. If the remainder is 0, the given integer is even. If the remainder is 1 the given integer is odd. We can use proof by contradiction (also known as indirect proof) to prove the same result without resorting to the division algorithm. To get you started, we begin such an indirect proof with the statement: "By way of contradiction, assume that n is an integer that is both even and odd." Next apply the definitions of both even and odd integers and work towards a contradiction.
Note: This is a partial homework list. As instructors develop additional chapter homework it will be added to this list.
Sample Syllabus:
SPRING TERM 2007
Professor: Kurt Overhiser
Office: East Campus - Building 8, Room 206
Phone: 407-582-2481
E-mail:
Student Engagement Hours:
Monday 10:00am – 11:15am (IMC)
Tuesday 10:00am – 12:45pm (EC 8-206)
Wednesday 10:00am – 11:15am (IMC)
Thursday 10:00am – 12:45pm (EC 8-206)
Friday 10:00am – 11:15am (IMC) AND 1:00pm – 2:15pm; 4:15pm – 5:45pm (EC 8-206)
Course: MHF 2300--Logic and Proof in Mathematics
Catalog Course Description:
MHF 2300 is a three-credit mathematics course. The prerequisite for this course is MAC 1104 orMAC 1105 with a grade of ‘C’ or higher. An appropriate score on an approved assessment suchas the CPT can also satisfy this requirement. Topics in this course include basic mathematicallogic, methods of proof in mathematics, application of proof to elementary mathematicalstructures. This course if for prospective majors in mathematics or mathematics education and isa Gordon Rule class. A minimum grade of C is required in MHF 2300 if it is to be used to satisfyGordon Rule and general education requirements.
Required Materials:
1. Mathematical Reasoning Writing and Proof 2nd edition by Ted Sundstrom
2. Basic calculator
Attendance:
Regular attendance and class participation are significant factors that promote student success inthis course. Attendance is required and will be taken every day at the beginning of class. If astudent is not present at that time, he or she will be marked absent. During those days when astudent is absent, he or she is responsible for all material covered that day and for any in-classannouncements given by the professor. The instructor may exercise the authority to withdrawany student with more than four absences. There will be no excused absences.
Homework:
The daily homework assignments for this course will be posted on the class website. You areexpected to read the textbook and review your notes as you do the assigned homework. Therewill be time allotted at the beginning of each class to go over selected homework problems. Withadvance notice, students may be asked to put completed homework problems up on the board fordiscussion. The key for success in this course is to do the homework. If you are having troublewith the material, be sure to promptly solicit helpfrom the professor.
Examinations:
Students will be notified at least one week in advance of any upcoming examinations. Becausemathematics is a subject that builds on itself, some of the content of the exams will be cumulativein nature. There will be two in-class exams and a final exam.
Proof Portfolio:
A major goal of this course is to develop your ability to write sound mathematical proofs. Todemonstrate your progress towards this goal you will be given ten problems requiring proof. Youmay submit each of the problems to be critiqued by the professor. After each submission youmay revise your proof and resubmit it for a final grade. Further details regarding this portfolioand the actual problems will be given soon in a separate document.
Number Theory Portfolio:
We will use number theory as the primary subject matter while you are learning proof techniques.Definitions and theorems related to number theory are scattered throughout the text. The numbertheory portfolio will be where you collect and organize this number theory content. You will begiven a list of terms to be defined and a list of key theorems. You will also include in thisportfolio specific examples demonstrating the definitions and theorems.
Course Grade and Evaluation:
Each of the two in-class exams as well as the final exam will count as 20% of the total grade.The proof portfolio will count 25% and the number theory portfolio will count 15%. Grades willbe assigned according to the rule: 90-100 is an A, 80-89 is a B, 70-79 is a C, 55-69 is a D andbelow 55 is an F.
Make-Ups:
NO make-up exams will be given. In case of a medical emergency, death in the family, or legalsituation, the final exam score may replace the missed exam once documentation is received andapproved by the professor. If a student knows in advance that he/she has a conflict with ascheduled test, it may be possible to take the test at an earlier time.
Academic Dishonesty:
All forms of academic dishonesty are prohibited at Valencia. Academic dishonesty includes, butis not limited to, plagiarism, cheating, furnishing false information, forgery, alteration or misuseof documents, misconduct during a testing situation, and misuse of identification with intent todefraud or deceive. Sanctions available to the professor should a violation occur are described inthe Valencia Student Handbook or online at
College Withdrawal Policy:
The College has initiated withdrawal procedures and timelines in response to legislation/rulesadopted by the state legislature and State Board of Community Colleges. The withdrawaldeadline for this semester is Friday March 23, 2007. If you withdraw or are withdrawn from thecourse after this deadline, you will be assigned either a WP (withdrawn passing) or a WF(withdrawn failing) based on the work you complete of to that point. Additional information isavailable in the 2006-2007 College Catalog on pages 70-72.
Valencia Student Core Competencies:
Valencia faculty members have defined four interrelating competencies (Think, Value,Communicate, Act) that prepare students to succeed in the world community. Thesecompetencies are outlined in the College Catalog. In this course you will further your mastery ofthese core competencies through classroom lecture and discussion, group work, and otherlearning activities.
CLAST Competencies:
The College-Level Academic Skills Test (CLAST) measures the following: reading skills, essayskill, English language skills, and mathematics skills. To the extent possible, you will beencouraged to develop these skills as part of your work in this course. More information on theCLAST test can be found in the 2006-2007 College Catalog on pages 86-88.
Student Code of Classroom Conduct:
Valencia is dedicated not only to the advancement of knowledge and learning, but is concernedwith the development of responsible personal and social conduct. By enrolling at Valencia, astudent assumes the responsibility for becoming familiar with and abiding by the general rules ofconduct. The primary responsibility for managing the classroom environment rests with theprofessor. Students who engage in any prohibited or unlawful acts that result in disruption of aclass may be directed by the professor to leave the class. Violation of any Valenciapolicies/procedures or classroom rules may lead to disciplinary action up to and includingexpulsion from the College. Disciplinary action could include being withdrawn from the class,disciplinary warning, probation, suspension, expulsion, or other appropriate and authorizedactions. Valencia’s Student Code of Classroom Conduct (Policy 10-18) can be found in thecurrent Student handbook, or online at Additionalinformation is available in the 2006-2007 College Catalog on pages 73-74.
Students with Disabilities:
Students with disabilities who qualify for academic accommodations may provide the instructor anotification letter from the Office for Students with Disabilities (OSD) and discuss specific needswith the instructor, preferably during the first two weeks of class. The Office for Students withDisabilities determines accommodations based on appropriate documentation of disabilities. TheEast Campus Office is located in Building 5, Room 216.
Disclaimer:
Changes in the syllabus, grading procedure, and homework assignments may be made at any timeat the discretion of the professor.