Question

Answer the following question: 1. a. Use an affine cipher x 7→ 3x + 1 (mod...

Answer the following question:

1.

a. Use an affine cipher x 7→ 3x + 1 (mod 26) to encode “Baltimore”.

b. Let a and b be integers. What does it mean to say a divides b? Provide a precise definition and include the proper notation.

c. Let a, b, c, and n be integers with n 6= 0. Suppose that a ≡ b (mod n) and b ≡ c (mod n). Prove that a ≡ c (mod n).

d. Use the Euclidean algorithm to find gcd(39, 65). Find integers a and b so that 39a + 65b = gcd(39, 65). The purpose of this question is to demonstrate your understanding of the algorithm, and you are graded solely on the algorithm. Simply writing down gcd(39, 65) and a and b will get you zero points.

Homework Answers

Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT