Klostermeyer et al.'s row-count formula conjecture for the Pascal rhombus
Statement
Let be the number of ones in row of the Pascal rhombus, with entries reduced modulo . Klostermeyer et al.'s row-count formula conjecture. Then
The formula predicts the number of odd entries in power-of-two rows and is part of the proposed structural theory of the Pascal rhombus modulo ; the source gives no resolution evidence.
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.