ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let N≥1N\geq 1, let N\mathbb{N} denote the nonnegative integers, and let 1=(1,…,1)∈NN\mathbf{1}=(1,\ldots,1)\in\mathbb{N}^N. For s=(s1,…,sN)∈NN\mathbf{s}=(s_1,\ldots,s_N)\in\mathbb{N}^N, define

U0={s∈NN∣si∈{0,1}}.U_{\mathbf{0}}=\{\mathbf{s}\in\mathbb{N}^N\mid s_i\in\{0,1\}\}.

Let (mk)f\binom{m}{\mathbf{k}}_f denote the ff-weighted vector-composition coefficient. Weighted vector-composition prime criterion. If f(x)=1f(\mathbf{x})=1 for every x∈U0\mathbf{x}\in U_{\mathbf{0}}, then an integer q>1q>1 is prime if and only if mm divides

(mq1−2m1)f\binom{m}{q\mathbf{1}-2m\mathbf{1}}_f

for every integer mm satisfying 0≤2m≤q0\leq 2m\leq q. This proposed criterion extends the Mann–Shanks prime criterion from integer compositions to weighted vector compositions; its status is not established in the supplied text.

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.