M325K Fall 2014


Unique # : 55550
Lecture  : TTH 11-12:30 in BIO 301
Textbook  : Grimaldi, "Discrete and Combinatorial Mathematics", 5th ed.
Syllabus  : I.1-4, II.1-4, III.1-3, IV.1-2, V.1-6, VII.1-4, VIII.1.
            A little counting, a little logic and probability, stuff about
            functions, relations, and graphs; altogether good clean fun. 
Instructor: Klaus Bichteler, kbi@math.utexas.edu
Office    : RLM 12.130
Hours     : TTH 2:00--3:25 and by appointment
This page: http://www.ma.utexas.edu/users/kbi/COURSES/TERM/14F/325K/325.html

Grading Scheme
During most every lecture we'll have one or more short multiple-choice quizzes, which will count 15% towards the course grade. They cover topics from the current and previous lectures. For the quizzes you will need to own and register an iClicker and to enroll in this course. If something goes awry with this process, bring your iClicker to the ITS office in FAC to have the ID read; write it down. It will be used to register your iClicker in Quest. (See the bottom of http://web4.cns.utexas.edu/quest/support/clicker/#register.)

At most every lecture I shall assign homework, which is to be turned in on the following week's Thursday. I will not accept late homework, but I will drop the two lowest or missed homeworks. The homework counts 15% towards the course grade. There will be three (3) midterm tests, each worth 15% and covering the material presented prior to the test. The tests thus contribute 45% to the grade. The comprehensive final test counts 25%. Tests: The worst (or missed) midterm test is replaced with the final test grade if that improves the total. I can't allow you to miss two of the midterm tests, though, and there will be NO (0) make-up test. Cheating is costly.
The midterm tests are scheduled on the following days during class time: October 2, October 30, and December 4. The final test is scheduled for Saturday, December 13, at 9:00 AM in NOA 1.102. Put these dates on your calendar now!
There are usually 5-6 problems per midterm test. The most efficient way to learn the material is to read ahead and to collaborate: the homework counts a lot, and I encourage you to do it in groups and to turn in group homeworks.

Curve: I do not like to grade on the curve; I like the scheme 90-100: A, 80-89.9: B, 70-79.9: C, 60-69.9: D, below 60: F. However, I'll deviate a little from that by assigning A-, B-, C- etc. to totals that don't quite make the cutoff for A, B, C, respectively.
I am not permitted to change this grading scheme, for example by assigning extra work if a few points are missing for a higher grade. Also, I do not cook the books, not even for the most charming, needy, or pushy student. So aim for a few points above what you actually need for your desired grade.

Regrades
I grade very leniently. If I make a mistake in grading please let me know and I'll fix it. However, the way I apportion partial credit is my prerogative and I will not entertain arguments about it; they merely generate ill will and are a waste of time. Also, just in case disputes over your record should arise: keep all tests, homeworks, quizzes, etc.
Find this page via http://www.ma.utexas.edu/users/kbi/COURSES/TERM/14F/325K/325K.html.
Check your email regularly for communications from me.

The University of Austin provides upon request appropriate academic accommodations for qualified students with disabilities. For more information, contact the Office of the Dean of Students at 471- 6259, 471-6441 TTY or go here.

Here is a Practice Final in dvi format, in postscript format, in pdf format.

Here is a plan of the course. A course is a living and unpredictable thing.
Therefore this plan is highly preliminary and will change as the course develops!


Thursday August 28: [QL] First Principles and Examples of Counting.
    Lecture 1. HW1a, Due 09/04: Sections 1.1&1.2 # 6, 8, 10, 12, 14a, 16.
Tuesday September 02: [QL] Binomial Theorem, Multinomial Theorem.
    Lecture 2. HW2a, Due 09/11: Section 1.3 # 2, 4, 8, 14, 26, 30.
Thursday September 4: [QL] Selection with Repetition, Some Diophantine Equations.
    Lecture 3. HW2b, Due 09/11 Section 1.4 # 2, 4, 12, 16.
Tuesday September 09: [QL] Elementary Logic, Statements, Truth Tables.
    Lecture 4. HW3a, Due 09/18: Section 2.1 # 2, 4, 6, 8, 10; Section 2.2 # 4, 6, 10, 14.
Thursday September 11: [QL] The Laws of Logic, Logical Equivalence and Implication.
    Lecture 5. HW3b, Due 09/18: Section 2.3 # 2, 4.
Tuesday September 16: [QL] Rules of Inference, Quantifiers.
    Lecture 6. HW4a, Due 09/25: Section 2.4 # 2, 4.
Thursday September 18: [QL] Set Theory.
    Lecture 7. Read this for fun. HW4b, Due 09/25: Section 3.1 # 8, 14; Section 3.2 # 8, 18.
Tuesday September 23: [QL] The Laws of Set Theory, Venn Diagrams, Examples of Proofs.
    Lecture 8. HW5a, Due 10/02: Section 3.3 # 8, 10.
Thursday September 25: [QL] Introduction to Probability.
    Lecture 9. HW6b, Due 10/09: Section 3.4 # 2, 4, 8; Section 3.5 # 4.
Tuesday September 30:
[QL] Buffer - Review.
    Thursday October 2: [QL] Test 1.

Tuesday October 7: [QL] Conditional Probability, Bayes' Theorem.
    Lecture 10. Read this. HW7a, Due 10/16: Section 3.6 # 4, 6.
Thursday October 09: [QL] The Integers; Mathematical Induction.
    Lecture 11.     Here is an illustration. HW7b, Due 10/16: Section 4.1 # 2, 4, 6a, 8.
Tuesday October 14: [QL] Recursive Definitions; Division Algorithm.
    Lecture 12. HW8a, Due 10/23: Section 4.2 # 2, 4, 6, 8, 12. 3
Thursday October 16: [QL] Division Algorithm, Ideals.
    Lecture 13. HW8b, Due 10/23: Section 4.3 # 2, 4, 8, 12.
Tuesday October 21: [QL] Ideals, Greatest Common Divisor.
    Lecture 14. HW9a, Due 10/30: Compute a generator of ((840,1001)); Section 4.4 # 2, 4, 6, 8, 10, 12.
Thursday October 23: [QL] The Fundamental Theorem of Arithmetic.
    Lecture 15. HW9b, Due 10/30: Section 4.5 # 2, 4, 6; Section 4.6 # 2, 4, 14.
Tuesday October 28: [QL] Buffer - Review.
    Thursday October 30: Test 2.

Tuesday November 04: [QL] Relations and Functions.
    Lecture 16. HW10a, Due 11/13: Section 5.1 # 2, 4, 12.
Thursday November 6: [QL] Surjective Functions.
    Lecture 17. HW10b, Due 11/13: Section 5.2 # 2, 4, 12, 15, 16, 17; Section 5.3 # 2, 4, 8.
Tuesday November 11: [QL] Special Functions, Binary operations. The Pidgeon Hole Principle.
    Lecture 18. HW11a, Due 11/20: Section 5.4 # 2, 4, 6, 8, 12; Section 5.5 # 2, 4, 12, 14.
Thursday November 13: [QL] Composition of Functions, Inverses.
    Lecture 19. HW11b, Due 11/20: Section 5.6 # 4, 6, 8, 10, 12, 14, 16, 18 a-c.
Tuesday November 18: [QL] Relations Revisited.
    Lecture 20. HW12a, Due 11/25: Section 7.1 # 2, 4, 6.
Thursday November 20: [QL] Graphs and Incidence Matrices.
    Lecture 21. HW12b, Due 11/25: Section 7.2 # 2, 4, 6, 10, 18, 22.
Tuesday November 25: [QL] Partial Orders on Finite Sets; Topological Sorting. Equivalence Relations.
    Lecture 22.
HW13, Due 12/04: Section 7.3 # 2, 4, 6, 10, 18, 22.
Thursday November 27: Thanksgiving
    Tuesday December 2: [QL] Buffer - Equivalence Relations, Review.
    Lecture 23.
Thursday December 4: Test 3


Saturday, December 13: Final Test at 9:00 AM in NOA 1.102.




[an error occurred while processing this directive]