News for hackers. Stuff that matters.
Re:Is the largest root of a random polynomial more likely to... by RockofStrength on Friday May 10, 2024 @09:40AM (#40318859)
You get e from the primes by averaging the set size of only growing gaps (2,3,5)(7,11)(13,17)... or only non-shrinking gaps (2,3,5,7,11)(13,17)(19,23,29)...

Not a property of primes per se, just a property of growth. It works better with a set of randoms.

Re:Is the largest root of a random polynomial more likely to... by lupire on Friday May 10, 2024 @11:09AM (#40319941)
I thinking that works for primes because primes are approximately randomly distributed.

But primes are more directly "e" if you look at π(N), the count of primes less than N. That is ~n/ ln(n)

https://en.m.wikipedia.org/wiki/Prime-counting_function

Re:Is the largest root of a random polynomial more likely to... by keepamovin on Friday May 10, 2024 @11:37PM (#40325787)
I think that's also another way you can get e from primes.

Can you explain more what you mean by "set size of only growing gaps" - I like this!

Re:Is the largest root of a random polynomial more likely to... by RockofStrength on Saturday May 11, 2024 @10:13PM (#40331923)
(2,3,5) because 2 to 3 = 1 and 3 to 5 = 2. 5 to 7 is also 2 so the gap does not grow, so 7 starts the next set.
Re:Is the largest root of a random polynomial more likely to... by keepamovin on Sunday May 12, 2024 @01:06AM (#40332369)
Hey that’s cool I like that! Haha :) Thanks for sharing this. You have any GitHub repo or blog talking more about this??? :)