Fast compact prime number sieves (among others)
Journal of Algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
An Exercise in Program Explanation
ACM Transactions on Programming Languages and Systems (TOPLAS)
Systematic Programming: An Introduction
Systematic Programming: An Introduction
A Discipline of Programming
On the Prime Example of Programming
Proceedings of a Symposium on Language Design and Programming Methodology
| Hi-index | 48.22 |
Programs attributed to Wirth and Misra for generating the prime numbers up to a specified limit are investigated. It is shown that Wirth's program is incorrect according to three increasingly weak criteria, and a composite number is exhibited that the program accepts as prime. This is the smallest known counterexample, and could not have been found by the usual method of program testing—the program would run for trillions of years on the fastest computer before reaching it! Closely related counterexamples are given to a conjecture of Misra concerning his program. An appendix gives a particularly simple algorithmic proof of the Chinese remainder theorem.