Find an Integer $$a \text { such that } a \equiv 3 a ( \bmod 7 ) \text {. }$$

Q15: Prove or disprove: For all integers

Q17: Find <span class="ql-formula" data-value="\text {

Q18: Show that if a, b, k

Q19: Tdivisibleake anybthree-digity 9. Prove inthatteger,thisrevmerseust itshappdigits,en forandall

Q22: find each of these values<br>- <span

Q23: find the sum and product of

Q24: Find gcd(20!, 12!) by directly finding

Q39: Find 289 mod 17.

Q70: find each of these values<br>-(123 mod 19

Q76: Use the Euclidean algorithm to find gcd(144,