### Abstract

We examine a version of the Universal Number Partition Problem with a divisibility property referred to as the Universal Shelf Packing Problem (USPP). We show that if a shelf length is a product of powers of two primes the USPP is always partitionable. In the case where the shelf length is a product of three distinct primes we propose an efficient scheme to determine when such a case is not partitionable. We also show that a shelf length that is a product of powers of four or more primes always has at least one partition failure. Our analysis uses elementary number theory, known results related to the linear Diophantine Frobenius problem, and a new result on Frobenius gaps.

Original language | English (US) |
---|---|

Pages (from-to) | 1692-1698 |

Number of pages | 7 |

Journal | Discrete Mathematics |

Volume | 312 |

Issue number | 10 |

DOIs | |

State | Published - May 28 2012 |

### Keywords

- Frobenius problem
- Integer partitions
- Packing

### ASJC Scopus subject areas

- Theoretical Computer Science
- Discrete Mathematics and Combinatorics

## Fingerprint Dive into the research topics of 'Universal number partition problem with divisibility'. Together they form a unique fingerprint.

## Cite this

*Discrete Mathematics*,

*312*(10), 1692-1698. https://doi.org/10.1016/j.disc.2012.01.022