Either find an integer $x$ such that $x \equiv 2$ (mod 6) and $x \equiv 3$ (mod 9) are both true, or else prove that there is no such integer.

Name: Either find an integer $x$ such that $x \equiv 2$ (mod 6) and $x \equiv 3$ (mod 9) are both true, or else prove that there is no such integer.
Brand: Quizplus
Rating: 4.9 (34 reviews)

Question

Either find an integer $x$ such that $x \equiv 2$ (mod 6)  and $x \equiv 3$  (mod 9)  are both true, or else prove that there is no such integer.

Quizplus · Accepted Answer

The Answer of Either find an integer $x$ such that $x \equiv 2$ (mod 6)  and $x \equiv 3$  (mod 9)  are both true, or else prove that there is no such integer.

Either Find an Integer xxx Such That x≡2x \equiv 2x≡2 (Mod 6) And

Either Find an Integer $x$ Such That $x \equiv 2$ (Mod 6) And