Skip to content
Technique

A 'there exists' claim needs only one example; try small numbers first

Quantitative Aptitude • Number System

Statement

A statement 'there exists a number such that …' is true as soon as one number works, and false only if no number works. So test small cases first: 1, 2, 3, small primes, small powers. A prime has exactly two factors (1 and itself), so two primes always have the same number of factors; this makes primes a quick test when a factor count must stay the same.

How to use it

  1. 1Read whether the claim says 'there exists' (one example is enough) or 'for every' (one failure is enough to break it).
  2. 2Try the smallest numbers that make the change a whole number.
  3. 3Primes are a natural first try when the number of factors must be kept.

Worked example

Is there a natural number which, when doubled and then increased by 1, is still a prime?

Step-by-step

  1. 1
    Try 2: .
  2. 2
    2 and 5 are both prime.

    Why: One example settles a 'there exists' claim.

Answer

Yes, for example 2.

Watch out

Testing one or two large numbers, finding they fail, and concluding that no number works is the usual mistake.

Also known as

existence proof, counterexample, one example is enough

Appears in past papers

2025

2023

2022

2021

2018

2016