JavaScript is disabled for your browser. Some features of this site may not work without it.
Some Negative Results Concerning Prime Number Generators
dc.contributor.author | Pritchard, Paul | en_US |
dc.date.accessioned | 2007-04-23T16:47:05Z | |
dc.date.available | 2007-04-23T16:47:05Z | |
dc.date.issued | 1983-02 | en_US |
dc.identifier.citation | http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR83-542 | en_US |
dc.identifier.uri | https://hdl.handle.net/1813/6382 | |
dc.description.abstract | Programs due 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 counter-example, 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 counter-examples are given to a conjecture of Misra concerning his program. | en_US |
dc.format.extent | 796469 bytes | |
dc.format.extent | 169973 bytes | |
dc.format.mimetype | application/pdf | |
dc.format.mimetype | application/postscript | |
dc.language.iso | en_US | en_US |
dc.publisher | Cornell University | en_US |
dc.subject | computer science | en_US |
dc.subject | technical report | en_US |
dc.title | Some Negative Results Concerning Prime Number Generators | en_US |
dc.type | technical report | en_US |