Let be a property about two integers and . If we want to disprove the claim that 'for every integer , there exists an integer such that is true', then we need to prove that
Tap an option to check your answer.
Let be a property about two integers and . If we want to disprove the claim that 'for every integer , there exists an integer such that is true', then we need to prove that
Tap an option to check your answer.
Checking your account…
Let P(n, m) be a property about two integers n and m. If we want to disprove the claim that 'for every integer n, there exists an integer m such that P(n, m) is true', then we need to prove that (A) there exist integers n, m such that P(n, m) is false (B) there exists an integer m such that P(n, m) is false for all integers n (C) there exists an integer n such that P(n, m) is false for all integers m (D) for every integer n, there exists an integer m such that P(n, m) is false
Logic and proof techniques has come up 73 times in 3 exams since 2004.
This question is on Quantifiers and their negation, part of Logic and proof techniques in Mathematics.
Statements with 'for all' and 'there exists', and how they change when negated or reordered.
TestStop has 6 past-paper questions on this subtopic.
Question from the JNU SSS 2011 paper. Solutions are TestStop's own. Not affiliated with or endorsed by any examination authority.