Question

In: Computer Science

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 by cases that for all real numbers | x + y | <= |x| + |y|
  2. Prove by contradiction that the average of three real numbers is greater than or equal to at least one of the numbers

Solutions

Expert Solution

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

if all know that |x| will always give us a positive value no matter what or we can say |x| = +x
|x| = for all values x is greater than 0 where x !=0

so let's take some examples

case 1: x = -3 and y = 2
|x+y| = |-3+2| = |-1| = 1
|x|+|y| = |-3| +| |2| = 3+2 = 5

case 2 :when both positive than we know value would be same
i.e |x+y| = |x| + |y|

case 3: when both values are negative then also value would be the same for both
   for eg : x = -3 and y = -2
|x+y| = |-3+-2| = |-5| = 5
|x| + |y| = |-3|+ |-2| = 3+2 = 5

so this proves that |x+y|<=|x| + |y|

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

let's understand first what average do :
average of any numbers will give the answer between or equal to the min value and max value from the list of values

for example x = 1, y=2 ,z = 3
so avg = (1+2+3)/3
avg = 2

so we see the value exist between min value i.e 1 and max value ie 3

so let's understand it by contradiction

it starts with negation and says that:-
suppose we have three real numbers x,y,z such that their average is
maximum than all three numbers

so let m is the average of three number


then
(x+y+z)/3 = m ----(line 1)
according to our assumption (x<m) ,(y<m) and (z<m)

adding all inequalities we get x+y+x<3m.

we know that m is defined as in-line (1) as x+y+z = 3m

but now 3m = x+y+z < 3m. So 3m<3m which is not possible so our assumption is wrong so this proves that the average of three real numbers is greater than or equal to at least one of the numbers


lets take one more example : (enjoying right .....(* ~*)
lets say x = 5 ,y = 6,and z = 8

avg = (4+6+8)/3
avg = 6
so avg is less than or equal to 6 and 8


if any doubt comment below


Related Solutions

3. Write a program using switch-case statements that accepts an integer number between 0 and 100...
3. Write a program using switch-case statements that accepts an integer number between 0 and 100 and, based on its value, reports its equivalent letter grade (A, B, C, D, or F).
3.11. (a) Let n be any integer such that n is congruent to 0 (mod 7)....
3.11. (a) Let n be any integer such that n is congruent to 0 (mod 7). For any positive integer k, what is the remainder when n^k is divided by 7? (b) Let n be any integer such that n is congruent to 1 (mod 7). For any positive integer k, what is the remainder when n^k is divided by 7? (c) Let n be any integer such that n is congruent to 2 (mod 7). For any nonnegative integer...
Consider the set of integer numbers from 0 to 9, that is {0, 1, 2, 3,...
Consider the set of integer numbers from 0 to 9, that is {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}. Bob wishes to use these numbers to create a 7-digit password to secure his new laptop. Note that each number can appear in any position (for example, 0 can be the first number in the password). (a) Find the number of 7-digit passwords that are possible. (b) Find the number of 7-digit passwords with distinct digits. (c) Find...
a. Use mathematical induction to prove that for any positive integer ?, 3 divide ?^3 +...
a. Use mathematical induction to prove that for any positive integer ?, 3 divide ?^3 + 2? (leaving no remainder). Hint: you may want to use the formula: (? + ?)^3= ?^3 + 3?^2 * b + 3??^2 + ?^3. b. Use strong induction to prove that any positive integer ? (? ≥ 2) can be written as a product of primes.
Can any genius explain me about well-ordering principle - Proofs using well-ordering principle. with some examples.
Can any genius explain me about well-ordering principle - Proofs using well-ordering principle. with some examples.
Show that for any square-free integer n > 1, √ n is an irrational number
Show that for any square-free integer n > 1, √ n is an irrational number
Suppose k is any natural number, k >= 0. Prove that the number of nodes in...
Suppose k is any natural number, k >= 0. Prove that the number of nodes in any binomial tree of height k is exactly 2^k.
I wanna know if there are any examples of compliance with respect to clauses 4.1 -...
I wanna know if there are any examples of compliance with respect to clauses 4.1 - 4.4 of ISO 9001?
Topic 2 TRUE OR FALSE Q’s 31.          A natural number is the number 0 or any...
Topic 2 TRUE OR FALSE Q’s 31.          A natural number is the number 0 or any number obtained by adding 1 to a natural number. 32.          The category of numbers called integers includes negative numbers. 33.          A rational number is any number that can be expressed without a fractional part. 34.          The base of a number system determines the number of digits used in the system. 35.          The digits used in any base are 1 through the base number. 36.         ...
Days 1 to 120: Number of New Cases 0 1 0 0 2 0 3 0...
Days 1 to 120: Number of New Cases 0 1 0 0 2 0 3 0 0 0 0 14 2 1 0 27 80 51 18 26 216 81 37 117 167 108 151 178 111 414 337 195 706 214 300 68 118 160 190 209 154 193 170 154 166 68 119 152 146 101 98 159 175 195 195 157 130 129 161 116 133 217 209 75 298 240 205 196 233 76 339 170...
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT