When Is the Number of True Different Permutation Polynomials Equal to 0?

Abstract

In this paper, we have obtained the prime factorization form of positive integers N for which the number of true different fourth- and fifth-degree permutation polynomials (PPs) modulo N is equal to zero. We have also obtained the prime factorization form of N so that the number of any degree PPs nonreducible at lower degree PPs, fulfilling Zhao and Fan (ZF) sufficient conditions, is equal to zero. Some conclusions are drawn comparing all fourth- and fifth-degree permutation polynomials with those fulfilling ZF sufficient conditions.

1. Introduction

Permutation polynomials (PPs) are used in cryptography, sequence generation, or as interleavers in turbo codes [1,2,3]. Recently, some results were obtained regarding the number of true different (td) PPs modulo a positive integer N, whose definition is provided in Section 2.

In [4], the number of td quadratic permutation polynomials (QPPs) was obtained. Then, in [5], the method from [4] was applied to determine the number of td cubic permutation polynomials (CPPs) for N equal to a multiple of 8 as interleaver lengths from the long-term evolution (LTE) standard [6]. The method proposed in [7] is based on the Chinese remainder theorem and on two other important theorems regarding PPs, and it aims to get the number of td PPs. By using it, the number of td QPPs and CPPs for every N were obtained. In [8,9], the method from [7] was used to determine the number of td CPPs, fourth-degree PPs (4-PPs), and fifth-degree PPs (5-PPs) under Zhao and Fan (ZF) sufficient conditions given in [10]. In [11], an algorithm to determine the number of td PPs of degrees up to five, based on the Weng and Dong (WD) algorithm from [12], was given.

In this paper, we obtain some new results as follows. We determine the form of prime factorization of N so that the number of td 4-PPs and 5-PPs is equal to 0, and the form of prime factorization of N so that the number of any degree PPs nonreducible at lower degree PPs, fulfilling ZF sufficient conditions, is equal to 0. Thus, these values of N do not have to be used as 4-PP or 5-PP interleaver lengths because some smaller degree PPs are equivalent to 4-PP or 5-PP, providing the same permutations. A similar conclusion holds when we want to find PP interleavers under ZF sufficient conditions.

The paper is structured as follows. In Section 2, we recall the algorithm from [11], which is based on the WD algorithm [12]. In Section 3, we obtain a necessary condition so that the number of td PPs of a certain degree is equal to 0 (Lemma 1). Using the result from Lemma 1 in Section 3.1, Section 3.2, Section 3.3 and Section 3.4, we obtain the form of N’s prime factorization so that the number of td QPPs, CPPs, 4-PPs, and 5-PPs is equal to 0, respectively. In Section 4, we obtain the number of null polynomials and the quantities required in the algorithm from [11] to determine the number of any degree td PPs fulfilling ZF sufficient conditions. Then, in Theorem 1, we obtain the prime factorization of N so that the number of any degree td PPs fulfilling ZF sufficient conditions is equal to 0. Section 5 concludes the paper.

2. Determining the Number of td PPs of Degree Up to Five by Using the WD Algorithm

Definition 1.

The polynomial of degree d, modulo N,

$$\pi \left(x\right)=q_0+q_{1}x+q_2{x}^2+\cdots +q_d{x}^d\left(\mathrm{mod}N\right),$$

(1)

where N is a positive integer, is a PP if the coefficients $q_k$, $k=1,\dots ,d$, are chosen so that the set $\left\{\pi \right(0),\pi (1),\dots ,\pi (N-1\left)\right\}$, modulo N, is a permutation of the set $\left\{0,1,\dots ,N-1\right\}$ of integers modulo N.

Definition 2.

A PP of degree d (d-PP) is named true if the permutation generated by it can not be generated by a PP of degree smaller than d.

Definition 3.

Two PPs are referred to as different if they generate two different permutations of the set $\{0,1,\dots ,N-1\}$.

Definition 4.

Two d-PPs are referred to as true different if they are both true and different.

Below, we give the algorithm given in [11] for determining the number of td PPs of degree up to five based on the WD algorithm.

(1)

Factor the positive integer N as

$$N=\prod _{k=1}^{s_1}{p}_{1,k}·\prod _{k=s_1+1}^{s_1+s_2}{p}_{2,k}^{n_{N,p_{2,k}}},$$

(2)

where $n_{N,p_{2,k}}>1$, $\forall k=s_1+1,\dots ,s_1+s_2$, $s_1\ge 0$ is the number of prime numbers at power of one in the factorization of N, $s_2\ge 0$ is the number of prime numbers at power greater than one in the factorization of N, and $s_1+s_2\ge 1$.

(2)

Compute the number of all d-PPs, for $1\le d\le 5$, with the formula

$$C_{N,d-PPs,\mathrm{all}}=\prod _{k=1}^{s_1}{C}_{p_{1,k},d-PPs}·\prod _{k=s_1+1}^{s_1+s_2}{C}_{p_{2,k},d-PPs}·{\left(p_{2,k}\right)}^{d·(n_{N,p_{2,k}}-1)},$$

(3)

where $C_{p_{1,k},d-PPs}$ and $C_{p_{2,k},d-PPs}$ are given in Table 1, Table 2 and Table 3, in columns with $n_{N,p}=1$ and $n_{N,p}>1$, respectively, for every prime type at power equal or greater than one and for any degree from one to five. In the first product from (3), quantities $C_{p_{1,k},d-PPs}$ have the values given in Table 1, Table 2 and Table 3 in columns with $n_{N,p}=1$. In the second product from (3), quantities $C_{p_{2,k},d-PPs}$ have the values given in Table 1, Table 2 and Table 3 in columns with $n_{N,p}>1$.

Table 1. The number of all linear permutation polynomials (LPPs) and quadratic permutation polynomials (QPPs) over ${\mathbb{Z}}_p$ permuting ${\mathbb{Z}}_{p^{n_{N,p}}}$, with $n_{N,p}\ge 1$.

p	${\mathit{n}}_{\mathit{N},\mathit{p}}=1$		${\mathit{n}}_{\mathit{N},\mathit{p}}>1$
	${\mathit{C}}_{\mathit{p},\mathit{LPPs}}$	${\mathit{C}}_{\mathit{p},\mathit{QPPs}}$	${\mathit{C}}_{\mathit{p},\mathit{LPPs}}$	${\mathit{C}}_{\mathit{p},\mathit{QPPs}}$
2	1	2	1	1
$p>2$	$p-1$	$p-1$	$p-1$	$p-1$

Table 2. The number of all cubic permutation polynomials (CPPs) and fourth-degree permutation polynomials (4-PPs) over ${\mathbb{Z}}_p$ permuting ${\mathbb{Z}}_{p^{n_{N,p}}}$, with $n_{N,p}\ge 1$.

p	${\mathit{n}}_{\mathit{N},\mathit{p}}=1$		${\mathit{n}}_{\mathit{N},\mathit{p}}>1$
	${\mathit{C}}_{\mathit{p},\mathit{CPPs}}$	${\mathit{C}}_{\mathit{p},\mathbf{4}-\mathit{PPs}}$	${\mathit{C}}_{\mathit{p},\mathit{CPPs}}$	${\mathit{C}}_{\mathit{p},\mathbf{4}-\mathit{PPs}}$
2	4	8	1	2
3	6	18	4	4
5	24	24	4	4
7	6	90	6	6
$1\left(\mathrm{mod}3\right)$,	$p-1$	$p-1$	$p-1$	$p-1$
$p>7$
$2\left(\mathrm{mod}3\right)$,	$p^2-1$	$p^2-1$	$p-1$	$p-1$
$p>5$

