If a computer could consider 100 billion orders a second instead of just 1 billion, how many years would it take to solve the traveling salesman problem by enumeration if n = 26? (Does the improvement in computer speed make a serious difference in conclusions based on footnote 4 on page 26?)

It would take \(\frac{25!}{10^{11} \cdot 3600 \cdot 24 \cdot 365} = 4918572\) years

The improvement doesn’t make much difference for conclusions in footnote 4, it only brings the order of magnitude down by 2, from hundreds millions of years to single-digit millions of years