|Campus:||Ohio University, Athens Campus|
|Academic Year:||2016 - 2017|
|Section:||101 (Class Number 3763)|
|Contact Information:||My contact information is posted on my web page.|
|Office Hours:||My office hours are posted on my web page.|
Course Description: Course in discrete mathematical structures and their applications with an introduction to methods of proofs. The main topics are introductions to logic and elementary set theory, basic number theory, induction and recursion, counting techniques, graph theory and algorithms. Applications may include discrete and network optimization, discrete probability and algorithmic efficiency.
Prerequisites: MATH 113 or MATH 1200 or Placement level 2 or higher.
Note: Students cannot earn credit for both MATH 3050 and either of CS 3000. (If a student takes both courses, the first course taken is deducted.)
Class meetings: Section 101 (Class Number 3763) Meets Mon, Wed, Fri 12:55pm - 1:50m in Morton Hall Room 218.
Final Exam Date and Time: Section 101 (Class Number 3763) will have its final exam in the late afternoon on the last day of finals: from 3:10pm to 5:10 pm on Friday, April 28. If this exam date and time is not good for you, then don't register for this course. I will not give you an earlier final exam to accommodate your personal travel plans.
Syllabus: For Section 101 (Class Number 3763), this web page replaces the usual paper syllabus. If you need a paper syllabus (now or in the future), print this web page.
|Title:||Discrete Mathematics with Applications, 4th Edition|
click to enlarge
|Publisher:||Brooks/Cole (Cengage Learning), 2010|
Calculators will not be allowed on exams.
Websites with Useful Math Software: In lectures, I often use a computer for calculating. The software that I use is free and is easily accessible at the following list of links. I use the same software in my office, instead of a calculator. You are encouraged to use this same free software instead of a calculator. (Link)
Special Needs: If you have physical, psychiatric, or learning disabilities that require accommodations, please let me know as soon as possible so that your needs may be appropriately met.
Attendance Policy: Attendance is required for all lectures and exams, and will be recorded.
Missing Class: If you miss a class for any reason, it is your responsibility to copy someone’s notes or download my notes from the course web page, and study them. I will not use office hours to teach topics discussed in class to students who were absent.
Missing an Exam Because of Illness: If you are too sick to take an exam, then you must
Missing Exams Because of University Activity: If you have a University Activity that conflicts with one of our exams, you must contact me before the exam to discuss arrangements for a make-up. I will need to see documentation of your activity. If you miss an exam because of a University Activity without notifying me in advance, you will not be given a make-up.
Missing Exams Because of Personal Travel Plans: All of our In-Class Exams are on Fridays, and our Final Exam is in the late afternoon on the last day of finals (3:10pm - 5:10pm on Friday, April 28, 2016). Please don't bother asking me if you can make up an exam, or take it early, because your ride home is leaving earlier in the day, or because you already bought a plane ticket with an early departure time. The answer is, No you may not have a make-up exam, or take the exam early. You will just have to change your travel plans or forfeit that exam.
Cheating on Quizzes or Exams: If cheat on a quiz or exam, you will receive a zero on that quiz or exam and I will submit a report to the Office of Community Standards and Student Responsibility (OCSSR). If you cheat on another quiz or exam, you will receive a grade of F in the course and I will again submit a report to the OCSSR.
Grading for Section 101: During the semester, you will accumulate points as described in the table below. (Note that no scores are dropped.)
|Class Participation (36 class meetings, 3 points each *)||100 points possible|
|Homework (10 assignments, 20 points each):||200 points possible|
|In-Class Exams (best 3 of 4 exams, 150 points each):||450 points possible|
|Cumulative Final Exam:||250 points possible|
|Total:||1000 points possible|
(* Notice that it is actually possible to score 108 points through Class Participation. Any points scored over 100 will be considered as extra credit points.)
At the end of the semester, your Total will be converted to your Course Grade as described in the table below. (Note that there is no curve.)
|900 - 1000||90% - 100%||A-, A||You mastered all concepts, with no significant gaps|
|800 - 899||80% - 89.9%||B-, B, B+||You mastered all essential concepts and many advanced concepts, but have some significant gaps.|
|700 - 799||70% - 79.9%||C-, C, C+||You mastered most essential concepts and some advanced concepts, but have many significant gaps.|
|600 - 699||60% - 69.9%||D-, D, D+||You mastered some essential concepts.|
|0 - 599||0% - 59.9%||F||You did not master essential concepts.|
Blackboard Gradebook: Throughout the semester, your current scores and current course grade will be available in an online gradebook on the Blackboard system.
Class Participation: In MATH 3050 Section 101, the class meetings will be run as seminars, not lectures, so your participation is essential. I will give each of you a small assignment to prepare for discussion in each class meeting. Starting with Day 2 (Wednesday, January 11), you will have a class participation score for each class meeting, a score that indicates your contribution to the classroom discussion. The class participation score for each class meeting will be either 0, 1, 2, or 3, computed as follows:
Please note that the Class Participation assignments cannot be made-up in the case of absence, even excused absence, because they involve participation in a class discussion.
Homework: One learns math primarily by trying to solve problems. For that reason, homework plays a central role in Math 3050 Section 101. There are two kinds of homework: suggested homework problems and assigned homework sets.
The suggested homework problems, shown in the table below, are selected from the textbook. These problems are not to be turned in and are not part of your grade. But in order to learn the material covered in the course, you should do as many of the suggested problems as possible and keep your solutions in a notebook for study.
|Section||Suggested Homework Problems (do not turn in)|
|All||Complete list of all Suggested Homework Problems|
The ten assigned homework sets are to be turned in and will be graded. The problems for each homework set are provided on the cover sheet found at the link provided in the list below. For each of the assigned homework sets, you should do the following:
Assigned Homework Sets (turn in)
Calendar for 2016 - 2017 Spring Semester MATH 3050 Section 101 (Class Number 3763)
|1||Mon Jan 9||1||2.1 Logical form and Logical Equivalence|
|Wed Jan 11||2||2.2 Conditional Statements (Topic Assignments)|
|Fri Jan 13||3||2.3 Valid and Invalid Arguments (Topic Assignments)(Argument Forms)
|2||Mon Jan 16||No Class||Martin Luther King, Jr. Day Holiday|
|Wed Jan 18||4||3.1 Predicates and Quantified Statements I (Topic Assignments)|
|Fri Jan 20||5||3.2 Predicates and Quantified Statements II (Topic Assignments)
|3||Mon Jan 23||6||3.3 Statements with Multiple Quantifiers (Topic Assignments)|
|Wed Jan 25||7||3.4 Arguments with Quantified Statements (Topic Assignments)|
|Fri Jan 27||8||In-Class Exam 1 Covering Chapters 2 and 3|
|4||Mon Jan 30||9||4.1 Direct Proof and Counterexample I: Introduction (Topic Assignments)|
|Wed Feb 1||10||4.2 Direct Proof and Counterexample II: Rational Numbers (Topic Assignments)|
|Fri Feb 3||11||4.3 Direct Proof and Counterexample III: Divisibility (Topic Assignments)
|5||Mon Feb 6||12||4.4 Direct Proof and Counterexample IV: Division into Cases (Topic Assignments)|
|Wed Feb 8||13||4.6 Indirect Argument: Contradiction and Contraposition (Topic Assignments)|
|Fri Feb 10||14||4.7 Indirect Argument: Two Classical Theorems (Topic Assignments)(Handout on Fermat's Theorem)|
|6||Mon Feb 13||15||5.1 Sequences (Class Drill on Sequences)
|Wed Feb 15||16||5.1 Sequences (Topic Assignments)|
|Fri Feb 17||17||5.2 Mathematical Induction I (Topic Assignments)(Handout on Induction)|
|7||Mon Feb 20||18||5.2 Mathematical Induction I (Topic Assignments)
|Wed Feb 22||19||5.2 Mathematical Induction II (Topic Assignments)|
|Fri Feb 24||20||In-Class Exam 2|
|8||Mon Feb 27||21||6.1 Set Theory: Definitions and the Element Method of Proof|
|Wed Mar 1||22||6.2 Properties of Sets|
|Fri Mar 3||23||6.3 Disproofs, Algebraic Proofs
|9||Mon Mar 6||No Class||Spring Break|
|Wed Mar 8|
|Fri Mar 10|
|10||Mon Mar 13||24||7.1 Functions Defined on General Sets (Handout on Functions)(Class Drills on Functions)|
|Wed Mar 15||25||7.2 One-to-One Functions, Onto Functions, and Inverse Functions|
|Fri Mar 17||26||7.2 One-to-One Functions, Onto Functions, and Inverse Functions
|11||Mon Mar 20||27||7.2 One-to-One Functions, Onto Functions, and Inverse Functions|
|Wed Mar 22||28||7.3 Composition of Functions|
|Fri Mar 24||29||In-Class Exam 3|
|12||Mon Mar 27||30||8.1 Relations and Sets|
|Wed Mar 29||31||8.2 Reflexivity, Symmetry, and Transitivity|
|Fri Mar 31||32||8.3 Equivalence Relations|
|13||Mon Apr 3||33||8.3 Equivalence Relations
|Wed Apr 5||34||9.1 Introduction to Counting|
|Fri Apr 7||35||9.2 Possibility Trees and the Multiplication Rule|
|14||Mon Apr 10||36||9.2 Possibility Trees and the Multiplication Rule
|Wed Apr 12||37||9.3 Counting Elements of Disjoint Sets: The Addition Rule|
|Fri Apr 14||38||In-Class Exam 4|
|15||Mon Apr 17||39||9.5 Counting Subsets of a Set: Combinations|
|Wed Apr 19||40||9.6 r-Combinations with Repetition Allowed
|Fri Apr Apr 21||41||9.7 Pascal's Formula and the Binomial Theorem|
|16||Fri April 28||56||Final Exam 3:10pm - 5:10pm in Morton 218|
(page maintained by Mark Barsamian, last updated April 3, 2017