ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let T(n)\mathcal T(n) be the set of ternary partitions of nn, meaning partitions whose parts are powers of 33, and define

s(n)=numT(n,−1).s(n)=\mathrm{num}_{\mathcal T}(n,-1).

Ternary-partition evaluation conjecture. One has s(1)=s(2)=1s(1)=s(2)=1 and, for every relevant integer nn,

s(3n)=s(3n+1)=s(3n+2)=3val3((3n)!).s(3n)=s(3n+1)=s(3n+2)=3^{\mathrm{val}_3((3n)!)}.

This is one of the open questions proposed for restricted partition sets and remains open.

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.