An extension of the Frobenius coin-exchange problem

Details An extension of the Frobenius coin-exchange problem An extension of the Frobenius coin-exchange problem

2002-04-02

arxiv.org/abs/math/0204037v1

Number Theory. New York Seminar 2003 (D. Chudnovsky, G. Chudnovsky, M. Nathanson, eds.), 2004, Springer, 17-23.

Mathematics

Number Theory

8 pages

Scientific paper

Given positive integers $a_1,...,a_n$ with $\gcd(a_1,...,a_n) = 1$, we call an integer t representable if there exist nonnegative integers $m_1,...,m_n$ such that $t = m_1 a_1 + ... + m_n a_n$. In this paper, we discuss the linear diophantine problem of Frobenius: namely, find the largest integer which is not representable. We call this largest integer the Frobenius number $g(a_1,...,a_n)$. We extend this problem to asking for the smallest integer $g_k(a_1,...,a_d)$ beyond which every integer is represented more than k times. We concentrate on the case d=2 and prove statements about $g_k(a,b)$ similar in spirit to classical results known about g(a,b).

Affiliated with

Also associated with

No associations

Rating

An extension of the Frobenius coin-exchange problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with An extension of the Frobenius coin-exchange problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An extension of the Frobenius coin-exchange problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-316741