Join devRant
Do all the things like
++ or -- rants, post your own rants, comment on others' rants and build your customized dev avatar
Sign Up
Pipeless API
From the creators of devRant, Pipeless lets you power real-time personalized recommendations and activity feeds using a simple API
Learn More
-
@Wisecrack too complex for me and requires too much effort to read and understand that formula.
I assume it'd be equally complex to make accurate estimates for dev tasks.
Nvm... -
@AvatarOfKaine some sort of fucking magic probably.
-
@jaylord haven't the faintest.
But mostly because I didnt doublecech before posting.
Real whiz kid that one is. That wisecrack is definitely going places! Like back to school to repeat 7th grade! -
@jaylord probably to floor the float to int. Is this python 2 or what?
-
@ess3sq that's a clever trick but no. Python 3.
-
@PonySlaystation You're so hard to read I don't know if you're being ironic or not, but thanks.
By the way, how unreadable is my code? I leave a lot of comments but functionally I don't know if they're even explaining whats going on.
accurately estimates number of primes under k
from k=29, to k=232 (within +/- 1..2)
ceil(k-((phi/(1/((log(phi**(k-6), phi))/1))))/2)
Played with an alife I made.
And built a system to explore long chains of polynomials where the exponents were prime.
You can look at it if you like here:
https://pastebin.com/3trWAU7v
Don't blame me if your console explodes though!
random
primes