Show simple item record

dc.contributor.authorPritchard, Paulen_US
dc.date.accessioned2007-04-23T16:47:05Z
dc.date.available2007-04-23T16:47:05Z
dc.date.issued1983-02en_US
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR83-542en_US
dc.identifier.urihttps://hdl.handle.net/1813/6382
dc.description.abstractPrograms 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.extent796469 bytes
dc.format.extent169973 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/postscript
dc.language.isoen_USen_US
dc.publisherCornell Universityen_US
dc.subjectcomputer scienceen_US
dc.subjecttechnical reporten_US
dc.titleSome Negative Results Concerning Prime Number Generatorsen_US
dc.typetechnical reporten_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics