| The statement is this:
- Find the smallest values of for which the first
iterations of (the Syracuse function) applied to fail to
yield .
Solution.
Run the following for loop:
-
for j from 1 to 1000 do
-
if csyr(j) > 2*j + 1 then
-
print(j);
-
end if;
-
end do;
An upper limit such as is desirable as a means of preventing
the loop from running forever. The choice of as loop size is a
blind guess. It may or may not turn out to be large enough. (But for
this problem it is large enough.) Upon running this loop one finds
values in the sought category, of which the five smallest are .
| |