Fraction Counting Problem Brian Rothstein December 27, 1999 1

First Page		Document Content
Date: 2007-09-20 19:32:04 Greatest common divisor Fundamental theorem of arithmetic Integer factorization algorithms Least common multiple Extended Euclidean algorithm Mathematics Number theory Euclidean algorithm		Fraction Counting Problem Brian Rothstein December 27, 1999 1 Add to Reading List Source URL: www.ugcs.caltech.edu Download Document from Source Website File Size: 122,10 KB Share Document on Facebook

	PROCEEDINGS OF THE ROMAN NUMBER THEORY ASSOCIATION Volume 2, Number 1, March 2017, pages 1-12 Michel Waldschmidt DocID: 1vpOA - View Document
	SOME EXAMPLES IN THE THEORY OF SUBGROUP GROWTH ¨ ller and Jan-Christoph Schlage-Puchta Thomas W. Mu Abstract. By estimating the subgroup numbers associated with various classes of large groups, we exhibit a number of n DocID: 1vpks - View Document
	CLASS FIELD THEORY P. Stevenhagen Explicit Algebraic Number Theory Oberwolfach Seminar November 2002 DocID: 1voYb - View Document
	————————————————————————————– Vilnius Conference in Combinatorics and Number Theory Vilnius, Lithuania, July 16 - July 22, 2017 Program and Abstract Book DocID: 1volf - View Document
	Advanced algebraic number theory Advanced algebraic number theory A. Page IMB INRIA/Université de Bordeaux DocID: 1vmt5 - View Document