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.

Use the Euclidean algorithm to determine the GCD(328, 132).  Show your work. Then express the GCD(328, 132) value you identify as a linear combination of 328 and 132. Show your work.

According to Fermat’s little theorem, what is the value of 3374(mod 11)?

The octal expansion of the decimal number 109 is ___________eight. Only type the digits; do not include the base.