Update index.html

index.html

@@ -66,20 +66,23 @@ <h3>### Entropy,</h3>
 
 https://mathworld.wolfram.com/PrimePartition.html
 
+
+<h4>  
 ``
 *key words:
 radio waves, partitions, prime numbers characteristics, Riemann hypothesis, Bernoulli distribution, Likelihood function, Euler product, meromorphic function, sets, summation, Laurent series, addition, series, pattern, gravity, imaginary numbers, complex analysis, isolated singularities, entropy, Agoh–Giuga conjecture, Euler product, Banach space, Prime partition, Guiga number, Carmichael number, number theory
 *
 ``
-
+</h4>
+
 970,462.32026163842254755194171738
 95426903.18473885
 ```
 In the 19th century, physicists developed the methods of statistical mechanics for studying many-particle systems, whereas mathematicians proved the distribution law for prime numbers. It turns out that the two apparently different approaches can be traced back to the same mathematical root, namely, the notion of partition function. In modern quantum field theory, the Feynman functional integral can be viewed as a partition function, as we will discuss later on. The typical procedure proceeds in the following two steps.
 ```
 
 ```
-
+<h4> </h4>
 TY  - BOOK
 AU  - Zeidler, Eberhard
 PY  - 2006/01/01
@@ -94,58 +97,58 @@ <h3>### Entropy,</h3>
 
 
 ```
-
-It's my lucky day. I solved for prime numbers. I was messing around with equations and papers and homework and math. Got into prime numbers based off ideas of 10 digit numbers and divisibility, and into Bernoulli’s distribution. I went through [partitions](
+<h4>It's my lucky day. I solved for prime numbers. I was messing around with equations and papers and homework and math. Got into prime numbers based off ideas of 10 digit numbers and divisibility, and into Bernoulli’s distribution. I went through [partitions](
 https://scholar.google.com/citations?view_op=view_citation&hl=en&user=4wpjDroAAAAJ&citation_for_view=4wpjDroAAAAJ:u5HHmVD_uO8C), into [Bernoullis distribution](https://en.wikipedia.org/wiki/Bernoulli_distribution), and [numbers](https://en.wikipedia.org/wiki/Bernoulli_number), from [Fermat’s little theorem](https://en.wikipedia.org/wiki/Proofs_of_Fermat's_little_theorem), and unto of course my flavor into the interpretations and sudo math., inlcuding...
+</h4>
 
 q = 1 - p
 since 
 p − 1 ≡ −1 (mod p)
 q = -1
-
+<h4> </h4>
 -1 not trivial zero
 equality between a sum and a product
+<h4> </h4>
+1 sum = product  
+q = -1  
+  q = -1 * n : inf
+  1 - p = -1 * n
+  (1-p)/n = -1
+  -1/n - p/n = -1
+
+  1/n + p/n = 1
 
-1 sum = product
-q = -1
-q = -1 * n : inf
-1 - p = -1 * n
-(1-p)/n = -1
--1/n - p/n = -1
+  p - 1 = -1 mod p
+  p = 0
 
-1/n + p/n = 1
+  1/n + 0/n = 1
+    n =/= 0
 
-p - 1 = -1 mod p
-p = 0
+  1/n + 0/n - 1 = 0
+  1((x/n) + 0/n - (x)) = 0
 
-1/n + 0/n = 1
-n =/= 0
+  1 ((xn^[1/2]) + 0/n - (x)) = 0
+    n = {Integral{log(e)}}
 
-1/n + 0/n - 1 = 0
-1((x/n) + 0/n - (x)) = 0
+  the Riemann hypothesis is the conjecture that the Riemann zeta function has its zeros only at the negative even integers and complex numbers with real part ⁠1/2
 
-1c ((xn^[1/2]) + 0/n - (x)) = 0
-n = {Integral{log(e)}}
+  x = sqrt(x^2 + 1)
+  x = {0, |x| - 1}
+  x = {0, (|log(e)| - 1) * } = {0, .5657055181}
+    {.567055181, .5052250171}
+      {b,c} graph
+b is divisible by 7, c is divisible by 11  
+11 and 7 are prime numbers  
 
-the Riemann hypothesis is the conjecture that the Riemann zeta function has its zeros only at the negative even integers and complex numbers with real part ⁠1/2
+11 and 7 at integer magnitude = b and c  
+  b / 7 = 81,007,883
+  refract at magnitude change: .81007883
+  c / 11 = 205,004,561 : 2.05004561
 
-x = sqrt(x^2 + 1)
-x = {0, |x| - 1}
-x = {0, (|log(e)| - 1) * } = {0, .5657055181}
-{.567055181, .5052250171}
-{b,c} graph
-b is divisible by 7, c is divisible by 11
-11 and 7 are prime numbers
-
-11 and 7 at integer magnitude = b and c
-b / 7 = 81,007,883
-refract at magnitude change: .81007883
-c / 11 = 205,004,561 : 2.05004561
-
-remember |log(e)| - 1 = .5675055181
-.56570055 = 56570055 is divisible by 3
-.5675955181 = 5675955181 is divisible by 13
-.567055181 = 567055181 is divisible by 7
+  remember |log(e)| - 1 = .5675055181
+  .56570055 = 56570055 is divisible by 3
+  .5675955181 = 5675955181 is divisible by 13
+  .567055181 = 567055181 is divisible by 7
 x = log(e)
 e * pi = 8.5397
 .81007883 + .5675055181 =