Lang's conjecture on lower bounds for linear forms in logarithms
Statement
Let . For rational positive numbers and integers , define
Assume that . Lang's conjecture. There exists a constant depending only on such that
This is a conjectural lower bound for nonzero linear forms in logarithms of rational numbers. In the paper it is discussed as an input that would yield stronger estimates for values of binomial forms; its resolution status is not established in the supplied text.
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.