Exact Covering System

A system of congruences mod with is called a Covering System if every Integer satisfies for at least one value of . A covering system in which each integer is covered by just onecongruence is called an exact covering system.

References

Guy, R. K. ``Exact Covering Systems.'' §F14 in Unsolved Problems in Number Theory, 2nd ed. New York: Springer-Verlag, pp. 253-256, 1994.

• 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
• k-Coloring
• Kei
• Keith Number
• Keller's Conjecture
• Kelvin Functions
• Kelvin's Conjecture
• Kelvin Transformation
• Kempe Linkage
• Kepler Conjecture
• Kepler-Poinsot Solid
• Kepler Problem
• Kepler's Equation
• Kepler's Folium
• Kepler Solid