ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For integers k<k′k<k' let fk(n)f_k(n) and fk′(n)f_{k'}(n) count the corresponding gleeful representations of nn. The simultaneous-duplicate conjecture. If k′=3k'=3 or 44, then there are infinitely many integers nn with both f2(n)>1f_2(n)>1 and fk′(n)>1f_{k'}(n)>1. The heuristic predicts infinitely many examples in these two cases; three examples are known for k′=3k'=3, while no 22-44 examples were found below 101810^{18}, so 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.