text:
# 1 Introduction

## 1 Introduction

Counting arithmetic functions for different prime sets can be assigned to the archaic mathematical reality.

Nevertheless, the generated by them prime sequences, named Eratosthenes progressions, became known only in recent years (e.g.,,, and sequences A007097, A063502, A064110 in ).

The Eratosthenes progression possesses a common formation law of its elements (an inner prime number distribution law) the realization of which is based on a multiple use of the Eratosthenes sieve  (Figure 1).

The derivation of Eratosthenes progressions and their systematic investigation is directed to a learning the nonasymptotic behaviour of primes, i.e., of the function’s behaviour

$$d\left(n\right)=p\left(n+1\right)p\left(n\right),n=1,2,\mathrm{},\overline{n},$$

where $`p\left(n\right)`$ is the $`n`$th prime and $`\overline{n}`$ is a sufficiently large natural number.

The inner prime number distribution law can be applied mostly in mathematics itself, for example, when constructing new geometric concepts in arithmetic.

Following Alain Connes ( pp. 208–209), it can be supposed that the specific behaviour of primes will reflect itself in the new geometry sought for understanding quantum gravity.

In biochemistry, the specific behaviour of primes can manifest itself in the laws of formation and functioning of large molecules, from $`10^3`$–atomic insulin and hemoglobin up to $`310^5`$–atomic proteins and enzymes.

In this paper, the general statement of the problem for derivation of Eratosthenes progressions is given and their basic properties are presented. The general results are applied to the sequence of primes itself

$$P=\{2,3,5,7,11,\mathrm{}\}=\left\{p\left(n\right)\right\}_{n=1,2,\mathrm{}},$$

as well as to the following related to $`P`$ sequences:

$`M=P=\{4,6,8,9,\mathrm{}\}=\left\{m\left(n\right)\right\}_{n=1,2,\mathrm{}}`$ the set of composite numbers;

$`T=\{t\left(\nu \right)=(p\left(\nu \right),p\left(\nu +1\right)):\nu \mathrm{\Lambda }\}`$ the set of twin pairs, where ffffffff $`\mathrm{\Lambda }=\{n:p\left(n+1\right)p\left(n\right)=2,n\}=\{2,3,5,7,10,13,17,\mathrm{}\}`$;

$`T_1=\{p\left(\nu \right):(p\left(\nu \right),p\left(\nu +1\right))T,\nu \mathrm{\Lambda }\}=\left\{t_1\left(\nu \right)\right\}_{\nu \mathrm{\Lambda }}`$ the setffffffffff of first elements of twins;

$`T_2=\{p\left(\nu +1\right):(p\left(\nu \right),p\left(\nu +1\right))T,\nu \mathrm{\Lambda }\}=\left\{t_2\left(n\right)\right\}_{\nu \mathrm{\Lambda }}`$ theffffffffff set of second elements of twins;

$`T_3=T_1T_2=\{3,5,7,11,13,17,19,\mathrm{}\}`$ the set of twin elements;

$`S=PT_3=\{2,23,37,47,53,\mathrm{}\}`$ the set of isolated primes, A007510;

$`D_{6n1}=\{6n1P:n=1,2,\mathrm{},\}=\{5,11,17,\mathrm{}\}`$ the set of primes ofddfffffffff the kind $`6n1`$;

$`D_{6n+1}=\{6n+1P:n=1,2,\mathrm{},\}=\{7,13,19,\mathrm{}\}`$ the set of primes ofddfffffffff the kind $`6n+1`$, and

$`T_4=\{t\left(n\right):\left(t_1\left(n\right)+t_2\left(n\right)\right)/2=6q,qP\}`$ the set of twins withfffffffff minimal average (, p. 15).

The sets $`T,T_1T_4`$ and  S below will be supposed to be infinite.

In this paper some properties of Eratosthenes progression such as distribution laws of the progression elements, $`\zeta `$–functions for the progressions and their connection with the Riemann $`\zeta `$–function are only mentioned.

The main result of this paper consists in the proposed plane–spiral geometric concept of arithmetic, compatible with the linear Cartesian concept.

The real semiaxis $`_+^1`$ in the new geometric model is isometrically mapped as a logarithmic spline-spiral on the plane $`^2`$ in such a way that the Eratosthenes rays, not intersecting each other, cross the spiral only at the primes.

The spiral arithmetic allows one to interpret in a new way the basic counting function $`\pi \left(x\right)`$, the Littlwood’s $`\mathrm{\Omega }`$–theorem and also gives an arithmetic interpretation of the distribution in natural series of all kinds of clusters of primes (see , for example) and twin pairs, in particular.

The basic object in the spiral geometry is a spider–web $`W_n`$ composed of spiral and Eratosthenes rays intersecting it, in which the number of rotations $`n`$ infinitely increases.

The web $`W_n`$ consists of embedded concave–convex trapezoids of primes with a characteristic formation law. This law is a direct consequence of the inner prime number distribution law.

The plane $`^2`$ is considered as a mosaic composed of elementaryconcave–convex trapezoids.

The web $`W_n`$ geometrically select (personalyzes) primes, and also all kinds of linear and plane configurations of primes.

## 2 Splitting theorem for infinite sequences of primes

### 2.1 Basic definitions

Let sets $`A`$ and $`B`$ with the properties

$$AB=\mathrm{},$$
(1)
$$A\overline{B}=,$$
(2)
where $`\overline{B}=\left\{1\right\}B`$ are given.

Let the arithmetic function

$$g\left(n\right):A$$

generate (denote) the $`n`$th element $`a\left(n\right)A`$.

Then the counting recurrent law

$$\epsilon _{a\left(0\right)}^+:a\left(n+1\right)=g\left(a\left(n\right)\right),n=0,1,2,\mathrm{},a\left(0\right)$$
(3)
determines an A–counting progression $`\epsilon _{a(0)}^+`$ and an $`A`$–counting ray

$$r_{a\left(0\right)}=\{a\left(n\right):a\left(n+1\right)=g\left(a\left(n\right)\right),n=0,1,2,\mathrm{},a\left(0\right)\}.$$

Together with the function $`g\left(n\right)`$, its inverse function, the $`n`$th number of element $`a\left(n\right)A`$, is also uniquely determined (in a purely arithmetical sense it is a counting function)

$$g_1\left(a\right):A.$$

The functions $`g\left(n\right)`$ and $`g_1\left(a\right)`$ are strictly monotonic and satisfy the equalities

$$g\left(g_1\left(a\right)\right)=a,g_1\left(g\left(n\right)\right)=n.$$

By means of $`g\left(n\right)`$ and $`g_1\left(a\right)`$ the compositions

$$\begin{array}{c}g_n\left(a\left(0\right)\right)=\underset{n}{\underset{}{g(\mathrm{}g}}\left(a\left(0\right)\right)\mathrm{})=a(n),\hfill \\ \\ g_n\left(a\left(n_1\right)\right)=\underset{n}{\underset{}{g_1(\mathrm{}g_1}}\left(a\left(n_1\right)\right)\mathrm{}),\text{with }nn_1.\hfill \end{array}$$

are introduced.

These compositions satisfy the equalities

$$\begin{array}{c}g_{n_1}\left(g_{n_2}\left(a\left(0\right)\right)\right)=g_{n_1+n_2}\left(a\left(0\right)\right),n_1,n_21,\hfill \\ \\ g_{n_1}\left(g_{n_2}\left(a\left(0\right)\right)\right)=g_{n_2n_1}\left(a\left(0\right)\right),1n_1n_2.\hfill \end{array}$$

An extension of the $`A`$–counting progression $`\epsilon _{a\left(0\right)}^+`$ with negative numbers $`\epsilon _{a\left(0\right)}^{}=\epsilon _{a\left(0\right)}^+`$ leads to an infinite cyclic group

$$\epsilon _{a\left(0\right)}=\epsilon _{a\left(0\right)}^{}\left\{a\left(0\right)\right\}\epsilon _{a\left(0\right)}^+,g_n\left(a\left(0\right)\right)=g_n\left(a\left(0\right)\right),n>0$$
(4)
under composition $`g_n\left(a\left(0\right)\right),`$ with a depth $`n`$ and a generator $`a\left(0\right)\overline{B}`$.

Two elements from $`\epsilon _{a\left(0\right)}`$ interact under the composition rule

$$g_{n_1}\left(a\left(0\right)\right)g_{n_2}\left(a\left(0\right)\right)=g_{n_1}\left(g_{n_2}\left(a\left(0\right)\right)\right)=g_{n_1+n_2}\left(a\left(0\right)\right),n_1,n_2.$$
(5)
### 2.2 Basic assertion and its consequences

The following assertion about the splitting of the set $`A`$ in a denumerable number of denumerable subsets with a common law(3) of formation of its elements is given:

Theorem 1.For any sets $`A`$ and $`B`$ with properties (1) and (2) the following equalities hold

$$\begin{array}{c}\underset{a\left(0\right)\overline{B}}{}r_{a\left(0\right)}=\mathrm{},\underset{a\left(0\right)\overline{B}}{}r_{a\left(0\right)}=A.\hfill \end{array}$$

Theorem 1 leads to a matrix representation of the sequences $`A`$ and $``$ with peculiar properties of their elements.

Corollary 1. There exists an one-to-one mapping

$$\overline{\phi }\left(a\left(0\right)\right):\overline{B}^2A=\left\{r_{a\left(0\right)}\right\}_{a\left(0\right)\overline{B}}\left\{a_{\mu \nu }\right\}_{\mu ,\nu =1,2,\mathrm{}}$$
(6)
( $`{}_{}{}^{2}A`$ denotes the matrix representation of the elements of $`A`$).

From (6) a matrix representation to the natural series

$$^2=\overline{B}^2A,$$
(7)
where $`\overline{B}=\text{Column}\left\{a_{\mu 0}\right\}_{\mu =1,2,\mathrm{}}`$ also follows.

The matrices $`{}_{}{}^{2}A`$ and $`{}_{}{}^{2}`$ shall be called mesm–matrices.

In the case when $`A=P`$ and $`B=M`$ an example of the left upper corner of the matrix $`{}_{}{}^{2}`$ (, pp. 18–22) is given in Appendix 1.

Corollary 2.The rows of matrices $`{}_{}{}^{2}`$ are isomorphic to the row $`r_1`$ with respect to the mapping

$$\mathrm{\Psi }\left(g_n\left(1\right)\right):g_n\left(1\right)g_n\left(g_n\left(1\right)\right)a\left(0\right)g_n\left(a\left(0\right)\right),a\left(0\right)\overline{B},a\left(0\right)>1.$$

The columns of the matrix $`{}_{}{}^{2}A`$ are isomorphic to the column $`\overline{B}`$ with respect to the mapping

$$\phi \left(a\left(0\right)\right):a\left(0\right)g_n\left(a\left(0\right)\right),a\left(0\right)\overline{B}.$$

In the case $`A=P`$ and $`B=M`$ Figure 2 illustrates mentioned isomorphisms. In Figure 2, an one-to-one correspondence between rooted trees and elements of $``$, proposed by F. G$`\ddot{\text{o}}`$bel  is used (see the $`1th`$ row of Figure 2).

Theorem 1 leads also to an important consequence, which reveals the arithmetic nature of the fine structure of the set $`A`$ elements’ distribution among the natural numbers.

Let $`g_1(n^{},n^{\prime \prime }),n^{},n^{\prime \prime }`$ denote the number of elements $`A`$ in the interval $`(n^{},n^{\prime \prime })`$.

Corollary 3.For the matrix $`[\overline{B}^2A]`$ elements the following equalities hold:

$$\begin{array}{c}g_1(a_{\mu 0},0)=a_{\mu _1}1,\mu =1,2,\mathrm{},\hfill \\ \\ g_1(a_{\mu _1\nu _1},a_{\mu _2\nu _2})=\left|a_{\mu _1\left(\nu _11\right)}a_{\mu _2\left(\nu _21\right)}\right|1,\hfill \\ \\ \mu _i,\nu _i1,i=1,2.\hfill \end{array}\}$$
(8)
## 3 The Theorem 1 application to special cases of sets $`𝐀`$ and $`𝐁`$

### 3.1 About new $`𝐀`$–counting progressions

In the case when $`A`$ and $`B`$ take usual values the law (3) generates known $`A`$–counting progressions. So, for example, at $`A=\left\{even\right\}`$ and $`B=\left\{odd\right\}`$ a generating function is of kind $`g\left(a\left(n\right)\right)=2a\left(n\right)1`$ and in this case $`\epsilon _2^+=\{2,3,5,9,17,33,65,129\mathrm{}\}`$ is a Pisot sequence (, A000051).

New $`A`$–progressions one occur when the behaviour of $`A`$ elements among natural numbers is unknown and it cannot be considered as a probabilistic. Besides the sequences of primes $`P`$, all subsequences of $`P`$, in the formation of which the Eratosthenes sieve combines with an additional deterministic filter $`f\left(n\right)`$ (this is the formation rule of the considered subsequence), should also be considered belonging to this class. The set of these subsequences shall be denoted by $`_f`$.