Table 3. The number of all fifth-degree permutation polynomials (5-PPs) over ${\mathbb{Z}}_p$ permuting ${\mathbb{Z}}_{p^{n_{N,p}}}$, with $n_{N,p}\ge 1$.

p	${\mathit{n}}_{\mathit{N},\mathit{p}}=1$	${\mathit{n}}_{\mathit{N},\mathit{p}}>1$
	${\mathit{C}}_{\mathit{p},\mathbf{5}-\mathit{PPs}}$	${\mathit{C}}_{\mathit{p},\mathbf{5}-\mathit{PPs}}$
2	16	4
3	54	16
5	120	56
7	720	258
13	2976	1884
$1\left(\mathrm{mod}15\right)$	$p-1$	$p-1$
$11\left(\mathrm{mod}15\right)$	$p^2-1$	$p-1$
$7\left(\mathrm{mod}15\right)$ or $13\left(\mathrm{mod}15\right),$ $p>13$	$p^3-p^2+p-1$	$p^3-2p^2+2p-1$
$2\left(\mathrm{mod}15\right)$ or $8\left(\mathrm{mod}15\right),$ $p>2$	$p^3-1$	$p^3-2p^2+2p-1$
$4\left(\mathrm{mod}15\right)$	$p^2-1$	$p-1$
$14\left(\mathrm{mod}15\right)$	$(p-1)(2p+1)$	$p-1$

(3)

Compute the number of different d-PPs, for $2\le d\le 5$, with the formula

$$C_{N,d-PPs,\mathrm{diff}}=\frac{C_{N,d-PPs,\mathrm{all}}}{{\prod }_{k=2}^{d}gcd(k!,N)}.$$

(4)

(4)

Compute the number of td d-PPs, for $2\le d\le 5$, with the recursive formula

$$C_{N,d-PPs,\mathit{td}}=C_{N,d-PPs,\mathrm{diff}}-\sum _{k=1}^{d-1}{C}_{N,k-PPs,\mathit{td}},$$

(5)

where $C_{N,1-PPs,\mathit{td}}=C_{N,1-PPs,\mathrm{all}}$.

3. Determining Positive Integers $\mathit{N}$ so that the Number of td PPs of Degree Up to Five Is Equal to 0

Below, we first obtain a formula equivalent to (5), which is more appropriate for the aim of this paper. We use (4) in (5) when $d=2$, and we obtain

$$C_{N,QPPs,\mathit{td}}=\frac{C_{N,2-PPs,\mathrm{all}}}{gcd(2,N)}-C_{N,1-PPs,\mathrm{all}}.$$

(6)

We use (4) and (6) in (5) when $d=3$, and we obtain

$$C_{N,CPPs,\mathit{td}}=\frac{C_{N,3-PPs,\mathrm{all}}}{gcd(2,N)·gcd(6,N)}-\frac{C_{N,2-PPs,\mathrm{all}}}{gcd(2,N)}.$$

(7)

Using (4) and (7) in (5) when $d=4$, we obtain

$$C_{N,4-PPs,\mathit{td}}=\frac{C_{N,4-PPs,\mathrm{all}}}{gcd(2,N)·gcd(6,N)·gcd(24,N)}-\frac{C_{N,3-PPs,\mathrm{all}}}{gcd(2,N)·gcd(6,N)},$$

(8)

and using (4) and (8) in (5) when $d=5$, we obtain

$$\begin{array}{c}{C}_{N,5-PPs,\mathit{td}}=\frac{C_{N,5-PPs,\mathrm{all}}}{gcd(2,N)·gcd(6,N)·gcd(24,N)·gcd(120,N)}-\end{array}$$

$$\begin{array}{c}-\frac{C_{N,4-PPs,\mathrm{all}}}{gcd(2,N)gcd(6,N)·gcd(24,N)}.\end{array}$$

(9)

We note that the formula

$$C_{N,d-PPs,\mathit{td}}=\frac{C_{N,d-PPs,\mathrm{all}}}{{\prod }_{k=2}^{d}gcd(k!,N)}-\frac{C_{N,(d-1)-PPs,\mathrm{all}}}{{\prod }_{k=2}^{d-1}gcd(k!,N)}$$

(10)

is valid for each degree $d\ge 2$, but the quantities $C_{p_{1,k},d-PPs}$ and $C_{p_{2,k},d-PPs}$ in (3) are not known, as in Table 1, Table 2 and Table 3, for each degree d.

The values of N such that the number of td PPs of degrees up to five is equal to 0 can be derived by using Equations (3), (6)–(9), and Table 1, Table 2 and Table 3.

In the following, a lemma that states a necessary condition to obtain $C_{N,d-PPs,\mathit{td}}=0$, required to obtain the sought results, is given.

Lemma 1.

The number of td d-PPs is equal to 0 only if $n_{N,p_k}=1$ and only if $C_{p_k,d-PPs}=C_{p_k,(d-1)-PPs}$, or at most $\frac{C_{p_k,d-PPs}}{C_{p_k,(d-1)-PPs}}\mid gcd(d!,N)$ for each $p_k\mid N$ so that $p_k\nmid gcd(d!,N)$.

Proof. 

Condition $C_{N,d-PPs,\mathit{td}}=0$ in (10) is equivalent to

$$\frac{C_{N,d-PPs,\mathrm{all}}}{C_{N,(d-1)-PPs,\mathrm{all}}}=gcd(d!,N),$$

(11)

or taking into account (3),

$$\prod _{k=1}^{s_1}\frac{C_{p_{1,k},d-PPs}}{C_{p_{1,k},(d-1)-PPs}}·\prod _{k=s_1+1}^{s_1+s_2}\frac{C_{p_{2,k},d-PPs}}{C_{p_{2,k},(d-1)-PPs}}·{\left(p_{2,k}\right)}^{(n_{N,p_{2,k}}-1)}=gcd(d!,N).$$

(12)

Clearly, $C_{p_{1,k},d-PPs}\ge C_{p_{1,k},(d-1)-PPs}$$\forall k=\overline{1,s_1}$, and $C_{p_{2,k},d-PPs}\ge C_{p_{2,k},(d-1)-PPs}$, and ${\left(p_{2,k}\right)}^{(n_{N,p_{2,k}}-1)}>1$ for $n_{N,p_{2,k}}>1$$\forall k=\overline{s_1+1,s_1+s_2}$. Notation $\forall k=\overline{1,L}$, with L a positive integer, means $\forall k=1,2,\dots ,L$. Then, if $p_{2,k}\nmid gcd(d!,N)$ for some $k\in \{s_1+1,\dots ,s_1+s_2\}$, Equation (12) can be fulfilled only if $n_{N,p_{2,k}}=1$, and $C_{p_{2,k},d-PPs}=C_{p_{2,k},(d-1)-PPs}$ or $\frac{C_{p_{2,k},d-PPs}}{C_{p_{2,k},(d-1)-PPs}}\mid gcd(d!,N)$, and if $p_{1,k}\nmid gcd(d!,N)$ for some $k\in \{1,\dots ,s_1\}$, Equation (12) can be fulfilled only if $C_{p_{1,k},d-PPs}=C_{p_{1,k},(d-1)-PPs}$ or $\frac{C_{p_{1,k},d-PPs}}{C_{p_{1,k},(d-1)-PPs}}\mid gcd(d!,N)$. □

