Which of the following is the proper way to begin a proof by contradiction of the theorem "∀p ∀q, p ∈ ℚ ∧ q ∈ ℚ → pq ∈ ℚ"? Suppose the product of every two irrational numbers is rational. Suppose the product of every two rational numbers is irrational. Suppose there exist two rational numbers whose product is irrational. Suppose there exist two irrational numbers whose product is rational.
Added by Craig M.
Your feedback will help us improve your experience
Sri K and 98 other Calculus 1 / AB educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
Show that the product of a rational number (other than 0) and an irrational number is irrational. Hint: Try proof by contradiction.
Preliminaries
Real Numbers, Estimation, and Logic
Show that $\sqrt{2}$ is irrational. Hint: Try a proof by contradiction. Suppose that $\sqrt{2}=p / q,$ where $p$ and $q$ are natural numbers (necessarily different from 1 ). Then $2=p^{2} / q^{2},$ and so $2 q^{2}=p^{2} .$ Now use Problem 76 to get a contradiction.
Prove by contradiction, where $p$ is a prime number. $\sqrt{2}$ is an irrational number.
The Language Of Logic
Proof Methods
Recommended Textbooks
Calculus: Early Transcendentals
Thomas Calculus
Transcript
18,000,000+
Students on Numerade
Trusted by students at 8,000+ universities
Watch the video solution with this free unlock.
EMAIL
PASSWORD