Question

1. Compute the Greatest Common Divisor of 325

and the last three digits of your student Number.
2.Test whether the last four digits of your student
Number is a prime or not.
3. Write a RSA decode and encode system(optional)
encode the sentence"I love sart." and decode it.
The better you finish, the higher score you get.
C++ , Java, Python are OK.

Answer 1

The question entails computing the GCD of two numbers, prime testing, and implementing an RSA encryption-decryption system, requiring skills in mathematics and computer programming.

Step-by-step explanation:

The student's question revolves around the concepts of mathematics, specifically in the computation of the Greatest Common Divisor (GCD), prime number testing, and implementing a basic RSA encryption and decryption system. Since I don't have access to the student's number, I'll use a hypothetical number for demonstration; let's say the last three digits are 456. To calculate the GCD of 325 and 456, we could use the Euclidean algorithm.

For the prime number testing, we would again need the actual last four digits; assuming a hypothetical number of 1234, we would test divisibility to confirm if it is a prime.

Lastly, for the RSA encryption and decryption, we'd generate two prime numbers, compute their product n, choose an encryption key e, compute a decryption key d, and use these to encode and decode the message 'I love sart.' Implementing an RSA system would involve both mathematics and computer programming skills.