This document contains an assignment with 4 questions on topics related to number theory and modular arithmetic. Question 1 asks to prove several statements about greatest common divisors and divisibility. Question 2 involves computing greatest common divisors and finding solutions to linear congruences. Question 3 proves several statements about modular arithmetic. Question 4 asks to solve systems of congruences using the Chinese Remainder Theorem. Students are instructed to submit their answers by the due date to the course coordinator.