Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:00148344n
Noun Concept
Categories: Modular arithmetic, Elementary number theory
EN
reduced residue system  Reduce Residue System
EN
In mathematics, a subset R of the integers is called a reduced residue system modulo n if: gcd = 1 for each r in R, R contains φ elements, no two elements of R are congruent modulo n. Wikipedia
Definitions
Relations
Sources
EN
In mathematics, a subset R of the integers is called a reduced residue system modulo n if: gcd = 1 for each r in R, R contains φ elements, no two elements of R are congruent modulo n. Wikipedia
A set of φ integers such that each integer is relatively prime to n and no two are congruent modulo n Wikipedia Disambiguation
set of φ(n) integers such that each integer is relatively prime to n and no two are congruent modulo n Wikidata
IS A
subset
Wikipedia
EN
reduced residue system
Wikidata
EN
reduced residue system
Wikipedia Redirections
EN
Reduce Residue System

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License