Durham E-Theses Moduli of symplectic bundles over curves Hitching, George H. How to cite:

Source URL: etheses.dur.ac.uk

• Geometry
• Invariant theory
• Moduli space
• Divisor
• Symplectic topology
• Algebraic curves
• Stable vector bundle
• Algebraic geometry
• Abstract algebra
• Moduli theory

Perfect Numbers over Simple Algebraic Number Fields Kieran Smallbone 15 March 2002 Table of Contents

Source URL: eprints.maths.ox.ac.uk

• Number theory
• Algebraic number theory
• Divisor function
• Prime number
• Perfect number
• Arithmetic function
• Gaussian integer
• Number
• Algebraic number field
• Mathematics
• Abstract algebra
• Integer sequences

arXiv:1101.0259v1 [math.NT] 31 Dec[removed]ON THE SUM OF RECIPROCALS OF AMICABLE NUMBERS Jonathan Bayless Department of Mathematics, Husson University, Bangor, Maine 04401, USA [removed]

Source URL: arxiv.org

• Sieve theory
• Divisor function
• Prime number
• Modular arithmetic
• Chebyshev function
• Log-normal distribution
• Mathematics
• Number theory
• Integer sequences

Motivation The Trick Other Applications

Source URL: www.iacr.org

• Divisor
• Mathematics
• Public-key cryptography
• Greatest common divisor
• RSA

Designing an Algorithmic Proof of the Two-Squares Theorem Jo˜ao F. Ferreira? School of Computer Science University of Nottingham Nottingham NG8 1BB, England

Source URL: www.cs.nott.ac.uk

• Multiplication
• Inverse function
• Greatest common divisor
• Mathematics
• Euclidean algorithm
• Algorithm

Math mode – v[removed]Herbert Voß* January 30, 2014 Abstract It is often said that TEX was designed for mathematical or technical purposes.

Source URL: tug.ctan.org

• Desktop publishing software
• Digital typography
• Donald Knuth
• TeX
• Typesetting
• Quadratic equation
• Divisor
• Classical orthogonal polynomials
• Mathematics
• Application software
• Typography

On Euclid’s Algorithm and Elementary Number Theory Roland Backhouse, Jo˜ao F. Ferreira1 School of Computer Science, University of Nottingham, Nottingham, NG8 1BB, England Abstract Algorithms can be used to prove and t

Source URL: www.cs.nott.ac.uk

• Elementary arithmetic
• Stern–Brocot tree
• Algorithm
• Greatest common divisor
• Multiplication
• Function
• Number theory
• Rational number
• Number
• Mathematics
• Elementary mathematics
• Euclidean algorithm

Heegner Points and Rankin L-Series MSRI Publications Volume 49, 2004 Gross–Zagier Revisited BRIAN CONRAD

Source URL: library.msri.org

• Algebraic number theory
• Elliptic curves
• Group theory
• Algebraic structures
• Heegner point
• Divisor
• Algebraic number field
• Field
• Abelian variety
• Abstract algebra
• Algebra
• Field theory

Extended Euclid’s Algorithm The extended Euclid’s algorithm can be used to express gcd(a, b) as an integer linear combination of a and b, i.e., we can use it to find integers x and y such that ax + by = gcd(a, b). Le

Source URL: pages.pacificcoast.net

• Modular arithmetic
• Integer factorization algorithms
• Extended Euclidean algorithm
• Greatest common divisor
• Mathematics
• Number theory
• Euclidean algorithm

2000 Paper 1 Question 8 Discrete Mathematics The following fragment of ML implements Stein’s algorithm for evaluating the Greatest Common Divisor, (a, b), of two natural numbers, a and b: fun stein a b c =

Source URL: www.cl.cam.ac.uk