The noted computer scientist Donald Knuth has conjectured that every
positive integer can be obtained by beginning with a single 3 and
applying some combination of the factorial, square root, and floor
Recall that the factorial function is n! = n*(n-1)*(n-2)*...3*2*1, and
for this problem, we insist that n be an integer. floor(x)
gives the greatest integer less than or equal to x. For example, we
to obtain a Knuth expression for 26.
One could spend a pleasant afternoon manually creating Knuth expressions for small integers
with a hand calculator. But it is much more fun to write a
perl program to do this for you. The challenge is to write an elegant,
fast, or golfish program that finds Knuth expressions for the integers 1 to 10 inclusive.
I'll post my solution in a day or so.
Posts are HTML formatted. Put <p> </p> tags around your paragraphs. Put <code> </code> tags around your code and data!
Titles consisting of a single word are discouraged, and in most cases are disallowed outright.
Read Where should I post X? if you're not absolutely sure you're posting in the right place.
Please read these before you post! —
Posts may use any of the Perl Monks Approved HTML tags:
You may need to use entities for some characters, as follows. (Exception: Within code tags, you can put the characters literally.)
- a, abbr, b, big, blockquote, br, caption, center, col, colgroup, dd, del, div, dl, dt, em, font, h1, h2, h3, h4, h5, h6, hr, i, ins, li, ol, p, pre, readmore, small, span, spoiler, strike, strong, sub, sup, table, tbody, td, tfoot, th, thead, tr, tt, u, ul, wbr
Link using PerlMonks shortcuts! What shortcuts can I use for linking?
See Writeup Formatting Tips and other pages linked from there for more info.
| & || & |
| < || < |
| > || > |
| [ || [ |
| ] || ] ||