This article proves that nth Lehmer numbers have at least two primitive divisors when specific conditions are met, suggesting new implications for number theory.
In this article we build on the work of Schinzel {schinzelI}, and prove that if n>4, n≠6, n/(ηκ) is an odd integer, and the triple (n,α,β), in case (α−β)2>0, is not equivalent to a triple (n,α,β) from an explicit able, then the nth Lehmer number un(α,β) has at least two primitive divisors.
No takes yet. Share an insight, caveat, or question.
Robert Juričević (2009) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: