What results would follow from or imply "randomness" of the primes? This question on random versions of deterministic problems reminded me that many conditional results in number theory hold if the primes are in some sense random, and it is common knowledge that the Riemann hypothesis is tied up in this line of thought. 
Now, off the top of my head it's not clear what "randomly distributed" really means in the context of the primes. I know that the RH would imply better versions of the prime number theorem, but that's not quite the same. So I am interested in a clarification of this as well as the following
Main question: what results would imply that, and what results would we gain from, the assumption that the primes are "randomly distributed"?
 A: Since the primes aren't really random, it's not possible to state precisely the consequences of assuming that the primes are random in the same way that we can state precisely the consequences of the Riemann hypothesis or the axiom of choice.  However, using the Cramér random model for the primes, one can "deduce" many conjectures about the primes, such as the Hardy-Littlewood prime tuples conjecture.  There is a nice expository article by Chris Caldwell that explains how to use Cramér's model to deduce all kinds of number-theoretical statements.
A: This is an excellent expository paper by Soundararajan bearing on your question.
A: The Moebius function $\mu(n)$ is defined for squarefree integers $n$ as $(-1)^k$ if $k$ is the number of prime factors of $n$ (and $\mu(n)$ is defined as $0$ if $n$ is not squarefree). The Riemann hypothesis is equivalent to the statement $\forall \epsilon > 0, \sum_{n < x} \mu(n) = o(x^{1/2 + \epsilon})$. If, on the other hand, you choose $\nu(n) = \pm 1$ randomly for squarefree $n$ and zero otherwise, then by the law of the iterated logarithm, with probability one $\sum_{n < x} \nu(n) = O(\sqrt {x \log \log x})$.
Other randomness issues connected with the Riemann hypothesis for L-functions are estimates for sums of the type $\sum e^{2\pi i \alpha n}$ or $\sum \chi(n)$ for a Dirichlet character $\chi$, where $n$ may vary over the integers in an interval or just over primes in an interval (and I should have written $p$ in that case). The mean of these sums is usually easy to figure out and sharp estimates for the deviation from the mean are consequences of (or sometimes equivalent to) the Riemann hypothesis. You can phrase some of these things in terms of primes in arithmetic progressions but then it's not so easy to see the connection with randomness.
A: Billingsley wrote a nice article on the relationship between numbers, random walks and Brownian motion.
