ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let P(x)∈Z[x]P(x)\in\mathbb{Z}[x] have positive leading coefficient, and let g:N→D:={z∈C:∣z∣=1}g:\mathbb{N}\to\mathbb{D}:=\{z\in\mathbb{C}:|z|=1\} be a multiplicative function taking values in roots of unity. The pair (P,g)(P,g) is admissible if there exists a prime pp such that the sequence (g(pvp(P(n))))n≥1\bigl(g(p^{v_p(P(n))})\bigr)_{n\geq1} is not constant. Let g(N)g(\mathbb{N}) denote the image of gg on the natural numbers.

Multiplicative functions at polynomials conjecture. If (P,g)(P,g) is admissible and v∈g(N)v\in g(\mathbb{N}), then there are infinitely many n∈Nn\in\mathbb{N} such that g(P(n))≠vg(P(n))\neq v.

Non-admissibility forces g(P(n))g(P(n)) to be constant, so admissibility is necessary. The conjecture generalizes the corresponding question for the Liouville function; the source does not state a resolution.

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.