scholarly journals On Euclid’s algorithm and elementary number theory

2011 ◽  
Vol 76 (3) ◽  
pp. 160-180 ◽  
Author(s):  
Roland Backhouse ◽  
João F. Ferreira
2016 ◽  
pp. 1-32
Author(s):  
Gary L. Mullen ◽  
James A. Sellers

2019 ◽  
pp. 239-244
Author(s):  
Richard Evan Schwartz

This chapter proves some number-theoretic results about the sequences defined in Chapter 23. It proceeds as follows. Section 24.2 proves Lemma 24.1, a multipart structural result. Section 24.3 takes care of several number-theoretic details left over from Section 23.6 and Section 23.7.


2019 ◽  
pp. 227-238
Author(s):  
Richard Evan Schwartz

This is the first of four chapters giving a self-contained proof of Theorem 0.7. Section 23.2 describes a sequence of even rationals {pn/qn} that converges to A. Section 23.3 states the two main technical results, the Box Theorem and the Copy Theorem. Section 23.4 shows how to choose a sequence {cn}. Section 23.5 states three auxiliary results about arc copying in the plaid model. Section 23.6 deduces the Box Theorem from one of these auxiliary lemmas. Section 23.7 deduces the Copy Theorem from the auxiliary lemmas and some elementary number theory. Thus, after this chapter ends, the only remaining task is to prove the auxiliary copy lemmas and prove a few lemmas in elementary number theory.


Sign in / Sign up

Export Citation Format

Share Document