Exam 3: The Logic of Quantified Statements
Exam 1: Speaking Mathematically13 Questions
Exam 2: The Logic of Compound Statements27 Questions
Exam 3: The Logic of Quantified Statements16 Questions
Exam 4: Elementary Number Theory and Methods of Proof28 Questions
Exam 5: Sequences, Mathematical Induction, and Recursion37 Questions
Exam 6: Set Theory19 Questions
Exam 7: Functions21 Questions
Exam 8: Relations19 Questions
Exam 9: Counting and Probability25 Questions
Exam 10: Graphs and Trees14 Questions
Exam 11: Analyzing Algorithm Efficiency22 Questions
Exam 12: Regular Expressions and Finite State Automata14 Questions
Select questions type
Is the following argument valid or invalid? Justify your answer.
All real numbers have nonnegative squares.
The number i has a negative square.
Therefore, the number i is not a real number.
Free
(Essay)
4.8/5
(28)
Correct Answer:
The argument is valid by modus tollens.
Is the following argument valid or invalid? Justify your answer.
All prime numbers greater than 2 are odd.
The number a is not prime.
Therefore, the number a is not odd.
Free
(Essay)
4.8/5
(33)
Correct Answer:
The argument is invalid; it exhibits the inverse error.
Which of the following is a negation for "For all real numbers r , there exists a number s such that
Free
(Multiple Choice)
4.8/5
(32)
Correct Answer:
A
For each of the following statements, (1) write the statement informally without using variables or the symbols or , and (2) indicate whether the statement is true or false and briefly justify your answer.
(a) real numbers a real number such that .
(b) a real number such that real numbers .
(Essay)
4.9/5
(37)
Which of the following is a negation for "For any integer n, if n is composite, then n is even Or n > 2."
(Multiple Choice)
4.7/5
(41)
Consider the statement "The square of any odd integer is odd."
(a) Rewrite the statement in the form ___ ,____. (Do not use the words "if" or "then.")
(b) Rewrite the statement in the form ______ , if ____then_____ (Make sure you use the variable when you fill in each of the second two blanks.)
(c) Write a negation for the statement.
(Essay)
4.8/5
(38)
Which of the following is a negation for "There exists a real number x such that for all real Numbers y, xy > y."
(Multiple Choice)
4.8/5
(42)
For each of the following statements, (1) write the statement informally without using variables or the symbols or , and (2) indicate whether the statement is true or false and briefly justify your answer.
(a) integers an integer such that .
(b) an integer such that integers .
(Essay)
4.9/5
(41)
Write negations for each of the following statements:
(a) For all integers , if is prime then is odd.
(b) real numbers , if then .
(c) For all integers and , if divides then divides .
(d) real numbers , if then or .
(e) real numbers , if then .
(f) For all real numbers and with , there exists an integer such that .
(Essay)
4.9/5
(29)
Rewrite the following statement in the form _______x,
if ______ then (where each of the second two blanks are sentences involving the variable x )
Every valid argument with true premises has a true conclusion.
(Essay)
4.9/5
(35)
Let T be the statement
(a) Write the converse of T.
(b) Write the contrapositive of T.
(Essay)
4.8/5
(31)
Are the following two statements logically equivalent? Justify your answer.
(a) A real number is less than 1 only if its reciprocal is greater than 1.
(b) Having a reciprocal greater than 1 is a sufficient condition for a real number to be less than 1.
(Essay)
4.8/5
(39)
Which of the following is a negation for "Given any real numbers a and b , if a and b are rational then a / b is rational."
(Multiple Choice)
4.8/5
(27)
Rewrite the following statement formally. Use variables and include both quantifiers in your answer.
Every even integer greater than 2 can be written as a sum of two prime numbers.
(Essay)
4.9/5
(29)
Rewrite the following statement formally. Use variables and include both quantifiers in your answer.
Every rational number can be written as a ratio of some two integers.
(Essay)
4.9/5
(38)
Rewrite the following statement in if-then form without using the word "only": A graph with n vertices is a tree only if it has n − 1 edges.
(Essay)
4.8/5
(36)
Filters
- Essay(0)
- Multiple Choice(0)
- Short Answer(0)
- True False(0)
- Matching(0)