Divisor-count conjecture for classes of upper k-gap balancing numbers
Divisor-count conjecture for classes of upper k-gap balancing numbers
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.
Progress summary
The conjecture remains unproved: numerical evidence and one prime-valued special case are known, but no general proof or counterexample has appeared.
The conjecture, stated in the 2018 paper on classes of gap balancing numbers, predicts that the number of classes for gap equals the number of positive divisors of . The paper gives numerical support but no proof and notes that no uniform bound is expected as varies.
Known results
- For , there are at least two classes; the number is at most .
- The divisor-count formula is known for odd when is prime, by work of Tekcan, Tayat, and Özbek.
Current status (as of August 2026): The general divisor-count conjecture remains open; no retrieved source reports a proof, counterexample, correction, or independently verified advance.
Sources
Sources & referencesView supporting material
Primary source
Jeremiah Bartz, Bruce Dearden and Joel Iiams, “Classes of Gap Balancing Numbers”, arXiv:1810.07895 (2018).
Solutions 1
Sign in to submit a solution.
Let and put . By the seed characterization following Proposition 4.1, the number of classes equals the number of pairs satisfying
With , this becomes
Conversely, every integer solution of (1) with and yields a unique admissible seed. Reduction modulo shows that is odd when is even and even when is odd. Hence , so
and gives .
Consider the Euclidean domain , with norm
Every prime is odd and satisfies . Therefore is a quadratic residue modulo , and splits in as
Because is a principal ideal domain and has norm , the factors can be chosen with
Writing , unique factorization shows that every element of norm has the form
where has norm . Distinct exponent vectors give distinct unit orbits. The norm-one units are
Restricting to positive elements removes the sign. Thus the positive elements of norm split into exactly
orbits under multiplication by .
Each orbit contains exactly one admissible seed. Indeed, since , there is a unique integer such that
Neither endpoint can occur, since equality would imply , impossible for odd . Writing , positivity of this element and its conjugate gives , and
Therefore (2) is equivalent to
which for integral is exactly . Hence each positive norm- orbit produces exactly one class seed.
The number of classes is consequently
Finally, is the ordinary cobalancing case with one class, agreeing with the single positive divisor of . Thus the formula holds for every .