Exam 9: Discrete Mathematics
Exam 1: Functions and Graphs362 Questions
Exam 2: Polynomial, Power, and Rational Functions494 Questions
Exam 3: Exponential, Logistic, and Logarithmic Functions350 Questions
Exam 4: Trigonometric Functions522 Questions
Exam 5: Analytic Trigonometry313 Questions
Exam 6: Applications of Trigonometry333 Questions
Exam 7: Systems and Matrices354 Questions
Exam 8: Analytic Geometry in Two and Three Dimensions167 Questions
Exam 9: Discrete Mathematics154 Questions
Exam 10: Statistics and Probability147 Questions
Exam 11: An Introduction to Calculus: Limits, Derivatives, and Integrals167 Questions
Exam 12: Prerequisites382 Questions
Select questions type
Write the sum using summation notation, assuming the suggested pattern continues.
-
(Multiple Choice)
4.8/5
(45)
State an explicit rule for the nth term of the recursively-defined sequence.
-
(Multiple Choice)
4.9/5
(36)
Tell whether permutations or combinations are being described.
-4 musicians are selected to form a band.
(Multiple Choice)
4.8/5
(40)
Use mathematical induction to prove the statement is true for all positive integers n.
-
(Essay)
4.8/5
(36)
Find an explicit rule for the nth term of the sequence.
-The second and fifth terms of a geometric sequence are 9 and 243 , respectively.
(Multiple Choice)
4.9/5
(29)
Solve.
-A collection of dimes is arranged in a triangular array with 17 coins in the base row, 16 in the next, 15 in the next, and so forth with 1 dime in the last row. Find the value of the collection.
(Multiple Choice)
4.7/5
(35)
Find the sum of the arithmetic sequence.
-2, -4, 8, -16, 32
(Multiple Choice)
4.8/5
(36)
Determine whether the sequence converges or diverges. If it converges, give the limit.
-
(Multiple Choice)
4.8/5
(33)
Use mathematical induction to prove the statement is true for all positive integers n.
-
(Short Answer)
4.8/5
(39)
Construct a graph for the first ten terms of the sequence.
-

(Multiple Choice)
4.7/5
(29)
Solve.
-A musician plans to perform 5 selections for a concert. If he can choose from 7 different selections, how many ways can he arrange his program?
(Multiple Choice)
4.7/5
(42)
Use mathematical induction to prove the statement is true for all positive integers n.
-
(Essay)
4.8/5
(37)
Showing 61 - 80 of 154
Filters
- Essay(0)
- Multiple Choice(0)
- Short Answer(0)
- True False(0)
- Matching(0)