Cyclotomic unit

#	Item
1	The Tonelli-Shanks algorithm Ren´e Schoof, Roma 20 dicembre 2008 let p > 2 be prime. We describe an algorithm (due to A. Tonelli (Atti Accad. Linceiand D. Shanks (1970ies)) to compute a square root of a given sq Add to Reading List Source URL: www.mat.uniroma2.it Language: English - Date: 2009-01-31 17:59:10 Algebraic number theory Modular arithmetic TonelliShanks algorithm Field theory Cyclotomic unit Trigonometry in Galois fields
2	An Algorithmic Approach to Cyclotomic Units by Marc Conrad, University of Bedfordshire http://perisic.com/marc-conrad 2πia For n ∈ N and (a, n) = 1 let n := e n be a primitive nth unit root. Add to Reading List Source URL: www.mathos.unios.hr Language: English - Date: 2016-02-05 01:29:43
3	Journal de Th´eorie des Nombres de Bordeaux), 289–325 Class invariants and cyclotomic unit groups from special values of modular units par Amanda FOLSOM Add to Reading List Source URL: almira.math.u-bordeaux.fr Language: English - Date: 2009-01-21 05:49:27
4	FERMAT’S LAST THEOREM FOR REGULAR PRIMES KEITH CONRAD Add to Reading List Source URL: www.math.uconn.edu Language: English - Date: 2004-10-01 23:05:14 Algebra Cyclotomic field Algebraic number field Prime number Cyclotomic unit Field Trigonometry in Galois fields Proofs of quadratic reciprocity Abstract algebra Algebraic number theory Mathematics