#### Filter Results:

- Full text PDF available (1)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Laura L. Dolph, Annmarie Reynolds, James A. Sellers
- Discrete Mathematics
- 2000

We discuss a family of restricted m–ary partition functions b m,j (n), which is the number of m–ary partitions of n with at most i + j copies of the part m i allowed. We then use generating function dissections to prove the following family of congruences for 1 ≤ t ≤ m − 1 and 2 ≤ k ≤ m − t + 1:

- ‹
- 1
- ›