SECTION

CONCEPTS

METHODS

PRACTICE PROBLEMS

Ch. 1

Functions and Sequences

• definition of function: input and output
• domain and target
• sequences

• piecewise functions
• calculating recursive functions
• arithmetic sequences
• geometric sequences

Pages 7-8

#5, 6

Pages 23-25

#2, 5a, 8, 9, 11, 12

Ch. 2

The Integers

• modular arithmetic
• divisors, multiples
• prime numbers

• writing rational numbers as decimals
• converting decimals to fractions
• converting to other bases
• iquo, mod
• Euclidean Algorithm
• prime factorization
• finding gcd, lcm

Pages 27-29

#1, 2, 3, 4, 8

Pages 45-50

#2, 5, 6, 7, 8, 9, 10, 14, 15, 25, 33, 34

Section 3.1

Boolean Expressions

• propositions
• operations: and, or, not
• functions using Boolean values

• writing Boolean expressions
• truth tables (BY HAND!)
• deciding if expressions are equal
• De Morgan’s Laws
• negating expressions

Pages 51-53

#2, 3, 4, 5, 6

Pages 62-65

#3, 4, 5, 6, 7, 8, 10, 13, 15, 16, 17, 19

Section 3.2

Implication and Proof

• hypothesis and conclusion
• contrapositive means the same as original
• converse means something different
• “if and only if” statements

• writing an implication in symbolic form
• negating an implication
• stating a converse
• stating a contrapositive

Pages 66-67

#2, 3, 4, 6, 7, 8

Pages 78-80

#1, 2, 3, 4, 5, 7, 8, 9, 10, 13, 15, 17