The binary-representation conjecture for fractional parts of binomial coefficients
Statement
Let be a prime, let , and let be the standard base- representation of . Let . Write for the leading digit in the base- representation of , let denote the number of zeros in the standard binary representation of , and let be the unique integer with and . Binary-representation conjecture. The quantity
is odd if and only if
for some . This criterion is intended to determine the fractional part of from the binary representation of ; its resolution is not given here.
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.