# Timeline for How to formally say that the integers modulo $p$ for a prime $p$ gives results that are "more random" than for a composite $n$?

### Current License: CC BY-SA 4.0

8 events
when toggle format what by license comment
Jun 17 '20 at 8:17 history edited CommunityBot
Commonmark migration
Dec 5 '18 at 20:36 comment One can argue that you selected a special series to result in 2,0's since you show numbers greater than the modulus. It is better to use a circular representation to show full cycle and sub-groups. The closes that I found on Mathematica
Dec 5 '18 at 20:03 comment I find that Quora answer to be very misleading. When primes are used in hash algorithms, the typical operation is multiplication, not division.
Dec 5 '18 at 19:36 answer timeline score: 4
Dec 5 '18 at 19:28 history edited
edited body
Dec 5 '18 at 19:22 history edited
polish
Dec 5 '18 at 19:00 review
Dec 5 '18 at 19:22
Dec 5 '18 at 18:56 history asked