Let \(x\) be any integer such that \(x \equiv 3 \pmod{8}\). Which of the following statements are true for every such \(x\)?
(A) \(x\) is an odd number.
(B) \(x \equiv 3 \pmod{4}\)
(C) \(x^{2} \equiv 1 \pmod{8}\)
(D) \(x \equiv 3 \pmod{16}\)
Choose the correct answer from the options given below:
Answer & explanation
Correct answer: option 2
The correct answer is Option (2) → (A), (B) and (C) only
By the definition of congruence, \(x \equiv 3 \pmod{8}\) means that \(x\) can be written as \(8k + 3\) for some integer \(k\).
\(x = 8k + 3\)
\(x = 2(4k + 1) + 1\)
\(x = 4(2k) + 3\)
\(x^{2} \equiv 3^{2} = 9 \equiv 1 \pmod{8}\)
So \(x = 8k + 3\) is odd, leaves remainder 3 on division by 4, and \(x^{2}\) leaves remainder 1 on division by 8; the values of \(x\) include 3, 11, 19, …
Checking the statements
(A) \(x\) is an odd number. — Correct. \(8k + 3 = 2(4k + 1) + 1\).
(B) \(x \equiv 3 \pmod{4}\) — Correct. \(8k + 3 = 4(2k) + 3\).
(C) \(x^{2} \equiv 1 \pmod{8}\) — Correct. \(x^{2} \equiv 9 \equiv 1 \pmod{8}\).
(D) \(x \equiv 3 \pmod{16}\) — Incorrect. \(x = 11\) satisfies \(11 \equiv 3 \pmod{8}\), but \(11 - 3 = 8\) is not divisible by 16.