Strictly chained (p,q)-ary partitions
classification
🧮 math.NT
cs.DMmath.CO
keywords
partitionssomechainedconditionsconsiderdivisibilityencodingestimates
read the original abstract
We consider a special type of integer partitions in which the parts of the form $p^aq^b$, 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.