Given that is an integer such that is odd, use proof by contradiction to show, using algebra, that is odd.
Was this exam question helpful?
Exam code: 9MA0
Given that is an integer such that is odd, use proof by contradiction to show, using algebra, that is odd.
How did you do?
Was this exam question helpful?
is an integer such that is even.
Prove by contradiction, using algebra, that is even.
How did you do?
Was this exam question helpful?
Given that is an integer such that is odd, use proof by contradiction to show, using algebra, that is odd.
How did you do?
Was this exam question helpful?
Below is an attempt at a proof by contradiction to show that there is no largest multiple of 7.
Line 1: | Assume there is a number, , say, that is the largest multiple of 7 |
Line 2: | |
Line 3: | Consider the number |
Line 4: | |
Line 5: | |
Line 6: | So is a multiple of 7 |
Line 7: | This is a contradiction to the assumption that is the largest multiple of 7 |
Line 8: | Therefore, there is no largest multiple of 7 |
Both line 2 and line 6 are incomplete.
Complete these lines of the proof.
How did you do?
Was this exam question helpful?
"There are an infinite number of positive multiples of 10."
A proof by contradiction starts as follows:
Proof |
|---|
Assume there are a finite number of positive multiples of 10. |
This means there is a greatest multiple of 10, written as , where . |
Consider the expression . |
Write the statements needed to complete the proof.
How did you do?
Was this exam question helpful?
Given that and are integers such that
is even
use algebra to prove by contradiction that at least one of or is even.
How did you do?
Was this exam question helpful?
Given that is odd, use proof by contradiction to show, using algebra, that is even.
How did you do?
Was this exam question helpful?
Prove by contradiction that there are an infinite number of positive even numbers.
How did you do?
Was this exam question helpful?
A student is attempting to answer the following exam question:
“Prove by contradiction that is an irrational number. You may use without proof the fact that if a number is even, then must also be even.”
The student’s proof is as follows:
Line 1: | Assume is a rational number. Therefore, it can be written in the form , where are integers with , and where and have no common factors. |
Line 2: | Squaring both sides gives |
Line 3: | Multiplying both sides by gives |
Line 4: |
|
Line 5: | This means can be written as , for some integer |
Line 6: | Squaring gives |
Line 7: | Substituting into gives |
Line 8: | Dividing both sides by 2 gives |
Line 9: | This shows that is even, and therefore must be even |
Line 10: | It has been shown that both and are even, so they share a common factor of 2. |
Line 11: | This is a contradiction of the assumption that and have no common factors. |
Line 12: | Therefore, is irrational. |
There is an error within the first three lines of the proof.
Find the error and write down the correct line of the proof.
How did you do?
Line 4 of the proof is missing.
Complete this line of the proof.
How did you do?
Was this exam question helpful?
Given that is odd, use proof by contradiction to show, using algebra, that is odd.
How did you do?
Was this exam question helpful?
and are two real numbers such that is an irrational number.
Prove by contradiction that or or both are irrational numbers.
How did you do?
Was this exam question helpful?
Prove by contradiction that a triangle cannot have more than one obtuse angle.
How did you do?
Was this exam question helpful?
Use proof by contradiction to show that is an irrational number.
How did you do?
Was this exam question helpful?
A student attempts to answer the following question:
Given that is an obtuse angle, use algebra to prove by contradiction that |
The student starts the proof with:
Assume that when is an obtuse angle |
Complete the proof.
How did you do?
Was this exam question helpful?
Prove by contradiction that is an irrational number.
You may use without proof the fact that if is a multiple of 11, then is a multiple of 11.
How did you do?
Was this exam question helpful?
Given that is odd where is a positive integer, use proof by contradiction to show, using algebra, that is odd.
How did you do?
Was this exam question helpful?
Prove by contradiction that there are an infinite number of positive powers of 2.
How did you do?
Was this exam question helpful?
Below is a proof by contradiction that is irrational.
Line 1: | Assume is a rational number. Therefore it can be written in the form , where and are integers with no common factors, and . Note that (as ) so we can assume that . |
Line 2: | Rearranging gives |
Line 3: | Raising both sides to the power gives |
Line 4: | |
Line 5: | This says that a power of must equal a power of |
Line 6: | This is not possible, except when which contradicts |
Line 7: | Therefore is irrational |
Lines 4 is missing.
Complete this line of the proof.
How did you do?
Was this exam question helpful?
Use proof by contradiction to show that, given a rational number and an irrational number , is irrational.
How did you do?
Was this exam question helpful?
Prove by contradiction that there are no positive integers and such that
How did you do?
Was this exam question helpful?
Prove by contradiction that there are no positive integers and such that
How did you do?
Was this exam question helpful?
Prove by contradiction that there are an infinite number of prime numbers.
How did you do?
Was this exam question helpful?
Without solving the equation directly, use algebra to prove by contradiction that the solutions to the equation
cannot be written in the form where and are both odd integers.
How did you do?
Was this exam question helpful?
A composite number, , has the following properties:
It is a positive integer greater than 1
It is not a prime number
It has at least two prime factors
It can be written as a product of its prime factors, , , ..., :
where .
Prove by contradiction that any composite number, , must have at least one prime factor that is less than or equal to .
How did you do?
Was this exam question helpful?