Boyd et al.'s density conjecture for square-free trinomial discriminants

Let

S={nN:nn+(1)n(n1)n1 is square-free}.S=\left\{n\in\mathbb N:n^n+(-1)^n(n-1)^{n-1}\text{ is square-free}\right\}.

Here a positive integer is square-free if it is not divisible by the square of any prime, and the natural density of SS is the limiting proportion of positive integers in SS.

Boyd et al.'s conjecture. The set SS has density

0.9934466,0.9934466\ldots,

with the displayed decimal correct to that many decimal places.

The quantity is, up to sign conventions, the discriminant of the trinomial xnx1x^n-x-1. The source reports computational evidence and sporadic nonsquare-free values, but does not give a proof of the asserted density.

Sources & referencesView supporting material

Primary source

Biswajit Koley and A. Satyanarayana Reddy, “Survey on irreducibility of trinomials”, arXiv:2012.07568 (2020).

Progress summary

Never refreshed

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

Solutions 0

No solutions have been posted yet.