Finiteness of multiply gleeful numbers for every exponent at least 3
Statement
Let denote the number of gleeful representations of the integer with parameter . The universal finiteness conjecture. For every integer , there are finitely many integers with . The claim is presented as a stronger version of the preceding fixed- finiteness heuristic; no examples with 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.