Suppose n e Z. (That is, throughout this question, n is an arbitrary integer; you cannot pick a particular value for n to be.) (a) Consider the following proposition, which we'll call P: If 7n + 5 is odd, then n is even. What is the contrapositive of P? (b) Prove (using a direct proof) that the contrapositive of P is true. (You do not need to write English sentences as in the homework solutions.)

Suppose n e Z. (That is, throughout this question, n is an arbitrary integer; you cannot pick a particular value for n to be.) (a) Consider the following proposition, which we'll call P: If 7n + 5 is odd, then n is even. What is the contrapositive of P? (b) Prove (using a direct proof) that the contrapositive of P is true. (You do not need to write English sentences as in the homework solutions.)

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

A prime number is a natural number greater than 1 which is not a product of two smaller natural numbers. Prove or disprove: For every integer q, if q > 7, then q can be written as q = (a + b * c) such that the following properties hold a and b are prime numbers, c is an integer greater than 1.
Correct answer will be upvoted else downvoted. Computer science. Vasya concentrates on the properties of right triangles, and he utilizes a recipe that decides whether some triple of integers is Pythagorean. Lamentably, he has failed to remember the specific recipe; he recalls just that the recipe was some condition with squares. Along these lines, he concocted the accompanying equation: c=a2−b. Clearly, this isn't the right recipe to check if a triple of numbers is Pythagorean. Yet, amazingly, it really dealt with the triple (3,4,5): 5=32−4, thus, as indicated by Vasya's equation, it is a Pythagorean triple. When Vasya tracked down the right recipe (and comprehended that his equation is off-base), he pondered: what number of are there triples of integers (a,b,c) with 1≤a≤b≤c≤n to such an extent that they are Pythagorean both as per his equation and the genuine definition? He requested that you count these triples. Input The principal line contains one integer t…
Let P(n) be the statement that a postage of n cents can be formed using just 4-cent and 5-cent stamps." Use strong mathematical induction to prove that P(n) is true for n ≥ 12. Answer the following questions to show a complete proof (Please remember that you must prove the statement using strong mathematical induction) Show that the statements P(12), P(13), P(14), and P(15) are true, completing the basis step of the proof. What is the inductive hypothesis of the proof? What do you need to prove in the inductive step? Complete the inductive step for k ≥ 15.
Note: For all integers k,n it is true that kn, k+n, and k-n are integers. An integer k is even if and only if there exists an integer r such that k=2r. An integer k is odd if and only if there exists an integer r such that k=2r+1. For every integer k it is true that if k is even then k is not odd. For every integer k it is true that if k is odd then k is not even. For every integer k it is true that if k is not even then k is odd. For every integer k it is true that if k is not odd then k is even. If P then Q means the same thing as P → Q (P implies Q). 3. Consider the argument form pvr .. p→r Is this argument form valid? Prove that your answer is correct. 4. Prove that for every integer d, if d³ is odd then d is odd.
Determine the validity of the ff. proof: Theorem: The difference between any odd integer and any even integer is odd. "Proof: Suppose n is any odd integer, and m is any even integer. By definition of odd, n = 2k+1 where k is an integer, and by definition of even, m = 2k where k is an integer. Then n- m = (2k+1)– 2k = 1, and 1 is odd. Therefore, the difference between any odd integer and any even integer is odd." O Insufficient information to find the answer Yes, it is valid O Maybe O Not valid
Write a formal proof of the following statement. Be sure to copy this statement on your paper before beginning the proof. For all integers n, n is even if and only if 3n is even. Note: An "if-and-only-if" statement requires that you prove both implications: "if n is even then 3n is even" and "if 3n is even then n is even."
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.
Correct answer will be upvoted else downvoted. Computer science. Positive integer x is called divisor of positive integer y, in case y is distinguishable by x without remaining portion. For instance, 1 is a divisor of 7 and 3 isn't divisor of 8. We gave you an integer d and requested that you track down the littlest positive integer a, to such an extent that a has no less than 4 divisors; contrast between any two divisors of an is essentially d. Input The primary line contains a solitary integer t (1≤t≤3000) — the number of experiments. The primary line of each experiment contains a solitary integer d (1≤d≤10000). Output For each experiment print one integer a — the response for this experiment.
For each of the statements below, determine for yourself if the statement is true orfalse. If it is true, write a direct proof. If it is false, use a counterexample to show that it is false(a) For all integers m and n, if mn ≡ 0 (mod 8), then m ≡ 0 (mod 8) orn ≡ 0 (mod 8).(b) For all integers a, if a ≡ 7 (mod 10), then a^2 ≡ 9 (mod 10).
Correct answer will be upvoted else downvoted. Computer science. You are given three positive (more prominent than nothing) integers c, d and x. You need to track down the number of sets of positive integers (a,b) with the end goal that balance c⋅lcm(a,b)−d⋅gcd(a,b)=x holds. Where lcm(a,b) is the most un-normal various of an and b and gcd(a,b) is the best normal divisor of an and b. Input The primary line contains one integer t (1≤t≤104) — the number of experiments. Each experiment comprises of one line containing three integer c, d and x (1≤c,d,x≤107). Output For each experiment, print one integer — the number of sets (a,b) to such an extent that the above uniformity holds.
Correct answer will be upvoted else downvoted. Computer science. There is an exhibit a1,a2,… ,an of n positive integers. You should isolate it into a negligible number of ceaseless portions, to such an extent that in each section there are no two numbers (on various positions), whose item is an ideal square. Also, it is permitted to do all things considered k such activities before the division: pick a number in the exhibit and change its worth to any certain integer. However, in this form k=0, so it isn't significant. What is the base number of consistent fragments you should utilize in the event that you will make changes ideally? Input The primary line contains a solitary integer t (1≤t≤1000) — the number of experiments. The principal line of each experiment contains two integers n, k (1≤n≤2⋅105, k=0). The second line of each experiment contains n integers a1,a2,… ,an (1≤ai≤107). It's surefire that the amount of n over all experiments doesn't surpass 2⋅105.…
Correct answer will be upvoted else downvoted. Computer science. You are provided a program with that comprises of n directions. At first a solitary variable x is doled out to 0. A while later, the guidelines are of two kinds: increment x by 1; decline x by 1. You are given m inquiries of the accompanying organization: question l r — what number of particular qualities is x appointed to if every one of the directions between the l-th one and the r-th one comprehensive are disregarded and the rest are executed without changing the request? Input The primary line contains a solitary integer t (1≤t≤1000) — the number of testcases. Then, at that point, the depiction of t testcases follows. The main line of each testcase contains two integers n and m (1≤n,m≤2⋅105) — the number of directions in the program and the number of questions. The second line of each testcase contains a program — a line of n characters: each character is either '+' or '- ' — addition and…