Pages 15-17: 20(a,b), 24(a), 36(a)
Pages 23-24: 41(a,b,g)
Page 30: 63
Page 30: 71
Page 33: 77, 79, 84, 86, 88, 89
Page 39: 92, 95, 96, 100
Page 44: 3, 8, 13
Page 52: 23, 25, 49
Page 73--75: 1(b,e,j(see 11),o,q) ,3(see also 4), 8
Page 82: 19, 21, 23, 30
Page 82-83: 31, 32
Read about Fibonacci numbers in section 3.3 and do:
Page 91: 63, 65, 66, 75
Also do:
Page 96: 82
Page 96: 84(b)
Page 97: 88, 93
Read 89
Page 101: 101
Page 102: 107 (see 106), 109, 118
Page 101: 103
Also prove: The equation ax is congruent to 1 (mod n) has a solution
iff gcd(a,n)=1.
Or if you don't like that one try:
Consider the relation on subsets of a given set Omega,
R, defined in the following way: For A, B subsets of Omega, A is related
to B, or A R B iff A is a subset of the complement of B. Decide if this
is an equivalence relation.