3 ms·
I wrote a quick script to test it. It does not take leap seconds into consideration and assumes all months to have 31 days (would be easy to modify, but it is s
by zulln 10y ago
I wrote a quick script to test it. It does not take leap seconds into consideration and assumes all months to have 31 days (would be easy to modify, but it is sufficient for the task).
https://gist.github.com/zulln/110a1d454d07339c496cc8ec6349fe8b https://gist.github.com/zulln/110a1d454d07339c496cc8ec6349fe...
This means this does not work about 200 times a day in addition to about hundred whole days (for every hundred years).
- mbb70 10y agoA quick script from me determined you need 10,524,628 decimals of pi for this to work for all dates and times, with the limiting time being 16:25:42.
- lutusp 10y ago> A quick script from me determined you need 10,524,628 decimals of pi for this to work for all dates and times ... (emphasis added) For a finite, normally distributed digit sequence (as Pi is thought to be), the probability is always less than 1.0 for finding a particular sequence within it. But if you mean a specially engineered sequence designed to include all possible 6-digit sequences, then we've left the question of whether a given finite Pi sequence includes it.
- zulln 10y agoI am not sure what you are trying to say here. He did not care about probability, he tested it.
- theden 10y agoNice! That's pretty neat zulln. If you'd like to improve things, I do accept pull requests https://github.com/TheDen/PiDay https://github.com/TheDen/PiDay