Maximal gcd conjecture for Lucas sequences
Statement
Let be a Lucas sequence, and let denote the gcd function associated with it. Assume that . Then the maximal gcd conjecture asserts that
The conjecture is motivated by the expected abundance of positive integers dividing , analogous to the distribution of Carmichael numbers; such integers would force the maximum to be asymptotic to .
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.