News for hackers. Stuff that matters.
Re:Munchausen Numbers and How to Find Them by Someone on Wednesday September 21, 2016 @05:30PM (#12552439)
https://oeis.org/A046253 agrees, but adds 0 and 438579088, using 0^0 = 0.

Also, http://mathworld.wolfram.com/MuenchhausenNumber.html gives an explanation why they are called Münchhausen Numbers. It states:

these numbers "raise themselves" analogously to way in which Baron Hieronymus von Münchhausen allegedly raised himself by riding a cannonball.

I would think it refers to bootstrapping (the baron pulled himself out of a morass by pulling on his bootstraps)

And for those playing with this in their favorite language: I would precompute an array of ten d^d values and hoist the d^d computation out of the loop for a very nice speed up.

Finally: int may not be sufficient in C if you iterate up to 9 digits. 9^9 needs 29 bits => 999,999,999 would need over 32 => unsigned int already is living very dangerously (probably too dangerously)

There are no comments on this comment yet.