ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let n=p1⋯ptn=p_1\cdots p_t be square-free, and let ω(d)\omega(d) denote the number of primes dividing dd. The parity-product conjecture. B(n)B(n) is attained by at least one of the two polynomials

∏d∣n, ω(d)≡1(mod2)Φd(x)\prod_{d\mid n,\,\omega(d)\equiv 1\pmod{2}}\Phi_d(x)

or

∏d∣n, ω(d)≡0(mod2)Φd(x).\prod_{d\mid n,\,\omega(d)\equiv 0\pmod{2}}\Phi_d(x).

The conjecture is true when t=1t=1 and t=2t=2, and the source reported computational support for the listed cases. Its validity for general square-free nn remained open.

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.