Residue (Congruence)
The number 
in the Congruence 
is called the residue of 
(mod 
). The residue of large numberscan be computed quickly using Congruences. For example, to find 
(mod 17), note that
 |  |  | |
 | |  | |
 | |  | |
 | |  |
so
See also Common Residue, Congruence, Minimal Residue
References
Shanks, D. Solved and Unsolved Problems in Number Theory, 4th ed. New York: Chelsea, pp. 55-56, 1993.
- Kac Formula
- Kac Matrix
- Kakeya Needle Problem
- Kakutani's Fixed Point Theorem
- Kakutani's Problem
- Kalman Filter
- Kampyle of Eudoxus
- KAM Theorem
- Kanizsa Triangle
- Kantorovich Inequality
- Kaplan-Yorke Conjecture
- Kaplan-Yorke Dimension
- Kaplan-Yorke Map
- Kappa Curve
- Kaprekar Number
- Kaprekar Routine
- Kaps-Rentrop Methods
- Kapteyn Series
- Karatsuba Multiplication
- k-ary Divisor
- Katona's Problem
- Kauffman Polynomial F
- Kauffman Polynomial X
- k-Chain
- k-Circuit