The cases when $p_k\mid N$ and $p_k\mid gcd(d!,N)$, for degrees of 2 up to 5, are approached separately in Section 3.1, Section 3.2, Section 3.3 and Section 3.4. To help in this purpose, in Table 4 and Table 5 the values of $\frac{C_{p_{1,k},d-PPs}}{C_{p_{1,k},(d-1)-PPs}}$ and $\frac{C_{p_{2,k},d-PPs}}{C_{p_{2,k},(d-1)-PPs}}$, for $d=2,3,4,5$, are given.

Table 4. The values $\frac{C_{p,d-PPs}}{C_{p,(d-1)-PPs}}$ for $d=2,3,4$.

p	${\mathit{n}}_{\mathit{N},\mathit{p}}=1$	${\mathit{n}}_{\mathit{N},\mathit{p}}>1$	${\mathit{n}}_{\mathit{N},\mathit{p}}=1$	${\mathit{n}}_{\mathit{N},\mathit{p}}>1$	${\mathit{n}}_{\mathit{N},\mathit{p}}=1$	${\mathit{n}}_{\mathit{N},\mathit{p}}>1$
	$\frac{{\mathit{C}}_{\mathit{p},\mathit{QPPs}}}{{\mathit{C}}_{\mathit{p},\mathit{LPPs}}}$	$\frac{{\mathit{C}}_{\mathit{p},\mathit{QPPs}}}{{\mathit{C}}_{\mathit{p},\mathit{LPPs}}}$	$\frac{{\mathit{C}}_{\mathit{p},\mathit{CPPs}}}{{\mathit{C}}_{\mathit{p},\mathit{QPPs}}}$	$\frac{{\mathit{C}}_{\mathit{p},\mathit{CPPs}}}{{\mathit{C}}_{\mathit{p},\mathit{QPPs}}}$	$\frac{{\mathit{C}}_{\mathit{p},\mathbf{4}-\mathit{PPs}}}{{\mathit{C}}_{\mathit{p},\mathit{CPPs}}}$	$\frac{{\mathit{C}}_{\mathit{p},\mathbf{4}-\mathit{PPs}}}{{\mathit{C}}_{\mathit{p},\mathit{CPPs}}}$
2	2	1	2	1	2	2
3	1	1	3	2	3	1
5	1	1	6	1	1	1
7	1	1	1	1	15	1
$1\left(\mathrm{mod}3\right)$, $p>7$	1	1	1	1	1	1
$2\left(\mathrm{mod}3\right)$, $p>5$	1	1	$p+1$	1	1	1

Table 5. The values $\frac{C_{p,5-PPs}}{C_{p,4-PPs}}$.

p	${\mathit{n}}_{\mathit{N},\mathit{p}}=1$	${\mathit{n}}_{\mathit{N},\mathit{p}}>1$
	$\frac{{\mathit{C}}_{\mathit{p},\mathbf{5}-\mathit{PPs}}}{{\mathit{C}}_{\mathit{p},\mathbf{4}-\mathit{PPs}}}$	$\frac{{\mathit{C}}_{\mathit{p},\mathbf{5}-\mathit{PPs}}}{{\mathit{C}}_{\mathit{p},\mathbf{4}-\mathit{PPs}}}$
2	2	2
3	3	4
5	5	14
7	8	43
13	248	157
$1\left(\mathrm{mod}15\right)$	1	1
$11\left(\mathrm{mod}15\right)$	1	1
$7\left(\mathrm{mod}15\right)$ or $13\left(\mathrm{mod}15\right),$ $p>13$	$p^2+1$	$p^2-p+1$
$2\left(\mathrm{mod}15\right)$ or $8\left(\mathrm{mod}15\right),$ $p>2$	$(p^2+p+1)/(p+1)$	$p^2-p+1$
$4\left(\mathrm{mod}15\right)$	$p+1$	1
$14\left(\mathrm{mod}15\right)$	$(2p+1)/(p+1)$	1

3.1. Determining Positive Integers N so That the Number of td QPPs Is Equal to 0

As can be seen from Table 4, the conditions in Lemma 1 are satisfied for each prime $p>2$.

When $gcd(2!,N)=2$, it results that $2\mid N$. Two subcases result.

When $p=2$ and $n_{N,2}=1$, equality $C_{N,QPPs,\mathit{td}}=0$ implies $\frac{C_{2,QPPs}}{C_{2,LPPs}}=2$. As we see in Table 4, the last condition is true.

When $p=2$ and $n_{N,2}>1$, equality $C_{N,QPPs,\mathit{td}}=0$ implies $\frac{C_{2,QPPs}}{C_{2,LPPs}}·2^{n_{N,2}-1}=2$, or, equivalently, $1·2^{n_{N,2}-1}=2$, or $n_{N,2}=2$. Thus, this solution is valid.

Concluding, the number of td QPPs results equal to 0 when N is of the form

$$N_{C_{N,QPPs,\mathit{td}}=0}=2^{n_{N,2}}·\prod _{k=2}^s{p}_k,\mathrm{with}{n}_{N,2}=\overline{0,2},p_k>2,\forall k=\overline{2,s},$$

(13)

as was previously obtained by a different method given in [7].

3.2. Determining Positive Integers N so That the Number of td CPPs Is Equal to 0

As can be seen from Table 4, the conditions in Lemma 1 are satisfied for primes of type $p=1\left(\mathrm{mod}3\right)$. In addition, if $gcd(3!,N)=6$, condition $\frac{C_{p,CPPs}}{C_{p,QPPs}}\mid gcd(3!,N)$ is met for $p=5$.

When $gcd(3!,N)>1$, the following cases result.

(1)

$gcd(3!,N)=2$, i.e., $2\mid N$ and $3\nmid N$

When $p=2$ and $n_{N,2}=1$, equality $C_{N,CPPs,\mathit{td}}=0$ implies $\frac{C_{2,CPPs}}{C_{2,QPPs}}=2$. As we see in Table 4, the last condition is true.

When $p=2$ and $n_{N,2}>1$, equality $C_{N,CPPs,\mathit{td}}=0$ implies $\frac{C_{2,CPPs}}{C_{2,QPPs}}·2^{n_{N,2}-1}=2$, or, equivalently, $1·2^{n_{N,2}-1}=2$ or $n_{N,2}=2$, a valid solution.

(2)

$gcd(3!,N)=3$, i.e., $2\nmid N$ and $3\mid N$

When $p=3$ and $n_{N,3}=1$, equality $C_{N,CPPs,\mathit{td}}=0$ implies $\frac{C_{3,CPPs}}{C_{3,QPPs}}=3$. As we see in Table 4, the last condition is true.

When $p=3$ and $n_{N,3}>1$, equality $C_{N,CPPs,\mathit{td}}=0$ implies $\frac{C_{3,CPPs}}{C_{3,QPPs}}·3^{n_{N,3}-1}=3$, or, equivalently, $2·3^{n_{N,3}-1}=3$. Thus, no integer solution $n_{N,3}$ of the last equation exists such that $n_{N,3}>1$.

(3)

$gcd(3!,N)=6$, i.e., $2\mid N$ and $3\mid N$

In the cases when $p=2$ and $n_{N,2}\in \{1,2\}$, and when $p=3$ and $n_{N,3}=1$, only one solution exists. Thus, we have to consider only the case when $n_{N,2}>2$ and $n_{N,3}>1$.

