Additional Information for MATH 135 Midterm (Fall 2014)

(You do not need to submit this page with your exam)

1. Instructors and Sections. The following table will help you to identify your section.

Section Lecture Time Lecture Location Instructor

001 10:30-11:20 STJ 3014 M. Akash
002 11:30-12:20 B1 271 A. M. Thompson
003 09:30-10:20 PHY 145 A. Bertiger
004 02:30-03:20 PHY 145 JP. Pretti
005 10:30-11:20 MC 2066 G. Coutinho
006 09:30-10:20 DC 1351 JP. Pretti
007 01:30-02:20 PHY 145 D. Leung
008 12:30-01:20 B1 271 D. Leung
009 08:30-09:20 MC 4061 M. Akash

2. Natural Numbers. Recall that for Math 135, we are using the notation

N = {1, 2, 3, 4, . . .}

to denote the set of positive integers. This may be different from your CS course, where the set of natural numbers is
often said to include zero as well.

3. Proposition List. You may use any result on this sheet without proof, unless otherwise indicated or unless you are
being asked to prove the result itself. Make sure to clearly state the name (e.g. Transitivity of Divisibility) or the
acronym (e.g. TD) associated with the result that you are using.

Proposition (Transitivity of Divisibility, TD). Let a, b, c ∈ Z. If a | b and b | c, then a | c.

Proposition (Divisibility of Integer Combinations, DIC). Let a, b, c ∈ Z. If a | b and a | c, then for all x, y ∈ Z,
a | (bx + cy).

Proposition (Bounds by Divisibility, BBD). Let a, b ∈ Z. If a | b and b 6= 0, then |a| ≤ |b|.