练习3-56原文
Exercise 3.56. A famous problem, first raised by R. Hamming, is to enumerate, in ascending order with no repetitions, all positive integers with no prime factors other than 2, 3, or 5. One obvious way to do this is to simply test each integer in turn to see whether it has any factors other than 2, 3, and 5. But this is very inefficient, since, as the integers get larger, fewer and fewer of them fit the requirement. As an alternative, let us call the required stream of numbers S and notice the following facts about it. ●S begins with 1. ●The elements of (scale-stream S 2) are also elements of S. ●The same is true for (scale-stream S 3) and (scale-stream 5 S). ●These are all the elements of S. Now all we have to do is combine elements from these sources. For this we define a procedure merge that combines two ordered streams into one ordered result stream, eliminating repetitions:
s2)))s1car s1car s2car)s1cars2)))))))))
Then the required stream may be constructed with merge, as follows:
<??> <??>)))
Fill in the missing expressions in the places marked
代码 s 3)(scale-stream s 5)))))
，人生没有彩排，每一天都是现场直播
