Hacker News Reader

> Congratulations: You have now once again successfully solved one of the one star exercises in Knuth's TACP.

My CS professor has published papers that are solutions to exercises in The Art of Computer Programming. It's sort of a fact of life for computer scientists that whatever you're doing has probably already been done by Knuth.

View on HN

Knuth has a large range of problems in his text. He scales them all by difficulty on a log scale from 0 to 50. Things rated 00-05 might be a basic facts or arithmetic (What is 6! ?).

A set of problems in the 20s would be a good chunk of work, each taking about 20-30 minutes. By the time you get to 40's, you're dealing with problems that you could write a paper on. In the introduction, he demands proof of Fermat's Last Theorem as an example for 50.

Reply on news.ycombinator.com