Coin Problem
Let there be 
Integers 
with 
(all Relatively Prime). For large enough 
, there is a solution in NonnegativeIntegers 
. The greatest 
for which there is no solution is called thecoin problem. Sylvester showed
and an explicit solution is known for
, but no closed form solution is known for larger 
.
References
Guy, R. K. ``The Money-Changing Problem.'' §C7 in Unsolved Problems in Number Theory, 2nd ed. New York: Springer-Verlag, pp. 113-114, 1994.
- Sonine's Integral
- Sophie Germain Prime
- Sorites Paradox
- Sorting
- Sort-Then-Add Sequence
- Source
- Sous-Double
- Souslin Set
- Souslin's Hypothesis
- Sous-Triple
- Space
- Space Conic
- Space Curve
- Space Diagonal
- Space Distance
- Space Division
- Space-Filling Curve
- Space-Filling Function
- Space-Filling Polyhedron
- Space Groups
- Space of Closed Paths
- Span (Geometry)
- Span (Link)
- Span (Polynomial)
- Span (Set)