Statistical observations about primes Are there statistical observations about prime numbers showing that primes are not random? For example obviously primes are $1$ or $-1$ mod $6$, but are these remainder distributed equally? What I mean is, that if you derive some contraints on prime statements, do primes seem statistically random within the number set satisfying these constraints? Or are there some observations which are seen, but cannot be explained.
I'm basically wondering if there is evidence that the "construction" of primes has some inherent deep complexity, that statements about primes are always limited and at some point only randomness can be assumed.
I could compare that to fractal images where the generating equation is very simple, but the resulting images seem structured but still unpredictable.
Hope I made my question clear :)
 A: There is a heuristic probabilistic model of the primes due to Cramér based on the prime number theorem wherein a number $n$ has probability $\frac{1}{\log n}$ of being a prime. The idea is that statistical properties of these random numbers should with probability $1$ coincide with statistical properties of the primes themselves. So the question can be interpreted as follows:

Are there any results about the primes that disagree with the predictions of Cramér's model?

Of course Cramér's model predicts that about half of all prime numbers are even, which is silly, but this isn't hard to fix. More seriously, in 1985 Maier proved a result about the distribution of primes that disagrees with Cramér's model in a stronger way: details can be found in Granville's Harald Cramér and the distribution of primes. 
A: Clear as mud. 
The primes aren't random. They are defined by a completely deterministic process. 
Nevertheless, there are many situations in which a probabilistic model for primes makes predictions which agree with all the numerical evidence. 
There are many observations about primes that cannot be explained, but I don't know what this has to do with randomness; there are just a lot of hard questions around. 
If you could ask a precise question, maybe I could give a precise answer. 
A: Look up "Prime Races"
here:
http://www.dms.umontreal.ca/~andrew/PDF/PrimeRace.pdf
This does a great job explaining
why certain types of primes
(such as 4n+1 and 4n+3)
have asymptotically equal numbers
but one type
(in this case, 4n+3)
seems to occur more often than the other.
