ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For a positive integer n=∏i=1kpiain=\prod_{i=1}^k p_i^{a_i}, define

f(n)=∑i=1kaipi.f(n)=\sum_{i=1}^k a_i p_i.

A Ruth–Aaron number is an integer nn satisfying f(n)=f(n+1)f(n)=f(n+1). Erdős's infinitude conjecture. There are infinitely many integers nn such that

f(n)=f(n+1).f(n)=f(n+1).

This is the named Erdős conjecture appearing in the paper's future-work discussion. The source gives examples and partial counting results but no proof or disproof of infinitude.

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.