Divisor-count conjecture for classes of upper k-gap balancing numbers
Statement
Let be an integer. An upper -gap balancing number is a balancing number associated with a gap of , and solutions are grouped into classes as in the paper. Divisor-count conjecture. The number of classes of upper -gap balancing numbers is equal to the number of positive divisors of . There appears to be no uniform upper bound on the number of such classes as varies; the conjecture is supported by numerical evidence for the values of examined in the paper, but no proof is given.
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.