The finite Ruth–Aaron triple conjecture

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 triple is a sequence n,n+1,n+2n,n+1,n+2 of consecutive integers with equal values of ff. Finite Ruth–Aaron triple conjecture. There are only finitely many integers nn such that

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

The conjecture is motivated by the reported rarity of Ruth–Aaron triples. The source proves only a conditional boundedness result under a growth assumption and a uniform-distribution assumption, so the unconditional assertion remains open.

Sources & referencesView supporting material

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.