Suppose That a and B Are Integers $$a \equiv 4 ( \bmod 7 ) , \text { and } b \equiv 6 ( \bmod 7 ) . \text { Find the integer } c \text { with } 0 \leq c \leq 6$$

Q3: Find the discrete logarithms of 5 and

Q26: Find the prime factorization of 1,024.

Q74: Express gcd(450, 120) as a linear combination

Q75: refer to an 8-digit student id at

Q79: Encrypt the message BALL using the

Q80: Encode the message "stop at noon"

Q81: Encrypt the message "meet me at

Q83: Prove or disprove: For all integers

Q86: Applying the division algorithm <span

Q87: What is the shared key if