Prove the following statement using induction. “For all integers n ≥ 4, 2n < n !"  Use good proof technique.  Grading rubric:1 pt. State the basis step, then prove it.1 pt. State the inductive hypothesis.2 pt. Complete the proof of the inductive step.1 pt. State the final conclusion at the end of the proof.1 pt. Label each part: the basis step, inductive hypothesis, inductive step, and conclusion. Note: Remember that n factorial, written as n!, is defined as n(n-1)...(2)1, the product of n times every positive integer less than n.  To avoid the need for typing superscript exponents, you may use the expression ‘2^n’ to represent 2n.  Also the ≥ symbol can be written as >=.

Prove the following statement by proving the contrapositive.  “If n2 + 3  is odd then n is even, for all n ∈ ℤ.” Use good proof technique.  Grading rubric:1 pt. State the contrapositive at the beginning, then prove it.1 pt. State any givens and assumptions.1 pt. Clearly explain your reasoning.1 pt. State the final conclusion at the end of the proof. Note:  To avoid the need for typing superscript exponents, you may use the expression ‘n-squared’ or ‘n^2’ to represent n2.

Which of these is a diagram for K 1, 4 ?

Consider the following proposition. “If no questions are dumb, then this question is smart.” Which of the following is the inverse of this statement? Only one statement is correct.  Note:  smart = not dumb

Define S, a set of integers, recursively as follows: Initial Condition: 0 ∈ SRecursion: If m ∈ S then 2m + 1 ∈ S. Which of the following sets is equivalent to set S?

With the universe of discourse for x as the set of all people alive in the world and the universe of discourse for y as the set of all countries in the world, we define the following predicates: F(x) is “x is a current FSU student,” G(x) is “x is a graduate of FSU,” and R(x, y) is “x is a resident of y.” Which of the following logical expressions accurately expresses this statement: Some residents of the United States are graduates of FSU and some residents of the United States are not graduates of FSU.

For any predicates, P(x) and Q(x), ∃x [ P(x) ⋀ Q(x) ] ⟺ [ ( ∃x P(x) ) ⋀ ( ∃x Q(x) ) ].

What topic in units 10-11 of the course material did you find the most challenging?

Define S, a set of bit strings, recursively as follows. Initial Condition:  1 ∈ S Recursion: If m ∈ S then m11 ∈ S. Which of the following best describes set S?

[1] The assignments and tests are good measures of how much I’m learning.