Solve the Linear Congruence $$15 x \equiv 31 ( \bmod 47 ) \text { given that the inverse of } 15 \text { modulo } 47 \text { is } 22 \text {. }$$

Q26: Find the prime factorization of 1,024.

Q28: Show that 7 is a primitive root

Q44: (a) Find two positive integers, each with

Q75: refer to an 8-digit student id at

Q86: Applying the division algorithm <span

Q87: What is the shared key if

Q88: Prove or disprove: For all integers

Q91: Find Imc(20!, 12!) by directly

Q92: Suppose the first digit of the

Q93: Find the sequence of pseudorandom numbers