Find Gcd(2⁸⁹, 2³⁴⁶) by Directly Finding the Largest

Q23: Encrypt the message KING using the RSA

Q54: Use the Euclidean Algorithm to find gcd(900,

Q55: Use the Euclidean Algorithm to find gcd(128,

Q69: Given that gcd(620, 140) = 20, write

Q114: Prove or disprove: There exist two consecutive

Q128: Convert (1 1101)2 to base 10.

Q129: Convert (BC1)16 to base 2.

Q131: Find three integers <span class="ql-formula"

Q135: Prove or disprove: For all integers

Q138: Convert (2AC)16 to base 10.