(mathematics) Two integers are said to be congruent modulo N (where N is some integer) if they have the same remainder when divided by N.
| Sci-Tech Dictionary: modulo N |
(mathematics) Two integers are said to be congruent modulo N (where N is some integer) if they have the same remainder when divided by N.
| 5min Related Video: modulo N |
| modulo N check (computer science) | |
| complete residue system modulo n (mathematics) | |
| reduced residue system modulo n (mathematics) |
| What is a n? Read answer... | |
| What is an n? Read answer... | |
| What is N? Read answer... |
| Construct a table of power of integers modulo n and find the primitive roots of n when n18? | |
| Modulo art pictures and how to do it? | |
| Were is your electric modulo in 2001 winstar? |
Copyrights:
![]() | Sci-Tech Dictionary. McGraw-Hill Dictionary of Scientific and Technical Terms. Copyright © 2003, 1994, 1989, 1984, 1978, 1976, 1974 by McGraw-Hill Companies, Inc. All rights reserved. Read more |
Mentioned in