Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Modular arithmetic
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
== See also == {{Div col|colwidth=25em}} * [[Boolean ring]] * [[Circular buffer]] * [[Division (mathematics)]] * [[Finite field]] * [[Legendre symbol]] * [[Modular exponentiation]] * [[Modulo (mathematics)]] * [[Multiplicative group of integers modulo n]] * [[Pisano period]] (Fibonacci sequences modulo ''n'') * [[Primitive root modulo n]] * [[Quadratic reciprocity]] * [[Quadratic residue]] * [[Rational reconstruction (mathematics)]] * [[Reduced residue system]] * [[Serial number arithmetic]] (a special case of modular arithmetic) * [[Two-element Boolean algebra]] * Topics relating to the group theory behind modular arithmetic: ** [[Cyclic group]] ** [[Multiplicative group of integers modulo n]] * Other important theorems relating to modular arithmetic: ** [[Carmichael function|Carmichael's theorem]] ** [[Chinese remainder theorem]] ** [[Euler's theorem]] ** [[Fermat's little theorem]] (a special case of Euler's theorem) ** [[Lagrange's theorem (group theory)|Lagrange's theorem]] ** [[Thue's lemma]] {{div col end}}
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)