2000 character limit reached
Strictly chained (p,q)-ary partitions
Published 1 Dec 2012 in math.NT, cs.DM, and math.CO | (1212.0048v1)
Abstract: We consider a special type of integer partitions in which the parts of the form $paqb$, for some relatively prime integers $p$ and $q$, are restricted by divisibility conditions. We investigate the problems of generating and encoding those partitions and give some estimates for several partition functions.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.