KennethDeleting #ephipi cruft. The first #Perl script I'm sticking with (which I've renamed ePhiPi_0xMagBin.pl) is the poor man's stress test. All it does it examine the constants #EulerNumber, #Phi, and #pi for matching single binary digits or strings of digits by orders of 0x magnitude. It reaches the 7th fairly quickly.
Write a program in Perl which searches continuously for binary digits which match in phi, pi, and e. For each order of binary magnitude print how long the search took in fractions of a second (to the utmost), seconds, hours, and days. Whenever a matching digit or series of digits are found, print the index number, the digits themselves, the number of those digits, then continue the search.