Modular Arithmetic ची गणना कशी करावी
Modular Arithmetic म्हणजे काय?
Modular arithmetic wraps numbers around after reaching a modulus. a mod m is the remainder when a is divided by m. Foundational in cryptography, checksums, and number theory.
चरण-दर-चरण मार्गदर्शक
- 1a mod m = remainder of a ÷ m
- 2(a+b) mod m = ((a mod m)+(b mod m)) mod m
- 3Modular exponentiation: fast algorithm for aⁿ mod m
Worked Examples
इनपुट
17 mod 5
परिणाम
2
17 = 3×5 + 2
गणना करण्यास तयार आहात? विनामूल्य Modular Arithmetic कॅल्क्युलेटर वापरून पहा
ते स्वतः वापरून पहा →