TMUA-P2Y-ARG-002 — Paper P2 · Quantifiers · Level 1

Options

1. A
   It asserts every integer squares to $64$; the claim is false.
2. B
   It asserts at least one integer squares to $64$; the claim is true (for example $k = 8$).
3. C
   It asserts at most one integer squares to $64$; the claim is false.
4. D
   It asserts no integer squares to $64$; the claim is false.
5. E
   It asserts $64$ is the only perfect square; the claim is false.

Letters only — the answer key is hidden. Work it out, then check the solution below.

Keep practising

• Same topic · same level

  P2ARG3Level 1

  TMUA-P2-ARG3-001

  What does the statement “For all integers n, n^2 0 ” assert?

  Quantifiers

  Open TMUA-P2-ARG3-001 →

• Same trap: single-counterexample

  P2ARG1Level 3

  TMUA-P2-ARG1-009

  A textbook exercise states the following facts about positive integers, where P is “ n is divisible by 6 ” and Q is “ n…

  Statements and connectives

  Open TMUA-P2-ARG1-009 →

• Step up a level

  P2ARG3Level 2

  TMUA-P2-ARG3-003

  Consider (S1) “For every integer x there is an integer y with y > x ” and (S2) “There is an integer y such that for ever…

  Quantifiers

  Open TMUA-P2-ARG3-003 →