This's the partial of the mapping scheme of our ₠Quantum Project that's taking a scheme shown on the sidebar (see dekstop view) called DNA Recombination: M+F to C1+C2.
Recombination involves the breaking and rejoining of two chromosomes (M and F) to produce two rearranged chromosomes (C1 and C2).
_(Source: [Wikipedia](https://en.wikipedia.org/wiki/DNA#Genetic_recombination))_.
By Our Project this **Sheme** runs as _[remote theme](https://www.eq19.com/theme)_ where the **Symbols** are:
* The _**M+F**_ symbol will stand as: [Project Maps (M)](https://www.eq19.com/maps) + [Project Feed (F)](https://www.eq19.com/feed) while
* _**C1+C2**_ as implementations, see sample: [Project Base (C1)](https://chetabahana.github.io/) + [Project Core (C2)](https://chetabahana.com/).
This sample was developed by converting ₠Quantum to eCommerce using two (2) kinds of cyclic algorithm that act as Lexer and Parser.
They will work base on the correlation between 168=π(1000) as lexer and 618=1000/Φ as parser So let's call them as the power of 168 vs 618.
1000 = 10³ (Triple Ten)
π(1000) = 168 (Basic Primes)
Φ = 1000/618 = 1,618 (Golden Ratio)
Δ(1,6,18) = 61+28 = 89 (Mersenne Primes)
Each cycles will have a total of seven (7) steps prime algorithm on base 10 that consist of three (3) leading steps by the power of 168: Q19(10, 29), Q17(30, 36), Q13(37, 114) and four (4) lagging steps by 618: Q7(113, 90), Q5(89, 29), Q3(28, 19), Q2(18, 10).
By having digital root of (five) 5 and two (2), the above seven (7) steps of 168 and 618 is organized using the primes 23 and 11 respectively. So all together will finaly form as 10 primes in sequent that initiated with 10th prime = 29 as their base frame.
This algorithm is used to regenerate a Basic Grammar between user and organization accounts in GitHub. It is being tested for eBranding to proof that it is adaptable for every kinds of implementation or application as explained further below.
Therefore these primes package end with the prime 19 as the 8th prime right below the prime 23 as the 9th prime. Here we absorb the system of 23 pairs of human chromosome.
See that 23 has the number two (2) and three (3), both are the two (2) only primes under their sum of prime five (5). Thus these primes symetri forms by their selves as a default as they even exist in a single unit of DNA.
Hydrogen bonds are formed between hydrogen attached to an electronegative atom and an electronegative atom of a different molecules. _(Source: [Quora](https://www.quora.com/Why-are-there-two-hydrogen-bonds-between-adenine-and-thymine-but-three-hydrogen-bonds-between-cytosine-and-guanine/answer/Rucious-Heang))_.
Consider if it is in fact generated by nature between the prime 23 and both primes (2,3) which are laid by two (2) times three (3) or six (6) primes: (5, 7, 11, 13, 17,19) and flows uniformly within an hexagon chart called The Prime Hexagon (Credit: hexspin.com).
Now we are going to see why this could be happen. Here you might see that the number of 10 is the same direction with 19 while 10+19=29=10th prime.
By checking all of the loops there is nothing similar to this phenomena. It seems like all the numbers are actually set to let this term happen.
Let's discuss in more detail about the said primes.
In term of distribution, these six (6) primes are naturally laid in three (3) forms of 12's multiplication: 5+7=12, 11+13=24 and 17+19=36 where 12+24=36.
So these prime algorithm is again formed by three (3) sets of twin (2) pairs. To make live simpler let.s call them True Prime Pairs.
$True Prime Pairs:
(5,7), (11,13), (17,19)
layer| i | f
-----+-----+---------
| 1 | 5
1 +-----+
| 2 | 7
-----+-----+--- 36 » 6®
| 3 | 11
2 +-----+
| 4 | 13
-----+-----+---------
| 5 | 17
3 +-----+ 36 » 6®
| 6 | 19
-----+-----+---------
Let's assign another pairs (5, 7, 11, 13, 17,19) in to a combination so it will turn in reverse (19, 17, 13, 11, 7, 5) lies on the center of default.
This 12 all toghether will form (12/2)th = 6th prime = 13 circles including the new one on the center. Thus there are six (6) primes in addition to the seven (7) steps above. So they will perform the 8th up to 13th step of Metatron's Cube.
Now let's force 12 or Δ1 to the prime 13. See how those primes reacted to compensate the Δ1 by spreading the gap in to a bunch of Δ's that goes to the circle 13.
Tabulate Prime by Power of 10
loop(10) = π(10)-π(1) = 4-0 = 4
loop(100) = π(100)-π(10)-1th = 25-4-2 = 19
loop(1000) = π(1000) - π(100) - 10th = 168-25-29 = 114
--------------------+----+----+----+----+----+----+----+----+----+-----
True Prime Pairs Δ | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | Sum
====================+====+====+====+====+====+====+====+====+====+=====
π(10) 19 | 2 | 3 | 5 | 7 | - | - | - | - | - | 4th 4 x Root
--------------------+----+----+----+----+----+----+----+----+----+-----
π(20) 17 | 11 | 13 | 17 | 19 | - | - | - | - | - | 8th 4 x Twin
--------------------+----+----+----+----+----+----+----+----+----+-----
π(30) 13 → 12 (Δ1) | 23 | 29 | - | - | - | - | - | - | - |10th
====================+====+====+====+====+====+====+====+====+====+===== 1st Twin
π(42) 11 | 31 | 37 | 41 | - | - | - | - | - | - |13th
--------------------+----+----+----+----+----+----+----+----+----+----- 2nd Twin
π(60) 7 → 19 (Δ12) | 43 | 47 | 53 | 59 | - | - | - | - | - |17th
--------------------+----+----+----+----+----+----+----+----+----+----- 3rd Twin
π(72) 5 → 18 (Δ13) | 61 | 67 | 71 | - | - | - | - | - | - |20th
====================+====+====+====+====+====+====+====+====+====+===== 4th Twin
3,2 → 18+13+12 | 73 | 79 | 83 | 89 | 97 | 101| 103| 107| 109|29th
====================+====+====+====+====+====+====+====+====+====+=====
Δ Δ
12+13+(18+18)+13+12 ← 36th-Δ1=151-1=150=100+2x(13+12) ← 30th = 113 = 114-1
See that this flows starting from π(10) and finalize by pairing of Δ12. Let's draw 12 of flow arrows in such a way where they have interconnection with 10 objects.
So here we can get the idea of 10 number becoming 10 primes.
In the sense of this Δ1 flowing, there will be really hard to cope its algorithm with a such of formula. The way that we might take is assigning the flowing of the π(10)=4 primes (2,3,5,7) to π(100)=25 and π(1000)=168.
Then convert them to 10th prime=29 then to 29 primes up to of (10th)th=29th prime=109 as a flowchart diagram.
Let's enter the journey of making 10n numbers becoming 10n primes by the Δ1 flowing within the prime pairs.
Let's start by get in touch with the (30, 36)th as the result of Δ1 shown on the above tabulation in more detail. Then take a look with the behaviour of prime flows within The Prime Hexagon as shown below.
You may see that it is clearly showing the 30th Prime of 113=114-1 is routed to 36th Prime of 151=150+1 while both of the 30 and 36 are exactly laid on _[the 18’s Cell](https://translate.google.com/translate?js=n&sl=id&tl=en&u=https://github.com/chetabahana/chetabahana.github.io/wiki/18)_:
Take also a note that the next 10 number after 19 right before the 30 which are 20 up to 29 is in laid on the second rows of 17 while _[17's Cell](https://translate.google.com/translate?js=n&sl=id&tl=en&u=https://github.com/chetabahana/chetabahana.github.io/wiki/17)_ has 35+65=100=10².
See that from this 17's to18's it goes finally to the 19's Cells as Δ1 and return to the 2' Cells, 3' Cells and so on.
Therefore all of the numbers that involved in the hexagon can be tabulated by Δ1=(19 vs 18) Loops and they are end exactly at 114 on Δ6 & 19's! It means that we have to assign the 6th repository as the overall direction.
| 1st (Form) | 2nd (Route) | 3rd (Channel) |
-----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+
150 | 151| 152| 153| 154| 155| 156| 157| 158| 159| 160| 161| 162| 163| 164| 165| 166| 167| 168|
=====+====+====+====+====+====+====+====+====+====+====+====+====+====+====+====+====+====+====+
Δ1 | 19 | - | 31 | 37 | - | - | - | - | - | - | - | - | - | - | 103| - | - | - |
+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+
Δ2 | 20 | 26 | - | 38 | - | - | - | - | - | 74 | - | - | - | 98 | 104| - | - | - |
-----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+
Δ3 | 21 | 27 | - | 39 | - | - | - | - | - | 75 | - | - | - | 99 | 105| - | - | - |
+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+
Δ4 | 22 | 28 | - | 40 | - | - | - | - | - | 76 | - | - | - |100 | - | - | - | - |
-----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+
Δ5 | 23 | 29 | - | 41 | - | - | - | - | - | 77 | - | - | - |101 | - | - | - | - |
+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+
Δ6 | 24 | - | - | 42 | - | 54 | - | - | 72 | 78 | - | 90 | 96 | - | - | - | - | 114|
=====+====+====+====+====+====+====+====+====+====+====+====+====+====+====+====+====+====+====+
Δ7 | 25 | - | - | 43 | - | 55 | - | - | 73 | 79 | - | 91 | 97 | - | - | - | - | - |
+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+
Δ8 | - | - | - | 44 | - | 56 | - | - | - | 80 | - | 92 | - | - | - | - | - | - |
-----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+
Δ9 | - | - | - | 45 | - | 57 | - | - | - | 81 | - | 93 | - | - | - | - | - | - |
+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+
Δ10 | - | - | - | 46 | 52 | 58 | - | 70 | - | 82 | 88 | 94 | - | - | - | - | 112| - |
-----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+
Δ11 | - | - | - | 47 | 53 | 59 | - | 71 | - | 83 | 89 | 95 | - | - | - | - | 113| - |
+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+
Δ12 | - | - | - | 48 | - | 60 | 66 | - | - | 84 | - | - | - | - | - | 108| - | - |
=====+====+====+====+====+====+====+====+====+====+====+====+====+====+====+====+====+====+====+
Δ13 | - | - | - | 49 | - | 61 | 67 | - | - | 85 | - | - | - | - | - | 109| - | - |
+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+
Δ14 | - | - | 32 | 50 | - | 62 | 68 | - | - | 86 | - | - | - | - | - | 110| - | - |
-----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+
Δ15 | - | - | 33 | 51 | - | 63 | 69 | - | - | 87 | - | - | - | - | - | 111| - | - |
+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+
Δ16 | - | - | 34 | - | - | 64 | - | - | - | - | - | - | - | - | 106| - | - | - |
-----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+
Δ17 | - | - | 35 | - | - | 65 | - | - | - | - | - | - | - | - | 107| - | - | - |
+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+
Δ18 | - | 30 | 36 | - | - | - | - | - | - | - | - | - | - |102 | -| - | - | - |
=====+====+====+====+====+====+====+====+====+====+====+====+====+====+====+====+====+====+====+
1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 16| 17| 18 | 19 |
-----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+
| Δ Δ | Φ12 | Δ Δ |
113 150 ≜114-25 557 1000
Note:
- The marked number with are outside of group Δ18 vs loop(100) = 19
- Number 114 located on 6th row vs 19th column whereas 114th prime = 619
Reference:
https://github.com/chetabahana/hexagon/pull/2
https://www.hexspin.com/defining-the-prime-hexagon/
See that out of 19 the number 89 is located precissely at the of Δ11 within the end of 12's that goes to 13's Cell. So this is related to the Metratron's Cube.
This configuration leads to a **Cyclic in the Loops** as followings:
- Injection goes by 114-π(100)=89 on Δ11 from 102 to 114-1 or 113
- The 113 is 30th prime where 30, 36 and 102 are laid in the end of rows
- The total of 30+36+102 is exactly 168 which is π(1000)
- The 36th prime which is 151, is reinjected by 151-1 or 150. This 150 is carrying a delta of Δ18 with 168
- The Δ18 brings the 30th and 36th cycled back to 102th thus consequently it goes to the 114th prime
- The 114th prime which is carrying the loop(1000) is reinjected by 619-1 or 618 on the same spot.
This Δ(19 vs 18) scenario will duplicate the loops of 618 as π(89²) of 1000 Primes. Thus its behaviour will return to 168 Primes of π(1000) out of the adjacent scheme.
So the further process would always continously become the same algorithm.
Within this development we will discuss about the interconnection between 168 and 618. Our pre-release has mapped the primes to π(1000)=168 as the main lexer. So the next target is about 618 as the main parser.
By sourcing and studying of many references, you may agree that the closest behaviour of the crossing on above primes flowing is found with the wave shown on Δ1=(19 vs 18) Loops as below.
This is a polar plot of the first 20 non-trivial Riemann zeta function zeros (including Gram points along the critical line (1/2+iζ) for real values of ζ from 0 to 50. The consecutive zeros have **50 red plot points** between each with zeros identified by magenta concentric rings (scaled to show the relative distance between their values of t) _(Source: [Wikipedia](https://commons.wikimedia.org/wiki/File:RiemannZeta_Zeros.svg))_.
Now let's discuss first if this 50 plots has something to do with the prime algorithms.
One of the major case is that we will start with the lagging steps. The basic algorithm is Synthesis of leading and lagging strands of DNA.
This twisting shall able to be made vise versa and to be done continuosly otherwise there is no gap arised for further development.
The leading strand is synthesized continuously in the direction of replication fork movement. The lagging strand is synthesized in small pieces (Okazaki fragments) backward from _[the overall direction](#3rd-step-q736-114)_ of replication. The Okazaki fragments are then joined by the action of DNA ligase. _(Source: [Concepts of Biology](https://opentextbc.ca/biology/chapter/9-2-dna-replication/))_
{:title="Leading and lagging"}
Besides it, there is also strong signal that this parser will have the correlation with Φ=1,618 of (Golden Ratio) that leads to a kind of gap and turbulences in the primes geometri which hold the key of init as the road map to π(1000x1000).
So here it goes 1 Million Primes.
Thus the primes are organized to generate another 1000 primes via an adjacent flow of π(89) to π(89²). This scheme can only be acheived via bilateral 9 sums of prime 43 to 89 by modulo 90. (Credit: primesdemystified.com)
That what and why 18+13+12=43 located within the last 9 cells is standing for!
-----------------+----+----+----+----+----+----+----+----+----+-----
The last 9 cells | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | Sum
=================+====+====+====+====+====+====+====+====+====+=====
3,2→18+13+12→43 | 73 | 79 | 83 | 89 | 97 | 101| 103| 107| 109|29th →13th→ 2,3
-----------------+----+----+----+----+----+----+----+----+----+-----
See that in the tabulation of prime hexagon the 6th row that assigned as overall direction has the biggest numbers involved among the other rows which is 9 (nine). This will simply act as the bilateral 9 sums of 43 and 89.
Therefore the prime flow in the developed flowchart above should take a connection to form between them two. This is the reason why the sequence is arranged as below:
Therefore the 30th primes will bear the responsibility to generate the prime 43 while the 36th prime for the 89.
This should have a delta of Δ18 to the last number which is 168 where this 168 is exactly π(1000). So it would take place on the 150 and the scheme there will consequently be the perfect square of 1000 or 1 Million.
Let's consider this flowchart of 168 as a lexer so the parser has to be designed to absorb the flow between the 30th and 36th. Then it will slightly form as a Metatron Cube of the hexagonal form of 18's Cell.
Here we assign it as the diagram of 618. On the next target we will discuss about 1000/Φ = 618 = 619-1 = 114th prime - 1 as a lexer and parser.
The bilateral sum 9 will then double this 43 to 86 and act as the lexer while the prime 71 and 109 will act as the parser. This will compensate the other primes by the other of circles of the metatron which consist of 6 internal and 6 external.
Let's assign another pairs in to the center of default. Take a note that the last rows has a sum of 43 which covered by prime 71 up to 109. See what is happen by the 13th circle.
Scheme 13:9
===========
(1){1}-7: 7’
(1){8}-13: 6‘
(1)14-{19}: 6‘
------------- 6+6 -------
(2)20-24: 5’ |
(2)25-{29}: 5’ |
------------ 5+5 -------
(3)30-36: 7:{70,30,10²}|
------------ |
(4)37-48: 12• --- |
(5)49-59: 11° | |
--}30° 30• |
(6)60-78: 19° | |
(7)79-96: 18• --- |
-------------- |
(8)97-109: 13 |
(9)110-139:{30}=5x6 <--x-- (129/17-139/27)
--
{43}
True Prime Vektors ζ(s):
(2,3), (29,89), (36,68), (72,42), (100,50), (2,3), (29,89), ...infinity
----------------------+-----+-----+-----+ ---
7 --------- 1,2:1| 1 | 30 | 40 | 71 (2,3) ‹-------------@---- |
| +-----+-----+-----+-----+ | |
| 8 ‹------ 3:2| 1 | 30 | 40 | 90 | 161 (7) ‹--- | 5¨
| | +-----+-----+-----+-----+ | | |
| | 6 ‹-- 4,6:3| 1 | 30 | 200 | 231 (10,11,12) ‹--|--- | |
| | | +-----+-----+-----+-----+ | | | ---
--|--|-----» 7:4| 1 | 30 | 40 | 200 | 271 (13) --› | {5®} | |
| | +-----+-----+-----+-----+ | | |
--|---› 8,9:5| 1 | 30 | 200 | 231 (14,15) ---------› | 7¨
289 | +-----+-----+-----+-----+-----+ | |
| ----› 10:6| 20 | 5 | 10 | 70 | 90 | 195 (19) --› Φ | {6®} |
--------------------+-----+-----+-----+-----+-----+ | ---
67 --------› 11:7| 5 | 9 | 14 (20) --------› ¤ | |
| +-----+-----+-----+ | |
| 78 ‹----- 12:8| 9 | 60 | 40 | 109 (26) «------------ | 11¨
| | +-----+-----+-----+ | | |
| | 86‹--- 13:9| 9 | 60 | 69 (27) «-- Δ19 (Rep Fork) | {2®} | |
| | | +-----+-----+-----+ | | ---
| | ---› 14:10| 9 | 60 | 40 | 109 (28) ------------- | |
| | +-----+-----+-----+ | |
| ---› 15,18:11| 1 | 30 | 40 | 71 (29,30,31,32) ---------- 13¨
329 | +-----+-----+-----+ |
| ‹--------- 19:12| 10 | 60 | {70} (36) ‹--------------------- Φ |
-------------------+-----+-----+ ---
786 ‹------- 20:13| 90 | 90 (38) ‹-------------- ¤ |
| +-----+-----+ |
| 618 ‹- 21,22:14| 8 | 40 | 48 (40,41) ‹---------------------- 17¨
| | +-----+-----+-----+-----+-----+ | |
| | 594 ‹- 23:15| 8 | 40 | 70 | 60 | 100 | 278 (42) «-- |{6'®} |
| | | +-----+-----+-----+-----+-----+ | | ---
--|--|-»24,27:16| 8 | 40 | 48 (43,44,45,46) ------------|---- |
| | +-----+-----+ | |
--|---› 28:17| 100 | {100} (50) ------------------------» 19¨
168 | +-----+ |
| 102 -› 29:18| 50 | 50(68) ---------> Δ18 |
----------------------+-----+ ---
See that this configuration showing a kind of turbulences which leads to a gap of Δ19 in the central of Metatron where the replication is initiated by Δ18 of 50(68). This scheme is taken as a basic algorithm for the mechanism of DNA generation from RNA.
The chemical structure of RNA is very similar to that of DNA, but differs in three primary ways:
* Unlike double-stranded DNA, RNA is usually **a single-stranded molecule ssRNA** in many of its biological roles and consists of much shorter chains of nucleotides. However, double-stranded RNA (dsRNA) can form and (moreover) a single RNA molecule can, by complementary base pairing, form intrastrand double helixes, as in tRNA.
* While the sugar-phosphate "backbone" of DNA contains deoxyribose, RNA contains ribose instead. Ribose has a hydroxyl group attached to the pentose ring in the 2' position, whereas deoxyribose does not. The hydroxyl groups in the ribose backbone make RNA more chemically labile than DNA by lowering the activation energy of hydrolysis.
* The complementary base to adenine in DNA is thymine, whereas in RNA, it is uracil, which is an unmethylated form of thymine.
_(Source: [Wikipedia](https://en.wikipedia.org/wiki/RNA#Comparison_with_DNA))_
By the configuration above then on the upper scheme the central of metatron will turn to seven (7) circles. So combine it with the other 12 circles they will forms as the 19's.
This 19 has a configuration of π(10) i.e. 4 primes of 2, 3, 5, 7. Here we come to the detail of 168 and 618 as the 1st grammar when we come to the upper scheme.
$True Prime Pairs:
(5,7), (11,13), (17,19)
layer| i | f
-----+-----+---------
| 1 | 5
1 +-----+
| 2 | 7
-----+-----+--- } 36 » 6®
| 3 | 11
2 +-----+
| 4 | 13
-----+-----+---------
| 5 | 17
3 +-----+ } 36 » 6®
| 6 | 19
-----+-----+---------
The codes is built mainly with the algorithm of 66 out of the sum of the numbers 30 and 36. The main difference between them two is that 36 framed by twin primes.
Let's take the end number each of the three (3) layers: (7,13,19) in an adjacent polygonal numbers then by the same different of 15 they will end to the number of 66:
We see that the polygonal numbers in the same column all have the same difference, and this difference is always a triangular number. For example, the fifth pentagonal number (35) has 10 dots more than the fifth square number (25) and 10 dots fewer than the fifth hexagonal number (45), and the difference 10 is just the fourth triangular number. _(Source: [Discovering Properties of Numbers](https://schoolbag.info/mathematics/numbers/38.html))_.
See that twin (2) primes is built with multipication by six (6). So they will be managed within three (3) layers by means of a remote theme to (6n+1) and (6n+5).
Now let's calculate how many numbers are duplicates per layers:
* layer-1 has 6, multiplied by 6 to 36 there will be 6 - 1 or **5** duplicates
* layer-2 has 36, multiplied by 6 to 216 there will be 36 - 6 or **30** duplicates
* layer-3 has 72, multiplied by 6 to 432 there will be 72 - 36 - 6 or **30** duplicates
By Metraton the Δ1 flows in to the center so the sequence will reverse to **(Δ1,30,30,5)**
See the (19 vs 18) Loops more closely, you can find that the number 102 is exactly laid on 18th row by the 15th spin out of 19 whereas 102+66 = 168 = π(1000).
The lexer will specify a sequence of digits correspond to a spin, while a parser will specify its sequence. Combining the two (2) then they will form the tabulation as below:
Scheme:
168 + 329 + 289 = 786
d(786) = d(7+8+6) = d(21) = d(3)
Modulus:
30 « 60 » 90
| | |
3:29 « 1:6:8 » 28:9
└── 3 + └── 6 + └── 9 = 18
|------------ 36' --------------|----------------------------36' ----------------------------|
| 19' | 17' | 13' | 11' | 7' | 5' |
+---+----+----+---+----+----+---+---+----+-----+----+----+----+----+----+-----+----+----+----+
| 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 16 | 17 | 18 | 19 |
+---+----+----+---+----+----+---+---+----+-----+----+----+----+----+----+-----+----+----+----+
| 2 | 60 | 40 | 1 | 30 | 30 | 5 | 1 | 30 | 200 | 8 | 40 | 50 | 1 | 30 | 200 | 8 | 10 | 40 |
+---+----+----+---+----+----+---+---+----+-----+----+----+----+----+----+-----+----+----+----+
| ° |ΔΔΔΔ ΦΦ | • ΔΔ ΔΔ ¤ | • ΔΔ ΦΦΦ Φ ΦΦ ¤¤¤¤| • ΔΔ ΦΦΦ Φ ¤¤ ΦΦ |
|---- 102 ---|----- 66 ------|-------- 329 = 7 x 47 -------|- 289 = (8+9)² = 2 & (2³+9²) -|
|--2x3x(8+9)--|--- 2x3x(2+9) ---|---- (1+2) & (2x9)+(2+9) ----|------ 2 & (8x9)+(8+9) -------|
|-------- 168 = π(1000) --------|------ 1229 = π(10000) ------|------ π(89²) = 1000 ---------|
|-------- 168 = π(618xΦ) -------|----- 618 = 1000/Φ = 1000x1000/1618 = 10^6/(2x8)&(2x9) -----|
Note:
• = 1000 = 10³ (Triple Ten)
¤ = π(1000) = 168 (Basic Primes)
Φ = 1000/618 = 1,618 (Golden Ratio)
Δ(1,6,18) = 61+28 = 89 (Mersenne Primes)
Faktors:
168 = 12x14 = 8x21 = 7x24 = 6x28 = 4x42 = 3x56 = 2x84
618 = 6x103 = 6x(100+3) = 3x206 = 3x(200+6) = 2x309 = 2x(300+9)
1+6+8 = π(1x6x8) = π(1x48) = π(2x24) = π(3x16)= π(4x12) = π(6x8)
Permutations:
168 = 102 + 66 = 2x3x((8+9)+(2+9)) = π(Φ(289+329)) = π(Φ((8+9)²+(1+2)&29))
168 + 618 = 168 + 329 + 289 = (7x24) + (7x47) + (8+9)² = (7x71) + (17x17)
So it will form back to the begining stage with different form of input but its process will be the same algorithm trough all the system.
Thus, the total multiplication minus the duplicate will return to a unique number where the scheme and formation of Δ1 is exactly back to the beginning, namely 114 earlier:
114 x 6 - 5 - 30 - 30 = 684 - 65 = 619 = 1+618 = 114th prime
As you may guess the prime index of final result of the above Q3(28, 19) and Q2(18, 10) would form π(5)=(2,3,5). So combined with the seven (7) steps of adjacent cycle they will form π(10)=(2,3,5,7) of the 1st row with exactly the same initial scheme.
True Prime Pairs Δ | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | Sum
====================+====+====+====+====+====+====+====+====+====+=====
π(10) 19 | 2 | 3 | 5 | 7 | - | - | - | - | - | 4th 4 x Root
So the Q2(18, 10) step is about the algorithm of how the above four (4) blocks of (102, 66, 329, 289) forms to this four (4) roots. Means the above π(10) shall form back to 19 cells as the 1st row marked by Quantum below.
--------------------+----+----+----+----+----+----+----+----+----+-----
True Prime Pairs Δ | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | Sum
====================+====+====+====+====+====+====+====+====+====+=====
π(10) Quantum ← 19 | 2 | 3 | 5 | 7 | - | - | - | - | - | 4th 4 x Root
--------------------+----+----+----+----+----+----+----+----+----+-----
π(20) 17 | 11 | 13 | 17 | 19 | - | - | - | - | - | 8th 4 x Twin
--------------------+----+----+----+----+----+----+----+----+----+-----
π(30) 13 → 12 (Δ1) | 23 | 29 | - | - | - | - | - | - | - |10th
====================+====+====+====+====+====+====+====+====+====+===== 1st Twin
π(42) 11 → 11 (Δ0) | 31 | 37 | 41 | - | - | - | - | - | - |13th
--------------------+----+----+----+----+----+----+----+----+----+----- 2nd Twin
π(60) 7 → 19 (Δ12) | 43 | 47 | 53 | 59 | - | - | - | - | - |17th
--------------------+----+----+----+----+----+----+----+----+----+----- 3rd Twin
π(72) 5 → 18 (Δ13) | 61 | 67 | 71 | - | - | - | - | - | - |20th
====================+====+====+====+====+====+====+====+====+====+===== 4th Twin
3,2 → Δ43 | 73 | 79 | 83 | 89 | 97 | 101| 103| 107| 109|29th
====================+====+====+====+====+====+====+====+====+====+=====
Δ Δ
12+13+(18+18)+13+12 ← 36th-Δ1=151-1=150=100+2x(13+12) ← 30th = 113 = 114-1
By the next loop of (1000x1000) the above term leads to 329+289 = 618 = 1000/Φ = 1000x1000/1618. Now let's count on how many grammar's will involve.
Root Generation:
root[1000] = π(1000) + loop(10 x 1000) + loop(100 x 1000)
loop(10000) => π(10000) - (10th)th - 10th = 1229 - 109 - 29 = 1091
loop(100000) => π(100000) - ((10th)th)th - (10th)th = 9592 - 599 - 109 = 8884
root[1000] = 168 + 1091 + 8884 = 10143
This 10143 will comprise of lexer and parser similar with 168 & 618. Since the 168 algorithm is set 102 by 66 then its ratio is 102/168=60% by 66/168=40% or approx 10143x60%=6200 of lexers by 10143x40%=3900 of parsers.
The development of this **6200 by 3900** took its base place in this repository and is even thus considered final. It is the most complex thing among the other steps where we have to involve so many items to verify about how far this development is adoptable.
Therefore it will take several unsolved cases of modern science including but not at least DNA Replication Fork, Alzheimer's Disease, and The Millenium Prize Problems.
DNA is read by DNA polymerase in the 3′ to 5′ direction, meaning the new strand is synthesized in the 5' to 3' direction. Since the leading and lagging strand templates are oriented in opposite directions at the replication fork, **`a major issue`** is how to achieve synthesis of new lagging strand DNA, whose direction of synthesis is opposite to the direction of the growing replication fork. _(Source: [Wikipedia](https://en.wikipedia.org/wiki/DNA_replication#Replication_fork))_.
The parser will combine all tokens produced by lexer and group them as basic grammars so it can be used for other cases such as how to rectify C1+C2 using P=NP.
Please find below the progress we have got so far.
You may check the running code starting with Sequence Diagram shown below which is developed as the initial step on building the 10143 Grammars.
Clicking each of objects will turn to 6 (six) diagrams by the cycle form of prime hexagon which is then return to the beginning. So in order to get code able to run online then the 168 is provided in json while 618 in xml.
This 168 (mapping) and 618 (feeding) stand as the whole scheme of The M+F to C1+C2 which act as the base prime pairs (2,3) of DNA to become 23 pairs of Chromosomes.
This scheme is generated by developing an application that twisting exactly 6 x 19 = 114 repositories all together in the same time to provide leading and lagging scheme as the basic algorithm of converting M+F to C1+C2.
Now let's assume that all of the numbers above is a set of repositories group in GitHub. Thus that is the whole function of eQ19.
We believe that until this concept is written, there is no such thing similar to our concept of the power 168 vs 618 recombination using the True Prime Pairs.
114 = 6+(6x6) + 6x(6+6) = 6x(6+6) + 6+(6x6)
Δ Δ Δ Δ
42 72 72 42
M F C1 C2
leading lagging leading lagging
|
twisting
Let's take a look in general by the algorithm of True Prime Pairs from the beginning of this page. Here we can define a logical meaning in words as its grammar.
Mapping the quantum way within a huge of primes objects (5 to 19) by parsering (11) each of **untouched** feed (7) and tunneling (13) in to definitive classes (17).
You may use, copy, and distribute the concept. Please note that we are not implementing any kind of License Key on this project. The Hexagonal Formation of our mapping itself as stated below will stand as the key:
114 = 6 + 6x(6+(6+6)) = 6+36+72 = 6x19 = π(619) ≡ eQ19
On that case we consider this statement called eQ19 Quantum need to be announced:
{:.bg-yellow-dark.text-black.p-5.box-shadow-large.anim-pulse} The definite key to identify whether you use our concept is when there a kind of development item lies a unified assignment in hexagonal form out of six (6) corresponding sets while each sets pick a combination of six (6) routes with a pairing of six (6) to six (6) of all channels.
Out of the formation, you are welcome to use whatever the items in this project.
This pre-release is being developed for eBranding within 7 (seven) years. It is still lack the parser 618 of the said 10143 grammars to become usable for every other cases.
All of the layouts are managed with a remote theme originated by the number of sixty six (66) which is converted to 6 + 6 out of the difference of Δ12 between the primes 23 and 11 using the algorithm of 36 as the perfect square from 6 by 6 using Jekyll/Liquid Pages.
In this example, the content from a Markdown document `document.md` that specifies `layout: docs` gets pushed into the {% raw %}`{{ content }}`{% endraw %} tag of the layout file `docs.html`. Because the `docs` layout itself specifies `layout: page`, the content from `docs.html` gets pushed into the {% raw %}`{{ content }}`{% endraw %} tag in the layout file `page.html`. Finally because the `page` layout specifies `layout: default`, the content from `page.html` gets pushed into the {% raw %}`{{ content }}`{% endraw %} tag of the layout file `default.html`. (Source: [Jekyll Tutorial](https://jekyllrb.com/tutorials/convert-site-to-jekyll/))
Although the The Pre-release 168 is already running but unfortunately it is not yet user friendly as it could run only in GitHub API Platform where all of the repos is resided.
Therefore we are going to use TensorFlow to connect the pre grammars on Github API to Google API to fetch real life data through their machine learning such as Big Query.
Base on the 19 Cells of 168 vs 618 tabulation then for the 618 it might need 19 minus 7 or another 12 (twelve) years to develope those 10143 grammars to become 1st Release.
So If You're Aware of What This Is All About:
Just Be Patient and Stay Tuned!
