Quadratic fields with and without Euclid's algorithm
β Scribed by Alexander Oppenheim
- Publisher
- Springer
- Year
- 1934
- Tongue
- English
- Weight
- 115 KB
- Volume
- 109
- Category
- Article
- ISSN
- 0025-5831
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Algorithms can be used to prove and to discover new theorems. This paper shows how algorithmic skills in general, and the notion of invariance in particular, can be used to derive many results from Euclid's algorithm. We illustrate how to use the algorithm as a verification interface (i.e., how to v
The continued fraction expansion and infrastructure for quadratic congruence function fields of odd characteristic have been well studied. Recently, these ideas have even been used to produce cryptosystems. Much less is known concerning the continued fraction expansion and infrastructure for quadrat
to my teacher, professor tsuneo kanno, on his 70th birthday For an odd prime number p and a real quadratic field k, we consider relative unit groups for intermediate fields of the cyclotomic Z p -extension of k and discuss the relation to Greenberg's conjecture. 1997 Academic Press 2 which were def