When $n_{N,2}>2$ and $n_{N,3}>1$, equality $C_{N,CPPs,\mathit{td}}=0$ implies $\frac{C_{2,CPPs}}{C_{2,QPPs}}·2^{n_{N,2}-1}·\frac{C_{3,CPPs}}{C_{3,QPPs}}·3^{n_{N,3}-1}=2·3$, or, equivalently, $1·2^{n_{N,2}-1}·2·3^{n_{N,3}-1}=2·3$. The last equation has no integer solutions so that $n_{N,2}>2$ and $n_{N,3}>1$. If $5\mid N$, $n_{N,5}=1$, $n_{N,2}>2$ and $n_{N,3}>1$, condition $C_{N,CPPs,\mathit{td}}=0$ implies $\frac{C_{2,CPPs}}{C_{2,QPPs}}·2^{n_{N,2}-1}·\frac{C_{3,CPPs}}{C_{3,QPPs}}·3^{n_{N,3}-1}·\frac{C_{5,CPPs}}{C_{5,QPPs}}=2·3$, or, equivalently, $1·2^{n_{N,2}-1}·2·3^{n_{N,3}-1}·6=2·3$. The last equation has also no solutions such that $n_{N,2}>2$ and $n_{N,3}>1$.

Concluding, the number of td CPPs results equal to 0 when N is of the form

$$\begin{array}{c}{N}_{C_{N,CPPs,\mathit{td}=0}}=2^{n_{N,2}}·3^{n_{N,3}}·{\displaystyle \prod _{k=3}^s}{p}_k,\end{array}$$

$$\begin{array}{c}\mathrm{with}{n}_{N,2}=\overline{0,2},n_{N,3}=\overline{0,1},p_k>3,\mathrm{with}{p}_k=1\left(\mathrm{mod}3\right),k=\overline{3,s},\end{array}$$

(14)

as was previously obtained by a different method given in [7].

3.3. Determining Positive Integers N so That the Number of td 4-PPs Is Equal to 0

From Table 4, we note that the conditions from Lemma 1 are fulfilled for each prime $p>7$ and for prime $p=5$.

When $gcd(4!,N)>1$, the following cases result:

(1)

$gcd(4!,N)=2^{n_{N,2}}$, with $n_{N,2}\in \{1,2,3\}$, i.e., $2^{n_{N,2}}\mid N$

When $p=2$ and $n_{N,2}=1$, equality $C_{N,4-PPs,\mathit{td}}=0$ implies $\frac{C_{2,4-PPs}}{C_{2,CPPs}}=2$. As we see in Table 4, the last condition is true.

When $p=2$ and $n_{N,2}\in \{2,3\}$, equality $C_{N,4-PPs,\mathit{td}}=0$ implies $\frac{C_{2,4-PPs}}{C_{2,CPPs}}·2^{n_{N,2}-1}=2^{n_{N,2}}$, or, equivalently, $2·2^{n_{N,2}-1}=2^{n_{N,2}}$. The last equation has as solutions both $n_{N,2}=2$ and $n_{N,2}=3$.

When $p=2$ and $n_{N,2}>3$, equality $C_{N,4-PPs,\mathit{td}}=0$ implies $\frac{C_{2,4-PPs}}{C_{2,CPPs}}·2^{n_{N,2}-1}=2^3$, or, equivalently, $2·2^{n_{N,2}-1}=2^3$. The last equation has no integer solutions such that $n_{N,2}>3$.

(2)

$gcd(4!,N)=3$, i.e., $2\nmid N$ and $3\mid N$

When $p=3$ and $n_{N,3}=1$, equality $C_{N,4-PPs,\mathit{td}}=0$ implies $\frac{C_{3,4-PPs}}{C_{3,CPPs}}=3$. As we see in Table 4, the last condition is true.

When $p=3$ and $n_{N,3}>1$, equality $C_{N,4-PPs,\mathit{td}}=0$ implies $\frac{C_{3,4-PPs}}{C_{3,CPPs}}·3^{n_{N,3}-1}=3$, or, equivalently, $1·3^{n_{N,3}-1}=3$. The last equation has as a valid solution $n_{N,3}=2$.

(3)

$gcd(4!,N)=2^{n_{N,2}}·3$, with $n_{N,2}\in \{1,2,3\}$, i.e., $2^{n_{N,2}}\mid N$ and $3\mid N$

Each of the above cases have solutions. Therefore, we do not have to consider this case because the same solutions result.

Concluding, the number of td 4-PPs results equal to 0 when N is of the form

$$\begin{array}{c}{N}_{C_{N,4-PPs,\mathit{td}=0}}=2^{n_{N,2}}·3^{n_{N,3}}·5^{n_{N,5}}·{\displaystyle \prod _{k=4}^s}{p}_k,\end{array}$$

$$\begin{array}{c}\mathrm{with}{n}_{N,2}=\overline{0,3},n_{N,3}=\overline{0,2},n_{N,5}=\overline{0,1},p_k>7,k=\overline{4,s}.\end{array}$$

(15)

3.4. Determining Positive Integers N so That the Number of td 5-PPs Is Equal to 0

As can be seen from Table 5, the conditions in Lemma 1 are satisfied for primes p of types $p=1\left(\mathrm{mod}15\right)$ and $p=11\left(\mathrm{mod}15\right)$. In addition, if $8\mid gcd(5!,N)$, condition $\frac{C_{p,5-PPs}}{C_{p,4-PPs}}\mid gcd(5!,N)$ is fulfilled for $p=7$, and if $20\mid gcd(5!,N)$, condition $\frac{C_{p,5-PPs}}{C_{p,4-PPs}}\mid gcd(5!,N)$ is fulfilled for $p=19$.

When $gcd(5!,N)>1$, the following cases result:

(1)

$gcd(5!,N)=2^{n_{N,2}}$, with $n_{N,2}\in \{1,2,3\}$, i.e., $2^{n_{N,2}}\mid N$, $3\nmid N$, and $5\nmid N$

When $p=2$ and $n_{N,2}=1$, equality $C_{N,5-PPs,\mathit{td}}=0$ implies $\frac{C_{2,5-PPs}}{C_{2,4-PPs}}=2$. As we see in Table 5, the last condition is true.

When $p=2$ and $n_{N,2}\in \{2,3\}$, equality $C_{N,5-PPs,\mathit{td}}=0$ implies $\frac{C_{2,5-PPs}}{C_{2,4-PPs}}·2^{n_{N,2}-1}=2^{n_{N,2}}$, or, equivalently, $2·2^{n_{N,2}-1}=2^{n_{N,2}}$. The last equation has as solutions both $n_{N,2}=2$ and $n_{N,2}=3$.

When $p=2$ and $n_{N,2}>3$, equality $C_{N,5-PPs,\mathit{td}}=0$ implies $\frac{C_{2,5-PPs}}{C_{2,4-PPs}}·2^{n_{N,2}-1}=2^3$, or, equivalently, $2·2^{n_{N,2}-1}=2^3$. The last equation has no integer solutions such that $n_{N,2}>3$.

When $7\mid N$, $n_{N,7}=1$, and $n_{N,2}>3$, equality $C_{N,5-PPs,\mathit{td}}=0$ implies $\frac{C_{2,5-PPs}}{C_{2,4-PPs}}·2^{n_{N,2}-1}·\frac{C_{7,5-PPs}}{C_{5,4-PPs}}=2^3$, or, equivalently, $2·2^{n_{N,2}-1}·8=2^3$. The last equation has no integer solutions such that $n_{N,2}>3$.

(2)

$gcd(3!,N)=3$, i.e., $2\nmid N$, $3\mid N$, and $5\nmid N$

When $p=3$ and $n_{N,3}=1$, equality $C_{N,5-PPs,\mathit{td}}=0$ implies $\frac{C_{3,5-PPs}}{C_{3,4-PPs}}=3$. As we see in Table 5, the last condition is true.

