Summer I 2014
Paul LaFollette, Jr.
Office: Wachman Hall 307
Telephone 215 204 6822 (1-6822 from on campus)
paul.lafollette@temple.edu
Office hours: Monday and Thursday 7:45-8:30 Tuttelman 305A Tuesday 10:45 Wachman 307
or by appointment
Required Textbook
Discrete Mathematics and Its Applications, 7th Edition, Kenneth H. Rosen, McGraw Hill
Student Solutions Guide, 7th Edition (recommended), Kenneth H. Rosen, McGraw Hill
Grading Policy
There will be one or two mid-term examinations and a final examination.
The midterm examinations and the final will allow one page of notes..
There will be homeworks assigned and bi-weekly quizzes.
Your final grade will be determined by a combination of your performance
on the mid-term(s), the final, and homework and weekly quiz scores. Each of these
components will contribute an equal amount to your grade.
Cheating and plagiarism will not be tolerated. The following web page discusses the University policy on plagairism and a number of other responsibilties of undergraduate students. It is worth visiting.
Undergraduate Responsibilities
I would like to point out that completing the homework assignments is of particular importance for several reasons. First of all, it contributes directly to your final grade. Secondly, it contributes indirectly to your final grade, because doing homework exercises is the best, perhaps the only way to master this material.
Most of the following sections of the book will be covered, not necessarily in this order:
1. The Foundations: Logic and Proof
1.1 Propositional Logic
1.2 Applications of Propositional Logic
1.3 Propositional Equivalences
1.4 Predicates and Quantiers
1.5 Nested Quantiers
1.6 Rules of inference (optional)
1.7 Introduction to Proofs
1.8 Proof Methods and Strategy (pp. 92-97, 99-102, optional)
2. Basic Structures: Sets, Functions, Sequences, and Sums
2.1 Sets
2.2 Set Operations
2.3 Functions
2.4 Sequences and Summations
2.6 Matrices
4. Number Theory and Cryptography
4.1 Divisibility and Modular Arithmetic
4.2 Integer Representations and Algorithms (except Modular Exponentiation)
4.3 Primes and Greatest Common Divisors
5. Induction and Recursion
5.1 Mathematical Induction
5.2 Strong Induction (PP 334 { 338)
5.3 Recursive Denitions (PP 344 { 348)
6. Counting
6.1 The Basics of Counting
6.2 The Pigeonhole Principle
6.3 Permutations and Combinations
6.4 Binomial Coecients and Identities (optional)
6.5 Generalized Permutations and Combinations
9. Relations
9.1 Relations and their Properties
9.3 Representing Relations
9.5 Equivalence Relations
Disability Disclosure Statement
Any student who has a need for accommodation based on the impact of a disability should contact me privately to discuss the specific situation as soon as possible. Contact Disability Resources and Services at 215-204-1280 in 100 Ritter Annex to coordinate reasonable accommodations for students with documented disabilities.
Student and Faculty Academic Rights and Responsibilities
Freedom to teach and freedom to learn are inseparable facets of academic freedom. The University has a policy on Student and Faculty and Academic Rights and Responsibilities (Policy #03.70.02) which can be accessed through the following link