ON SHANKS’ ALGORITHM FOR COMPUTING THE CONTINUED FRACTION OF logb a. TERENCE JACKSON AND KEITH MATTHEWS Abstract. We give a more practical variant of Shanks’ 1954 algorithm for computing the continued fraction of log

First Page		Document Content
$Elementary mathematics / Euclidean algorithm / Integer / Tonelli–Shanks algorithm / Algorithm / Continued fraction / Mathematics / Abstract algebra / Number theory$ Date: 2002-12-04 15:22:13 Elementary mathematics Euclidean algorithm Integer Tonelli–Shanks algorithm Algorithm Continued fraction Mathematics Abstract algebra Number theory		ON SHANKS’ ALGORITHM FOR COMPUTING THE CONTINUED FRACTION OF logb a. TERENCE JACKSON AND KEITH MATTHEWS Abstract. We give a more practical variant of Shanks’ 1954 algorithm for computing the continued fraction of log Add to Reading List Source URL: www.numbertheory.org Download Document from Source Website File Size: 184,07 KB Share Document on Facebook

	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 DocID: 1oo9G - View Document
	1 Square root computation over even extension fields Gora Adj 1 DocID: 12N6G - View Document
$ON SHANKS’ ALGORITHM FOR COMPUTING THE CONTINUED FRACTION OF logb a. TERENCE JACKSON AND KEITH MATTHEWS Abstract. We give a more practical variant of Shanks’ 1954 algorithm for computing the continued fraction of log$	ON SHANKS’ ALGORITHM FOR COMPUTING THE CONTINUED FRACTION OF logb a. TERENCE JACKSON AND KEITH MATTHEWS Abstract. We give a more practical variant of Shanks’ 1954 algorithm for computing the continued fraction of log DocID: ZFKH - View Document