ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let pp be a prime, let L(p)L(p) be defined by

L(p)={(p−1)/4if p≡1(mod8),(p+1)/4if p≡3(mod8),(p+3)/4if p≡5(mod8),(p−3)/4if p≡7(mod8),L(p)=\begin{cases}(p-1)/4&\text{if }p\equiv1\pmod 8,\\(p+1)/4&\text{if }p\equiv3\pmod 8,\\(p+3)/4&\text{if }p\equiv5\pmod 8,\\(p-3)/4&\text{if }p\equiv7\pmod 8,\end{cases}

and let U1(p)U_1(p) denote the number of unconnected graphs in the linear family. Exact-count conjecture. For any prime p>31p>31, U1(p)=L(p)U_1(p)=L(p). The computations reported in the source support this equality for the tested primes up to 30413041, but no proof or resolution 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.