Clock/modular arithmetic anyone?

  • Thread starter Thread starter JaeSun
  • Start date Start date
  • Tags Tags
    Arithmetic
Click For Summary
SUMMARY

The discussion centers on the concepts of clock/modular arithmetic and its application in RSA encryption, particularly in calculating large powers with modular arithmetic. Participants express a need for assistance in verifying answers related to these mathematical principles, especially in the context of an upcoming test. The importance of understanding modular arithmetic is emphasized, as it is crucial for both academic success and practical applications in cryptography.

PREREQUISITES
  • Understanding of modular arithmetic principles
  • Familiarity with RSA encryption algorithms
  • Basic knowledge of mathematical powers and exponents
  • Experience with problem-solving in mathematics
NEXT STEPS
  • Study the fundamentals of modular arithmetic in detail
  • Explore RSA encryption and its mathematical foundations
  • Practice calculating large powers using modular arithmetic techniques
  • Review examples of clock arithmetic applications in real-world scenarios
USEFUL FOR

Students preparing for mathematics tests, cryptography enthusiasts, and anyone interested in enhancing their understanding of modular arithmetic and its applications in encryption.

JaeSun
Messages
37
Reaction score
0
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 ...
 

Attachments

Physics news on Phys.org



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!
 

Similar threads

Replies
3
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 49 ·
2
Replies
49
Views
8K
  • · Replies 3 ·
Replies
3
Views
3K
  • · Replies 27 ·
Replies
27
Views
3K
  • · Replies 13 ·
Replies
13
Views
7K
  • · Replies 3 ·
Replies
3
Views
5K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 2 ·
Replies
2
Views
11K
  • · Replies 2 ·
Replies
2
Views
2K