# Pairwise Scenario

This section is referring to *wiki page-4* of *zone section-4* that is *inherited * from *the zone section-7* by *prime spin-5* and *span-* with *the partitions* as below.

/parser

*(10 - 2) th prime = 8th prime = 19*

The subclasses of partitions systemically develops characters similar to the distribution of prime numbers.

tps://gist.github.com/eq19/e9832026b5b78f694e4ad22c3eb6c3ef#partition-function) represents the number of possible partitions of a non-negative integer n.

*f(8 twins) = 60 - 23 = 37 inner partitions*

```
p r i m e s
1 0 0 0 0 0
2 1 0 0 0 1 β--- #29 β--- #61
3 2 0 1 0 2 π 2
4 3 1 1 0 3 π 89 -29 = 61 - 1 = 60 βοΈ
5 5 2 1 0 5 π f(37) = f(8 twins) βοΈ
6 7 3 1 0 7 β--- #23
7 11 4 1 0 11 β--- #19
8 13 5 1 0 13 β--- # 17 β--- #49
9 17 0 1 1 17 β--- 7th prime π 7s
10 19 1 1 1 β1 β--- 0th βprime β--- Fibonacci Index #18
-----
11 23 2 1 1 β2 β--- 1st βprime β--- Fibonacci Index #19 β--- #43
..
..
40 163 5 1 0 β31 β- 11th βprime β-- Fibonacci Index #29 π 11
-----
41 167 0 1 1 β0
42 173 0 -1 1 β1
43 179 0 1 1 β2 β--- ββ1
44 181 1 1 1 β3 β--- ββ2 β--- 1st ββprime β--- Fibonacci Index #30
..
..
100 521 0 -1 2 β59 β--- ββ17 β--- 7th ββprime β--- Fibonacci Index #36 π 7s
-----
```

*7 + 13 + 19 + 25 = 64 = 8 Γ 8 = 8Β²*

## Subclasses of Partitions

Let weighted points be given in the plane . For each point a radius is given which is the expected ideal distance from this point to a new facility. We want to find the location of a new facility such that the sum of the weighted errors between the existing points and this new facility is minimized. This is in fact a nonconvex optimization problem. We show that the optimal solution lies in an extended rectangular hull of the existing points. Based on this finding then an efficient big square small square (BSSS) procedure is proposed.

Integers can be considered either in themselves or as solutions to equations (Diophantine geometry).

Young diagrams associated to the partitions of the positive integers ** 1 through 8**. They are arranged so that images under the reflection about the main diagonal of the square are conjugate partitions

*(Wikipedia)*.

*f(8πͺ8) = 1 + 7 + 29 = 37 inner partitions*

```
p r i m e s
1 0 0 0 0 0
2 1 0 0 0 1 β--- #29 β--- #61
3 2 0 1 0 2 π 2
4 3 1 1 0 3 π 89 -29 = 61 - 1 = 60
5 5 2 1 0 5 π f(37) = f(8πͺ8) βοΈ
6 7 3 1 0 7 β--- #23
7 11 4 1 0 11 β--- #19
8 13 5 1 0 13 β--- # 17 β--- #49
9 17 0 1 1 17 β--- 7th prime π 7s
10 19 1 1 1 β1 β--- 0th βprime β--- Fibonacci Index #18
-----
11 23 2 1 1 β2 β--- 1st βprime β--- Fibonacci Index #19 β--- #43
..
..
40 163 5 1 0 β31 β- 11th βprime β-- Fibonacci Index #29 π 11
-----
41 167 0 1 1 β0
42 173 0 -1 1 β1
43 179 0 1 1 β2 β--- ββ1
44 181 1 1 1 β3 β--- ββ2 β--- 1st ββprime β--- Fibonacci Index #30
..
..
100 521 0 -1 2 β59 β--- ββ17 β--- 7th ββprime β--- Fibonacci Index #36 π 7s
-----
```

When these subclasses of partitions are flatten out into a matrix, you want to take the Jacobian of each of a stack of targets with respect to a stack of sources, where the Jacobians for each target-source pair are independent .

Itβs possible to build a *Hessian matrix* for a *Newtonβs method* step using the Jacobian method. You would first flatten out its axes into a matrix, and flatten out the gradient into a vector *(Tensorflow)*.

** In summary, it has been shown that partitions into an even number of distinct parts and an odd number of distinct parts exactly cancel each other, producing null terms 0x^n, except if n is a generalized pentagonal number n=g_{k}=k(3k-1)/2}**, in which case there is exactly one Ferrers diagram left over, producing a term (β1)kxn. But this is precisely what the right side of the identity says should happen, so we are finished.

*(Wikipedia)*

```
p r i m e s
1 0 0 0 0 0
2 1 0 0 0 1 β--- #29 β--- #61
3 2 0 1 0 2 π 2
4 3 1 1 0 3 π 89 -29 = 61 - 1 = 60
5 5 2 1 0 5 π f(37) = f(29πͺ23) βοΈ
6 7 3 1 0 7 β--- #23
7 11 4 1 0 11 β--- #19
8 13 5 1 0 13 β--- # 17 β--- #49
9 17 0 1 1 17 β--- 7th prime π 7s
10 19 1 1 1 β1 β--- 0th βprime β--- Fibonacci Index #18
-----
11 23 2 1 1 β2 β--- 1st βprime β--- Fibonacci Index #19 β--- #43
..
..
40 163 5 1 0 β31 β- 11th βprime β-- Fibonacci Index #29 π 11
-----
41 167 0 1 1 β0
42 173 0 -1 1 β1
43 179 0 1 1 β2 β--- ββ1
44 181 1 1 1 β3 β--- ββ2 β--- 1st ββprime β--- Fibonacci Index #30
..
..
100 521 0 -1 2 β59 β--- ββ17 β--- 7th ββprime β--- Fibonacci Index #36 π 7s
-----
```

