Find the Integer a Such That $$a = 89 ( \bmod 19 ) \text { and } - 9 \leq a \leq 9$$

Q107: find the sum and product of

Q108: Use the Euclidean Algorithm to find gcd(580,

Q109: Here is a sample proof that

Q110: refer to an 8-digit student id at

Q111: Encrypt the message "just testing" using the

Q113: Find −88 mod 13.

Q114: Prove or disprove: There exist two consecutive

Q115: What does a 60-second stop watch read

Q116: Encrypt the message WATCH OUT using blocks

Q117: Convert (204)₁₀ to base