Abstract
Algorithms can be used to prove theorems. This chapter illustrates how the notion of invariance can assist in proving equivalences directly instead of by mutual implication.
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(1990). Proving theorems with Euclid's algorithm. In: On the Shape of Mathematical Arguments. Lecture Notes in Computer Science, vol 445. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0020920
Download citation
DOI: https://doi.org/10.1007/BFb0020920
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52849-4
Online ISBN: 978-3-540-47166-0
eBook Packages: Springer Book Archive