The reciprocal counting-function conjecture for square and hexagonal lattices

From papers

Let b1b_1 and b3b_3 be the characteristic functions of the integers represented by X2+Y2X^2+Y^2 and X2+3Y2X^2+3Y^2, respectively. Define

μf(x)=nxf(n)n.\mu_f(x)=\sum_{n\leq x}\frac{f(n)}{n}.

Reciprocal counting-function conjecture. For every xx, one has

μb1(x)μb3(x).\mu_{b_1}(x)\geq\mu_{b_3}(x).

The paper notes that the main counting-function conjecture implies this one, but the supplied text does not state a separate proof or resolution.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Pieter Moree and Herman J. J. te Riele, “The hexagonal versus the square lattice”, arXiv:math/0204332 (2002).

Solutions 0

No solutions have been posted yet.