2000 character limit reached
Fibonacci-like property of partition function (2308.06289v1)
Published 10 Aug 2023 in math.NT
Abstract: The main result of the paper is the Fibonacci-like property of the partition function. The partition function $p(n)$ has a property: $p(n) \leq p(n-1) + p(n-2)$. Our result shows that if we impose certain restrictions on the partition, then the inequality becomes an equality. Furthermore, we extend this result to cases with a greater number of summands.
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.