ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let pk(n)p^k(n) denote the number of partitions of nn into perfect kk-th powers. In particular, p2(n)p^2(n) is the square power partition function, and let a,ba,b be positive integers.

Square power partition function inequality conjecture. The inequality

p2(a)p2(b)≥p2(a+b)p^2(a)p^2(b)\geq p^2(a+b)

has equality and failure exactly in the instances listed in the source's table: equality for a=1a=1, b=1,2,4,5,6,9,10,13,14,18,22b=1,2,4,5,6,9,10,13,14,18,22; a=2a=2, b=4,5,9,13b=4,5,9,13; a=3a=3, b=4b=4; a=4a=4, b=5,6,7b=5,6,7; a=5a=5, b=5,6,8,11,15b=5,6,8,11,15; a=6a=6, b=8,10,12,14b=8,10,12,14; and a=7a=7, b=8,9,12,13,19b=8,9,12,13,19, with the listed complementary instances of failure.

The claim refines the eventual multiplicative inequality for restricted partition functions by identifying its exceptional small-index behavior. The source gives no resolution beyond presenting these instances as a conjectural pattern.

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.