When $p=3$ and $n_{N,3}>1$, equality $C_{N,5-PPs,\mathit{td}}=0$ implies $\frac{C_{3,5-PPs}}{C_{3,4-PPs}}·3^{n_{N,3}-1}=3$, or, equivalently, $4·3^{n_{N,3}-1}=3$. The last equation has no integer solutions such that $n_{N,3}>1$.

(3)

$gcd(5!,N)=2^{n_{N,2}}·3$, with $n_{N,2}\in \{1,2,3\}$, i.e., $2^{n_{N,2}}\mid N$, $3\mid N$, and $5\nmid N$

Each of the cases when $p=2$ and $n_{N,2}\in \{1,2,3\}$, and when $p=3$ and $n_{N,3}=1$, have one solution. Thus, we have to consider only the case when $n_{N,2}>3$ and $n_{N,3}>1$.

When $n_{N,2}>3$ and $n_{N,3}>1$, equality $C_{N,5-PPs,\mathit{td}}=0$ implies $\frac{C_{2,5-PPs}}{C_{2,4-PPs}}·2^{n_{N,2}-1}·\frac{C_{3,5-PPs}}{C_{3,4-PPs}}·3^{n_{N,3}-1}=2^3·3$, or, equivalently, $2·2^{n_{N,2}-1}·4·3^{n_{N,3}-1}=2^3·3$. The last equation has no integer solutions such that $n_{N,2}>3$ and $n_{N,3}>1$.

When $7\mid N$, $n_{N,7}=1$, $n_{N,2}>3$ and $n_{N,3}>1$, equality $C_{N,5-PPs,\mathit{td}}=0$ implies $\frac{C_{2,5-PPs}}{C_{2,4-PPs}}·2^{n_{N,2}-1}·\frac{C_{3,5-PPs}}{C_{3,4-PPs}}·3^{n_{N,3}-1}·\frac{C_{7,5-PPs}}{C_{5,4-PPs}}=2^3·3$, or, equivalently, $2·2^{n_{N,2}-1}·4·3^{n_{N,3}-1}·8=2^3·3$. The last equation has no integer solutions such that $n_{N,2}>3$ and $n_{N,3}>1$.

(4)

$gcd(5!,N)=5$, i.e., $2\nmid N$, $3\nmid N$, and $5\mid N$

When $p=5$ and $n_{N,5}=1$, equality $C_{N,5-PPs,\mathit{td}}=0$ implies $\frac{C_{5,5-PPs}}{C_{5,4-PPs}}=5$. As we see in Table 5, the last condition is true. When $p=5$ and $n_{N,5}>1$, equality $C_{N,5-PPs,\mathit{td}}=0$ implies $\frac{C_{5,5-PPs}}{C_{5,4-PPs}}·5^{n_{N,5}-1}=5$, or, equivalently, $14·5^{n_{N,5}-1}=5$. The last equation has no integer solutions such that $n_{N,5}>1$.

The cases of other combinations of prime factors 2, 3, and 5, do not have to be considered because the same solutions result.

Concluding, the number of td 5-PPs results equal to 0 when N is of the form

$$\begin{array}{c}{N}_{C_{N,5-PPs,\mathit{td}=0}}=2^{n_{N,2}}·3^{n_{N,3}}·5^{n_{N,5}}·{\displaystyle \prod _{k=4}^s}{p}_k,\mathrm{with}{n}_{N,2}=\overline{0,3},n_{N,3}=\overline{0,1},n_{N,5}=\overline{0,1},\end{array}$$

$$\begin{array}{c}{p}_k>5,\mathrm{with}{p}_k=1\left(\mathrm{mod}15\right)\mathrm{or}{p}_k=11\left(\mathrm{mod}15\right),k=\overline{4,s}.\end{array}$$

(16)

4. Determining Positive Integers N so That the Number of td d-PPs Fulfilling ZF Sufficient Conditions Is Equal to 0

With the algorithm from Section 2, we can determine the number of td PPs fulfilling ZF sufficient conditions for an arbitrary degree d of PPs. The values used in (3) are denoted by $C_{p_k,d-PPs,ZF}$ in this case. We consider the sufficient coefficient conditions from [10] to find the values for $C_{p_k,d-PPs,ZF}$, depending on the degree d of PPs.

Let it be a PP of degree d modulo N as in Equation (1).

For $p=2$ and $n_{N,p}=1$, the condition is $(q_1+q_2+\cdots +q_d)\ne 0\left(\mathrm{mod}2\right)$. It is fulfilled for $2^d/2=2^{d-1}$ combinations of coefficients $(q_1,q_2,\dots ,q_d)$.

For $p=2$ and $n_{N,p}>1$, the conditions are $q_1\ne 0\left(\mathrm{mod}2\right)$, $(q_2+q_4+q_6+\dots )=0\left(\mathrm{mod}2\right)$ and $(q_3+q_5+q_7+\dots )=0\left(\mathrm{mod}2\right)$.

Condition $q_1\ne 0\left(\mathrm{mod}2\right)$, with $q_1\in {\mathbb{Z}}_2$, is met only for $q_1=1$.

Furthermore, we consider the degree d odd and even, respectively, in the other two conditions.

When d is odd ($d\ge 3$), i.e., $d=2·k+1$, $k\in {\mathbb{N}}^{*}$, each of the sums $(q_2+q_4+q_6+\dots )$ and $(q_3+q_5+q_7+\dots )$ contain k coefficients, each of them being satisfied for $2^k/2=2^{k-1}$ combinations of coefficients. It results that $C_{p_k,d-PPs,ZF}=1·2^{k-1}·2^{k-1}=2^{2k-2}=2^{d-3}$, for d odd.

When d is even ($d\ge 4$), i.e., $d=2·k$, with $k\in \mathbb{N}$, $k\ge 2$, the sum $(q_2+q_4+q_6+\dots )$ contains k coefficients and the sum $(q_3+q_5+q_7+\dots )$ contains $k-1$ coefficients. The first sum is fulfilled for $2^k/2=2^{k-1}$ combinations of coefficients and the second one for $2^{k-1}/2=2^{k-2}$ combinations of coefficients. It results that $C_{p_k,d-PPs,ZF}=1·2^{k-1}·2^{k-2}=2^{2k-3}=2^{d-3}$, for d even.

When $p>2$ and $n_{N,p}\ge 1$, the conditions become $q_1\ne 0\left(\mathrm{mod}p\right)$ and $q_2=q_3=\cdots =q_d=0\left(\mathrm{mod}p\right)$. Condition $q_1\ne 0\left(\mathrm{mod}p\right)$, with $q_1\in {\mathbb{Z}}_p$, is fulfilled for $p-1$ values. Condition $q_2=q_3=\cdots =q_d=0\left(\mathrm{mod}p\right)$, with $q_i\in {\mathbb{Z}}_p$, $\forall i=\overline{2,d}$, is fulfilled only for $q_2=q_3=\cdots =q_d=0$. In this case, $C_{p_k,d-PPs,ZF}=(p-1)·1=p-1$.

Table 6 summarizes the values of $C_{p_k,d-PPs}$ used in (3) in the case of ZF sufficient conditions.

Table 6. The number of d-permutation polynomials (PPs) ($d\ge 3$) fulfilling ZF sufficient conditions over ${\mathbb{Z}}_p$ permuting ${\mathbb{Z}}_{p^{n_{N,p}}}$, with $n_{N,p}\ge 1$.

