The weighted vector-composition prime criterion

Let N1N\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={sNNsi{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 xU0\mathbf{x}\in U_{\mathbf{0}}, then an integer q>1q>1 is prime if and only if mm divides

(mq12m1)f\binom{m}{q\mathbf{1}-2m\mathbf{1}}_f

for every integer mm satisfying 02mq0\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.

Sources & referencesView supporting material

Primary source

Steffen Eger, “The Combinatorics of Weighted Vector Compositions”, arXiv:1704.04964 (2018).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.