The Dirichlet theorem about the existence of infinite primes of the kind $`\alpha n+\beta `$ (an additional filter) for arbitrary coprimes $`\alpha `$ and $`\beta `$ shows that $`_f`$ is infinite.

In particular, we have inclusions $`T_1,T_2,T_3,S_fandD_{\alpha n\pm 1}_fat\alpha =4,6`$.

For all elements $`_f`$ there exists a mesmf–process, which is analogous to the process represented in Figure 1. From the $`A`$–split theorem it follows that for every $`A_f_f`$ and $`B_f=A_f`$ there exists a mesmf–matrix $`\left[B_f^2A_f\right].`$

As a result of a mesm–transition $`A_f^2A_f`$, the elements of the rows $`{}_{}{}^{2}P,^2T_1,^2T_2,^2T_3,^2S`$  and $`{}_{}{}^{2}D_{\alpha n\pm 1}^{}\left(\alpha =4,6\right)`$ already will be distributed according to the inner law (3), which now should be understood as a specific self-smoothing  (only with respect to the rows $`{}_{}{}^{2}A_{f}^{}`$) of the irregularities in the appearance of the elements $`A_f`$ in the natural series.

### 3.2 The basic case: $`𝐀=𝐏`$ and $`𝐁=𝐌`$.

The upper left corner of the matrix $`{}_{}{}^{2}P`$ and its extension to the matrix $`{}_{}{}^{2}`$ are represented in Appendix 1. The Theorem 1 has been proved inductively in , pp. 4–8.

The first elements of the first rows of the matrix $`{}_{}{}^{2}P`$ were primarily determined by hand by means of MESM (Figure 1). In such a way the law (3) with $`g\left(n\right)=p\left(n\right)`$ (Eratosthenes progressions) was discovered .

The extension of the matrix $`{}_{}{}^{2}P`$ rows on negative primes according to the rules (4), (5) leads to infinite cyclic groups under composition $`p_n\left(a\left(0\right)\right),`$$`n`$ with a generators $`a\left(0\right)M`$. An example of such a group is the set

$$\epsilon _4=\{\mathrm{},p_n\left(4\right),\mathrm{},59,17,7,4,7,17,59,\mathrm{},p_n\left(4\right),\mathrm{}\}.$$

A part of $`{}_{}{}^{2}P`$ represented in Appendix 1 has been computed by means of Mathematica function NestList\[Prime, a(0), n\].

The row elements of the matrix $`\left[\overline{M}^2P\right]`$ determine new subsets of natural numbers

$$N_m=\{p_{n_1}^{\alpha _1}\left(m\right)\mathrm{}p_{n_k}^{\alpha _k}\left(m\right):n_i,\alpha _i,i=1,2,\mathrm{},k,k\},m\overline{M}:$$

$$N_1=\{2,3,2^2,5,23,2^3,3^2,25,11,2^23,35,2^4,\mathrm{}\},$$

$$N_4=\{7,17,7^2,59,717,277,17^2,7^3,759,7^217,1787,7^4,\mathrm{}\},$$

$$N_6=\{13,41,13^2,179,1341,1063,41^2,13^3,13^241,\mathrm{}\},$$

and so on.

According to Corollary 2, the behaviour of composite numbers reflects on the behaviour of the elements of the columns of the matrix $`{}_{}{}^{2}P`$.

On the other hand, the structure of the set $`M`$ depends on the structure of the set of primes because $`M`$ can be represented as a chain of $`\alpha _\mu `$–element segments $`\left(\text{ where }\alpha _\mu =d\left(\mu \right)1\right)`$ from consequent composite numbers

$$\overline{m}_\mu \left(\alpha _\mu \right)=\{p\left(\mu \right)+1,p\left(\mu \right)+2,\mathrm{},p\left(\mu +1\right)1\},\mu =2,3,\mathrm{}$$

$$\left(\overline{m}_2\left(1\right)=\left\{4\right\},\overline{m}_3\left(1\right)=\left\{6\right\},\overline{m}_4\left(3\right)=\{8,9,10\},\mathrm{}\right).$$

The segments are connected in a whole set $`M`$ by means of ghost primes $`\omega _\mu =p\left(\mu \right)`$$`\left(\omega _2=3,\omega _3=5,\omega _4=7,\mathrm{}\right)`$.

The Eratosthenes progressions $`\left\{\epsilon _m^+\right\}_{m\overline{M}}`$ (i.e., rows of the matrix $`{}_{}{}^{2}P`$) conform to the inner prime number distribution law

$$a\left(n+1\right)=p\left(a\left(n\right)\right)=p_{n+1}\left(a\left(0\right)\right),n=0,1,2,\mathrm{},a\left(0\right)m\overline{M},$$
(9)
but the deviation of the rows $`{}_{}{}^{2}P`$ between each other (i.e., the distribution of primes in the columns of $`{}_{}{}^{2}P`$) again persists dependent of the oddish behaviour of primes.

The main information left out of the inner law (9) is reflected in the structure of the first matrix $`{}_{}{}^{2}P`$ column

$$P_1=column[p_{11},p_{21},\mathrm{},p_{\mu 1},\mathrm{}].$$

The following assertion about the $`P_1`$ structure is valid.

Theorem 2.Mapping $`\phi :a(0)p_{\mu 1}`$ defines a correspondence between segments of composite numbers $`\overline{m}_\mu (\alpha _\mu )`$ and clusters of $`\alpha _\mu `$–successive primes

$$c_\mu \left(\alpha _\mu \right)=\{p_1\left(p\left(\mu \right)+1\right),p_1\left(p\left(\mu \right)+2\right),\mathrm{},p_1\left(p\left(\mu +1\right)1\right)\}P$$

in the cases $`\alpha _\mu 3`$, and separate primes $`p_1(p(\mu )+1)`$ in the cases $`\alpha _\mu =1`$. At their ends the clusters are complemented by the ghost images up to prime number segments

$$\overline{c}_\mu \left(\alpha _\mu \right)=\{p_1\left(p\left(\mu \right)\right),c_\mu \left(\alpha _\mu \right),p_1\left(p\left(\mu +1\right)\right)\}$$

and the equality $`P=\underset{\mu =1}{\overset{\mathrm{}}{}}\overline{c}_\mu (\alpha _\mu )`$ is fulfilled.

The next theorem about twin pairs $`t\left(\nu \right)=(t_1\left(\nu \right),t_2\left(\nu \right))T,\nu =3,5,7,\mathrm{}`$ is also justified.

Theorem 3.  For each pair $`t(\nu )`$(after the pair (3,5)) at least one of the elements $`t_1(\nu )`$ or $`t_2(\nu )`$ belongs to the first column $`P_1`$ .

The mapping $`\phi ^1:p_{\mu 1}m_\mu `$ defines a correspondence between pairs with both elements on $`P_1`$ ($`u`$–twin) and pairs of subsequent elements of some segment $`\overline{m}_{\overline{\mu }}(\alpha _{\overline{\mu }})M`$ with $`\alpha _{\overline{\mu }}3`$.

