had a problem where I was hand calculating and hardcoding the bounds for the piecewise algo of the length of Smarandache-Wellin numbers and then realized that the bounds are just entries on the list of the number of primes with at most n digits... which requires the prime counter function to calculate so now I have two problems. like is it good enough to say in the comments "hey this is just pi(10^n) for n <6" or do i actually need to do that shit


cybrespace: the social hub of the information superhighway jack in to the mastodon fediverse today and surf the dataflow through our cybrepunk, slightly glitchy web portal support us on patreon or liberapay!