give a proof by contradiction. there does not exist any rational number x such that x...

Question

Question

give a proof by contradiction. there does not exist any rational number x such that x * sqrt(2) = sqrt(3)

math Advanced-Math

Answer 1

Answer #1

Answer 2

Similar Homework Help Questions

Proof by contradiction that the product of any nonzero rational number and any irrational number is...

Proof by contradiction that the product of any nonzero rational number and any irrational number is irrational (Must use the method of contradiction). Which of the following options shows an accurate start of the proof. Proof. Let X+0 and y be two real numbers such that their product xy=- is a rational number where c, d are integers with d 0. Proof. Let x0 and y be two real numbers such that their product xy is an irrational number (that...
for every positive integer 1. 6. Give a proof by contradiction that there is no smallest...

for every positive integer 1. 6. Give a proof by contradiction that there is no smallest rational number in the open interval (5,8).
a) 118 is an irrational number by proof of Contradiction. Then why the same method does...

a) 118 is an irrational number by proof of Contradiction. Then why the same method does not extend to 36

Explain the difference between proof by contradiction and proof by contraposition. Give an example of a...

Explain the difference between proof by contradiction and proof by contraposition. Give an example of a theorem that would lend itself to proof by contradiction. Explain why that proof technique would be a good choice in this case.
25. (2 points) Below is a proof presented as a proof by contradiction. Restate the proof,...

25. (2 points) Below is a proof presented as a proof by contradiction. Restate the proof, using the same ideas, as a proof of the contrapositive of the proposition. Proposition: The sum of a rational number and an irrational number is irrational. Proof: Suppose BWOC that there existr e Q and neR-Q such that run e Q. Sincer is rational, r = for some p, q E Z. Sincer+ne Q, also r+n= for some a, b e Z. Now: r...
7. Give a proof by contradiction that for any subset S of 26 cards from a...

7. Give a proof by contradiction that for any subset S of 26 cards from a 52 card deck ( a 52 card deck is composed of 4 suits of 13 cards each), there is a suit such that S has at least 7 cards of that suit. This is an application of the pigeonhole principle.

Give a proof by contradiction of the following: : If x,y are integers and y is...

Give a proof by contradiction of the following: : If x,y are integers and y is odd, then 2x + y + 1 is even. Given a three element set A: {a1, a2, a3} and a two element set set B: {b1, b2}. Enumerate all the mappings f: A→B.
Write an example of a proof by contradiction . ( any proof dealing with real/math analysis)

Write an example of a proof by contradiction . ( any proof dealing with real/math analysis)
3) [3 marks] Use a proof by cases that for all real number x, xs]x]. You...

3) [3 marks] Use a proof by cases that for all real number x, xs]x]. You may need this definition. For any real numbers x, [x]= x, if x2 0, -x, otherwise. 4) [3 marks] Give a direct proof that If x is an odd integer and y is an even integer, then x + y is odd. 5) [3 marks] Give a proof by contradiction for the proposition in Q4, above. That is, give a proof by contraction for...

5) [2 marks] Give a proof by contradiction that if n+2 is even then n is...

5) [2 marks] Give a proof by contradiction that if n+2 is even then n is even