CS 1050 B Constructing Proofs

Fall 2006

Course Description

Theme: Basic primitives and paradigms for the mathematical understanding of computation.

Tentative list of topics:

• Propositions, Proofs, Propositional Logic.
• Induction and Recursion.
• Basic Counting and Probability.
• Number Theory: Euclid's Algorithm, Primality, RSA.
• Diagonalization and Uncomputability.

Lectures

MWF 1:05-2, CoC Room 102.

Instructor

Alexander Gray, Assistant Professor
Office hours: TBA, TSRB Room 240, or by appointment.

Teaching Assistant

Howard, howardz *AT* cc.gatech.edu
Office Hours: M 10-12, F 2-3, held in the College of Computing Commons Area on the first floor.

Text and Notes

(1) Discrete Mathematics and Its Applications, 6th Edition, by Kenneth H. Rosen.
(2) Notes from a similar class at Berkeley.

Grading

Weekly or biweekly homeworks (we shall drop the lowest 2 grades): 33.33%.
You may discuss the homeworks with other people in the class. But: You MUST write your answers by yourselves, without any collaboration and without using any resource, as if you are taking a test.
You should also indicate on the top of your homework who, if anyone, you discussed the homework with.
Academic conduct is subject to the Georgia Tech Honor Code.

Complete solutions will be always posted on the Web shortly after the deadline.

Homeworks are due at the beginning of class on the noted date.
Late homework policy: no credit for late homeworks.

Two quizes: 33.33%.
Final exam: 33.33%.

Study Group Contacts

Nayan Jain (nayan.jain *AT* gatech.edu)
Seth Finberg (sfinberg3 *AT* gatech.edu)
Daniel Neuberger (Daniel.neuberger *AT* gatech.edu)
Andrew Ho (gtg939x *AT* mail.gatech.edu)
Matthew Robertson (mhr *AT* gatech.edu)

Schedule