Exploring Prime Numbers & Square Roots

JeremyEbert
Messages
204
Reaction score
0
I have read several books on the Riemann Hypothesis and have a general understanding of the non-trivial zeros and their real part 1/2. In my own studies I have devised a root system based upon some of Euclid’s ideas and congruence that identifies some interesting properties of the square roots of prime numbers. I have included a graph of the root system which I hope visually depicts some these properties and their uses in factoring. In my root system prime numbers only fall on the parabola with the vertex of 1/2. I wonder what relation, if any, can be compared to the non-trivial zeros and their real part 1/2?

http://4.bp.blogspot.com/_u6-6d4_gs.../bdPIJMIFTLE/s1600/prime-+square+12a+zoom.png

http://2.bp.blogspot.com/_u6-6d4_gs...AAAE8/_hov_b0sno4/s1600/prime-+square+12a.png
 
Physics news on Phys.org
Interesting observance; 2 and 3 being the first two prime numbers make up the basic pattern in primes of 6(n)+-1 which accounts for 2/3 of all factorable numbers giving way to highly composite numbers. This factorability is the reason a base 12 system lends itself to grouping so nicely. With primes you get 4 groups of mod(p,12) outside of 2 and 3; = (1),(5),(7),(11). These 4 groups are derived from the pattern created by 2 and 3.
6(even) + 1 = (1)
6(odd) - 1 = (5)
6(odd) + 1 = (7)
6(even) – 1 = (11)
I like to refer to these groups as P1, P5, P7 and P11.
These 4 groups obviously contain composite numbers but they are nicely organized with their perfect square congruence. For instance, all P1 numbers have a mod (n1^2, 12) = 0 square congruence to mod (n2^2, 12) = 1 ( Group P1). The 4 groups’ square congruence is as follows;
P1 + (mod (n1^2, 12) = 0) == (mod (n2^2, 12) = 1)
P5 + (mod (n1^2, 12) = 4) == (mod (n2^2, 12) = 9)
P7 + (mod (n1^2, 12) = 9) == (mod (n2^2, 12) = 4)
P11 + (mod (n1^2, 12) = 1) == (mod (n2^2, 12) = 0)
Prime numbers: n1 = (P’ -1)/2 & n2 = (P’ +1)/2
Composite numbers: n1 <= (P’ -1)/2 & n2 <= (P’ +1)/2
Interesting results:
All Mersenne Primes are in P7.
All Prime Squares are in P1.
What would the proper equation for this be?
 
Last edited:
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...
Back
Top