Consider the statement "for all integers a and b, if a + b is even, then a and b are even" (a) Write the contrapositive of the statement. (b) Write the converse of the statement. (c) Write the negation of the statement. (d) Is the original statement true or false? Prove your answer. (e) Is the contrapositive of the original statement true or false? Prove your answer. (f) Is the converse of the original statement true or false? Prove your answer. (g) Is the negation of the original statement true or false? Prove your answer.

Consider the statement "for all integers a and b, if a + b is even, then a and b are even" (a) Write the contrapositive of the statement. (b) Write the converse of the statement. (c) Write the negation of the statement. (d) Is the original statement true or false? Prove your answer. (e) Is the contrapositive of the original statement true or false? Prove your answer. (f) Is the converse of the original statement true or false? Prove your answer. (g) Is the negation of the original statement true or false? Prove your answer.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Write TRUE if the statement is true, otherwise, write FALSE. The statement (¬P ∨ Q) ∧ (¬Q ∨ P) is a contradiction.
Translate the English sentence to propositional logic. a) Every student majoring in Cumputer science need to visit the science museum b) Use the De Morgan’s law to find the negation of “Some students has visited the science museum.”
7. Let A and B be integers from one to five. For the following expression: a + b = 3, prove if the expression is reflexive, symmetric, asymmetric, and/or transitive
For each of the following statements, let the domain be all animals in the world. 1. Express each of the statements using quantifiers and propositional functions. 2. Form the negation of the statement so that no negation is to the left of the quantifier. 3. Express the negation in simple English. (Do not simply use the words “it is not the case that..."). (a) All dogs have fleas (b) There is a horse that can add. (c) Every koala can climb. (d)No monkey can speak French. (e) There exists a pig that can swim and catch fish.
Determine if the following statements are logically equivalent:p ∨ (q ∧ r),(p ∧ q) ∨ (p ∧ r)Variables: p,q,r
Construct the formal proof of validity for each of the following arguments.
Is the following argument valid? Prove your answer by replacing each proposition with a variable to obtain the form of the argument. Then prove that the form is either valid or invalid. He studied for the test or he failed the test or both.He passed the test.∴ He studied for the test.
Problem 2: Consider the set of integers. 1. Use a direct proof to show that the sum of two odd integers is even. 2. Use a direct proof to show that the product of two odd integers is odd. Prove that if n is an integer and n³ + 5 is odd, then n is even using a) A proof by contraposition. 3. b) A proof by contradiction. 4. Prove or disprove that if m and n are integers such that mn = 1, then either m = 1 and n = 1, or else m = -1 and n = -1. 5. Prove that these four statements about the integer n are equivalent: a) n² is odd. b) 1 - n is even. c) n³ is odd. d) n² + 1 is even. 6. Prove that if m and n are integers and mn is even, then m is even or n is even.
Consider the following argument: No good car is cheap. A Simbaru is not cheap. .: A Simbaru is a good car. A. Give a representation of the argument using predicate/quantified logic. B. Determine whether the argument is valid or invalid by constructing a simple logic version of the argument that is specific to Simbaru, and prove it via a truth table. C. Give a representation of the argument using set logic. D. Determine whether the argument is valid or invalid using diagrams.
What is the correct answer in the following?
Determine the validity of the ff. proof: Theorem: "the sum of any two rational numbers is a rational number" Proof: "Proof: Suppose r and s are rational numbers. By definition of rational, r = a/b for some integers a and b with b + 0, and s = a/b for some integers a and b with b + 0. Then 2a a r+s ==+ b b a - = b Let p = 2a. Then p is an integer since it is a prod- uct of integers. Hence r+s = p/b, where p and b are integers and b + 0. Thus r+ s is a rational number by definition of rational. This is what was to be shown." Maybe O Yes, it is valid Insufficient information to find the answer Not valid
Four mathematicians have a conversation, as follows: ALICE: I am insane. BOB: I am pure. CHARLES: I am applied. DOROTHY: I am sane. ALICE: Charles is pure. BOB: Dorothy is insane. CHARLES: Bob is applied. DOROTHY: Charles is sane. You are also given the following information: Pure mathematicians tell the truth about their beliefs. Applied mathematicians lie about their beliefs. Sane mathematicians' beliefs are correct. Insane mathematicians' beliefs are incorrect. With the preceding clues, classify the four mathematicians as applied or pure, and insane or sane. Briefly explain your logic.