This document contains a mathematics practical assignment on divisibility in integers for a first year BSc computer science semester 1 class. It includes 10 problems involving addition and multiplication tables for integers modulo n, finding the greatest common divisor of integers using the Euclidean algorithm, finding remainders when integers are divided, and solving systems of congruences using the Chinese Remainder Theorem.
This document contains a mathematics practical assignment on divisibility in integers for a first year BSc computer science semester 1 class. It includes 10 problems involving addition and multiplication tables for integers modulo n, finding the greatest common divisor of integers using the Euclidean algorithm, finding remainders when integers are divided, and solving systems of congruences using the Chinese Remainder Theorem.
This document contains a mathematics practical assignment on divisibility in integers for a first year BSc computer science semester 1 class. It includes 10 problems involving addition and multiplication tables for integers modulo n, finding the greatest common divisor of integers using the Euclidean algorithm, finding remainders when integers are divided, and solving systems of congruences using the Chinese Remainder Theorem.