We are trying to prove: All odd positive integers between 3 and 11, inclusive, a
ID: 2968987 • Letter: W
Question
We are trying to prove: All odd positive integers between 3 and 11, inclusive, are prime. [Yes, I know this won't work]. Match the proof lines with the proof/disproof method.
Suppose not. Let n be an odd positive integer between 3 and 11 which is composite...
__Direct Proof
__Contradiction
__Disproof by counterexample
__Exhaustion
__Contraposition
1.
9 = 3*3 2. 3 is prime, 5 is prime, 7 is prime, 9 is experimental error,... 3. Suppose n is composite... 4.
Suppose not. Let n be an odd positive integer between 3 and 11 which is composite...
5. Suppose n is an odd positive integer with 3 ? n ? 11Explanation / Answer
Direct proof: Suppose n is an odd positive integer with 3 ? n ? 11
Contradiction: Suppose not. Let n be an odd positive integer between 3 and 11 which is composite...
Disproof by counterexample: 9 = 3*3
Exhaustion: 3 is prime, 5 is prime, 7 is prime, 9 is experimental error,...
Contraposition: Suppose n is composite
Related Questions
drjack9650@gmail.com
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.