Let be a property about two integers and . If we want to prove that "for every integer , there exists an integer such that is true", then we should do the following
Tap an option to check your answer.
Let be a property about two integers and . If we want to prove that "for every integer , there exists an integer such that is true", then we should do the following
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 prove that "for every integer n, there exists an integer m such that P(n, m) is true", then we should do the following (A) Let n and m be arbitrary integers. Then show that P(n, m) is true (B) Find an integer m such that P(n, m) is true for every integer n (C) Let n be an arbitrary integer. Then find an integer m possibly depending on n such that P(n, m) is true (D) Find an integer n and an integer m such that P(n, m) is true
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 2010 paper. Solutions are TestStop's own. Not affiliated with or endorsed by any examination authority.