Question

Proofs For this assignment, know that: An integer is any countable number. Examples are: -3, 0,...

Proofs

For this assignment, know that:

An integer is any countable number. Examples are: -3, 0, 5, 1337, etc.

A rational number is any number that can be written in the form a/b, a and b are integers in lowest terms, and b cannot equal 0. Examples are 27, 22/7, -3921/2, etc.

A real number is any number that is not imaginary or infinity. Examples are 0, 4/3, square root of 2, pi, etc.

1. Prove that the product of two odd integers is an odd integer.

2. Prove that the quotient of a rational number and a non-zero rational number is a rational number.

3. Prove by contrapositive that for every integer n, if 9n + 11 is even, then n is odd.

4. Prove by contrapositive that for every non-zero real number n, if is irrational, then 1/n is also irrational.

5. Prove by contradiction that the average of three real numbers is greater than or equal to at least one of the numbers.

6. Prove by cases that for all real numbers | x + y | <= |x| + |y|

7. Prove or disprove: The sum of any five consecutive integers is divisible by 5.

8. Prove or disprove: There exists no integers a and b such that 8a - 12b = 1

Homework Answers

Answer #1

1. Prove that the product of two odd integers is an odd integer.
Solution:---
Let a and b be two odd numbers....
If a and b are odd, then a and b can be written as:
a=2m+1 ,
b=2n+1
Where m and n are whole numbers.
So....
ab= (2m+1)(2n+1)
= 4mn+2m+2n+1
= 2(2mn+m+n)+1

Which is odd.
Bcz it leaves the remainder 1 after being divided by 2.

2. Prove that the quotient of a rational number and a non-zero rational number is a rational number.
Solution:----
the quotient of two rational numbers is always rational, and the reason for this lies in the fact that the product of two integers is always an integer. To divide two rational numbers,
a/b ÷ c/d, we use the following rule:
a/b ÷ c/d = a/b × d/c
= ad / bc
By this rule, the quotient of any two rational numbers can always be written as a fraction with a product of integers in the numerator and a product of integers in the denominator. Since the product of two integers is always an integer, we have that the quotient of two rational numbers can be written as a fraction with an integer in the numerator and an integer in the denominator. This is the exact definition of a rational number, so we have that the quotient of two rational numbers is always rational.

3. Prove by contrapositive that for every integer n, if 9n + 11 is even, then n is odd.
Solution:-----
Proof by contraposition:-----------
The contrapositive is “If n is even, then 9n + 11
is odd.”
Assume that n is even. We can now
write n = 2k for some integer k. Then

9n + 11 = (9 x 2k) + 11 = 18k + 11 =2 (9k+ 5) + 1.
Which is odd.
Bcz it leaves the remainder 1 after being divided by 2.

4. Prove by contrapositive that for every non-zero real number n, if is irrational, then 1/n is also irrational.
Solution:---
The contrapositive is “If 1/x is rational, then x is rational.”
Suppose that 1/x is rational and x != 0. Then there exists integers p and q such that 1/x = p/q and
q != 0.
1/x != 0 because 1 != x · 0, this would mean that p != 0.
Since p != 0, then x = 1/ (1/x) = 1/(p/q) = q/p.
Hence x can be written as a quotient of two integers with a nonzero denominator. Thus, x is
rational.


5. Prove by contradiction that the average of three real numbers is greater than or equal to at least one of the numbers. Proof. Proof by contradiction. We assume that there are three real numbers x1, x2, and x3 such that the average of the three numbers is less than each of the three numbers.
That is (x1+ x2+ x3) /3 < x1, (x1+ x2+ x3)/3 < x2, and (x1+ x2+ x3)/3 < x3.
Adding the three inequalities gives:
x1+x2+x33+x1+x2+x33+x1+x2+x33 < x1+x2+x3.x1+x2+x33+x1+x2+x33+x1+x2+x33 < x1+x2+x3.
The inequality contradicts the algebraic fact that
x1+x2+x33+x1+x2+x33+x1+x2+x33 = x1+x2+x3.x1+x2+x33+x1+x2+x33+x1+x2+x33 = x1+x2+x3

