ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let k≥0k\geq 0 be an integer. An upper kk-gap balancing number is a balancing number associated with a gap of kk, and solutions are grouped into classes as in the paper. Divisor-count conjecture. The number of classes of upper kk-gap balancing numbers is equal to the number of positive divisors of 2k2−12k^2-1. There appears to be no uniform upper bound on the number of such classes as kk varies; the conjecture is supported by numerical evidence for the values of kk 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.