Cody Boone Ferguson proposed a fix for this to compile with clang and Landon implemented it after some discussion. The reason Cody did not do it is because he thought it was the wrong output but as it happens the try section below was worded a bit confusingly. He looked at Yusuke Endoh's analysis found here but he missed that Yusuke added a '...' after the result which made him think the fix was wrong. Cody also made the recommended change of the author to make it so that each number is printed on a line by itself rather than having a long string of numbers on the same line. Thank you Cody for your assistance and thanks to Yusuke for confirming the output is correct!

To run:

./dalbec

Try:

./dalbec 3 | head -n 29

Why does the output end with 121?

Judges' remarks:

The output is mis-leading ... why does it also print 2047?

For a hint see https://web.archive.org/web/20000510191341/https://www.utm.edu/research/primes/prove2.html.

... and then try to understand the source! :-)

We (the judges) recommend that you take the time needed to understand how this program works. The source is small enough to make the effort reasonable, and complex enough to make it interesting.

Author's remarks:

This program assumes that your terminal wraps lines automatically. If this is not the case, you may need to change the space in the "printf" format string to a newline character.

An extra feature of this program is that it allows you (in most cases) to estimate the stack space available to programs on your system. Simply allow the program to run to completion. The stack space is roughly proportional to the last number printed.

(On SunOS/cc, the proportionality constant is about 48 bytes.)

On completion, the program produces a core file that may be used to refine this estimate. (Or you could try typing limit if you're running csh.) In rare cases the stack space may exceed 24*INT_MAX bytes, in which case the program will produce an inaccurate estimate.

This program is obfuscated by:

The use of easily-confused variable names.
Using the implicit !=0 in conditional expressions.
Substituting expressions such as !a for 0 where a!=0 and !a for 1 where a==0.
The fact that main() is a single expression and so beautifies poorly.
The fact that main() is used:
- to compute powers in modular arithmetic.
- to recursively call itself in the main loop.

Copyright and CC BY-SA 4.0 License:

Creative Commons Attribution-ShareAlike 4.0 International (CC BY-SA 4.0)

For more information, see: https://creativecommons.org/licenses/by-sa/4.0/