Show that “there are as many squares as there are numbers”
Chapter 7, Problem 2E(choose chapter or problem)
Show that “there are as many squares as there are numbers” by exhibiting a one-to-one correspondence from the positive integers, Z+, to the set S of all squares of positive integers:S = {n ? Z+ | n = k2, for some positive integer k}.
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer