What is Galileo's Paradox?

Galileo's Paradox observes that within any finite range, there are fewer perfect squares than natural numbers. Yet for infinite sets, every natural number n can be paired with exactly one square n², so both sets have the same countably infinite size.

How does the one-to-one correspondence work?

Each natural number n is paired with its square n². Since every natural number has a unique square and every perfect square has a unique square root, the mapping n → n² is a bijection between the two infinite sets.

What does this calculator show?

Enter an upper limit N and the Galileo's Paradox Calculator counts natural numbers from 1 to N, counts perfect squares up to N, computes the ratio, and lists all n ↔ n² pairs.

No. All calculations happen in your browser; nothing is sent to a server.

Galileo's Paradox Calculator

n	n²
1	1
2	4
3	9
4	16

How to Use Galileo’s Paradox Calculator

The Galileo’s Paradox Calculator lets you explore the fascinating tension between finite and infinite set comparisons. Enter an upper limit N and the Galileo’s Paradox Calculator instantly shows how many natural numbers and perfect squares exist up to N, along with a complete pairing table.

Enter the Upper Limit N - Type any integer from 1 to 10,000. This defines the finite range to analyze.
View the Counts - The Galileo’s Paradox Calculator displays the total natural numbers (= N) and the count of perfect squares (⌊√N⌋) within the range.
Check the Ratio - The squares-to-naturals ratio is shown as a percentage. For large N this ratio approaches 0%, emphasizing the finite paradox.
Explore the Pairing Table - The table lists every n paired with n², illustrating the one-to-one correspondence that holds over infinite sets.

The Galileo’s Paradox Calculator is a useful teaching aid for anyone learning about cardinality, countable infinity, and set theory.

Formula & Theory - Galileo’s Paradox Calculator

The Galileo’s Paradox Calculator uses this core formula or rule based on Galileo Galilei’s observation (1638) in Two New Sciences:

Finite range [1, N]:
  Natural numbers count  = N
  Perfect squares count  = ⌊√N⌋
  Ratio                  = ⌊√N⌋ / N → 0 as N → ∞

Infinite bijection:
  f: N → S,  f(n) = n²
  Every n ∈ ℕ maps to a unique n² ∈ S
  Every s ∈ S has a unique √s ∈ ℕ
  → |ℕ| = |S| (both countably infinite)

Symbol	Meaning
N	Upper limit of the finite range
⌊√N⌋	Floor of the square root of N; number of perfect squares ≤ N
f(n) = n²	The bijection mapping each natural number to its square
\|ℕ\|	Cardinality (size) of the natural numbers
\|S\|	Cardinality of the set of perfect squares

Galileo’s Original Insight

Galileo noted the paradox but concluded only that comparisons of size (more, fewer, equal) do not apply to infinite quantities in the same way they do to finite ones. Georg Cantor later formalized this with the concept of cardinality: two sets are the same size if and only if a bijection exists between them.

Assumptions and Limits

The Galileo’s Paradox Calculator works with integers from 1 to 10,000 for practical display. The mathematical result generalizes to all positive integers without bound.

Use Cases for Galileo’s Paradox Calculator

The Galileo’s Paradox Calculator is particularly useful in educational and exploratory settings:

Set theory introduction - Demonstrate why intuitive size comparisons break down for infinite sets.
Cardinality lessons - Illustrate countably infinite sets and bijections in an interactive way.
Math competitions - Verify properties of perfect squares and practice set pairing arguments.
Philosophy of mathematics - Explore foundational questions about the nature of infinity.
Computer science theory - Connect to concepts like Cantor diagonalization, enumerability, and halting problems.
Classroom engagement - The Galileo’s Paradox Calculator makes an abstract paradox concrete and verifiable with real numbers.