7. Prove or disprove: The sum of any five consecutive integers is divisible by 5.
Solution:---
Suppose n is the sum of five consecutive integers. Then there is an integer m so that
n is the sum of the integers m, m + 1, m + 2, m + 3 and m + 4, that is, we have
n = m + (m + 1) + (m + 2) + (m + 3) + (m + 4)
Removing the parentheses and rearranging the terms, this means,
n = m + m + m + m + m + 1 + 2 + 3 + 4 = 5m + 10
In particular, this gives n = 5m + 10 = 5(m + 2) and, since m + 2 is an integer, this shows n
is divisible by 5.
Conversely, suppose n is divisible by 5, say n = 5a. Let m = a − 2 so a = m + 2. Then
n = 5(m+2) = 5m+10 = m+m+m+m+m+1+2+3+4 = m+(m+1)+m+2)+(m+3)+(m+4)
which shows that n is sum of five consecutive integers.

Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
For a given real number x , there is a natural number n which is larger...
For a given real number x , there is a natural number n which is larger than x . True False The supremum of the set of negative integers is 0. True False The supremum of a bounded set of rational numbers is rational. True False The supremum of a bounded set of irrational numbers is irrational. True False Every rational number is the supremum of a bounded set of irrational numbers. True False Every bounded sequence is a Cauchy...
3.a) Let n be an integer. Prove that if n is odd, then (n^2) is also...
3.a) Let n be an integer. Prove that if n is odd, then (n^2) is also odd. 3.b) Let x and y be integers. Prove that if x is even and y is divisible by 3, then the product xy is divisible by 6. 3.c) Let a and b be real numbers. Prove that if 0 < b < a, then (a^2) − ab > 0.
Exercise 2.5.1: Proofs by cases. Prove each statement. Give some explanation of your answer (b) If...
Exercise 2.5.1: Proofs by cases. Prove each statement. Give some explanation of your answer (b) If x and y are real numbers, then max(x, y) + min(x, y) = x + y. (c) If integers x and y have the same parity, then x + y is even. The parity of a number tells whether the number is odd or even. If x and y have the same parity, they are either both even or both odd. (d) For any...
You must show all work performed for the questions below. You will not receive credit for...
You must show all work performed for the questions below. You will not receive credit for an answer without detailed work. 5. Prove or disprove each of the following claims: (a) For all positive integers, n is even if and only if 3n^2 + 8 is even. (b) If a and b are rational numbers, then a^2 + b^2 ≥ 2ab. (c) If n is an even integer, then n + 1 is odd. (d) Every odd number is the...
1. For each statement that is true, give a proof and for each false statement, give...
1. For each statement that is true, give a proof and for each false statement, give a counterexample     (a) For all natural numbers n, n2 +n + 17 is prime.     (b) p Þ q and ~ p Þ ~ q are NOT logically equivalent.     (c) For every real number x ³ 1, x2£ x3.     (d) No rational number x satisfies x^4+ 1/x -(x+1)^(1/2)=0.     (e) There do not exist irrational numbers x and y such that...
2. Which of the following is a negation for ¡°All dogs are loyal¡±? More than one...
2. Which of the following is a negation for ¡°All dogs are loyal¡±? More than one answer may be correct. a. All dogs are disloyal. b. No dogs are loyal. c. Some dogs are disloyal. d. Some dogs are loyal. e. There is a disloyal animal that is not a dog. f. There is a dog that is disloyal. g. No animals that are not dogs are loyal. h. Some animals that are not dogs are loyal. 3. Write a...
/* This program should check if the given integer number is prime. Reminder, an integer number...
/* This program should check if the given integer number is prime. Reminder, an integer number greater than 1 is prime if it divisible only by itself and by 1. In other words a prime number divided by any other natural number (besides 1 and itself) will have a non-zero remainder. Your task: Write a method called checkPrime(n) that will take an integer greater than 1 as an input, and return true if that integer is prime; otherwise, it should...
. For any integer n ≥ 2, let A(n) denote the number of ways to fully...
. For any integer n ≥ 2, let A(n) denote the number of ways to fully parenthesize a sum of n terms such as a1 + · · · + an. Examples: • A(2) = 1, since the only way to fully parenthesize a1 + a2 is (a1 + a2). • A(3) = 2, since the only ways to fully parenthesize a1 + a2 + a3 are ((a1 + a2) + a3) and (a1 + (a2 + a3)). • A(4)...
***Python Hailstones, also known as the Collatz sequence, are a mathematical curiosity. For any number in...
***Python Hailstones, also known as the Collatz sequence, are a mathematical curiosity. For any number in the sequence, the next number in the sequence is determined by two simple rules: If the current number n is odd, the next number in the sequence is equal to 3 * n + 1 If the current number n is even instead, the next number in the sequence is equal to one half of n (i.e., n divided by 2) We repeat this...
You’re the grader. To each “Proof”, assign one of the following grades: • A (correct), if...
You’re the grader. To each “Proof”, assign one of the following grades: • A (correct), if the claim and proof are correct, even if the proof is not the simplest, or the proof you would have given. • C (partially correct), if the claim is correct and the proof is largely a correct claim, but contains one or two incorrect statements or justications. • F (failure), if the claim is incorrect, the main idea of the proof is incorrect, or...
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT