Timeline for Primes are pseudorandom?
Current License: CC BY-SA 2.5
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 22, 2009 at 7:59 | comment | added | Ilya Nikokoshev | The formal definition of pseudorandom sequence generator in computer science is that no program can tell the difference between sequences generated by this generator and sequences of random numbers. This obviously cannot be applied when there's only sequence, but that's the direction. | |
| Oct 19, 2009 at 21:02 | comment | added | Michael Lugo | You at least get things like that since the primes are uniformly distributed among the four residue classes {1, 5, 7, 11} mod 12, primes are uniformly distributed among the pairs of possible residues mod 3 and 4. (Is there some standard definition of "pseudorandom" in this context?) | |
| Oct 19, 2009 at 19:55 | comment | added | Ilya Nikokoshev | Ah, an old Dirichlet principle... it's still weaker than anything about pseudorandomness I think (pseudorandom things must be evenly distributed among all characteristics simultaneously). | |
| Oct 19, 2009 at 19:44 | history | answered | Harrison Brown | CC BY-SA 2.5 |