Thanks
Thanks to Josh "Shorti" Myer,
who is a lot less lazy than I am,
for calculating
     |
N, given 2N=1,000,000 |
based on
     |
(log10 1000000) / (log10 2) |
According to Shorti, the actual value is
     |
219.93156856932 |
and it might be a repeating
fraction thereafter (his MS-Win's built-in calculator could not prove it
any better than this.)
Thanks to Bill Bohan
who is a lot more careful than I am, for pointing out that I had somehow
gotten off track by orders of magnituted in my 1997 version of the file,
an astronomical blunder. I had calculated the chart by hand, which
goes against the whole reason why they built the
ENIAC in the first place.
Mr. Bohan also gets a Good Netizen award for pointing out my rather foolish
errors with civility and a bit of humor.
And no thanks to the two nasty-grams I recieved on the same topic.
Didn't bother to make note of the social misfits who sent 'em.
Most honorable mention to Roy
W. Clickery as I used his
Data Powers of Ten
document to verify my
Powers of Two, although, unlike Mr. Clickery,
the fact that a kilobyte is 1,024 bytes isn't 1,000 bytes
does keep me awake at night.
I'm not worthy! Thank you
Don Knuth for
giving me my 15 minutes of fame with his reference to one of my
documents in your
Recent News
(1999) document.
I added his suggestions to my
Powers of Two document after hearing of this.
(For those who don't get it: This guy is one of the
legendary computer people that you'll see honored on a
postage stamp someday.)