Is the Prime Spiral an Intriguing Study or Just a Quirk?

Helical
Messages
74
Reaction score
0
I've was reading about it [http://mathworld.wolfram.com/PrimeSpiral.htm] and found it intriguing, has there been a great deal of study devoted to it or is it thought of as some kind of quark?

[P.S. I don't really know much about number theory, just curious]
 
Last edited by a moderator:
Physics news on Phys.org
I think it's fairly well-understood. The diagonals are related to prime-generating polynomials (which you can also read about on MathWorld).
 
but ALL the diagonals of Ulam spiral generate Polynomials that have prime values or only a few special diagonals of Ulam spiral only generate primes.
 
mhill said:
but ALL the diagonals of Ulam spiral generate Polynomials that have prime values or only a few special diagonals of Ulam spiral only generate primes.
Be careful, no polynomial generates only primes indefinitely. I think you meant --only generate primes up to a large value of n --!
 
Uh.. sorry , then i meant what are the diagonals that generate primes up to a large value of 'n' or perhaps a bit harder , given a certain prime what is the Polynomial in Ulam Spiral that for a certain integer the Polynomial gives you the prime 'p' are there SERIOUS studies with calculations for Ulam spiral.
 
I'm working through that one, give me a bit.Parse tree:

Code:
(Uh.. sorry)
(then i meant
 (
  (
   (
    what are the diagonals
    (that generate primes up to a large value of 'n')
   )
  or perhaps a bit harder ,
   (
    (
     (given a certain prime)
    what is the Polynomial in Ulam Spiral
     (
      (that for a certain integer)
      the Polynomial gives you the prime 'p'
     )
    )
   )
  )
 are there SERIOUS studies with calculations for Ulam spiral.)
)

Semantic re-formation:

Are there serious computational studies addressing:
1. What diagonals generate only primes up to large values of n?
2. Harder: given a prime p, what polynomials P have P(n) = p for some n?

Answer:

There are studies addressing #1. There is a close relationship between prime-generating polynomials and such serious topics as Heegner numbers (about which I know little). UPNT and MathWorld have lots of references.

#2 does not seem difficult. Do you have more conditions, or have I perhaps misunderstood you?
 
##\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