NETMaths
Part CCSIR NET December 2023partition-counterexamples

Partition counterexamples

Let {} be a collection of non-empty subsets of such that for m ≠ n. If , then which of the following statements are necessarily true?

  1. A. is finite for every integer n ≥ 1.
  2. B. is finite for some integer n ≥ 1.
  3. C. is infinite for some integer n ≥ 1.
  4. D. is countable (finite or infinite) for every integer n ≥ 1.

The answer and working come with the PYQ pack.

See pricing

68 questions are solved free — try those first.

The trap it tests

Hypothesis dropped

A theorem applied without checking one of its preconditions.

Drill statements like this

Related counterexample: A subset of ℝ with measure zero is countable

More on this topic

From Lebesgue Measure and IntegrationMeasurable sets and functions

ShareWhatsAppTelegram