The code is interspersed with python, shell, perl, also demonstrates how multiple languages can be integrated seamlessly.

These include generating variants of their abundance profile, assigning taxonomy and finally generating a rooted phylogenetic tree.

```
p r i m e s
1 0 0 0 0 0
2 1 0 0 0 1 β--- #29 β--- #61
3 2 0 1 0 2 π 2
4 3 1 1 0 3 π 89 - 29 = 61 - 1 = 60
5 5 2 1 0 5 π f(37) = β π Composite βοΈ
6 7 3 1 0 7 β--- #23
7 11 4 1 0 11 β--- #19
8 13 5 1 0 13 β--- # 17 β--- #49
9 17 0 1 1 17 β--- 7th prime π 7s π Composite βοΈ
10 19 1 1 1 β1 β--- 0th βprime β--- Fibonacci Index #18
-----
11 23 2 1 1 β2 β--- 1st βprime β--- Fibonacci Index #19 β--- #43
..
..
40 163 5 1 0 β31 β- 11th βprime β-- Fibonacci Index #29 π 11
-----
41 167 0 1 1 β0
42 173 0 -1 1 β1
43 179 0 1 1 β2 β--- ββ1
44 181 1 1 1 β3 β--- ββ2 β--- 1st ββprime β--- Fibonacci Index #30
..
..
100 521 0 -1 2 β59 β--- ββ17 β--- 7th ββprime β--- Fibonacci Index #36 π 7s
-----
```

This behaviour in a fundamental causal relation to the primes when the products are entered into the *partitions* system.

## Composite behaviour

The subclasses of partitions systemically develops characters similar to the distribution of prime numbers. It would mean that there should be some undiscovered things hidden within the residual of the decimal values.

*168 + 2 = 170 = (10+30)+60+70 = 40+60+70 = 40 + 60 + β(2~71)*

```
p r i m e s
1 0 0 0 0 0
2 1 0 0 0 1 β--- #29 β--- #61
3 2 0 1 0 2 π 2
4 3 1 1 0 3 π 89 - 29 = 61 - 1 = 60
5 5 2 1 0 5 π f(37) βοΈ
6 π 11s Composite Partition βοΈ
6 7 3 1 0 7 β--- #23
7 11 4 1 0 11 β--- #19
8 13 5 1 0 13 β--- # 17 β--- #49
9 17 0 1 1 17 β--- 7th prime
18 π 7s Composite Partition βοΈ
10 19 1 1 1 β1 β--- 0th βprime β--- Fibonacci Index #18
-----
11 23 2 1 1 β2 β--- 1st βprime β--- Fibonacci Index #19 β--- #43
..
..
40 163 5 1 0 β31 β- 11th βprime β-- Fibonacci Index #29 π 11
-----
41 167 0 1 1 β0
42 173 0 -1 1 β1
43 179 0 1 1 β2 β--- ββ1
44 181 1 1 1 β3 β--- ββ2 β--- 1st ββprime β--- Fibonacci Index #30
..
..
100 521 0 -1 2 β59 β--- ββ17 β--- 7th ββprime β--- Fibonacci Index #36 π 7s
-----
```

The initial concept of this work was the Partitioned Matrix of an even number wβ₯ 4:

- It was shown that
it is possible to establish a corresponding Partitioned Matrix with a determined number of lines.*for every even number wβ₯ 4* - It was demonstrated that, fundamentally,
in the matrix: Lw = Cw + Gw + Mw.*the sum of the partitions is equal to the number of lines* - It was also shown that for each and every Partitioned Matrix of an even number w β₯ 4 it is observed that Gw = Ο(w) β (Lw β Cw), which means that the number of Goldbach partitions or
(Lwd) calculated as follows: Lwd = Lw β Cw.*partitions of prime numbers of an even number w β₯ 4 is given by the number of prime numbers up to w minus the number of available lines*

To analyze the adequacy of the proposed formulas, probabilistically calculated reference values were adopted. *(Partitions of even numbers - pdf)*

```
p r i m e s
1 0 0 0 0 0
2 1 0 0 0 1 β--- #29 β--- #61
3 2 0 1 0 2 π 2
4 3 1 1 0 3 π 89 - 29 = 61 - 1 = 60
5 5 2 1 0 5 π 11 + 29 = 37 + 3 = 40 βοΈ
6 π 11s Composite Partition β--- 2+60+40 = 102 βοΈ
6 7 3 1 0 7 β--- #23
7 11 4 1 0 11 β--- #19
8 13 5 1 0 13 β--- # 17 β--- #49
9 17 0 1 1 17 β--- 7th prime
18 π 7s Composite Partition
10 19 1 1 1 β1 β--- 0th βprime β--- Fibonacci Index #18
-----
11 23 2 1 1 β2 β--- 1st βprime β--- Fibonacci Index #19 β--- #43
..
..
40 163 5 1 0 β31 β- 11th βprime β-- Fibonacci Index #29 π 11
-----
41 167 0 1 1 β0
42 173 0 -1 1 β1
43 179 0 1 1 β2 β--- ββ1
44 181 1 1 1 β3 β--- ββ2 β--- 1st ββprime β--- Fibonacci Index #30
..
..
100 521 0 -1 2 β59 β--- ββ17 β--- 7th ββprime β--- Fibonacci Index #36 π 7s
-----
```

*(11x7) + (29+11) + (25+6) + (11+7) + 4 = 77+40+31+18+4 = 170*