p	${\mathit{n}}_{\mathit{N},\mathit{p}}=1$	${\mathit{n}}_{\mathit{N},\mathit{p}}>1$
	${\mathit{C}}_{\mathit{p},\mathit{d}-\mathit{PPs},\mathit{ZF}}$	${\mathit{C}}_{\mathit{p},\mathit{d}-\mathit{PPs},\mathit{ZF}}$
2	$2^{d-1}$	$2^{d-3}$
$p>2$	$p-1$	$p-1$

We note that the ZF sufficient conditions also become necessary for LPPs and QPPs. Thus, the same values of $C_{p_k,d-PPs}$ from Table 1 can be used.

The values $\frac{C_{p_{1,k},d-PPs,ZF}}{C_{p_{1,k},(d-1)-PPs,ZF}}$ and $\frac{C_{p_{2,k},d-PPs,ZF}}{C_{p_{2,k},(d-1)-PPs},ZF}$, for $d\ge 3$, are given in Table 7.

Table 7. The values $\frac{C_{p,d-PPs}}{C_{p,(d-1)-PPs}}$ for d-PPs ($d\ge 3$) fulfilling Zhao and Fan (ZF) sufficient conditions.

p	${\mathit{n}}_{\mathit{N},\mathit{p}}=1$	${\mathit{n}}_{\mathit{N},\mathit{p}}>1$
	$\frac{{\mathit{C}}_{\mathit{p},\mathit{d}-\mathit{PPs}}}{{\mathit{C}}_{\mathit{p},(\mathit{d}-\mathbf{1})-\mathit{PPs}}}$	$\frac{{\mathit{C}}_{\mathit{p},\mathit{d}-\mathit{PPs}}}{{\mathit{C}}_{\mathit{p},(\mathit{d}-\mathbf{1})-\mathit{PPs}}}$
