Answer:
================================
The integers that are congruent to 3 (mod 11) have the form:
- N = 11k + 3, so they all give remainder of 3 when divided by 11.
We are looking for the number k for which:
Solve it for whole numbers of k:
- -103 < 11k < 97
- - 103/11 < k < 97/11
- - 10 < k < 9
The number of integer solutions of k is:
- 9 (negative values of k) + 1 (k = 0) + 8 (positive values of k) =
- 18