Abstract
Thirty-two unsolved problems in elementary number theory are listed as challenge problems for automated reasoning systems. The clausal forms of the conjectures and of their negations are given, suitable as input to resolution theorem provers versed in Peano arithmetic.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have