ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let fk(n)f_k(n) denote the number of gleeful representations of the integer nn with parameter kk. The universal finiteness conjecture. For every integer k≥3k\ge 3, there are finitely many integers nn with fk(n)>1f_k(n)>1. The claim is presented as a stronger version of the preceding fixed-kk finiteness heuristic; no examples with k>2k>2 were found, and the conjecture 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.