For a pair with one element $`t_1(\nu )`$ $`(ort_2(\nu ))`$ on $`P_1`$ ($`b`$–twin) the mapping$`\phi ^1:p_{\mu 1}m(\mu )`$ associates $`t_1(\nu )`$ ($`ort_2(\nu ))`$ with the element $`p(n)+1`$, or the element $`p(n+1)1`$ of some segment $`\overline{m}_{\overline{\mu }}(\alpha _{\overline{\mu }})M`$ at $`\alpha _{\overline{\mu }}3`$, or with the element of some one-element segment $`\overline{m}_{\overline{\mu }}(1)M`$.

The mapping $`\phi ^1:p_{\mu _1\nu _1}`$ $`p_{\mu _1(\nu _11)},\nu _12`$ relates the second element $`t_2(\nu )`$ ($`ort_1(\nu ))`$ to one of the ghosts $`p(\mu )p_{\mu _1(\nu _11)}`$ or $`p(\mu +1)`$ $`p_{\mu _1(\nu _11)}`$.

The following properties of the matrix $`{}_{}{}^{2}P`$ rows and columns are briefly veiwed:

* The difference $`d_m\left(n\right)=p_{\left(n+1\right)}\left(m\right)p_n\left(m\right),n=1,2,\mathrm{},m\overline{M}`$ monotonically increase under the estimate

$$d_m\left(n\right)>p_n\left(m\right)\left(\mathrm{ln}p_n\left(m\right)1\right)$$

unlike the difference $`d\left(n\right)`$ whose behaviour only on the face of it may seems to be a chaotical one ;
* The sequence $`\eta (s,m)=\underset{n=1}{\overset{\mathrm{}}{}}\frac{1}{p_n^s\left(m\right)}`$ converge for all $`m\overline{M}`$ and$`s1.`$

Note especially the convergence of the sum $`\eta (1,m)`$ (, p. 10) when the sum $`\underset{n=1}{\overset{\mathrm{}}{}}\frac{1}{p\left(n\right)}`$ diverges;
* An analogue of the Euler identity exists

$$\zeta (s,m))1+_{nN_m}\frac{1}{n^s}=_{n=1}^{\mathrm{}}(1\frac{1}{p_n^s\left(m\right)})^1,m\overline{M},s1;$$
* The Riemann function $`\zeta \left(s\right)=\underset{n=1}{\overset{\mathrm{}}{}}\frac{1}{n^s},s\mathit{}`$ can be represented by the functions $`\zeta (s,m)`$

$$\zeta \left(s\right)=\underset{m\overline{M}}{}\zeta (s,m);$$
* The asymptotic law for the primes and the simplified Riemann formula for $`\pi \left(x\right)`$ give an opportunity to find approximately $`p_{n+1}\left(m\right)`$,$`m\overline{M}`$ by solving the equations with respect to $`x`$

$$L\left(x\right)=p_n\left(m\right),$$
(10)
$$R\left(x\right)=p_n\left(m\right),$$
(11)
$$\text{where }L\left(x\right)=\underset{0}{\overset{x}{}}\frac{ds}{\mathrm{ln}\left(s\right)},R\left(x\right)=\underset{k=1}{\overset{\mathrm{}}{}}\frac{\mu \left(k\right)}{k}L\left(x^{1/k}\right)$$

and $`\mu \left(k\right)`$ is a M$`\ddot{\text{o}}`$bius function;
* There exists an approximate formula

$$n=\underset{\alpha }{\overset{p_n\left(\beta \right)}{}}\frac{ds}{s\mathrm{ln}\mathrm{ln}s}+\epsilon (n,\beta ),$$
(12)
$`\text{where }\alpha =11,\beta =1,n>4\text{ for }r_1,\alpha =7,\beta =4\text{ for }r_4\text{and }`$ $`\alpha =\beta =m\text{ for the other }\text{rays }r_m.`$

The absolute error $`\left|\epsilon \right|`$ for the part of the matrix $`\left[\overline{M}^2P\right]`$ in Appendix 1 is not greater than $`0.2`$ when $`n`$ is small and $`0.06`$ when $`n`$ is large.

Formula (12) is a prime number distribution law of the rays $`{}_{}{}^{2}P`$.

On Figure 3, the behaviour of the function (12) is presented for the ray $`r_9`$;
* It is obvious that for the number $`\mu `$ of the element $`p_{\mu n}`$ in the matrix $`{}_{}{}^{2}P`$ column

$$P_n=colomn[p_{1n},p_{2n},\mathrm{},p_{\mu n},\mathrm{}]$$

there exists an asymptotic formula

$$\mu m\underset{2}{\overset{m}{}}\frac{ds}{\mathrm{ln}s}.$$
(13)
This is the column $`{}_{}{}^{2}P`$ prime number distribution law.

In order to use (12) and (13) it is necessary to know the composite number $`m`$.

### 3.3  About other $`𝐀`$–counting progressions

Applying the $`A`$–split theorem in the cases

$$\begin{array}{c}A=T_1\text{ and }B_1=T_2M,\hfill \\ \\ A=S\text{ and }B_2=MT_3,\hfill \\ \\ A=D_{6n1}\text{ and }B_3=MD_{6n+1}\{2,3\},\hfill \\ \text{and}\hfill \\ A=D_{6n+1},B_4=MD_{6n1}\{2,3\},\hfill \end{array}$$

we can obtain the next mesm-matrices of kind (7):

$$[B_1^2T_1]=\left[\begin{array}{ccccccc}1\hfill & 3\hfill & 11\hfill & 137\hfill & 5639\hfill & 641129\hfill & 152921807\mathrm{}\hfill \\ 2\hfill & 5\hfill & 29\hfill & 641\hfill & 44381\hfill & 7212059\hfill & \mathrm{}\hfill \\ 4\hfill & 17\hfill & 239\hfill & 12161\hfill & 1583927\hfill & \mathrm{}\hfill & \\ 6\hfill & 41\hfill & 1151\hfill & 93251\hfill & 16989317\hfill & \mathrm{}\hfill & \\ 7\hfill & 59\hfill & 1931\hfill & 176021\hfill & 35263691\hfill & \mathrm{}\hfill & \\ 8\hfill & 71\hfill & 2339\hfill & 221201\hfill & 45749309\hfill & \mathrm{}\hfill & \\ \hfill & \hfill & \hfill & \hfill & \hfill & \mathrm{}\hfill & \end{array}\right];$$

$$[B_2^2S]=\left[\begin{array}{cccccccc}1\hfill & 2\hfill & 23\hfill & 263\hfill & 2917\hfill & 38639\hfill & 603311\hfill & 11093633\mathrm{}\hfill \\ 3\hfill & 37\hfill & 397\hfill & 4751\hfill & 64403\hfill & 1038629\hfill & 19661749\hfill & \mathrm{}\hfill \\ 4\hfill & 47\hfill & 491\hfill & 5897\hfill & 81131\hfill & 1328167\hfill & 25467419\hfill & \mathrm{}\hfill \\ 5\hfill & 53\hfill & 557\hfill & 6709\hfill & 93287\hfill & 1541191\hfill & 29778547\hfill & \mathrm{}\hfill \\ \hfill & \hfill & \hfill & \hfill & \hfill & \hfill & \hfill & \mathrm{}\hfill \\ 22\hfill & 257\hfill & 2861\hfill & 37799\hfill & 589181\hfill & 10821757\hfill & 230452837\hfill & \mathrm{}\hfill \\ 24\hfill & 277\hfill & 3079\hfill & 40823\hfill & 640121\hfill & 11807167\hfill & 252480587\hfill & \mathrm{}\hfill \\ \hfill & \hfill & \hfill & \hfill & \hfill & \hfill & \hfill & \mathrm{}\hfill \end{array}\right];$$

$$[B_3^2D_{6n1}]=\left[\begin{array}{cccccccc}1\hfill & 5\hfill & 29\hfill & 263\hfill & 3767\hfill & 76253\hfill & 2049263\hfill & 69633521\mathrm{}\hfill \\ 2\hfill & 11\hfill & 83\hfill & 953\hfill & 16223\hfill & 381221\hfill & 11579489\hfill & \mathrm{}\hfill \\ 3\hfill & 17\hfill & 137\hfill & 1721\hfill & 31883\hfill & 795803\hfill & 25434641\hfill & \mathrm{}\hfill \\ 4\hfill & 23\hfill & 197\hfill & 2663\hfill & 51803\hfill & 1348961\hfill & 44635001\hfill & \mathrm{}\hfill \\ 6\hfill & 41\hfill & 419\hfill & 6329\hfill & 135347\hfill & 3808109\hfill & 134441441\hfill & \mathrm{}\hfill \\ \hfill & \hfill & \hfill & \hfill & \hfill & \hfill & \hfill & \mathrm{}\hfill \end{array}\right];$$

$$[B_4^2D_{6n+1}]=\left[\begin{array}{cccccccc}1\hfill & 7\hfill & 61\hfill & 727\hfill & 12343\hfill & 284083\hfill & 8457367\hfill & 312953941\mathrm{}\hfill \\ 2\hfill & 13\hfill & 109\hfill & 1429\hfill & 26113\hfill & 642937\hfill & 20262883\hfill & 787318099\mathrm{}\hfill \\ 3\hfill & 19\hfill & 181\hfill & 2539\hfill & 49669\hfill & 1291471\hfill & 42627997\hfill & \mathrm{}\hfill \\ 4\hfill & 31\hfill & 331\hfill & 5011\hfill & 105277\hfill & 2908753\hfill & 10144807\hfill & \mathrm{}\hfill \\ 5\hfill & 37\hfill & 397\hfill & 6211\hfill & 133633\hfill & 3761239\hfill & 132710947\hfill & \mathrm{}\hfill \\ \hfill & \hfill & \hfill & \hfill & \hfill & \hfill & \hfill & \mathrm{}\hfill \end{array}\right].$$

The matrices $`[B_1^2T_1]`$, $`[B_2^2S]`$ and $`[P^2M]`$ were published in  as $`A063502`$, $`A064110`$ and $`A025003`$$`A025006`$, respectively. Matrices $`[B_3^2D_{6n1}]`$ and $`[B_4^2D_{6n+1}]`$ are the new ones.

New mesm–matrices can be obtained also for the Euler primes of the kind$`n^2+n+41`$ ($`r_1=\{41,1847,1573316,\mathrm{}\}`$), and for the Hardy-Littlwood primes of the kind $`H_{n^2+1}=\{n^2+1P:n=1,2,\mathrm{}\}`$ where at $`B_5=H_{n^2+1}`$ we have

$$[B_5^2H_{n^2+1}]=\left[\begin{array}{cccccc}1\hfill & 2\hfill & 5\hfill & 101\hfill & 746497\hfill & 286961228404901\mathrm{}\hfill \\ 3\hfill & 17\hfill & 7057\hfill & 11424189457\mathrm{}\hfill & & \\ 4\hfill & 37\hfill & 44101\hfill & 637723627777\mathrm{}\hfill & & \\ 6\hfill & 197\hfill & 3496901\mathrm{}\hfill & & & \\ 7\hfill & 257\hfill & 6421157\mathrm{}\hfill & & & \\ \hfill & \hfill & \hfill & \mathrm{}\hfill & & \end{array}\right].$$

All pointed out mesmf–matrices are not studied. In particular, an analogue of the distribution laws (12) and (13) has not been found for them with the exception of the matrix $`\left[P^2M\right]`$ for which an analogue of the law (13) is known. However, the common Corollaries 2 and 3 of the $`A`$–split theorem remain valid for them.

## 4 Logarithmic geometry of primes on the plane.

### 4.1 The Prime Number Spider Web (PNSW) Hypothesis

One of the main application of the prime number distribution law (9) consists in constructing the plane spiral geometric concept of arithmetic.

Let

$$_f=\{\rho \left(\theta \right)=\left(f\left(\theta \right)\right)^\theta :f\left(\theta \right)C^1[0,\mathrm{}),f\left(\theta \right)1,\mathrm{\hspace{0.17em}0}\theta <\mathrm{}\}$$

denote a class of logarithmic spirals with an arc length

$$\lambda (0,\theta )=\underset{0}{\overset{\theta }{}}\left(f\left(x\right)\right)^x\left(\left(\mathrm{ln}f\left(x\right)+\frac{xf^{}\left(x\right)}{f\left(x\right)}\right)^2+1\right)^{1/2}𝑑x.$$

The plane spiral geometric concept is based on the following PNSW–hypothesis .

Conjecture 1. On the plane $`^2`$ there exists a unique spiral $`\overline{\rho }(\theta )_f`$ and the corresponding to it sets of angles

$$\left\{\theta _{mn}\right\}_{m\overline{M}},n=1,2,\mathrm{},\theta _{mn^{}}<\theta _{mn^{\prime \prime }}\text{ at }n^{}<n^{\prime \prime }$$

such that the following conditions are fulfilled:

(i) $`\lambda (0,\theta _{mn})=p_n(m),n=1,2,\mathrm{},m\overline{M};`$

(ii) the primes $`p_n(m),n=1,2,\mathrm{}`$ lie on the same ray $`\mathrm{}_mR^2`$ with a positive direction corresponding to increasing $`n`$;

(iii) two arbitrary rays $`\mathrm{}_{m_1}`$ and $`\mathrm{}_{m_2},m_1,m_2\overline{M}`$ do not intersect each other and are non–parallel.

### 4.2 Logarithmic spline–spiral

Under the substitution $`f\left(\theta \right)=e^{cot\phi },_f`$ turns in a one–parametric family of logarithmic spirals

$$_\phi =\{\rho _\phi =e^{\left(cot\phi \right)\theta }:\mathrm{\hspace{0.17em}0}<\phi <\frac{\pi }{2},\mathrm{\hspace{0.17em}0}\theta <\mathrm{}\}$$

with an arc length

$$\lambda (0,\theta )=\frac{1}{\mathrm{cos}\phi }\left(e^{\left(cot\phi \right)\theta }1\right).$$
(14)
Now the required by the PNSW–hypothesis sets of angles with respect to $`m`$ and $`n`$, according to the condition (i), are given by the formula

$$\theta _{mn}=\mathrm{tan}\phi \mathrm{ln}(p_n\left(m\right)\mathrm{cos}\phi +1)).$$

For simple logarithmic spirals the conditions (ii) and (iii) of the PNSW–hypothesis are not fulfilled because the equation

$$S_{n_1n_2}\left(x\right)+S_{n_2n_3}\left(x\right)+S_{n_3n_1}\left(x\right)=0,$$
(15)
where

$$S_{\alpha \beta }\left(x\right)=\left(p_\alpha \left(m\right)x+1\right)\left(p_\beta \left(m\right)x+1\right)\mathrm{sin}\left(\sqrt{\frac{1}{x^2}1}\mathrm{ln}\frac{\left(p_\alpha \left(m\right)x+1\right)}{\left(p_\beta \left(m\right)x+1\right)}\right)$$

cannot be satisfied with the same value $`x=\mathrm{cos}\phi `$ for any triplets$`(p_{n_1}\left(m\right),p_{n_2}\left(m\right),p_{n_3}\left(m\right))`$ from any ray $`r_m,m\overline{M}`$.

Nevertheless, the solution (15) for all the denoted prime triplets from all rays of the matrix in Appendix 1 shows that $`x`$ remains in a sufficiently narrow interval $`I_x=(0.202,0.326)`$ with an average $`\overline{x}0.264`$ to which there corresponds a value $`\overline{\phi }74.69^{}`$. On Figure 4 a pure–logarithmic web is presented where only the condition (i) is fulfilled.

This result stimulates us to search for a verification of the PNSW–hypothesis in the class of logarithmic spline–spirals (LSS):

