1. Solve the congruence: 2x = 5 (mod11)
a. 5
b. 6
c. 7
d. 8
2. Find f(4) if f is defined recursively by: f(0) = f(1) = 1 and for n > 1.
a. 5
b. 25
c. 33
d. 1214
3. Find the sequence for the recursive formula: ,
a. 14, -4, 14, -4
b. 6, 14, 86, 734
c. -3, 12, -3, 12
d. -3, 9, -3, 9
4. Six women and eight men are on the faculty in the mathematics department at a school. How many ways are there to select a committee of four members of the department if at least one woman must be on the committee?
a. 4242
b. 126
c. 931
d. 1131
5. True of False? is a solution to the recurrence relation with initial conditions and
a. True
b. False
6. A connected planar graph has 28 edges. If a planar representation of this graph divides the plane into 16 regions, how many vertices does the graph have?
a. 14
b. 12
c. 10
d. None of the above
7. True or False? The following relation is an equivalence relation: {(0,1),(1,1),(2,1),(3,3)}.
a. True
b. False