-
-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
chetabahana
committed
May 4, 2024
0 parents
commit 58c33df
Showing
14 changed files
with
1,865 additions
and
0 deletions.
There are no files selected for viewing
Empty file.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,180 @@ | ||
| --- | ||
| sort: 0 | ||
| spin: | ||
| span: | ||
| suit: 0 | ||
| --- | ||
| # | ||
|
|
||
| # [Prime Identity](https://eq19.com/) | ||
|
|
||
| By this part we are going to compile all topic we have discussed. Here we would like to explain the way we take on getting the arithmetic expresion of prime distribution to get an ***individual unit expression (identity)*** such as a taxicab number below. | ||
|
|
||
| ```note | ||
| It is a taxicab number, and is variously known as Ramanujan's number and the Ramanujan-Hardy number, after an anecdote of the British mathematician _[GH Hardy](https://en.wikipedia.org/wiki/G._H._Hardy)_ when he visited Indian mathematician _[Srinivasa Ramanujan](https://en.wikipedia.org/wiki/Srinivasa_Ramanujan)_ in hospital _([Wikipedia](https://en.wikipedia.org/wiki/1729_(number)))_. | ||
| ``` | ||
|
|
||
| [](https://en.wikipedia.org/wiki/1729_(number)) | ||
|
|
||
| These three (3) number are [twin primes](https://en.wikipedia.org/wiki/Twin_prime). We called the pairs as _[True Prime Pairs](https://gist.github.com/eq19/0ce5848f7ad62dc46dedfaa430069857#true-prime-pairs)_. Our scenario is mapping the distribution out of these pairs by taking the symmetrical behaviour of 36 as the smallest power (greater than 1) which is not a prime power. | ||
|
|
||
| ```tip | ||
| The smallest square number expressible as the sum of **four (4) consecutive primes** in two ways (5 + 7 + 11 + 13 and 17 + 19) which are also **two (2) couples** of prime twins! _([Prime Curios!](https://en.wikipedia.org/wiki/1729_(number)](https://primes.utm.edu/curios/page.php?number_id=270)))_. | ||
| ``` | ||
|
|
||
| ```scss | ||
| $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 | ||
| -----+-----+--------- | ||
| ``` | ||
|
|
||
| Thus in short this is all about the method that we called as the ***[19 vs 18 Scenario](https://gist.github.com/eq19/0ce5848f7ad62dc46dedfaa430069857#the-%CE%B419-vs-18-scenario)*** of mapping [the quantum way](https://gist.github.com/eq19/0ce5848f7ad62dc46dedfaa430069857#file-utilization-md) within a huge of [primes objects](https://github.com/eq19) (5 to 19) by [lexering](https://gist.github.com/eq19/0ce5848f7ad62dc46dedfaa430069857#file-lexer-md) (11) the un[grammar](https://gist.github.com/eq19/0ce5848f7ad62dc46dedfaa430069857#file-grammar-md)ed feed (7) and [parsering](https://gist.github.com/eq19/0ce5848f7ad62dc46dedfaa430069857#file-parser-md) (13) across [syntax](https://gist.github.com/eq19/0ce5848f7ad62dc46dedfaa430069857#file-syntax-md) (17). | ||
|
|
||
| ***Φ(1,2,3) = Φ(6,12,18) = Φ(13,37,61)*** | ||
|
|
||
| ```scss | ||
| $True Prime Pairs: | ||
| (5,7), (11,13), (17,19) | ||
|
|
||
| layer | node | sub | i | f | ||
| ------+------+-----+---------- | ||
| | | | 1 | | ||
| | | 1 +-----+ | ||
| | 1 | | 2 | (5) | ||
| | |-----+-----+ | ||
| | | | 3 | | ||
| 1 +------+ 2 +-----+---- | ||
| | | | 4 | | ||
| | +-----+-----+ | ||
| | 2 | | 5 | (7) | ||
| | | 3 +-----+ | ||
| | | | 6 | | ||
| ------+------+-----+-----+------ } (36) | ||
| | | | 7 | | ||
| | | 4 +-----+ | ||
| | 3 | | 8 | (11) | ||
| | +-----+-----+ | ||
| | | | 9 | | ||
| 2 +------| 5 +-----+----- | ||
| | | | 10 | | ||
| | |-----+-----+ | ||
| | 4 | | 11 | (13) | ||
| | | 6 +-----+ | ||
| | | | 12 | | ||
| ------+------+-----+-----+------------------ | ||
| | | | 13 | | ||
| | | 7 +-----+ | ||
| | 5 | | 14 | (17) | ||
| | |-----+-----+ | ||
| | | | 15 | | ||
| 3 +------+ 8 +-----+----- } (36) | ||
| | | | 16 | | ||
| | |-----+-----+ | ||
| | 6 | | 17 | (19) | ||
| | | 9 +-----+ | ||
| | | | 18 | | ||
| ------|------|-----+-----+------ | ||
| ``` | ||
|
|
||
| The main background is that, as you may also aware, the prime number theorem describes the ***asymptotic distribution*** of prime numbers which is still a major problem in mathematic. | ||
|
|
||
| ## Zeta Function | ||
|
|
||
| Instead of getting a proved formula we came to a unique expression called ***zeta function***. This expression first appeared in a paper in 1737 entitled _Variae observationes circa series infinitas_. | ||
|
|
||
| ```tip | ||
| This expression states that the sum of the zeta function is equal to the product of the reciprocal of one minus the reciprocal of primes to the power s. But what has this got to do with the primes? The answer is in the following product taken over the primes p (discovered by _[Leonhard Euler](https://en.wikipedia.org/wiki/Leonhard_Euler)_): | ||
| ``` | ||
|
|
||
|  | ||
|
|
||
| This issue is actually come from ***[Riemann hypothesis](https://en.wikipedia.org/wiki/Riemann_hypothesis)***, a conjecture about the distribution of complex zeros of the Riemann zeta function that is considered by many mathematicians to be ***the most important*** of _[unsolved problems](https://en.wikipedia.org/wiki/List_of_unsolved_problems_in_mathematics)_ in pure mathematics. | ||
|
|
||
| ```note | ||
| In addition to the trivial roots, there also exist ***complex roots*** for real t. We find that the he first ten (10) non-trivial roots of the Riemann zeta function is occured when the values of t below 50. A plot of the values of ζ(1/2 + it) for t ranging from –50 to +50 is shown below. The roots occur each time ***the locus passes through the origin***. _([mathpages](https://www.mathpages.com/home/kmath738/kmath738.htm))_. | ||
| ``` | ||
|
|
||
| [](https://www.mathpages.com/home/kmath738/kmath738.htm) | ||
|
|
||
| Meanwhile obtaining the non complex numbers it is easier to look at a graph like the one below which shows Li(x) (blue), R(x) (black), π(x) (red) and x/ln x (green); and then proclaim "R(x) is the best estimate of π(x)." Indeed it is for that range, but as we mentioned above, Li(x)-π(x) changes sign infinitely often, and near where it does, Li(x) would be the best value. | ||
|
|
||
| [](https://primes.utm.edu/howmany.html#better) | ||
|
|
||
| And we can see in the same way that the function Li(x)-(1/2)Li(x1/2) is 'on the average' a better approximation than Li(x) to π(x); but no importance can be attached to the latter terms in Riemann's formula even by repeated averaging. | ||
| The problem is that the contributions from the non-trivial zeros at times swamps that of any but the main terms in these expansions. | ||
|
|
||
| ```warning | ||
| A. E. Ingham says it this way: Considerable importance was attached formerly to a function suggested by Riemann as an approximation to π(x)... This function represents π(x) with astonishing accuracy for all values of x for which π(x) has been calculated, but we now see that its superiority over Li(x) ***is illusory***... and for special values of x (as large as we please) the one approximation will deviate as widely as the other from the true value _([primes.utm.edu](https://primes.utm.edu/howmany.html#better))_. | ||
| ``` | ||
|
|
||
| [](https://primes.utm.edu/howmany.html#pnt) | ||
|
|
||
| Moreover in it was verified numerically, in a rigorous way using interval arithmetic, that _[The Riemann hypothesis is true up to 3 · 10^12](https://arxiv.org/pdf/2004.09765.pdf)_. That is, all zeroes β+iγ of the Riemann zeta-function with 0<γ≤3⋅1012 have β=1/2. | ||
|
|
||
| ```danger | ||
| We have Λ ≤ 0.2. The next entry is conditional on taking H a little higher than 10*13, which of course, is not achieved by Theorem 1. This would enable one to prove Λ < 0.19. Given that our value of H falls between the entries in this table, it is possible that some extra decimals could be wrought out of the calculation. We have not pursued this _([arXiv:2004.09765](https://arxiv.org/abs/2004.09765))_. | ||
| ``` | ||
|
|
||
| [](https://arxiv.org/pdf/2004.09765.pdf) | ||
|
|
||
| This Euler formula represents the distribution of a group of numbers that are positioned at regular intervals on a straight line to each other. Riemann later extended the definition of zeta(s) to all complex numbers (***except the simple pole at s=1 with residue one***). Euler's product still holds if the real part of s is greater than one. Riemann derived the functional equation of zeta function. | ||
|
|
||
| ```danger | ||
| The Riemann zeta function has the trivial zeros at -2, -4, -6, ... (the poles of gamma(s/2)). Using the Euler product (with the functional equation) it is easy to show that all the other zeros are in the critical strip of non-real complex numbers with 0 < Re(s) < 1, and that they are symmetric about the critical line Re(s)=1/2. The unproved Riemann hypothesis is that all of the nontrivial zeros are actually on the critical line _([primes.utm.edu](https://primes.utm.edu/notes/rh.html))_. | ||
| ``` | ||
|
|
||
|  | ||
|
|
||
| If both of the above statements are true then mathematically this Riemann Hypothesis is proven to be incorrect because it only applies to certain cases or limitations. So first of all the basis of the Riemann Hypothesis has to be considered. | ||
|
|
||
| [](https://gist.github.com/eq19/0ce5848f7ad62dc46dedfaa430069857#file-parser-md) | ||
|
|
||
| {:.bg-white.text-black.m-5} | ||
| _Sehr leider Herr Riemann. Leute können den Fall immer noch nicht lösen.._. | ||
|
|
||
| On the other hand, the possibility of obtaining the function of the distribution of prime numbers shall go backwards since it needs significant studies to be traced. Or may be ***start again from the Euleur Function***. | ||
|
|
||
| ## Euler's identity | ||
|
|
||
| _[Freeman Dyson](https://en.wikipedia.org/wiki/Freeman_Dyson#Quantum_physics_and_prime_numbers)_ discovered an intriguing connection between quantum physics and [Montgomery's pair correlation conjecture](https://en.wikipedia.org/wiki/Montgomery%27s_pair_correlation_conjecture) about the zeros of the [zeta function](https://gist.github.com/eq19/e9832026b5b78f694e4ad22c3eb6c3ef#zeta-function) which dealts with the distribution of primes. | ||
|
|
||
| ```note | ||
| The Mathematical Elementary Cell 30 (***MEC30***) standard _[unites](https://gist.github.com/eq19/e9832026b5b78f694e4ad22c3eb6c3ef#centralizing)_ the mathematical and physical results of 1972 by _the mathematician Hugh Montgomery and the physicist Freeman Dyson_ and thus reproduces energy distribution in systems as a path plan ***more accurately than a measurement*** _([Google Patent DE102011101032A9](https://patents.google.com/patent/DE102011101032A9/en#similarDocuments))_. | ||
| ``` | ||
|
|
||
| [](https://patentimages.storage.googleapis.com/6f/e3/f0/b8f7292f1f2749/DE102011101032A9.pdf) | ||
|
|
||
| The path plan assume that a symmetric distribution of prime numbers with equal axial lengths from a ***middle zero axis = 15*** is able to determine the distribution of primes in a given number space. This assumption finally bring us to the equation of ***[Euler's identity](https://en.wikipedia.org/wiki/Euler%27s_identity)***. | ||
|
|
||
| ```note | ||
| ***Euler's identity*** is named after the Swiss mathematician Leonhard Euler. It is a special case of Euler's formula | ||
| e^ix = cos x + i sin x when evaluated for x = π. _([Wikipedia](https://en.wikipedia.org/wiki/Euler%27s_identity))_. | ||
| ``` | ||
|
|
||
| [](https://en.wikipedia.org/wiki/Euler%27s_identity) | ||
|
|
||
| The finiteness position of Euler's identity by the said _MEC30_ opens up the possibility of accurately representing the self-similarity based on the distribution of _[True Prime Pairs](https://gist.github.com/eq19/0ce5848f7ad62dc46dedfaa430069857)_ so that all number would belongs together with [their own identitities](https://www.eq19.com/identition/). | ||
|
|
||
| ```tip | ||
| Euler's identity is considered to be an exemplar of deep mathematical beauty as it shows a profound connection between the most fundamental numbers. Three (3) of the basic arithmetic operations occur exactly once each: ***addition***, ***multiplication***, and ***exponentiation*** _([Wikipedia](https://en.wikipedia.org/wiki/Euler%27s_identity))_. | ||
| ``` | ||
|
|
||
| [](/identition). | ||
|
|
||
| See that there are multiple repetition from addition to multiplication which may lead up to the concept of [11th-dimension](https://www.techtarget.com/whatis/definition/11th-dimension). This path is being applied as you can find on the left sidebar. (Please change the view to desktop mode if you are on mobile browser). | ||
|
|
||
| Nothing is going to be easly about the nature of prime numbers but they demonstrably congruent to something organized. Let's discuss starting with the _[addition zones](https://www.eq19.com/addition/)_. |
Oops, something went wrong.