$$\begin{array}{c}\rho _{s_1}\left(\theta \right)=e^{s_1\left(\theta \right)},\hfill \\ \\ s_1\left(\theta \right)=\{\begin{array}{c}\alpha _{i+1}\theta +\beta _{i+1},\theta _i\theta \theta _{i+1}0ik1,\hfill \\ \alpha _{i1}\theta _{i1}+\beta _{i1}=\alpha _i\theta _{i1}+\beta _i,2ik,\hfill \end{array}\hfill \end{array}$$

where the first degree spline $`s_1\left(\theta \right)`$ is defined on an irregular set

$$\mathrm{\Delta }_k:0=\theta _0<\theta _1<\theta _2<\mathrm{}<\theta _{k1}<\theta _k,$$

with a number $`k3`$ of subintervals $`[\theta _i,\theta _{i+1}],0ik1`$, which increases with the number of rotations $`n`$ of the web $`W_n\left(P\right)`$.

The unknowns in the spiral $`\rho _{s_1}\left(\theta \right)`$ are both the knots of the set $`\mathrm{\Delta }_k`$ and the spline–spiral coefficients of the elements $`e^{\alpha _i\theta +\beta _i}`$

$$\{\alpha _i,\theta _i,\beta _i\}_{i=1,2,\mathrm{},k}.$$

They are determined from the conditions of the PNSW–hypothesis with regard for the initial condition

$$e^{\alpha _1\theta _0+\beta _1}=1\beta _1=0.$$
(16)
For arbitrary $`x_+^1`$ there exists an unique $`p(k_x)P`$ such that $`p(k_x1)x<p(k_x)`$ and the isometric transformation $`x_+^1`$ on $`^2`$, determined by the condition (i) of the PNSW–hypothesis, acquires the explicit form

$$h_{\rho _{s_1}}\left(x\right):_+^1\lambda (0,\theta _x)=p\left(k_x1\right)+\sqrt{1+\frac{1}{\alpha _{k_x}^2}}e^{\beta _{k_x}}\left(e^{\alpha _{k_x}\theta _x}e^{\alpha _{k_x}\theta _{k_x1}}\right),$$
(17)
where

$$\begin{array}{c}0x<\mathrm{},\theta _x=\frac{1}{\alpha _{k_x}}\mathrm{ln}E\left(x\right),\hfill \\ \\ E\left(x\right)=\frac{\alpha _{k_x}}{\sqrt{1+\alpha _{k_x}^2}}e^{\beta _{k_x}}\left(xp\left(k_x1\right)\right)+e^{\alpha _{k_x}\theta _{k_x1}},p\left(0\right)=0.\hfill \end{array}$$

The points $`(u_x,v_x)\rho _{s_1}(\theta )^2`$, which correspond to the numbers $`x_+^1`$, have the Euler and Cartesian coordinates respectively:

$$\rho \left(\theta _x\right)=e^{\alpha _{k_x}\theta _x+\beta _{k_x}}=e^{\beta _{k_x}}\mathrm{ln}E\left(x\right),\theta _x=\frac{1}{\alpha _{k_x}}\mathrm{ln}E\left(x\right)$$
(18)
aaaaaaaaaand

$$u_x=\rho \left(\theta _x\right)\mathrm{cos}\left(\theta _x\right),v_x=\rho \left(\theta _x\right)\mathrm{sin}\left(\theta _x\right).$$
(19)
The first plane spiral isometric to the semi–axis $`_+^1`$ was constructed in .

### 4.3 About constructing the webs $`W_n`$

Attempts to construct the spiral $`\rho _{s_1}\left(\theta \right)`$ under the PNSW-hypothesis for a given $`n`$ lead to a denial of some number $`k^0`$ of starting primes because of the difficulty in fulfilling the condition (ii) around the origin of $`^2`$ (condition (i) remains valid for the missed primes). In this paper the case $`k^0=11`$ is considered, i.e., instead of the rays $`r_1,r_4,r_6,r_8,r_9`$ and $`r_{10}`$, the truncated rays $`\overline{r}_1,\overline{r}_4,\overline{r}_8,\overline{r}_9`$ and $`\overline{r}_{10}`$ obey the condition (ii), and these rays start with the numbers $`127,59,41,87,83`$ and $`109`$ respectively.

According to (16), to the first element $`e^{\alpha _1\theta }\left(0\theta \theta _1\right)`$ of the spiral $`\rho _{s_1}`$ there corresponds the real segment $`[0,p\left(k^0+1\right)]`$.

The rotations $`W_n`$ are taken in account from the ray

$$r_{12}=\{37,157,919,7193,\mathrm{}\}$$

in the direction counter–clockwise.

At first, $`\rho _{s_1}^{\left(3\right)}`$ and $`W_3`$ are constructed on the basis of the first 3 elements of the first 25 rays $`\overline{r}_1,\overline{r}_4,\mathrm{},r_{36}`$ plus the fourth element of the ray $`r_{12}`$.

The satisfaction of the conditions (i), (ii) of the PNSW–hypothesis with regard to (16) leads to a solution of a nonlinear system ($`W_3`$–system) of 228 equations and 304 inequalities, caused by the condition (iii), with respect to the 228 unknowns

$$\{\alpha _i,\theta _i,\beta _i\}_{i=1,2,\mathrm{},76}.$$

All 832 primes up to the number 7193, which remain unused in the construction of the $`W_3`$–system $`\left(p_1\left(7193\right)=919;\mathrm{\hspace{0.33em}11}+\left(25\times 3+1\right)+832=919\right)`$ are placed by the Cartesian coordinates (19) on the $`2nd`$ and $`3rd`$ rotation of $`\rho _{s_1}^{\left(3\right)}`$.

The building up of new rotations $`n>3`$ on $`\rho _{s_1}^{\left(3\right)}`$ is reduced to the subsequent solution of $`3\times 3`$ nonlinear systems of equations.

Both solvability and uniqueness of the mentioned infinite set of nonlinear systems are the analytical interpretation of the content of the PNSW-hypothesis.

A desire to avoid the solution of the $`W_3`$–system leads to a construction of approximations $`\stackrel{~}{W}_3,\stackrel{~}{W}_4`$ and $`\widehat{W}_3`$, in which the first two turns are constructed as a simple spiral from $`_\phi `$. The subsequent rotations are constructed as LSS. In these webs $`\phi =74.18896^{}`$.

The web $`\stackrel{~}{W}_3`$ fairly well illustrates the main properties of the prime number spider webs and the web $`\stackrel{~}{W}_4`$ shows the possibility of continuing the construction of higher rotations. The web $`\widehat{W}_3`$ is created for a generation of initial approximations to a solution of the $`W_3`$–system. It also illustrates the demerits of the approximated webs.

The web $`\stackrel{~}{W}_3`$ is presented in Figure 5. It is constructed on the basis of 211 primes: 3 numbers from each of the first 20 rays from $`\overline{r}_1`$ to $`r_{30}`$, 2 numbers from 5 rays from $`r_{32}`$ to $`r_{36}`$ and 2 numbers from each of the 71 rays from $`r_{38}`$ to $`r_{126}\left(320+25+271=211\right)`$; 147 of these primes are placed on the $`2nd`$ and the $`3rd`$ rotations by means of coordinates (19).

The web $`\stackrel{~}{W}_3`$ does not have a complete $`3rd`$ rotation, ending in the number 5381 from the ray $`\overline{r}_1`$ and not reaching number 7193 from the initial ray $`r_{12}`$, marked in Figures 5 and 9 by a thick black line. To simplify the figure, 498 primes remaining until $`p_1\left(5381\right)=709`$ (709-211=498) are not placed on the $`3rd`$ rotation.

The web $`\widehat{W}_3`$ with a full $`3rd`$ rotation is represented in Figure 6. It is built on the basis of 255 primes: 3 from the first 25 rays from $`\overline{r}_1`$ to $`r_{36}`$ and 2 from 90 rays from $`r_{38}`$ to $`r_{151}`$$`\left(325+290=255\right)`$; 180 of these primes are placed on the $`2nd`$ and the $`3rd`$ rotations by means of coordinates (19).

To simplify the figure, 664 primes (919-255=664) remaining up to$`p_1\left(7193\right)=919`$ are not placed on the $`3rd`$ rotation.

At the end of the $`3rd`$ rotation $`\widehat{W}_3`$, (at the transition of the logarithmic spiral in LSS) a unessential qualitative defect shows up between numbers 877 from $`r_{36}`$ and 919 from $`r_{12}`$. The pointed defect obstructs the exact sewing of the spirals between the numbers 6823 and 7193 from the corresponding rays $`r_{36}`$ and $`r_{12}`$. This defect is removable by solving the $`W_3`$–system.

The web $`\stackrel{~}{W}_4`$, represented in Figure 7, is obtained from the web $`\stackrel{~}{W}_3`$ by adding on the $`4th`$ rotation as LSS. In this building, 96 primes are used: 4 elements of the rays from $`\overline{r}_1`$ to $`r_{30}`$, 3 elements of the rays from $`r_{32}`$ to $`r_{36}`$ and 4 elements of the rays from $`r_{38}`$ to $`r_{126}`$ (20+5+71=96). By means of 116 primes the LSS–units $`e^{\alpha _i\theta _i+\beta _i},i=1,2,\mathrm{},116`$ are determined by solving a $`3\times 3`$ nonlinear system 116 times with respect to 348 unknowns $`\alpha _i,\theta _i`$ and $`\beta _i`$: 94 times exactly and 22 times approximately. The cases of inexact solutions result in unessential distortions of the condition (ii) for 22 rays (in the diagrams of $`\stackrel{~}{W}_3`$ and $`\stackrel{~}{W}_4`$ those distortions are not seen).

A variety of possibilities for constructing the PNSW–hypothesis is illustrated by web $`\stackrel{~}{W}_{deg}`$ (Figure 8), in which the condition (ii) is violated in the following way: the rays lie on straight lines, but the subsequent segments of the rays have the opposite directions. In $`\stackrel{~}{W}_{deg}`$, the same primes are used as in $`\stackrel{~}{W}_3`$.

### 4.4 Web formation rules and properties

Satisfying the PNSW–hypothesis, the conditions of $`\stackrel{~}{W}_3`$ and $`\stackrel{~}{W}_4`$ fix the individual peculiarities of the behaviour of primes around the origin of $`^2`$ as concrete systems of embedded trapezoids confined between the rays $`\mathrm{}_{p_{\mu 1}}`$ and $`\mathrm{}_{p_{\left(\mu +k\right)1}},k1`$. For example, the trapezoid $`t_{19}`$ confined between the rays $`\mathrm{}_{113}`$ and $`\mathrm{}_{127}`$ (Figure 9) is one of the nineteen 3-rotation embedded trapezoids (3RET) of the web $`\stackrel{~}{W}_3`$.

From the Theorem 2 it follows that

* The elements of the clusters $`c_{\alpha _\mu }\left(\alpha _\mu \right)`$ (they and only they) become the starts of new rays on the spiral $`\rho _{s_1}\left(\theta \right)`$.

Let a cluster

$$c_\mu \left(k\right)=\{p_{\mu 1},p_{\left(\mu +1\right)1},\mathrm{},p_{\left(\mu +k\right)1}\}.$$

lie on the $`\nu `$th rotation of the spiral $`\rho _{s_1}^{\left(n\right)}\left(\theta \right)`$. On the $`\left(\nu +q\right)`$th rotation to it there correspond the primes $`\left\{p_q\left(p_{\left(\mu +i\right)1}\right)\right\}_{i=0,1,\mathrm{},k}`$.

The PNSW–hypothesis shows that
* The geometric figure on $`^2`$, confined between the arcs$`(p_{\mu 1},p_{\left(\mu +k\right)1})`$ and $`(p_q\left(p_{\mu 1}\right),p_q\left(p_{\left(\mu +k\right)1}\right))`$ by the spiral $`\rho _{s_1}`$ and the segments $`|p_{\mu 1},p_q\left(p_{\mu 1}\right)|`$, $`|p_{\left(\mu +k\right)1},p_q\left(p_{\mu +k}\right)|`$ of the rays $`\mathrm{}_{p_{\mu 1}}`$ and $`\mathrm{}_{p_{\left(\mu +k\right)1}}`$, is the concave–convex trapezoid

$$z(\nu ,\mu ,k,q)=[(p_{\mu 1},p_{\left(\mu +k\right)1}),(p_q\left(p_{\mu 1}\right),p_q\left(p_{\left(\mu +k\right)1}\right))].$$

The trapezoids of the type $`z(\nu ,\mu ,1,1)`$ are elementary trapezoids (or holes) to $`W_n`$. For example

$$z(1,19,1,1)=[(113,127),(617,709)]$$

is an elementary $`W_2`$–trapezoid (Figure 10).

Let the primes $`p_{\mu 1},`$ $`p_{\left(\mu +k\right)1}`$ $`c_\mu \left(\alpha _\mu \right),\alpha _\mu 3,\mathrm{\hspace{0.33em}0}k\alpha _\mu `$ lie on the $`\nu `$th rotation of the spiral $`\rho _{s_1}^{\left(n\right)}`$. On the $`\left(\nu +1\right)`$th rotation, to them there corresponds the cluster $`c_{\mu _1}\left(\alpha _{\mu _1}\right)=\{p_{\mu _11},p_{\left(\mu _1+1\right)1},\mathrm{},p_{\left(\mu _1+\alpha _{\mu _1}\right)1}\}`$ with a length $`\alpha _{\mu _1}=p_{\left(\mu +k\right)1}p_{\mu 1}1`$, according to Corollary 3.

From the conditions of the PNSW-hypothesis there stems the following rule for formation of 3RET:
* On the plane $`^2`$ the following equalities hold

$$z(\nu +1,\mu _1,\alpha _{\mu _1}+1,1)=\underset{i=0}{\overset{\alpha _{\mu _1}}{}}z(\nu +1,\mu +i,1,1),$$
(20)
$$z(\nu ,\mu ,1,2)=z(\nu ,\mu ,1,1)z(\nu +1,\mu _1,\alpha _{\mu _1}+1,1).$$
(21)
Equalities (20) and (21) can be regarded as those between the areas (the sign $``$ changes to +).

Let us apply the rule for formation of 3RET to $`3RET_{19}`$. Using the matrix from Appendix 1, we obtain

$$3RET_{19}=[(113,127),(617,709)][(617,619),(4549,4567)]$$

$$[(619,631),(4567,4663)]\mathrm{}[(701,709),(5281,5381)].$$

In this example $`\nu =1,\mu =30,\alpha _{\mu _1}=1271131=13`$. The starts of the newly–appeared rays on the second rotation are

$$\begin{array}{cccc}p\left(114\right)=619,\hfill & p\left(115\right)=631,\hfill & p\left(116\right)=641,\hfill & p\left(117\right)=643,\hfill \\ p\left(118\right)=647,\hfill & p\left(119\right)=653,\hfill & p\left(120\right)=659,\hfill & p\left(121\right)=661,\hfill \\ p\left(122\right)=673,\hfill & p\left(123\right)=677,\hfill & p\left(124\right)=683,\hfill & p\left(125\right)=691,\text{ and }\hfill \\ p\left(126\right)=701.\hfill & & & \end{array}$$
* The rule for formation of 3RET shows that 3RET is a mosaic of $`\alpha _{\mu _1}+1`$ elementary trapezoids, which are grouped in the direction of the ray $`\mathrm{}_{p_{\mu 1}}`$ in the following way:

the first is the elementary trapezoid

$$[(p_{\mu 1},p_{\left(\mu +1\right)1}),(p_1\left(p_{\mu 1}\right),p_1\left(p_{\left(\mu +1\right)1}\right))],$$

followed by the composite trapezoid

$$[(p_1\left(p_{\mu 1}\right),p_1\left(p_{\left(\mu +\alpha _{\mu _1}\right)1}\right)),(p_2\left(p_{\mu 1}\right),p_2\left(p_{\left(\mu +\alpha _{\mu _1}\right)1}\right))].$$

The elements (elementary trapezoids too) of the last one cause in total $`\mu _2=p_1\left(p_{\left(\mu +\alpha _{\mu _1}\right)1}\right)p_1\left(p_{\mu 1}\right)1`$ new rays on the $`\left(\nu +2\right)th`$ rotation, to which again the 3RET formation rule is applied for obtaining $`\alpha _{\mu _2}`$ new composite trapezoids located between the $`3rd`$ and $`4th`$ rotations of $`W_n`$.

Under the condition of the PNSW-hypothesis the process of growth of the initial 3RET is unlimited and leads to the formation of a class $`(\mathrm{}_{p_{\mu 1}},\mathrm{}_{p_{(\mu +1)1}})`$–trapezoids containing an unlimited number of different elementary trapezoids.
* Let mitos denote a closed geometric figure locked between the arc$`(p\left(12\right),p_1\left(12\right)))`$ of the spiral $`\rho _{s_1}`$ and the segment $`|p\left(12\right),p_1\left(12\right)|`$ of the ray $`r_{12}`$. Then the plane $`^2`$ can be represented as a mosaic of the initial $`k\left(k^0\right)`$–classes of embedded trapezoids (k(11)=25):

$$^2=\underset{i=1}{\overset{k\left(k^0\right)}{}}(\mathrm{}_{p\left(k^0+i\right)},\mathrm{}_{p\left(k^0+i+1\right)})\text{mitos}.$$

Inside the mitos the starts of the first few rays can intersect each other, i.e., be in a mitosis status.

Properties $`q_{10}),q_{11})`$ and $`q_{12})`$ are generalized in the property $`q_{13}`$.
* The plane $`^2`$ is representable as a mosaic (in the theoretical–set sum sense) of all the prime–numerical elementary trapezoids and mitos.
* The PNSW-hypothesis leads to the geometric interpretation of $`\pi \left(x\right)`$:

$$\pi \left(p_\nu \left(m\right)\right)=p_{\nu 1}\left(m\right)=\lambda (0,p_{\nu 1}\left(m\right)),\nu 2,m\overline{M}.$$
(22)
Equalities (22) allow one to interpret geometrically the $`\mathrm{\Omega }`$–theorem of Littlwood and Theorem 1 from , where for setting the real values and in particular the values of $`Li\left(x\right)`$ again the transformation $`h_{\rho _{s_1}}\left(x\right)`$ and coordinates (19) are used.

The geometric interpretation of the Theorem 3 consists in determination of the laws for appearance of $`u`$– and $`b`$–twins on $`W_n`$.
* $`u`$–twins appear on $`W_n`$ in the following cases:

a) as starts of new rays $`\mathrm{}_{p_{\mu 1}}`$ and $`\mathrm{}_{p_{\left(\mu +1\right)1}}`$ on the $`1st`$ rotation 3RET, which on the $`2nd`$ rotation cause one new ray $`\mathrm{}_{p\left(\left(p_{\mu 1}+p_{\left(\mu +1\right)1}\right)/2\right)}`$. Then 3RET is composed of three elementary trapezoids.

