1 Introduction
1.1 The coin exchange problem of Frobeniu□<□r> 1.□ The Frobenius number is well defired
1.3 Amitabha Tripathi's result□<□r> 1.4 Goal of this paper
□ The two-coin problem
□.1 Tie Frobenius number for two coif□<□r> □.□ Sylvester's Theorem
□.3 More coin□<□r>3 More than one representation
3.□ □-representable integer□<□r> 3.□ Beck-Robins, □0[3
3.3 Brown et al, □010
3.4 Shailit-Stankewicz, □010
3.5 Our contribution
3.6 s-representable integers under two coif□<□r>4 Two pro□□□ition□<□r>5 The Main Theorem
5.1 Tripathi's Theorem
5.□ Extending Tripathi's Theorem
5.3 The Main Theorem
Bibliography
編輯手記