Modular arithmetic with RSA and large power exponentiation

[JaeSun]

anyone familiar with this, along with some RSA and calculating large powers with modular arithmetic (im lost at the name of it currently).

i have attached the test that I took last week ... he allows us to take home the exact same test home, and do it again, and he combines the grades ... (average of each question) ...

im pretty sure I did the test, but I want to do it again just in case ...

if anyone is familiar, can someone double check some answers? I have already done it and will post the answers along with my work if anyone is willing to help me doublecheck it ...

bad on my part in that this is due in 4.5 hours ... should have posted earlier ...

 

[thepatientmental]

Hi there,

I am not familiar with RSA and calculating large powers with modular arithmetic, but I do have some knowledge about clock/modular arithmetic. It is a mathematical concept that deals with the behavior of numbers when they are subject to a fixed modulus. This means that when a number reaches a certain value, it "wraps around" and starts over from the beginning. For example, in a clock, when the hour hand reaches 12, it goes back to 1 and starts counting again.

As for your test, I am not able to help you double check your answers as I am not familiar with the specific concepts you mentioned. However, it is always a good idea to review and double check your work before submitting it. Good luck with your test!