King's Lead Hat @antitechbro.com · May 9 Also the entire block inside the floor in that formula is basically a cheat relying on Wilson's theorem, which is very much nonbasic and non-closed-form, and boils down to a boolean test saying `if (isPrime) then 1 else 0`
0 likes 1 replies
?
Replies
The inner sum? It's the prime-counting function. Very much nonbasic and nontrivial, VERY bruteforce. The outer sum? It's the bruteforce theoretical limit for the nth prime from Betrand's postulate, which is like bringing a gun to a knife fight, since it's a pretty inefficient upper bound for primes!