Examples:

$$\overline{m}_8\left(3\right)(\mathrm{}_{71},\mathrm{}_{73})\mathrm{}_{359},$$

$$\overline{m}_9\left(5\right)(\mathrm{}_{101},\mathrm{}_{103})\mathrm{}_{557},$$

$$\overline{m}_{11}\left(5\right)\{\begin{array}{c}(\mathrm{}_{137},\mathrm{}_{139})\mathrm{}_{787},\hfill \\ (\mathrm{}_{149},\mathrm{}_{151})\mathrm{}_{863};\hfill \end{array}$$

b) as a pair of subsequent primes on the $`2nd`$ rotation of 3RET

Examples on the $`2nd`$ turn of the trapezoid $`z(1,19,1,2)`$ (Figure 9):

$$\overline{m}_{30}\left(13\right)\{\begin{array}{c}(\mathrm{}_{641},\mathrm{}_{643})\mathrm{}_{4783},\hfill \\ (\mathrm{}_{659},\mathrm{}_{661})\mathrm{}_{4937}.\hfill \end{array}$$
* One of the elements of $`b`$–twin $`(t_1\left(\overline{n}\right),t_2\left(\overline{n}\right))`$ lies on the existing ray$`\mathrm{}_{p_q\left(p_{\mu _11}\right)},q1`$, but the other element is a start of a new ray $`\mathrm{}_{p_{\mu _21}}`$:

$$t_1\left(\overline{n}\right)p_q\left(p_{\mu _11}\right),t_2\left(\overline{n}\right)p_{\mu _21}\text{ – }right\text{ twin};$$

$$t_1\left(\overline{n}\right)p_{\mu _21},t_2\left(\overline{n}\right)p_q\left(p_{\mu _11}\right)\text{ – }left\text{ twin}$$

In such a way the $`b`$–elementary trapezoid

$$[(p_q\left(p_{\mu _11}\right),p_{\mu _21}),(p_{q+1}\left(p_{\mu _11}\right),p\left(p_{\mu _21}\right))]$$

is sewn together to the right of the ray $`\mathrm{}_{p_{\mu _11}}`$, and trapezoid

$$[(p_{\mu _21},p_q\left(p_{\mu _11}\right)),(p\left(p_{\mu _21}\right),p_{q+1}\left(p_{\mu _11}\right))]$$

to the left of the ray $`\mathrm{}_{p_{\mu _11}}`$.

Examples: the trapezoid $`[(617,619),(4549,4567)]`$ is sewn to the right of the ray $`\mathrm{}_{113}\left((\mathrm{}_{617},\mathrm{}_{619})\mathrm{}_{4561}\right);`$

the trapezoid $`[(857,859),(6653,6661)]`$ is sewn to the left of the ray$`\mathrm{}_{149}\left((\mathrm{}_{857},\mathrm{}_{859})\mathrm{}_{6659}\right)`$.

The properties $`q_{15})`$ and $`q_{16})`$ show the following $`W_n`$ sewing property
* The twin pairs $`sew`$ uniformly over $`n`$ the Eratosthenes rays in an $`unified`$ plane web $`W_n,`$ $`n=1,2,\mathrm{}.`$

## 5 Conclusion

The study of the inner prime number distribution law remains at the initial stage.

Finally, we shall note how the proof of Conjecture 1 looks like, and we shall find a possibility of its generalization. We should like to indicate possible applications of the proposed, in this paper, approach to a study of the oddish prime number behaviour.

At the first stage of the proof of Conjecture 1 it is necessary to solve the $`W_3`$–system and revise the number $`k^0`$. If the $`W_3`$–system cannot be solved with $`k^0=11`$, then the numbers $`k^0=10`$ and $`k^0=12`$ should be tried.

In the formulation of the $`W_3`$–system a function $`\stackrel{~}{p}\left(x\right)C^1(0,10000],`$ with a property

$$\stackrel{~}{p}\left(n\right)=p\left(n\right),n=1,2,\mathrm{},1229$$
(23)
is used.

This function can be built up by the rod spline method  using as a rod the approximation (, exercise 9.21)

$$\overline{p}\left(x\right)=x\left(\mathrm{ln}x+\mathrm{ln}\mathrm{ln}x+\frac{\mathrm{ln}\mathrm{ln}x2}{\mathrm{ln}x}\frac{\left(\mathrm{ln}\mathrm{ln}x\right)^2/23\mathrm{ln}\mathrm{ln}x+5.5}{\left(\mathrm{ln}x\right)^2}1\right).$$

The searched function will be of the form $`\stackrel{~}{p}\left(x\right)=s_2\left(x\right)\overline{p}\left(x\right)`$, where $`s_2\left(x\right)`$ is a parabolic spline determined on two nonuniform sets. At the interpolation points equalities (23) are fulfilled.

The $`W_3`$–system solvability can first be investigated numerically by using, for example, the program LANCELOT .

At the second stage of the proof of Conjecture 1, it is necessary to prove inductively the continuability of the basic $`k(k^0)`$–classes of embedded trapezoids

$$(\mathrm{}_{p_{\left(k^0+i\right)1}},\mathrm{}_{p_{\left(k^0+i+1\right)1}}),i=1,2,\mathrm{},k\left(k^0\right),$$

as well as the continuability of the new classes on rotations $`n2`$.

Conjecture 1 can be extended to all mesmf–matrices.

Conjecture 2. For each matrix $`A_f_f`$ there exists LSS-spiral and a web $`W_n(A_f)`$, satisfying the conditions (i), (ii) and (iii) of the PNSW–hypothesis.

In the infinite set of webs $`𝐰=\{W_n\left(A_f\right):A_f_f,n=1,2,\mathrm{}\}`$ it is necessary to introduce an operation summing webs @ in such a way that the equalities

$$W_n\left(S\right)\mathrm{@}W_n\left(T_1\right)\mathrm{@}W_n\left(T_2\right)=W_n\left(P\right)$$

and

$$W_n\left(D_{6n1}\right)\mathrm{@}W_n\left(D_{6n+1}\right)=W_n\left(P\right),$$

hold, by analogy with the set-theoretical equalities $`P=ST_1T_2`$ and $`P=D_{6n1}D_{6n+1}\{2,3\},\text{ where}\{2,3\}\text{ }\text{mitos}`$.

On the whole, the algebraic structures of mesm-matrices $`\left[B_f^2A_f\right]`$, webs $`W_n\left(A_f\right)`$ and the set $`𝐰`$ remain unexplored.

The spiral $`\rho _{s_1}\left(\theta \right)`$ length from the PNSW–hypothesis can turn out to be an appropriate time coordinate in the description of physical processes taking place in asymmetric and irreversible time.

Indeed, the mapping (17) can be extended also for negative values $`x(\mathrm{},0]:`$

$$h_{\rho _{s_1}}\left(x\right):_{}^1\lambda (0,\theta _x)=\frac{1}{\mathrm{cos}\phi }\left(e^{\left(cot\phi \right)\theta _x}1\right),$$

$$\mathrm{}<x0,\phi =arccot\left(\alpha _1\right).$$

In such a way, in the unit circle (inside the domain mitos) there remains a finite negative moustache with a length

$$\lambda (0,\mathrm{})=\frac{1}{\mathrm{cos}\phi }.$$

Now, the arc length of the spiral $`\rho _{s_1}\left(\theta \right),\mathrm{}<\theta <\mathrm{}`$ is split up in three pieces: the length of the negative moustache, the finite positive length spiral in the mitosis and the infinite arc length corresponding to the semiaxis $`[p\left(k^0+1\right),\mathrm{})`$.

The solution of equations (10), (11) provides a motivation for the following hypothesis:

Conjecture 3. For arbitrary $`m\overline{M}`$ and large $`n`$ the inequality

$$\left|L\left(p_{n+1}\left(m\right)\right)p_n\left(m\right)\right|c_1\sqrt{p_{n+1}\left(m\right)}\mathrm{ln}\left(p_{n+1}\left(m\right)\right)$$
(24)
is fulfilled with a constant $`c_1`$ independent of $`m`$ .

Inequalities (24) result in the common estimate

$$\left|L\left(x\right)\pi \left(x\right)\right|<c_2\sqrt{x}\mathrm{ln}x,c_2=const.$$
(25)
The proof of inequality (24) is easier than the proof of inequality (25). If from estimation (25) follows the truth of the Riemann hypothesis that complex solutions of the equations $`\zeta \left(s\right)=0,s\mathit{}`$ have a form $`s=1/2+i\gamma _n,`$ $`\gamma _n,n=1,2,\mathrm{},`$ then the inner prime number distribution law (9) will prove to be a new useful tool of the analytical number theory.

Appendix 1

Matrix $`[\overline{𝐌}^\mathrm{𝟐}𝐏]`$

$$\begin{array}{cccccccccccc}& & & & & & & & & & & \\ & & & & & & & & & & & \\ 1\hfill & 2\hfill & 3\hfill & 5\hfill & 11\hfill & 31\hfill & & & & & & \\ & & 127\hfill & 709\hfill & 5381\hfill & 52711\hfill & & & & & & \\ & & 648391\hfill & 9737333\hfill & 174440041\hfill & 3657500101\hfill & & & & & & \\ & & 88362852307\hfill & 2428095424619\hfill & & & & & & & & \\ & & 75063692618249\mathrm{}\hfill & & & & & & & & & \\ 4\hfill & 7\hfill & 17\hfill & 59\hfill & 277\hfill & 1787\hfill & & & & & & \\ & & 15299\hfill & 167449\hfill & 2269733\hfill & 37139213\hfill & & & & & & \\ & & 718064159\hfill & 16123689073\hfill & 414507281407\hfill & & & & & & & \\ & & 12055296811267\mathrm{}\hfill & & & & & & & & & \\ 6\hfill & 13\hfill & 41\hfill & 179\hfill & 1063\hfill & 8527\hfill & & & & & & \\ & & 87803\hfill & 1128889\hfill & 17624813\hfill & 326851121\hfill & & & & & & \\ & & 7069067389\hfill & 175650481151\hfill & 4952019383323\mathrm{}\hfill & & & & & & & \\ 8\hfill & 19\hfill & 67\hfill & 331\hfill & 2221\hfill & 19577\hfill & & & & & & \\ & & 219613\hfill & 3042161\hfill & 50728129\hfill & 997525853\hfill & & & & & & \\ & & 22742734291\hfill & 592821132889\hfill & 17461204521323\mathrm{}\hfill & & & & & & & \\ 9\hfill & 23\hfill & 83\hfill & 431\hfill & 3001\hfill & 27457\hfill & & & & & & \\ & & 318211\hfill & 4535189\hfill & 77557187\hfill & 1559861749\hfill & & & & & & \\ & & 36294260117\hfill & 963726515729\hfill & 28871271685163\mathrm{}\hfill & & & & & & & \\ 10\hfill & 29\hfill & 109\hfill & 599\hfill & 4397\hfill & 42043\hfill & & & & & & \\ & & 506683\hfill & 7474967\hfill & 131807699\hfill & 2724711961\hfill & & & & & & \\ & & 64988430769\hfill & 1765037224331\hfill & 53982894593057\mathrm{}\hfill & & & & & & & \\ 12\hfill & 37\hfill & 157\hfill & 919\hfill & 7193\hfill & 72727\hfill & & & & & & \\ & & 919913\hfill & 14161729\hfill & 259336153\hfill & 5545806481\hfill & & & & & & \\ & & 136395369829\hfill & 3809491708961\mathrm{}\hfill & & & & & & & & \\ 14\hfill & 43\hfill & 191\hfill & 1153\hfill & 9319\hfill & 96797\hfill & & & & & & \\ & & 1254739\hfill & 19734581\hfill & 368345293\hfill & 8012791231\hfill & & & & & & \\ & & 200147986693\hfill & 5669795882633\mathrm{}\hfill & & & & & & & & \\ 15\hfill & 47\hfill & 211\hfill & 1297\hfill & 10631\hfill & 112129\hfill & & & & & & \\ & & 1471343\hfill & 23391799\hfill & 440817757\hfill & 9672485827\hfill & & & & & & \\ & & 243504973489\hfill & 6947574946087\mathrm{}\hfill & & & & & & & & \\ 16\hfill & 53\hfill & 241\hfill & 1523\hfill & 12763\hfill & 137077\hfill & & & & & & \\ & & 1828669\hfill & 29499439\hfill & 563167303\hfill & 12501968177\hfill & & & & & & \\ & & 318083817907\hfill & 9163611272327\mathrm{}\hfill & & & & & & & & \\ 18\hfill & 61\hfill & 283\hfill & 1847\hfill & 15823\hfill & 173867\hfill & & & & & & \\ & & 2364361\hfill & 38790341\hfill & 751783477\hfill & 16917026909\hfill & & & & & & \\ & & 435748987787\hfill & 12695664159413\mathrm{}\hfill & & & & & & & & \\ 20\hfill & 71\hfill & 353\hfill & 2381\hfill & 21179\hfill & 239489\hfill & & & & & & \\ & & 3338989\hfill & 56011909\hfill & 1107276647\hfill & 25366202179\hfill & & & & & & \\ & & 664090238153\hfill & 19638537755027\mathrm{}\hfill & & & & & & & & \\ 21\hfill & 73\hfill & 367\hfill & 2477\hfill & 22093\hfill & 250751\hfill & & & & & & \\ & & 3509299\hfill & 59053067\hfill & 1170710369\hfill & 26887732891\hfill & & & & & & \\ & & 705555301183\hfill & 20909033866927\mathrm{}\hfill & & & & & & & & \end{array}$$

Appendix 1

Matrix $`[\overline{𝐌}^\mathrm{𝟐}𝐏]`$… Continuation 1.

$$\begin{array}{cccccc}& & & & & \\ & & & & & \\ 22\hfill & 79\hfill & 401\hfill & 2749\hfill & 24859\hfill & 285191\hfill \\ & & 4030889\hfill & 68425619\hfill & 1367161723\hfill & 31621854169\hfill \\ & & 835122557939\hfill & 24894639811901\mathrm{}\hfill & & \\ 24\hfill & 89\hfill & 461\hfill & 3259\hfill & 30133\hfill & 352007\hfill \\ & & 5054303\hfill & 87019979\hfill & 1760768239\hfill & 41192432219\hfill \\ & & 1099216100167\hfill & 33080040753131\mathrm{}\hfill & & \\ 25\hfill & 97\hfill & 509\hfill & 3637\hfill & 33967\hfill & 401519\hfill \\ & & 5823667\hfill & 101146501\hfill & 2062666783\hfill & 48596930311\hfill \\ & & 1305164025929\hfill & 39510004035659\mathrm{}\hfill & & \\ 26\hfill & 101\hfill & 547\hfill & 3943\hfill & 37217\hfill & 443419\hfill \\ & & 6478961\hfill & 113256643\hfill & 2323114841\hfill & 55022031709\hfill \\ & & 1484830174901\hfill & 45147154715447\mathrm{}\hfill & & \\ 27\hfill & 103\hfill & 563\hfill & 4091\hfill & 38833\hfill & 464939\hfill \\ & & 6816631\hfill & 119535373\hfill & 2458721501\hfill & 58379844161\hfill \\ & & 1579041544637\hfill & 48112275898789\mathrm{}\hfill & & \\ 28\hfill & 107\hfill & 587\hfill & 4273\hfill & 40819\hfill & 490643\hfill \\ & & 7220981\hfill & 127065427\hfill & 2621760397\hfill & 62427213623\hfill \\ & & 1692866362237\hfill & 51702420222709\mathrm{}\hfill & & \\ 30\hfill & 113\hfill & 617\hfill & 4549\hfill & 43651\hfill & 527623\hfill \\ & & 7807321\hfill & 138034009\hfill & 2860139341\hfill & 68363711327\hfill \\ & & 1860306318433\hfill & 56997887937671\mathrm{}\hfill & & \\ 32\hfill & 131\hfill & 739\hfill & 5623\hfill & 55351\hfill & 683873\hfill \\ & & 10311439\hfill & 185350441\hfill & 3898093877\hfill & 94434956839\hfill \\ & & 2606906998739\hfill & 80783250929599\mathrm{}\hfill & & \\ 33\hfill & 137\hfill & 773\hfill & 5869\hfill & 57943\hfill & 718807\hfill \\ & & 10875143\hfill & 196100297\hfill & 4135824247\hfill & 100450108949\hfill \\ & & 2773622459039\hfill & 86127342906779\mathrm{}\hfill & & \\ 34\hfill & 139\hfill & 797\hfill & 6113\hfill & 60647\hfill & 755387\hfill \\ & & 11469013\hfill & 207460717\hfill & 4387715993\hfill & 106839327589\hfill \\ & & 2956887579073\mathrm{}\hfill & & & \\ 35\hfill & 149\hfill & 859\hfill & 6661\hfill & 66851\hfill & 839483\hfill \\ & & 12838937\hfill & 233784751\hfill & 4973864561\hfill & 121763369327\hfill \\ & & 3386468161121\mathrm{}\hfill & & & \\ 36\hfill & 151\hfill & 877\hfill & 6823\hfill & 68639\hfill & 864013\hfill \\ & & 13243033\hfill & 241568891\hfill & 5147813641\hfill & 126206581463\hfill \\ & & 3514741569337\mathrm{}\hfill & & & \\ 38\hfill & 163\hfill & 967\hfill & 7607\hfill & 77431\hfill & 985151\hfill \\ & & 15239333\hfill & 280256489\hfill & 6016014239\hfill & 148471002899\hfill \\ & & 4159843299587\mathrm{}\hfill & & & \end{array}$$

Appendix 1

Matrix $`[\overline{𝐌}^\mathrm{𝟐}𝐏]`$… Continuation 2.

$$\begin{array}{cccccc}& & & & & \\ & & & & & \\ 39\hfill & 167\hfill & 991\hfill & 7841\hfill & 80071\hfill & 1021271\hfill \\ & & 15837299\hfill & 291905681\hfill & 6278569691\hfill & 155231019913\hfill \\ & & 4356423418499\mathrm{}\hfill & & & \\ 40\hfill & 173\hfill & 1031\hfill & 8221\hfill & 84347\hfill & 1080923\hfill \\ & & 16827557\hfill & 311234591\hfill & 6715304579\hfill & 166500464477\hfill \\ & & 4684808232443\mathrm{}\hfill & & & \\ 42\hfill & 181\hfill & 1087\hfill & 8719\hfill & 90023\hfill & 1159901\hfill \\ & & 18143603\hfill & 337033877\hfill & 7300206493\hfill & 181639026043\hfill \\ & & 5127173445557\mathrm{}\hfill & & & \\ 44\hfill & 193\hfill & 1171\hfill & 9461\hfill & 98519\hfill & 1278779\hfill \\ & & 20137253\hfill & 376292689\hfill & 8194134017\hfill & 204869160779\hfill \\ & & 5808496248769\mathrm{}\hfill & & & \\ 45\hfill & 197\hfill & 1201\hfill & 9739\hfill & 101701\hfill & 1323503\hfill \\ & & 20890789\hfill & 391182829\hfill & 8534307629\hfill & 213736527847\hfill \\ & & 6069307408303\mathrm{}\hfill & & & \\ 46\hfill & 199\hfill & 1217\hfill & 9859\hfill & 103069\hfill & 1342907\hfill \\ & & 21219089\hfill & 397681327\hfill & 8682977119\hfill & 217616274683\hfill \\ & & 6183541562551\mathrm{}\hfill & & & \\ 48\hfill & 223\hfill & 1409\hfill & 11743\hfill & 125113\hfill & 1656649\hfill \\ & & 26548261\hfill & 503859997\hfill & 11126538823\hfill & 281736685679\hfill \\ & & 8081022964981\mathrm{}\hfill & & & \\ 49\hfill & 227\hfill & 1433\hfill & 11953\hfill & 127643\hfill & 1693031\hfill \\ & & 27170047\hfill & 516340703\hfill & 11415461989\hfill & 289357897711\hfill \\ & & 8307635814431\mathrm{}\hfill & & & \\ 50\hfill & 229\hfill & 1447\hfill & 12097\hfill & 129229\hfill & 1715761\hfill \\ & & 27560453\hfill & 524172379\hfill & 11596829689\hfill & 294145810687\hfill \\ & & 8450108859131\mathrm{}\hfill & & & \\ 51\hfill & 233\hfill & 1471\hfill & 12301\hfill & 131707\hfill & 1751411\hfill \\ & & 28171007\hfill & 536433767\hfill & 11881126321\hfill & 301656862553\hfill \\ & & 8673774992821\mathrm{}\hfill & & & \\ 52\hfill & 239\hfill & 1499\hfill & 12547\hfill & 134597\hfill & 1793237\hfill \\ & & 28889363\hfill & 550881943\hfill & 12216514841\hfill & 310526940547\hfill \\ & & 8938160481557\mathrm{}\hfill & & & \\ 54\hfill & 251\hfill & 1597\hfill & 13469\hfill & 145547\hfill & 1950629\hfill \\ & & 31599859\hfill & 605555557\hfill & 13489097663\hfill & 344268078839\hfill \\ & & 9946200971687\mathrm{}\hfill & & & \\ 55\hfill & 257\hfill & 1621\hfill & 13709\hfill & 148439\hfill & 1993039\hfill \\ & & 32332763\hfill & 620393003\hfill & 13835380799\hfill & 353471438263\hfill \\ & & 10221768670013\mathrm{}\hfill & & & \\ 56\hfill & 263\hfill & 1669\hfill & 14177\hfill & 153877\hfill & 2071583\hfill \\ & & 33691309\hfill & 647927381\hfill & 14478972721\hfill & 370600719481\hfill \\ & & 10735307868743\mathrm{}\hfill & & & \end{array}$$

Appendix 1

Matrix $`[\overline{𝐌}^\mathrm{𝟐}𝐏]`$… Continuation 3.

$$\begin{array}{cccccc}& & & & & \\ & & & & & \\ 57\hfill & 269\hfill & 1723\hfill & 14723\hfill & 160483\hfill & 2167937\hfill \\ & & 35368547\hfill & 682005953\hfill & 15277169617\hfill & 391886115431\hfill \\ & & 11374585999793\mathrm{}\hfill & & & \\ 58\hfill & 271\hfill & 1741\hfill & 14867\hfill & 162257\hfill & 2193689\hfill \\ & & 35815873\hfill & 691097513\hfill & 15490445177\hfill & 397580778799\hfill \\ & & 11545824668459\mathrm{}\hfill & & & \\ 60\hfill & 281\hfill & 1823\hfill & 15641\hfill & 171697\hfill & 2332537\hfill \\ & & 38235377\hfill & 740436923\hfill & 16649917331\hfill & 428592846379\hfill \\ & & 12479807093519\mathrm{}\hfill & & & \\ 62\hfill & 293\hfill & 1913\hfill & 16519\hfill & 182261\hfill & 2487943\hfill \\ & & 40951019\hfill & 796000427\hfill & 17959785803\hfill & 463728180431\hfill \\ & & 13540770614753\mathrm{}\hfill & & & \\ 63\hfill & 307\hfill & 2027\hfill & 17627\hfill & 195677\hfill & 2685911\hfill \\ & & 44432569\hfill & 867503173\hfill & 19651365719\hfill & 509248998611\hfill \\ & & 14919411840803\mathrm{}\hfill & & & \\ 64\hfill & 311\hfill & 2063\hfill & 17987\hfill & 200017\hfill & 2750357\hfill \\ & & 45564719\hfill & 890830471\hfill & 20204583739\hfill & 524169678691\hfill \\ & & 15372235794151\mathrm{}\hfill & & & \\ 65\hfill & 313\hfill & 2081\hfill & 18149\hfill & 202001\hfill & 2779781\hfill \\ & & 46082987\hfill & 901517753\hfill & 20458245581\hfill & 531016168117\hfill \\ & & 15580165580489\mathrm{}\hfill & & & \\ 66\hfill & 317\hfill & 2099\hfill & 18311\hfill & 204067\hfill & 2810191\hfill \\ & & 46620709\hfill & 912598217\hfill & 20721384791\hfill & 538121923037\hfill \\ & & 15796066509169\mathrm{}\hfill & & & \\ 68\hfill & 337\hfill & 2269\hfill & 20063\hfill & 225503\hfill & 3129913\hfill \\ & & 52286593\hfill & 1029838717\hfill & 23513901553\hfill & 613739626127\hfill \\ & & 18099406558319\mathrm{}\hfill & & & \\ 69\hfill & 347\hfill & 2341\hfill & 20773\hfill & 234293\hfill & 3260657\hfill \\ & & 54615469\hfill & 1078227191\hfill & 24670634249\hfill & 645165616243\hfill \\ & & 19059563752283\mathrm{}\hfill & & & \\ 70\hfill & 349\hfill & 2351\hfill & 20899\hfill & 235891\hfill & 3284657\hfill \\ & & 55043683\hfill & 1087126459\hfill & 24883634693\hfill & 650958710863\hfill \\ & & 19236734782351\mathrm{}\hfill & & & \\ 72\hfill & 359\hfill & 2417\hfill & 21529\hfill & 243781\hfill & 3403457\hfill \\ & & 57160969\hfill & 1131224411\hfill & 25940205719\hfill & 679722101701\hfill \\ & & 20117195040149\mathrm{}\hfill & & & \\ 74\hfill & 373\hfill & 2549\hfill & 22811\hfill & 259657\hfill & 3643579\hfill \\ & & 61460533\hfill & 1221036307\hfill & 28097383163\hfill & 738585245417\hfill \\ & & 21922891272739\mathrm{}\hfill & & & \\ 75\hfill & 379\hfill & 2609\hfill & 23431\hfill & 267439\hfill & 3760921\hfill \\ & & 63567289\hfill & 1265161649\hfill & 29159843309\hfill & 767640499331\hfill \\ & & 22816010162129\mathrm{}\hfill & & & \end{array}$$

Appendix 1

Matrix $`[\overline{𝐌}^\mathrm{𝟐}𝐏]`$… Continuation 4.

$$\begin{array}{cccccc}& & & & & \\ & & & & & \\ 76\hfill & 383\hfill & 2647\hfill & 23801\hfill & 271939\hfill & 3829223\hfill \\ & & 64795981\hfill & 1290918281\hfill & 29780778613\hfill & 784640376427\hfill \\ & & 23339094889519\mathrm{}\hfill & & & \\ 77\hfill & 389\hfill & 2683\hfill & 24107\hfill & 275837\hfill & 3888551\hfill \\ & & 65864459\hfill & 1313343397\hfill & 30321784529\hfill & 799462887341\hfill \\ & & 23795492951147\mathrm{}\hfill & & & \\ 78\hfill & 397\hfill & 2719\hfill & 24509\hfill & 280913\hfill & 3965483\hfill \\ & & 67247771\hfill & 1342401539\hfill & 31023447269\hfill & 818701472243\hfill \\ & & 24388288001989\mathrm{}\hfill & & & \\ 80\hfill & 409\hfill & 2803\hfill & 25423\hfill & 292489\hfill & 4142053\hfill \\ & & 70432519\hfill & 1409422013\hfill & 32644249103\hfill & 863205467819\hfill \\ & & 25761357737977\mathrm{}\hfill & & & \\ 81\hfill & 419\hfill & 2897\hfill & 26371\hfill & 304553\hfill & 4326473\hfill \\ & & 73768631\hfill & 1479780677\hfill & 34349423377\hfill & 910115902141\hfill \\ & & 27211243680073\mathrm{}\hfill & & & \\ 82\hfill & 421\hfill & 2909\hfill & 26489\hfill & 305999\hfill & 4348681\hfill \\ & & 74172503\hfill & 1488302867\hfill & 34556157661\hfill & 915809403721\hfill \\ & & 27387388206553\mathrm{}\hfill & & & \\ 84\hfill & 433\hfill & 3019\hfill & 27689\hfill & 321017\hfill & 4578163\hfill \\ & & 78339559\hfill & 1576442723\hfill & 36697520357\hfill & 974856473813\hfill \\ & & 29216297536511\mathrm{}\hfill & & & \\ 85\hfill & 439\hfill & 3067\hfill & 28109\hfill & 326203\hfill & 4658099\hfill \\ & & 79794157\hfill & 1607252663\hfill & 37447368857\hfill & 995564440951\hfill \\ & & 29858589333061\mathrm{}\hfill & & & \\ 86\hfill & 443\hfill & 3109\hfill & 28573\hfill & 332099\hfill & 4748047\hfill \\ & & 81428323\hfill & 1641908027\hfill & 38291437141\hfill & 1018893116299\hfill \\ & & 30582699050611\mathrm{}\hfill & & & \\ 87\hfill & 449\hfill & 3169\hfill & 29153\hfill & 339601\hfill & 4863959\hfill \\ & & 83543071\hfill & 1686826109\hfill & 39386748617\hfill & 1049194449883\hfill \\ & & 31524064728311\mathrm{}\hfill & & & \\ 88\hfill & 457\hfill & 3229\hfill & 29803\hfill & 347849\hfill & 4989697\hfill \\ & & 85839547\hfill & 1735649329\hfill & 40578571003\hfill & 1082201297941\hfill \\ & & 32550506359429\mathrm{}\hfill & & & \\ 90\hfill & 463\hfill & 3299\hfill & 30557\hfill & 357473\hfill & 5138719\hfill \\ & & 88565483\hfill & 1793681753\hfill & 41997140089\hfill & 1121535591721\hfill \\ & & 33775078562347\mathrm{}\hfill & & & \\ 91\hfill & 467\hfill & 3319\hfill & 30781\hfill & 360293\hfill & 5182717\hfill \\ & & 89369047\hfill & 1810798861\hfill & 42415879469\hfill & 1133155938589\hfill \\ & & 34137123380603\mathrm{}\hfill & & & \\ 92\hfill & 479\hfill & 3407\hfill & 31667\hfill & 371981\hfill & 5363167\hfill \\ & & 92678347\hfill & 1881428537\hfill & 44145738083\hfill & 1181205761389\hfill \\ & & 35635464099689\mathrm{}\hfill & & & \end{array}$$

Appendix 1

Matrix $`[\overline{𝐌}^\mathrm{𝟐}𝐏]`$… Continuation 5.

$$\begin{array}{cccccc}& & & & & \\ & & & & & \\ 93\hfill & 487\hfill & 3469\hfill & 32341\hfill & 380557\hfill & 5496349\hfill \\ & & 95121911\hfill & 1933651711\hfill & 45426482839\hfill & 1216826411041\hfill \\ & & 36747532444747\mathrm{}\hfill & & & \\ 94\hfill & 491\hfill & 3517\hfill & 32797\hfill & 386401\hfill & 5587537\hfill \\ & & 96797411\hfill & 1969496239\hfill & 46306458839\hfill & 1241322670799\hfill \\ & & 37512927359291\mathrm{}\hfill & & & \\ 95\hfill & 499\hfill & 3559\hfill & 33203\hfill & 391711\hfill & 5670851\hfill \\ & & 98330021\hfill & 2002298621\hfill & 47112340151\hfill & 1263771327193\hfill \\ & & 38214783465337\mathrm{}\hfill & & & \\ 96\hfill & 503\hfill & 3593\hfill & 33569\hfill & 396269\hfill & 5741453\hfill \\ & & 99630571\hfill & 2030158657\hfill & 47797243919\hfill & 1282861540019\hfill \\ & & 38811965770483\mathrm{}\hfill & & & \\ 98\hfill & 521\hfill & 3733\hfill & 35023\hfill & 415253\hfill & 6037513\hfill \\ & & 105089261\hfill & 2147305243\hfill & 50681376121\hfill & 1363360331743\hfill \\ & & 41333311232987\mathrm{}\hfill & & & \\ 99\hfill & 523\hfill & 3761\hfill & 35311\hfill & 418961\hfill & 6095731\hfill \\ & & 106166089\hfill & 2170447637\hfill & 51251887327\hfill & 1379303865481\hfill \\ & & 41833278300773\mathrm{}\hfill & & & \\ 100\hfill & 541\hfill & 3911\hfill & 36887\hfill & 439357\hfill & 6415081\hfill \\ & & 112073683\hfill & 2297602183\hfill & 54391267121\hfill & 1467155677657\hfill \\ & & 44591559921641\mathrm{}\hfill & & & \\ 102\hfill & 557\hfill & 4027\hfill & 38153\hfill & 455849\hfill & 6673993\hfill \\ & & 116881321\hfill & 2401362767\hfill & 56958606937\hfill & 1539140110927\hfill \\ & & 46855727983837\mathrm{}\hfill & & & \\ 104\hfill & 569\hfill & 4133\hfill & 39239\hfill & 470207\hfill & 6898807\hfill \\ & & 121064467\hfill & 2491797367\hfill & 59200082443\hfill & 1602086508713\hfill \\ & & 48838469899327\mathrm{}\hfill & & & \\ 105\hfill & 571\hfill & 4153\hfill & 39451\hfill & 472837\hfill & 6940103\hfill \\ & & 121834483\hfill & 2508461203\hfill & 59613478459\hfill & 1613705610163\hfill \\ & & 49204743622123\mathrm{}\hfill & & & \\ 106\hfill & 577\hfill & 4217\hfill & 40151\hfill & 481847\hfill & 7081709\hfill \\ & & 124469621\hfill & 2565499711\hfill & 61029312569\hfill & 1653521623993\hfill \\ & & 50460527025823\mathrm{}\hfill & & & \\ 108\hfill & 593\hfill & 4339\hfill & 41491\hfill & 499403\hfill & 7359427\hfill \\ & & 129647857\hfill & 2677808011\hfill & 63821022049\hfill & 1732128413677\hfill \\ & & 52942646093899\mathrm{}\hfill & & & \\ 110\hfill & 601\hfill & 4421\hfill & 42293\hfill & 510031\hfill & 7528669\hfill \\ & & 132814411\hfill & 2746597487\hfill & 65533394977\hfill & 1780407360517\hfill \\ & & 54468962620717\mathrm{}\hfill & & & \\ 111\hfill & 607\hfill & 4463\hfill & 42697\hfill & 515401\hfill & 7612799\hfill \\ & & 134389627\hfill & 2780844971\hfill & 66386576369\hfill & 1804479121591\hfill \\ & & 55230488801623\mathrm{}\hfill & & & \end{array}$$

Appendix 1

Matrix $`[\overline{𝐌}^\mathrm{𝟐}𝐏]`$… Continuation 6.

$$\begin{array}{cccccc}& & & & & \\ & & & & & \\ 112\hfill & 613\hfill & 4517\hfill & 43283\hfill & 522829\hfill & 7730539\hfill \\ & & 136593931\hfill & 2828789699\hfill & 67581794939\hfill & 1838220650251\hfill \\ & & 56298481067219\mathrm{}\hfill & & & \\ 114\hfill & 619\hfill & 4567\hfill & 43889\hfill & 530773\hfill & 7856939\mathrm{}\hfill \\ 115\hfill & 631\hfill & 4663\hfill & 44879\hfill & 543967\hfill & 8066533\mathrm{}\hfill \\ 116\hfill & 641\hfill & 4759\hfill & 45971\hfill & 558643\hfill & 8300687\mathrm{}\hfill \\ 117\hfill & 643\hfill & 4787\hfill & 46279\hfill & 562711\hfill & 8365481\mathrm{}\hfill \\ 118\hfill & 647\hfill & 4801\hfill & 46451\hfill & 565069\hfill & 8402833\mathrm{}\hfill \\ 119\hfill & 653\hfill & 4877\hfill & 47297\hfill & 576203\hfill & 8580151\mathrm{}\hfill \\ 120\hfill & 659\hfill & 4933\hfill & 47857\hfill & 583523\hfill & 8696917\mathrm{}\hfill \\ 121\hfill & 661\hfill & 4943\hfill & 47963\hfill & 584999\hfill & 8720227\mathrm{}\hfill \\ 122\hfill & 673\hfill & 5021\hfill & 48821\hfill & 596243\hfill & 8900383\mathrm{}\hfill \\ 123\hfill & 677\hfill & 5059\hfill & 49207\hfill & 601397\hfill & 8982923\mathrm{}\hfill \\ 124\hfill & 683\hfill & 5107\hfill & 49739\hfill & 608459\hfill & 9096533\mathrm{}\hfill \\ 125\hfill & 691\hfill & 5189\hfill & 50591\hfill & 619739\hfill & 9276991\mathrm{}\hfill \\ 126\hfill & 701\hfill & 5281\hfill & 51599\hfill & 633467\hfill & 9498161\mathrm{}\hfill \\ 127\hfill & 709\hfill & 5381\hfill & 52711\hfill & 648391\hfill & 9737333\mathrm{}\hfill \\ 128\hfill & 719\hfill & 5441\hfill & 53353\hfill & 657121\hfill & 9878657\mathrm{}\hfill \\ 129\hfill & 727\hfill & 5503\hfill & 54013\hfill & 665843\hfill & 10020343\mathrm{}\hfill \\ 130\hfill & 733\hfill & 5557\hfill & 54601\hfill & 673793\hfill & 10147877\mathrm{}\hfill \\ 132\hfill & 743\hfill & 5651\hfill & 55681\hfill & 688249\hfill & 10382033\mathrm{}\hfill \\ 133\hfill & 751\hfill & 5701\hfill & 56197\hfill & 695239\hfill & 10493953\mathrm{}\hfill \\ 134\hfill & 757\hfill & 5749\hfill & 56701\hfill & 702173\hfill & 10606223\mathrm{}\hfill \\ 135\hfill & 761\hfill & 5801\hfill & 57193\hfill & 708479\hfill & 10707449\mathrm{}\hfill \\ 136\hfill & 769\hfill & 5851\hfill & 57751\hfill & 715969\hfill & 10829519\mathrm{}\hfill \\ 138\hfill & 787\hfill & 6037\hfill & 59723\hfill & 742681\hfill & 11261903\mathrm{}\hfill \\ 140\hfill & 809\hfill & 6217\hfill & 61819\hfill & 771079\hfill & 11723507\mathrm{}\hfill \\ 141\hfill & 811\hfill & 6229\hfill & 61979\hfill & 773317\hfill & 11760029\mathrm{}\hfill \\ 142\hfill & 821\hfill & 6311\hfill & 62921\hfill & 786053\hfill & 11967047\mathrm{}\hfill \\ 143\hfill & 823\hfill & 6323\hfill & 63059\hfill & 788009\hfill & 11999111\mathrm{}\hfill \\ 144\hfill & 827\hfill & 6353\hfill & 63391\hfill & 792413\hfill & 12071197\mathrm{}\hfill \\ 145\hfill & 829\hfill & 6361\hfill & 63467\hfill & 793511\hfill & 12089177\mathrm{}\hfill \\ 146\hfill & 839\hfill & 6469\hfill & 64679\hfill & 809917\hfill & 12356863\mathrm{}\hfill \\ 147\hfill & 853\hfill & 6599\hfill & 66089\hfill & 828923\hfill & 12667463\mathrm{}\hfill \\ 148\hfill & 857\hfill & 6653\hfill & 66749\hfill & 838091\hfill & 12816389\mathrm{}\hfill \\ 150\hfill & 863\hfill & 6691\hfill & 67157\hfill & 843613\hfill & 12907091\mathrm{}\hfill \\ 152\hfill & 881\hfill & 6841\hfill & 68821\hfill & 866329\hfill & 13280819\mathrm{}\hfill \\ 153\hfill & 883\hfill & 6863\hfill & 69109\hfill & 870161\hfill & 13343881\mathrm{}\hfill \\ 154\hfill & 887\hfill & 6899\hfill & 69491\hfill & 875519\hfill & 13431967\mathrm{}\hfill \\ 155\hfill & 907\hfill & 7057\hfill & 71287\hfill & 900157\hfill & 13836751\mathrm{}\hfill \\ \hfill & \hfill & \hfill & \hfill & \hfill & \hfill \end{array}$$


format: text

text:
# Cosmology with GTC. A combined mm-optical galaxy cluster survey

## 0.1 Introduction

Clusters of galaxies have been widely used as cosmological probes. Their modeling can be easily understood as they are the final stage of the linearly evolved primordial density fluctuations. As a consequence, it is possible to describe, as a function of the cosmological model, the distribution of clusters and their evolution, the mass function, which is usually used as a cosmological test . Therefore, a detailed study of the cluster mass function will provide very useful information about the underlying cosmology.
Unfortunately, cluster masses can not very well determined for intermediate-high redshift clusters and even for low redshift ones the error bars are still significant. However, instead of the mass function, it is possible to study the cluster population through other functions like the X-ray flux or luminosity functions, the temperature function or the Sunyaev-Zel’dovich effect (SZE hereafter) function. The advantage of these functions compared with the mass function is that, in these cases, the estimation of the X-ray fluxes, luminosities, temperatures or SZE decrements of the clusters is less affected by systematics than the mass estimation. The largest catalogue of clusters in the next years will be provided by the CMB satellite Planck. It is expected that Planck data will contain about 30000 detectable clusters (see Diego et al. 2002).
The decrement in the CMB temperature due to the SZE is independent of redshift. Therefore the most distant clusters could be detected through the SZE. Hence, the SZE is the perfect way to look at those high redshift clusters. It is in the high redshift interval where the differences among the cosmological models are more evident when one looks at the cluster population.
Unfortunately, through the SZE it is not possible to measure the redshift of the clusters and an independent observation (in the optical waveband for instance) of the clusters is needed in order to estimate their redshifts.
Since many clusters will be at high redshift, a telescope with a large diameter (like GTC) will be needed in order to identify those high-z clusters. However, due to the large size of the Planck catalogue, any proposal which attempts to make use of a 10-m class telescope to identify 30000 clusters would be rejected (even in the case the proposal plans to observe only the high-z clusters there would be thousands of them !). In the next sections we will show how an SZE-selected optical survey made with GTC of only a small portion of the clusters in the Planck catalogue could be enough to obtain important cosmological constraints.

## 0.2 A combined mm-optical survey

At the end of this decade, the Planck satellite will carry out a full-sky survey in order to measure with a high sensitivity the CMB. However, other emissions (not only due to the CMB) will also be present in the data. Most of this non-CMB emissions will come from our own Galaxy (dust, free-free, synchrotron) but there will be also some extra-galactic emissions (point sources and the SZE). The wide frequency range, angular resolution and high sensitivity of Planck will allow to detect $``$ 30000 clusters.
Observing galaxy clusters in the mm sub-mm band through the SZE has a unique advantage. The amplitude of the decrement in the center of the cluster is independent of its redshift. Due to this fact, the catalogue of clusters obtained by Planck will have a privileged selection function and the proportion of high-to-low redshift clusters will be maximum if we compare the catalogue with others obtained in optical or X-ray surveys.
Galaxy clusters are the best tracers of the large scale structure and by studying the evolution of their abundance with redshift it is possible to impose very strong constraints on the cosmological model.

For instance, using the local abundance of clusters it has been possible to find a strong correlation between the amplitude of the power spectrum ($`\sigma _8`$) and the matter density ($`\mathrm{\Omega }`$). However, all the models in that correlation having different values of $`\sigma _8`$ and $`\mathrm{\Omega }`$ predict the same observed local abundance of clusters (within the error bars). Therefore, by using just the local abundance of clusters it is not possible for instance to rule out models with high or low values of $`\mathrm{\Omega }`$. However this can be done if we go back on time and study the evolution of the cluster abundance with redshift. In this case, the further we go in redshift, the better are the constraints in the cosmological parameters.

As we have mentioned, the selection function of Planck will be privileged in the sense that the final catalogue will have a large proportion of high redshift clusters. It is interesting to exploit this fact and study the cosmological implications of such a large and redshift-independent catalogue. Unfortunately, since the SZE is independent of redshift, it will not be possible to determine the redshift of the clusters by just looking at their SZE emission. This fact will limit the kind of cosmological studies which can be done with the Planck catalogue since the only observable will be the flux of the cluster. In Fig. 1 we show the expected number counts for the Planck catalogue as a function of the observed flux.
Despite the large number of clusters in the catalogue, this number will not be enough to discriminate between a model with a cosmological constant and a model without cosmological constant.
However, both models can be distinguished if one uses the evolution of the number counts with redshift. To build this data one needs, obviously, to estimate first the redshift of the clusters and since this can not be done through the SZE one should make an independent optical observation for each one of the clusters. This can be a huge task if one attempts to measure the redshift for each one of the expected 30000 clusters. Some of them will be nearby clusters and they can be easily identified in previous surveys like the Sloan. Others at intermediate redshift could be observed with medium-size telescopes. There will be however, a large number of high-z clusters. In these cases, a large telescope like GTC will be needed. But even observing only the high-z clusters, their expected number is still too large to make a project like this one possible. However, instead of trying to identify all the Planck cluster catalogue, one could try to estimate the redshifts for only a small portion of it and build the number counts (as a function of z) from them. The question now is, how small should be the subsample of clusters if we want to extract useful information about the cosmological information form that subsample ?
In Diego et al. (2001) we computed such number and we found that due to the particular selection function of Planck, by randomly selecting a subsample of only 300 clusters we could discriminate between $`\mathrm{\Lambda }`$CDM and a OCDM models. This is an important conclusion since it tells us that we do not need to identify all the clusters in the Planck catalogue. The selection function of Planck is such that, a random subsample of 300 clusters contain enough high-z clusters to make possible the distinction between the two models.
As we suggested before, part of those 300 clusters could be identified with existing cluster catalogues. Others could be identified using medium-size telescopes and only a small portion of them ($`20\%`$) would require a telescope like GTC. In the same paper we calculated that, in order to estimate the photometric redshifts for the most distant clusters with GTC, we should observe them with two hours of integration time (8 bands and 900s per band) per cluster. These numbers show that this is a feasible project and the evolution of the number counts of the SZE-selected subsample of 300 clusters could be determined.
In Fig. 2 we show the expected number counts as a function of redshift for a Montecarlo realization of the $`\mathrm{\Lambda }`$CDM model. Also plotted are the mean number counts for the $`\mathrm{\Lambda }`$CDM (solid line) and for the OCDM model (dotted line). As we mentioned earlier, with just 300 clusters the OCDM model could be excluded by the high-z bins.

By combining the two data sets (number counts of Planck (Fig 1) and evolution of the number counts of the subsample (Fig. 2)) it is possible to constraint the cosmological parameters of the $`\mathrm{\Lambda }`$CDM model.
The first data set is very good to constrain the $`\sigma _8\mathrm{\Omega }`$ correlation. The second data can be used to break the previous degeneracy between both parameters. The result of combining the Planck number counts (30000 clusters, Fig. 1) with the GTC followup (300 clusters, Fig. 2) can be seen in Fig. 3.

## 0.3 conclusions

We have seen how combining two very different instruments (Planck and GTC) it is possible to constraint the cosmological model. Planck will provide a unique way of selecting distant clusters. However a subsequent redshift estimation will be needed. We have seen that a subsample (randomly selected from the Planck catalogue) of 300 identified clusters is large enough in order to distinguish between a $`\mathrm{\Lambda }`$CDM and a OCDM model. Among these 300 clusters there will be many of them which can be identified using existing galaxy cluster catalogues or medium-size telescopes but there will be a portion ($`20\%`$) which will require a telescope like GTC. A survey made with GTC over the SZE-selected subsample will allow to constrain the cosmological model in an independent test.

###### Acknowledgements.

This work has been supported by the Spanish DGESIC Project PB98-0531-C02-01, FEDER Project 1FD97-1769-C04-01, the EU project INTAS-OPEN-97-1192, and the RTN of the EU project HPRN-CT-2000-00124.
JMD acknowledges support from its Marie Curie Fellowship of the European Community programme Improving the Human Research Potential and Socio-Economic knowledge under contract number HPMF-CT-2000-00967.