11 ms·
Prime number patterns
- ccvannorman 12y agoI noticed that comparing sequential mod N (1260, 1261, 1262) you can see the composite lines rotating (which makes sense because the lines follow the 2s, so a mod of a number makes the 2s on each line be 1 or 2 pixels apart the lines appear diagonal.) This isn't a huge insight, but it does feel like a jumping off point for looking at the patterns -- a sort of lattice or baseline by which to compare the rest of the static. This app makes me happy. :-]
- wfn 12y agoUlam's spiral is fascinating, too. I've recently discovered this excellent prime number distribution visualization page, which combines the general idea of Ulam's spiral with other things: http://www.dcs.gla.ac.uk/~jhw/spirals/ http://www.dcs.gla.ac.uk/~jhw/spirals/
- christophilus 12y agoWoah! That is cool. Thanks for sharing.
- robert_tweed 12y agoThis is pretty cool, but seems like an illusion in that it appears to show a pattern where there isn't one. At least not exactly. Firstly, the formula traces a spiral. If you plot every point, that is. You only plot a point if it's a prime, but it's still always going to trace a spiral! Still, this only-plotting-primes business leads to new, unexpected patterns emerging. Yet, if you think about it, that's not altogether surprising really. Patterns emerge not so much in where the primes are, as where the primes aren't. Once you go beyond two, anything divisible by two can't be a prime anymore. Same with three. Same for all numbers, because that's what prime means. As a result, you get a pattern. It just so happens that this is what that pattern looks like when you plot it on a spiral rather than a straight line, or in a grid like the OP. The grid has a similar effect, but the pattern forms vertical lines depending on how many of the prime factors within the set divide evenly by the modulo divisor chosen. Or the divisor +/- 1, which gives rise to diagonals (try adjusting the number up/down by 1 to see this effect).
- ay1n 12y agoThank you, your explanation was a deep insight into those patterns for me.
- readerrrr 12y agoTry 4513 for two divergent lines in the first million and almost complete randomness in the 50th million.
- morsch 12y agoThat's a prime number and those diagonals were present for all primes I tried. There's probably a name for that.
- readerrrr 12y agoThere are two non-parallel lines in 4513( and I'm not talking about the two sets of parallel lines crossing each other ). Look carefully, and ignore other parallels. I haven't seen any such clear example in other primes( or any other number for that matter ). I though it was interesting so here is a picture: http://i.imgur.com/KpbfuSz.jpg http://i.imgur.com/KpbfuSz.jpg Between the purple and blue lines, there are a couple of segments desperately trying to form a line, but failing.
- protopete 12y ago2310
- CoffeeDregs 12y agoYeah, I just did the same thing. 235711 Unfortunately, it didn't yield anything much more interesting than 1260...
- api 12y agoIf a pattern were found that allowed primes of arbitrary size to be computed trivially, how would this impact cryptography?
- readerrrr 12y agoThere is such a formula, it is very simple n^2+n+41 It doesn't generate sequential primes. That doesn't really matter, checking if a number is prime can be done in sublinear time complexity. The real problem is factoring large numbers.
- schoen 12y agoIt also stops generating primes for n=40. See https://en.wikipedia.org/wiki/Formula_for_primes#Prime_formulas_and_polynomial_functions https://en.wikipedia.org/wiki/Formula_for_primes#Prime_formu...
- readerrrr 12y agoIt never stops generating primes, but it doesn't give a prime for every n.
- alphaBetaGamma 12y agoThen why is it better than just n which also doesn't give a prime for any n, but does generate them all.
- mariusz79 12y ago31415
- mariusz79 12y agofor 1618 (golden ratio x 1000) there is a straight line right in the middle of the screen. Best visible when scrolling
- alyx 12y agoSame with 1234
- CJefferson 12y agoThis kind of really obvious single line will occur for anything which is 2prime number. 1618 = 2809, so all numbers of the form: n1618 and n1618+809 are composite. There is no other 0<c<1617 where n*1618+c is always prime, so the line is really obvious.
- MichaelDickens 12y agoYour division signs got parsed as italic typesetting.
- Zolomon 12y agoI always thought these attempts were interesting, because the patterns depend completely upon the visualization implementation and not directly on the pattern of the prime numbers. Is there some way to find prime number patterns without depending on a specific visualization?
- netcraft 12y agoi've had the same thought, but I dont think theres anything wrong with the fact that patterns are only noticeable in a certain visualization. A pattern in a decimal number wouldn't be discernible in another base for instance. Its may just be that finding the right visualization might be the way to discover new insights.
- foolrush 12y agoSee Sociology. The model / metric forms the inference.
- BenedictEggers 12y agoYes. It's called math.
- SCHiM 12y agoEdit: I should read more throughly next time, we don't really seem to disagree at all. I thought I read that you said that these patterns were not interesting because they are not 'perfect'. Original comment: I've always thought what seems to be the direct opposite of what you do. In the end every thing we know are incomplete internal models of external systems. E.g. We see a plant, and the image of the plant is stored in our minds, however the image of the plant is not _the_ plant, and may or may not perfectly resemble the plant. What I'm trying to say is that I think it's pretty pointless to try and find 'perfect' patterns because our own storage system/recognition engine is less than perfect and that it's more fruitful to focus on those domains in which it's easy for us to see patterns, incomplete they may be. Like this very intriguing map of prime patterns.
- mrcactu5 12y agothe UI is very nice... where did you find 50 million primes? https://github.com/chrisdavies/primepattern/tree/master/sets https://github.com/chrisdavies/primepattern/tree/master/sets I found them: https://primes.utm.edu/lists/small/millions/ https://primes.utm.edu/lists/small/millions/ He says: Usually it is faster to run a program on your own computer than to download them. Here in numpy: import numpy as np N = 1000000 n = np.arange(N)+2 p = [] while(len(n) > np.sqrt(N)): p += [n[0]] n = n[np.where(n% p[-1] != 0)] print len(p), N/np.log(N)
- christophilus 12y agoHm. I should credit the source... Will put that on my todo list tonight. I transformed these into JSON: https://primes.utm.edu/lists/small/millions/ https://primes.utm.edu/lists/small/millions/
- christophilus 12y agoYeah. I thought about shrinking the dataset down to 10k primes instead of 1m primes, as the patterns would still hold up, but the load/rendering times would greatly improve.
- mrcactu5 12y agoI appreciate having such a ridiculous number or primes. For certain cryptography problems I need primes around 10^15 or even bigger.
- thomasahle 12y agoI like this way of using numpy. This resembles the sieve of eratosthenes, so you'd think it was fast. However `n%p[-1]` isn't fast to do, your inner loop ends up taking nearly linear time. At least linear in the final number of primes, which is larger than `N/logN`. Hence your algorithm runs in `N^(3/2)` whereas eratosthenes is `NloglogN`. Funny how many versions of this algorithm there are out there.
- mrcactu5 12y ago
- netcraft 12y agoGithub source: https://github.com/chrisdavies/primepattern https://github.com/chrisdavies/primepattern
- tikhonj 12y agoThis is great, although it's obviously hard to draw conclusions. I'd love to see the same sort of visualizations done for 50 million (or however many) random numbers drawn from a distribution that vaguely mimics the primes.
- escape_goat 12y agoI don't have a very strong math background, but it seems to me self-evident that the strong vertical striping, for instance, would be a trivial artefact of the modulus rather than anything interesting about the prime numbers themselves. This leads me to suspect that the rest of the linear striping has a similar explanation which is simply less obvious to me. This in turn leads me to wonder what it is, exactly, that we're looking at. There will always be patterns visible because there is a deep connection between the ability to form a pattern and not-being-a-prime-number; the latter always implies the former, if not the other way around. So how does one perceive a "subtle" pattern of primes when not-being-a-prime is a property possessed by an overlay of an infinite number of patterns?
- antimora 12y agoAssuming the black striped continue forever for "prime mod 1260", does this mean we can quickly weed out non prime numbers?
- christophilus 12y agoI was wondering that, myself. The magic number seems to be 210. (1260 is 210 * 6)
- christophilus 12y agoYou'll also notice that between the black stripes, there is a somewhat denser white stripe. A while back, I calculated the number of primes in those white stripes, and the number was a good bit higher than the over all average.
- pbhjpbhj 12y agoThis just seems to be a variation of the Sieve of Eratosthenes?
- christophilus 12y agoMaybe? Haven't heard of it.