2	2	$\left\{\begin{array}{cc}2,\hfill & \mathrm{if}d>3,\hfill \\ 1,\hfill & \mathrm{if}d=3.\hfill \end{array}\right.$
$p>2$	1	1

Let there be

$$z\left(x\right)=\sum _{k=1}^d{z}_k·x^k\left(\mathrm{mod}N\right),$$

(17)

a null polynomial (NP) of degree d modulo N, i.e., $z\left(x\right)=0,\forall x=\overline{0,N-1}$.

As we pointed out in [9], the null polynomials (NPs) under ZF sufficient conditions have to fulfill conditions

$$z_1\ne (-q_1)\left(\mathrm{mod}p\right),z_2=z_3=\cdots =z_d=0\left(\mathrm{mod}p\right),\forall p\mid N,p>2.$$

(18)

Thus, the number of NPs of degrees smaller than or equal to d fulfilling ZF sufficient conditions will not be equal to ${\prod }_{k=2}^{d}gcd(k!,N)$ as used in (4). This number is obtained in the following. The general form of NPs of degrees up to d is known from [13,14]:

$$\begin{array}{c}z\left(x\right)={\displaystyle \sum _{k=1}^d}\left\{\frac{N}{gcd(k!,N)}·{\tau }_k·{\displaystyle \prod _{m=0}^{k-1}}(x-m)\right\}\left(\mathrm{mod}N\right),\end{array}$$

$$\begin{array}{c}\mathrm{where}0\le {\tau }_k\le gcd(k!,N)-1.\end{array}$$

(19)

The quantity $gcd(k!,N)$, $k\ge 3$ is denoted by $g_k$ in the following. Let

$$\begin{array}{c}{g}_k=gcd(k!,N)=2^{n_{g_k,2}}·{\displaystyle \prod _{j=2}^{s_{g_k}}}{p}_{j,g_k}^{n_{g_k,p_j}},\mathrm{with}{s}_{g_k}\ge 2,n_{g_k,2}\ge 1,n_{g_k,p_j}\ge 1,\mathrm{and}\end{array}$$

$$\begin{array}{c}{p}_{j,g_k}>2,\forall j=2,3,\dots ,s_{g_k},\end{array}$$

(20)

be the factorization of $g_k$.

The truth value function $\left|\right|x\star y\left|\right|$, with ⋆ being an operator between two positive integers x and y, is defined as

$$\begin{array}{c}\left|\right|x\star y\left|\right|=\left\{\begin{array}{c}1,\mathrm{if}x\star y\mathrm{have}\mathrm{a}\mathrm{true}\mathrm{value}\mathrm{of}\mathrm{truth},\hfill \\ 0,\mathrm{if}x\star y\mathrm{have}\mathrm{a}\mathrm{false}\mathrm{value}\mathrm{of}\mathrm{truth}.\hfill \end{array}\right.\end{array}$$

(21)

We will use the function in (21) with the “equality operator” ($==$) and “greater than or equal to” operator (≥).

Similarly to [9], if a prime $p\le d$ exists, such that $n_{g_d,p}=n_{N,p}$, then for NPs fulfilling ZF sufficient conditions, we have to impose that $p\mid {\tau }_k$, $\forall k=k^{\prime },k^{\prime }+1,\dots ,d$, where $k^{\prime }$ is the lowest integer such that $n_{g_{k^{\prime }},p}=n_{g_d,p}$. Thus, prime p will reduce the number of NPs by $p^{d-k^{\prime }+1}$. With $g_d$ as in (20) for $k=d$, the number of NPs fulfilling ZF sufficient conditions will be equal to

$$\begin{array}{c}{C}_{NPs,ZF}=\frac{{\prod }_{k=2}^{d}gcd(k!,N)}{{\prod }_{k=2}^{s_{g_d}}{\left(p_{k,g_d}\right)}^{(d-k_d^{\prime }+1)·\left|\right|n_{g_d,p_k}==n_{N,p_k}\left|\right|}},\end{array}$$

(22)

where $k_d^{\prime }$ is the lowest integer such that $n_{g_{k_d^{\prime }},p_k}=n_{g_d,p_k}$.

Then the formula for the number of td $d-PPs$ fulfilling ZF sufficient conditions is

$$\begin{array}{c}{C}_{N,d-PPs,ZF,\mathit{td}}=C_{N,d-PPs,ZF,\mathrm{all}}·\frac{{\prod }_{k=2}^{s_{g_d}}{\left(p_{k,g_d}\right)}^{(d-k_d^{\prime }+1)·\left|\right|n_{g_d,p_k}==n_{N,p_k}\left|\right|}}{{\prod }_{k=2}^{d}gcd(k!,N)}-\end{array}$$

$$\begin{array}{c}-C_{N,(d-1)-PPs,\mathrm{all}}·\frac{{\prod }_{k=2}^{s_{g_{d-1}}}{\left(p_{k,g_{d-1}}\right)}^{(d-k_{d-1}^{\prime })·\left|\right|n_{g_{d-1},p_k}==n_{N,p_k}\left|\right|}}{{\prod }_{k=2}^{d-1}gcd(k!,N)}.\end{array}$$

(23)

Theorem 1.

Let the prime factorization of $d!$ be

$$\begin{array}{c}d!=2^{n_{d!,2}}·{\displaystyle \prod _{k=2}^{s_{d!}}}{p}_{k,d!}^{n_{d!,p_k}},\end{array}$$

$$\begin{array}{c}\mathit{with}{s}_{d!}\ge 2,n_{d!,2}\ge 1,n_{d!,p_k}\ge 1,\mathit{and}2<p_{k,d!}\le d,\forall k=2,3,\dots ,s_{d!}.\end{array}$$

(24)

Then the number of td d-PPs fulfilling ZF sufficient conditions is equal to zero ($C_{N,d-PPs,ZF,\mathit{td}}=0$) if the factorization of N is

$$\begin{array}{c}{N}_{C_{N,d-PPs,ZF,\mathit{td}=0}}=2^{n_{N,2}}·{\displaystyle \prod _{k=2}^{s_{d!}}}{p}_{k,d!}^{n_{N,p_k}}·{\displaystyle \prod _{k=s_{d!}+1}^s}{p}_k,\end{array}$$

$$\begin{array}{c}\mathit{with}0\le n_{N,2}\le n_{d!,2}\mathit{for}d>3\mathit{and}0\le n_{N,2}\le 2\mathit{for}d=3,\end{array}$$

$$\begin{array}{c}0\le n_{N,p_k}\le n_{d!,p_k}+1,2<p_{k,d!}<d,\forall k=2,3,\dots ,s_{d!},\mathit{and}{p}_k>d,\forall k=s_{d!}+1,\dots ,s.\end{array}$$

(25)

Proof. 

Imposing that $C_{N,d-PPs,ZF,\mathit{td}}=0$ in (23), we obtain

$$\begin{array}{c}\frac{C_{N,d-PPs,ZF,\mathrm{all}}}{C_{N,(d-1)-PPs,\mathrm{all}}}=gcd(d!,N)·\frac{{\prod }_{k=2}^{s_{g_{d-1}}}{\left(p_{k,g_{d-1}}\right)}^{(d-k_{d-1}^{\prime })·\left|\right|n_{g_{d-1},p_k}==n_{N,p_k}\left|\right|}}{{\prod }_{k=2}^{s_{g_d}}{\left(p_{k,g_d}\right)}^{(d-k_d^{\prime }+1)·\left|\right|n_{g_d,p_k}==n_{N,p_k}\left|\right|}}.\end{array}$$

(26)

The cases when d is a prime number and d is not a prime number are analyzed in the following.

(1)

d—a prime number

The prime factorizations of $g_{d-1}$ and $g_d/d^{\left(\right||n_{N,d}\ge 1|\left|\right)}$ are the same if d is a prime number. Moreover, $n_{g_d,d}=1$ and $k_d^{\prime }=d$. Therefore, we have

$$\begin{array}{c}\frac{{\prod }_{k=2}^{s_{g_{d-1}}}{\left(p_k\right)}^{(d-k_{d-1}^{\prime })·\left|\right|n_{g_{d-1},p_k}==n_{N,p_k}\left|\right|}}{{\prod }_{k=2}^{s_{g_d}}{\left(p_k\right)}^{(d-k_d^{\prime }+1)·\left|\right|n_{g_d,p_k}==n_{N,p_k}\left|\right|}}=\frac{1}{d^{\left(\right||n_{N,d}==1|\left|\right)}}.\end{array}$$

(27)

In this case, condition (26) becomes

$$\begin{array}{c}\frac{C_{N,d-PPs,ZF,\mathrm{all}}}{C_{N,(d-1)-PPs,\mathrm{all}}}=\frac{gcd(d!,N)}{d^{\left(\right||n_{N,d}==1|\left|\right)}}.\end{array}$$

(28)

Taking into account Equation (3) and the values in Table 7, for $d=3$ we obtain $C_{N,CPPs,ZF,\mathit{td}}=0$ if the factorization of N is

$$\begin{array}{c}{N}_{C_{N,CPPs,ZF,\mathit{td}=0}}=2^{n_{N,2}}·3^{n_{N,3}}·{\displaystyle \prod _{k=3}^s}{p}_k,\mathrm{with}{n}_{N,2}=\overline{0,2},n_{N,3}=\overline{0,2},\end{array}$$

$$\begin{array}{c}{p}_k>3,\forall k=\overline{3,s},\end{array}$$

(29)

as in (25) for $d=3$. The same result was obtained in [9].

If d is a prime number, $d>3$, considering (3) and the values in Table 7, (28) is equivalent to

$$\begin{array}{c}2·2^{n_{N,2}-1}·{\displaystyle \prod _{k=s_1+1}^{s_1+s_2}}1·{\left(p_{2,k}\right)}^{(n_{N,p_{2,k}}-1)}=2^{n_{g_d,2}}·{\displaystyle \prod _{k=2}^{s_{d!}-1}}{p}_{k,d!}^{n_{g_d,p_k}}·d^{\left(\right||n_{N,d}\ge 1\left|\right|)-\left(\right||n_{N,d}==1\left|\right|)},\end{array}$$

$$\begin{array}{c}\mathrm{with}0\le n_{g_d,2}\le n_{d!,2},0\le n_{g_d,p_k}\le n_{d!,p_k},\mathrm{and}2<p_{k,d!}<d,\forall k=2,3,\dots ,s_{d!}-1.\end{array}$$

(30)

For d a prime number, $d>3$, from (30) it results that $C_{N,d-PPs,ZF,\mathit{td}}=0$ if the factorization of N is

$$\begin{array}{c}{N}_{C_{N,d-PPs,ZF,\mathit{td}=0}}=2^{n_{N,2}}·{\displaystyle \prod _{k=2}^{s_{d!}-1}}{p}_{k,d!}^{n_{N,p_k}}·d^{n_{N,d}}·{\displaystyle \prod _{k=s_{d!}+1}^s}{p}_k,\end{array}$$

$$\begin{array}{c}\mathrm{with}0\le n_{N,2}\le n_{d!,2},0\le n_{N,p_k}\le n_{d!,p_k}+1,\mathrm{and}2<p_{k,d!}<d,\forall k=2,3,\dots ,s_{d!}-1,\end{array}$$

$$\begin{array}{c}0\le n_{N,d}\le 2,p_k>d,\forall k=s_{d!}+1,\dots ,s.\end{array}$$

(31)

(31) is the same as (25) for d a prime number.

(2)

d—not a prime number

The prime factors from the factorization of $g_d$ are the same as those from the prime factorization of $g_{d-1}$, possibly with greater powers of some factors, if d is not a prime number. The maximum powers of the primes $p_{k,d!}$ in the factorization of $g_d$ are $n_{d!,p_k}$, $\forall k=2,3,\dots ,s_{d!}$.

If $p_{k,d!}\mid g_d$, $p_{k,d!}\nmid d$, and $n_{d!,p_k}\ge n_{N,p_k}$, then $n_{g_{d-1},p_k}=n_{g_d,p_k}=n_{N,p_k}$ and $k_{d-1}^{\prime }=k_d^{\prime }$. Thus, the term corresponding to factor $p_{k,d!}$ in the ratio from the right-hand side of (26) is ${\displaystyle \frac{1}{p_{k,d!}}}$. The same observation is valid if $p_{k,d!}\mid g_d$, $p_{k,d!}\mid d$, and $n_{d!,p_k}-n_{d,p_k}\ge n_{N,p_k}$.

If $p_{k,d!}\mid g_d$, $p_{k,d!}\mid d$ and $n_{d!,p_k}-n_{d,p_k}<n_{N,p_k}\le n_{d!,p_k}$, then $n_{g_{d-1},p_k}<n_{g_d,p_k}=n_{N,p_k}$, $\left|\right|n_{g_{d-1},p_k}==n_{N,p_k}\left|\right|=0$, $\left|\right|n_{g_d,p_k}==n_{N,p_k}\left|\right|=1$, and $k_d^{\prime }=d$. Thus, the term corresponding to factor $p_{k,d!}$ in the ratio from the right-hand side of (26) is also ${\displaystyle \frac{1}{p_{k,d!}}}$.

If $p_{k,d!}\mid g_d$ and $n_{N,p_k}>n_{d!,p_k}$, then $n_{g_{d-1},p_k}<n_{N,p_k}$, $n_{g_d,p_k}<n_{N,p_k}$, $\left|\right|n_{g_{d-1},p_k}==n_{N,p_k}\left|\right|=0$, and $\left|\right|n_{g_d,p_k}==n_{N,p_k}\left|\right|=0$. Thus, the term corresponding to factor $p_{k,d!}$ in the ratio from the right-hand side of (26) is equal to 1.

Concluding, if d is not a prime number, (26) is equivalent to

$$\begin{array}{c}\frac{C_{N,d-PPs,ZF,\mathrm{all}}}{C_{N,(d-1)-PPs,\mathrm{all}}}=gcd(d!,N)·\frac{1}{{\prod }_{k=2}^{s_{d!}}{\left(p_{k,d!}\right)}^{\left|\right|n_{d!,p_k}\ge n_{N,p_k}\left|\right|}}.\end{array}$$

(32)

Similarly to (30), (32) is equivalent to

$$\begin{array}{c}2·2^{n_{N,2}-1}·{\displaystyle \prod _{k=s_1+1}^{s_1+s_2}}1·{\left(p_{2,k}\right)}^{(n_{N,p_{2,k}}-1)}=2^{n_{g_d,2}}·\frac{{\prod }_{k=2}^{s_{d!}}{p}_{k,d!}^{n_{g_d,p_k}}}{{\prod }_{k=2}^{s_{d!}}{\left(p_{k,d!}\right)}^{\left|\right|n_{d!,p_k}\ge n_{N,p_k}\left|\right|}},\end{array}$$

$$\begin{array}{c}\mathrm{with}0\le n_{g_d,2}\le n_{d!,2},0\le n_{g_d,p_k}\le n_{d!,p_k},\mathrm{and}2<p_{k,d!}<d,\forall k=2,3,\dots ,s_{d!}.\end{array}$$

(33)

If d is not a prime number, from (33) it results that $C_{N,d-PPs,ZF,\mathit{td}}=0$ if the factorization of N is

$$\begin{array}{c}{N}_{C_{N,d-PPs,ZF,\mathit{td}=0}}=2^{n_{N,2}}·{\displaystyle \prod _{k=2}^{s_{d!}}}{p}_{k,d!}^{n_{N,p_k}}·{\displaystyle \prod _{k=s_{d!}+1}^s}{p}_k,\end{array}$$

$$\begin{array}{c}\mathrm{with}0\le n_{N,2}\le n_{d!,2},0\le n_{N,p_k}\le n_{d!,p_k}+1,\mathrm{and}2<p_{k,d!}<d,\forall k=2,3,\dots ,s_{d!},\end{array}$$

$$\begin{array}{c}{p}_k>d,\forall k=s_{d!}+1,\dots ,s.\end{array}$$

(34)

We mention that formula (34) is also valid if d is a prime number. Thus, the theorem is proved. □

Two examples for the form of N when d is a prime number and when d is not a prime number are given in the following.

Example 1

(Example of N so that $C_{N,11-PPs,ZF,\mathit{td}}=0$). For $d=11$, we have

$$\begin{array}{c}11!=2^8·3^4·5^2·7^1·{11}^1,\end{array}$$

(35)

and $C_{N,11-PPs,ZF,\mathit{td}}=0$ if N is of the form

$$\begin{array}{c}{N}_{C_{N,11-PPs,ZF,\mathit{td}=0}}=2^{n_{N,2}}·3^{n_{N,3}}·5^{n_{N,5}}·7^{n_{N,7}}·{11}^{n_{N,11}}·{\displaystyle \prod _{k=6}^s}{p}_k,\end{array}$$

$$\begin{array}{c}\mathit{with}0\le n_{N,2}\le 8,0\le n_{N,3}\le 5,0\le n_{N,5}\le 3,0\le n_{N,7}\le 2,0\le n_{N,11}\le 2,\end{array}$$

$$\begin{array}{c}\mathit{and}{p}_k>11,\forall k=6,\dots ,s.\end{array}$$

(36)

Example 2

(Example of N such that $C_{N,12-PPs,ZF,\mathit{td}}=0$). For $d=12$, we have

$$\begin{array}{c}12!=2^{10}·3^5·5^2·7^1·{11}^1,\end{array}$$

(37)

and $C_{N,12-PPs,ZF,\mathit{td}}=0$ if N is of the form

$$\begin{array}{c}{N}_{C_{N,12-PPs,ZF,\mathit{td}=0}}=2^{n_{N,2}}·3^{n_{N,3}}·5^{n_{N,5}}·7^{n_{N,7}}·{11}^{n_{N,11}}·{\displaystyle \prod _{k=6}^s}{p}_k,\end{array}$$

$$\begin{array}{c}\mathit{with}0\le n_{N,2}\le 10,0\le n_{N,3}\le 6,0\le n_{N,5}\le 3,0\le n_{N,7}\le 2,0\le n_{N,11}\le 2,\end{array}$$

$$\begin{array}{c}\mathit{and}{p}_k>11,\forall k=6,\dots ,s.\end{array}$$

(38)

We mention that the same results as in [9] for degrees $d=4$ and $d=5$ are obtained, i.e.,

$$\begin{array}{c}{N}_{C_{N,4-PPs,ZF,\mathit{td}=0}}=2^{n_{N,2}}·3^{n_{N,3}}·{\displaystyle \prod _{k=3}^s}{p}_k,\end{array}$$

$$\begin{array}{c}\mathrm{with}0\le n_{N,2}\le 3,0\le n_{N,3}\le 2,\end{array}$$

$$\begin{array}{c}\mathrm{and}{p}_k>3,\forall k=3,\dots ,s,\end{array}$$

(39)

and

$$\begin{array}{c}{N}_{C_{N,5-PPs,ZF,\mathit{td}=0}}=2^{n_{N,2}}·3^{n_{N,3}}·5^{n_{N,5}}·{\displaystyle \prod _{k=4}^s}{p}_k,\end{array}$$

$$\begin{array}{c}\mathrm{with}0\le n_{N,2}\le 3,0\le n_{N,3}\le 2,0\le n_{N,5}\le 2,\end{array}$$

$$\begin{array}{c}\mathrm{and}{p}_k>5,\forall k=4,\dots ,s.\end{array}$$

(40)

5. Conclusions

In this paper, we obtained the form of N’s prime factorization for which the number of td fourth- and fifth-degree permutation polynomials is equal to zero. These values of N do not have to be used as fourth- and fifth-degree PP interleaver lengths because some PPs of smaller degree are equivalent to the fourth- or fifth-degree PPs, providing the same permutations.

We have particularized the algorithm from [11] for permutation polynomials under ZF sufficient conditions, and we obtained the number of null polynomials and the quantities $C_{p,d-PPs,ZF}$ required in the algorithm. We have also obtained the form of N’s prime factorization such that the number of td PPs of any degree, fulfilling ZF sufficient conditions, is equal to zero. Similarly to those above, these values of N do not have to be used as PP interleaver lengths when we search for PP interleavers under ZF sufficient conditions.

Comparing (15) with (39), we conclude that there are no td 4-PPs fulfilling ZF sufficient conditions, but there are td 4-PPs fulfilling other conditions, only when $7\mid N$.

Comparing (16) with (40), we conclude that there are no td 5-PPs fulfilling ZF sufficient conditions, but there are td 5-PPs fulfilling other conditions, only when $9\mid N$, or $25\mid N$, or $p\mid N$ with $p\ne 1\left(\mathrm{mod}15\right)$ and $p\ne 11\left(\mathrm{mod}15\right)$.