• The statement ∃x ∈ U (p(x)) is false if there is no x ∈ U for which p(x) is true.• The statement ∀x ∈ U (p(x)) is true if p(x) is true for each value of x in U .• The statement ∀x ∈ U (p(x)) is false if p(x) is false for at least one value of x in U .7. Negation of quantified statements. To negate a quantified statement, you switch the quan- tifier and push the negation inside.• The statements ¬∀x ∈U(p(x)) and ∃x ∈ U (¬p(x)) are equivalent.• The statements ¬∃x ∈U(p(x)) and ∀x ∈ U (¬p(x)) are equivalent.8. Big-Oh We say that f (x) = O(g(x)) if there are positive numbers c and n0 such thatf (x) ≤ cg(x) for every x > n0.9. Big-Theta. f (x) = Θ(g(x)) means that f = O(g(x)) and g = O(f (x)).10. Some notation for sets of numbers. We use R to stand for the real numbers, R+ to stand for the positive real numbers, Z to stand for the integers (positive, negative, and zero), Z+ to stand for the positive integers, and N to stand for the nonnegative integers.Problems1. For what positive integers x is the statement (x − 2)2 + 1 ≤ 2 true? For what integers is it true? For what real numbers is it true? If we expand the universe for which we are considering a statement about a variable, does this always increase the size of the statement’s truth set?2. Is the statement “There is an integer greater than 2 such that (x − 2)2 + 1 ≤ 2” true or false? How do you know?3. Write the statement that the square of every real number is greater than or equal to zero as a quantified statement about the universe of real numbers. You may use R to stand for the universe of real numbers.
4. The definition of a prime number is that it is an integer greater than 1 whose only positive integer factors are itself and 1. Find two ways to write this definition so that all quantifiers are explicit. (It may be convenient to introduce a variable to stand for the number and perhaps a variable or some variables for its factors.)
5. Write down the definition of a greatest common divisor of m and n in such a way that all quantifiers are explicit and expressed explicitly as “for all” or “there exists.” Write down Euclid’s extended greatest common divisor theorem that relates the greatest common divisor of m and n algebraically to m and n. Again make sure all quantifiers are explicit and expressed explicitly as “for all” or “there exists.”
6. What is the form of the definition of a greatest common divisor, using s(x, y, z) to be the statement x = yz and t(x, y) to be the statement x < y? (You need not include references to the universes for the variables.)
7. Which of the following statements (in which Z+ stands for the positive integers and Z
stands for all integers) is true and which is false, and why?
đang được dịch, vui lòng đợi..
