Try this
- Without revealing the answers, decide about each of . Which ones can you write as at a glance?
- Tap “Reveal”, then “Rows by residue mod ”. One whole row contains no element of at all. Which row?
- Tap a number that is not in and read why it is not.
- Now tap a number that is in . Is the machine's way of writing it the only one? For example, as which other difference of two squares can you write ?
The set means: the elements of are exactly the objects with property (the comprehension principle). Deciding whether means deciding whether has property . If the property is stated clearly, the set is well defined. But “stated clearly” is not the same as “easy to decide”: that empty row above has to be proved, not just seen.
Predict first
. Does belong to ?
leaves remainder when divided by . The proof below shows that not a single number with remainder mod is in .
Compare : it is in , since . However large the number, the answer depends only on its remainder mod .
Why
What we have to prove is that two sets are equal: . The description on the left is hard to check; the one on the right can be checked at a glance.
Which numbers are a difference of two squares?
Step 1 / 5- Every odd number is in
An odd number is the difference of two consecutive squares. The rows for remainder and remainder lie entirely in .
Change the property: sums of squares
Swap “difference” for “sum”: . Sort the numbers by their remainder mod again.
The row for remainder is empty, for the same reason as before: the sum of two squares can only be mod . But this time the converse is false: and leave remainder , yet neither is a sum of two squares. “Not leaving remainder mod ” is only a necessary condition for belonging to ; it cannot serve as another description of .
Three properties of elements
The elements of a set have three properties, and each one can bite you when solving problems:
- Definiteness: for any given object, it is either in the set or not, one or the other. “Very large numbers” do not form a set.
- Distinctness: each element is counted only once. is just , a two-element set.
- Unorderedness: .
The number of elements of is written . Because of distinctness, a set like often has far fewer elements than there are “combinations”. The exercises below are about counting how many are left once repeats are removed.
Practice
How many of can be written as the difference of two integer squares?
Let and . Find .
Given that and that this set has three elements, find .
How many of can be written as with both positive integers?