Erdős's infinitude conjecture for Ruth–Aaron numbers

At least 5 years old · documented by

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.

References

Primary source

Yanan Jiang and Steven J. Miller, “Generalizing Ruth-Aaron Numbers”, arXiv:2010.14990 (2020).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.