"Tricky" wording on Congruence Modulo Question? I'm asked for all possible values, but I can only see one. The question on my practice exam reads:
Consider the equivalence class [3] for the equivalence relation "congruence modulo $7$" on $\Bbb Z$. Suppose that $S = {1, 2, ..., N}$, where $N$ is a positive integer. Find all possible values of $N$ so that $[3] \cap S$ contains exactly $10$ elements.
As I see it, $S$ must be $\{1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12\}$, so all possible values of $N$ are $12$?
$3$ and $10$ and members of $[3]$, but $13$ is not, so any higher values would have more than $10$ elements.
 A: Recall that $[3]$ is an equivalence class, representing a set: 
$$x \in [3] \iff x \equiv 3 \pmod 7 \implies x = 7k + 3 \;\text{ where}\;\;k\in \mathbb Z$$
What integers $x$ in $\mathbb N = \{1, 2, 3, ....\}$, are such that $x = 7k + 3, k\geq 0\,$? We need the first ten such elements in the natural numbers, and let's call the set of the first ten elements $X$:
$$X =\{3, 10, 17, 24, 31, 38, 45, 52, 59, \bf 66\} $$ is the set of the first ten elements in $[3]$, if we are considering only values of $x \in [3]$ as a subset of the natural numbers.
$$S \subset \mathbb N = \{1, 2, 3, \cdots, 65, {\bf 66}\}$$
$$|X \cap S| = 10 \implies \bf N = 66$$
A: The first $10$ positive integers that belong to the equivalence class are $3, 10, 17, 24, 31, 38, 45, 52, 59, 66$. 
So we need to go up to $66$ at least, and we don't want the next one, $73$, for that would put us over. 
Remark: The number $7$ definitely does not belong to the equivalence class of $3$ modulo $7$, since the difference between $7$ and $3$ is not divisible by $7$.
The equivalence class of $3$, in symbols $[3]$, consists of all integers $n$, positive, negative, or $0$, such that $n\equiv 3\pmod{7}$. In more old-fashioned language, it consists of all integers $n$ of the form $7k+3$.
Very soon, we start thinking of $[3]$ as a single abstract object, and we kind of forget that, in principle, it is an infinite set. In that sense, the question was a bit of a trick question. 
