Omniadisce

Are there fewer square numbers than whole numbers?

Multiple choice Beginner New no attempts yet

In 1638 Galileo noticed a puzzle about the perfect squares
\[ 1, 4, 9, 16, 25, \dots \]
Most whole numbers are not squares, and the squares get rarer the higher you count. Among the first 100 whole numbers only 10 are squares; among the first 10,000 only 100 are. So there seem to be far fewer squares than whole numbers.

Yet every whole number $n$ has exactly one square, $n^2$, and every square comes from exactly one whole number:
\[ 1 \leftrightarrow 1, \quad 2 \leftrightarrow 4, \quad 3 \leftrightarrow 9, \quad 4 \leftrightarrow 16, \quad \dots \]
So there also seem to be exactly as many squares as whole numbers.
Principles it rests on
  • Two sets have the same size (cardinality) when there is a one-to-one pairing between them, with nothing missed and nothing repeated.
  • For finite sets, "a part is smaller than the whole" always holds. For infinite sets it can fail.
  • The density of a subset is a different measure from its size.
Question
Comparing the two sets by size, as modern set theory does, which statement is correct?

Sources & evidence

  1. Galileo's paradox: https://en.wikipedia.org/wiki/Galileo%27s_paradox
  2. Cardinality: https://en.wikipedia.org/wiki/Cardinality
Nobody has tried this yet.Be the first. Your answer starts the stats.

Only each person's first answer, given before viewing the solution, is counted.

Discussion 0 comments

Log in to join the discussion.

× Enlarged view