Factorial-plus-one bump conjecture for D(n)D(n)

About 6 years old · traced to

Define

D(n)=H(n!+1),D(n)=H(n!+1),

with the definition appearing in the paper.

The D(n)D(n) bump conjecture. There are arbitrarily large nn such that

D(n)<D(n+1).D(n)<D(n+1).

This is presented as one of the analogous bump conjectures for the four functions associated with factorials; the supplied text gives no proof or resolution.

References

Primary source

Joshua Zelinsky, “On the small prime factors of a non-deficient number”, arXiv:2005.12118 (2022).

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.