Home On the Frobenius Problem for {ak, ak + 1, ak + a, . . . , ak + ak−1}
Article
Licensed
Unlicensed Requires Authentication

On the Frobenius Problem for {ak, ak + 1, ak + a, . . . , ak + ak−1}

  • Amitabha Tripathi
Published/Copyright: November 5, 2010
Become an author with De Gruyter Brill
Integers
From the journal Volume 10 Issue 5

Abstract

For positive integers a, k, let denote the sequence ak, ak + 1, ak + a, . . . , ak + ak−1. Let denote the set of integers that are expressible as a linear combination of elements of with non-negative integer coefficients. We determine and which denote the largest (respectively, the number of) positive integer(s) not in . We also determine the set of positive integers not in which satisfy , where = \ {0}.

Received: 2009-11-14
Revised: 2010-05-07
Accepted: 2010-05-13
Published Online: 2010-11-05
Published in Print: 2010-November

© de Gruyter 2010

Downloaded on 29.9.2025 from https://www.degruyterbrill.com/document/doi/10.1515/integ.2010.044/html
Scroll to top button