Photo from wikipedia
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… Click to show full 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].
Keywords:
problem restricted;
colored partitions;
formula see;
see text;
text formula
Journal Title: International Journal of Number Theory
Year Published: 2021
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!
Journal Title: International Journal of Number Theory
Year Published: 2021
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!