ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let g±1,d(x)=xd+ad−1xd−1+⋯+a0g_{\pm1,d}(x)=x^d+a_{d-1}x^{d-1}+\dots+a_0 be a monic polynomial of odd positive degree dd, where each aia_i is independently +1+1 or −1-1 with probability 12\frac{1}{2}. Rademacher linear-factor conjecture. The probability that g±1,d(x)g_{\pm1,d}(x) has a linear factor x+1x+1 or x−1x-1, conditioned on g±1,d(x)g_{\pm1,d}(x) being reducible, goes to 11 as dd goes to infinity. For odd degree, these are the relevant integer linear factors and provide the asymptotic lower bound discussed in the source; the conjecture predicts that they account for asymptotically all reducibility.

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.