Non-almost-realizability conjecture for the partition numbers
Statement
For , let be the number of partitions of , meaning unordered sums of positive integers.
Partition-number conjecture. The sequence
of partition numbers is not almost realizable.
This conjecture concerns the realizability framework developed for combinatorial sequences. The source motivates it by computational evidence, while its status remains unresolved.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.