Greatest Common Divisor and Least Common Multiple, v3 WG21 N4061N3913, N3845 JTC1Programming Language C Walter E. Brown <> - Multiplicative order - Document - PDFSEARCH.IO

First Page		Document Content
Date: 2014-06-30 08:00:30 Greatest common divisor Least common multiple Euclidean algorithm Divisor Multiplicative order GCD domain Binary GCD algorithm Mathematics Number theory Modular arithmetic		Greatest Common Divisor and Least Common Multiple, v3 WG21 N4061N3913, N3845 JTC1Programming Language C++ Walter E. Brown <> Add to Reading List Source URL: www.open-std.org Download Document from Source Website File Size: 122,20 KB Share Document on Facebook

	Singularities of divisors on abelian varieties Olivier Debarre March 20, 2006 This is joint work with Christopher Hacon. We work over the complex numbers. Let D be an effective divisor on an abelian variety A of dimensio DocID: 1xViY - View Document
	FANO VARIETIES AND EPW SEXTICS OLIVIER DEBARRE Abstract. We explore a connection between smooth projective varieties X of dimension n with an ample divisor H such that H n = 10 and KX = −(n − 2)H and a class of sexti DocID: 1xVb2 - View Document
	MODULI OF STOKES TORSORS AND SINGULARITIES OF DIFFERENTIAL EQUATIONS by Jean-Baptiste Teyssier Abstract. — Let M be a meromorphic connection with poles along a smooth divisor DocID: 1xU9F - View Document
	Divisor Class Halving on Hyperelliptic Curves Peter Birkner Department of Mathematics, Technical University of Denmark (currently visiting Fields Institute, Toronto) Cryptography Seminar, University of Waterloo DocID: 1vjwU - View Document
	Divisor Class Halving on Hyperelliptic Curves Peter Birkner Department of Mathematics and Computer Science Eindhoven University of Technology EIDMA Seminar Combinatorial Theory DocID: 1uI5M - View Document