The logarithmic lower-bound conjecture for the Schemmel iteration function
Let be the function introduced in the paper, and let be an odd integer greater than . The logarithmic lower-bound conjecture.
The conjecture proposes a lower bound for the number of iterations measured by . The paper gives numerical motivation and discusses upper bounds, but does not establish this lower bound.
References
- Colin Defant, “On Arithmetic Functions Related to Iterates of the Schemmel Totient Functions”, arXiv:1506.05426 (2015).
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.