discrete mathematics ensley combinatorics

There are also copies on reserve at the Powell library. There is an electronic edition available from the CCLE page for this course under 'Site info' (you need to make an account with VitalSource to get access). The homework will include problems from the textbook, so make sure you have access to an up to date copy. You don't need to purchase a textbook, but you will probably find it useful for studying. The textbook appears to be pretty expensive if you buy it new, I encourage you to look for alternatives. We are using 'Discrete Mathematics- Eight Edition' by Richard Johnsonbaugh. The goal is for students to be comfortable with the aforementioned topics through the lens of mathematical precision. Throughout the class there will be a focus on abstraction and rigor, and students will construct proofs. This course will be discussing discrete mathematics, including topics such as induction, equivalence relations, counting and combinatorics, recurrence relations, graphs, and trees as well as algorithms dealing with these topics. Office hours: Wednesdays 11:30 am-12:30 pm in MS 2961 Course content and goals Office hours: Tuesday 3-4 pm, Thursdays 9-10 am in MS 3955 Office hours for the remainder of the quarter: Friday 3/13 10:30-11:25 am, Monday 3/16 4-5 pm James Cameron (please call me 'James' or 'Dr. If you do use email, make sure you put the class (M 61) in the subject line.

Please consider using Piazza instead of email: you will get a quicker response and other students can benefit from your questions. If you are already signed up, here is a link to the course on Piazza. If you add it some different way, the class is 'MATH 61-2'. Here is a link to sign up for the class in Piazza. We will be using Piazza for communicating with the instructors and with each other. Look for information about your discussion section in the list of this winters's math classes. The class meets Monday, Wednesday, and Friday from 2-2:50 am in Bunche Hall 2209 A with discussion sections 2-2:50 am on either Tuesday or Thursday.

Discrete mathematics ensley combinatorics