1. On a problem on restricted k-colored partitions
- Author
-
Yong-Gao Chen and Wu-Xia Ma
- Subjects
Combinatorics ,TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES ,Algebra and Number Theory ,Colored ,Arithmetic progression ,ComputingMethodologies_DOCUMENTANDTEXTPROCESSING ,Congruence (manifolds) ,Partition (number theory) ,ComputingMilieux_MISCELLANEOUS ,Mathematics - Abstract
Let [Formula: see text] be the number of [Formula: see text]-colored partitions of [Formula: see text]. Recently, Keith proved that for [Formula: see text], if [Formula: see text] for all [Formula: see text], then [Formula: see text] is large. We prove that such [Formula: see text] do not exist. Furthermore, for any positive integers [Formula: see text] with [Formula: see text], there exist infinitely many positive integers [Formula: see text] such that [Formula: see text], where [Formula: see text].
- Published
- 2021