Divisibility and sum condition for ceiling-function recursions
Statement
Let , , , , and define a recursion
Suppose that , , and the ceiling function satisfies this recursion. Divisibility and sum conjecture. Then does not divide any , and
The claim is motivated by empirical evidence that the ceiling function solves many such recursions. The source gives no resolution beyond this evidence, so the conjecture remains open.
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.