UNIVERSITÀ DEGLI STUDI DI PADOVA Tesi di Laurea Magistrale UNIVERSITÉ DE BORDEAUX Mémoire de Master 2 ARITHMETIC

Source URL: www.algant.eu

• Vector bundles
• Abelian varieties
• Multiplicative functions
• Divisor
• Riemann–Roch theorem
• Linear system of divisors
• Ample line bundle
• Canonical bundle
• Elliptic curve
• Abstract algebra
• Algebraic geometry
• Geometry

Higher genus counterexamples to relative Manin–Mumford Sean Howe [removed] Advised by prof. dr. S.J. Edixhoven.

Source URL: www.algant.eu

• Scheme theory
• Sheaf theory
• Abelian varieties
• Algebraic groups
• Picard group
• Sheaf
• Group scheme
• Invertible sheaf
• Divisor
• Abstract algebra
• Algebraic geometry
• Algebra

Concordia University Department of Mathematics & Statistics Universit´e Paris-Sud 11 D´epartement de Math´ematiques

Source URL: www.algant.eu

• Algebraic varieties
• Vector bundles
• Field theory
• Algebraic surfaces
• Del Pezzo surface
• Ample line bundle
• Divisor
• Picard group
• Linear system of divisors
• Abstract algebra
• Algebraic geometry
• Geometry

INTEGRATING THE ERROR IN THE DIVISOR PROBLEM Notes by Tim Jameson Let Bk be the k th Bernoulli polynomial. In particular B1 (x) = x − 21 and B2 (x) = x2 − ˜k (x) = Bk ({x}). x + 1 . Write bxc for the integer part of

Source URL: www.maths.lancs.ac.uk

• Polynomials
• Bernoulli polynomials
• Number theory
• Integration by parts
• Mathematical series
• Mathematical analysis
• Mathematics
• Calculus

Counting divisors G.J.O. Jameson, Math. Gazette[removed]The divisor function τ (n) The “divisors” of n are the positive integers (including 1 and n itself) that divide into n. We will denote by τ (n) the number o

Source URL: www.maths.lancs.ac.uk

• Arithmetic function
• Expected value
• Prime number theorem
• Carmichael function
• Number theory
• Mathematics
• Divisor function

MDIV. Multiple divisor functions The functions τk For k ≥ 1, define τk (n) to be the number of (ordered) factorisations of n into k factors, in other words, the number of ordered k-tuples (j1 , j2 , . . . , jk ) with

Source URL: www.maths.lancs.ac.uk

• Calculus
• Continuous function
• Exponentiation
• Polynomials
• Algebra
• Differential entropy
• Factorization of polynomials over a finite field and irreducibility tests
• Mathematics
• Mathematical analysis
• Exponentials

c Garrett 2004 quiz[removed]Find the greatest common divisor and least common multiple of 589, 3211, 247 by the naive method factoring them into primes and comparing prime factors.

Source URL: www.math.umn.edu

Proc. London Math. Soc[removed]199–247 e 2007 London Mathematical Society C

Source URL: www.math.boun.edu.tr

• Arithmetic functions
• Analytic number theory
• Prime numbers
• Von Mangoldt function
• Prime number theorem
• Prime-counting function
• Riemann hypothesis
• Divisor function
• Euclidean algorithm
• Mathematics
• Number theory
• Mathematical analysis

The 69th William Lowell Putnam Mathematical Competition Saturday, December 6, 2008 A1 Let f : R2 → R be a function such that f (x, y) + f (y, z) + f (z, x) = 0 for all real numbers x, y, and z. Prove that there exists

Source URL: www.math.harvard.edu

• Arithmetic
• Elementary arithmetic
• Least common multiple
• Greatest common divisor
• Euclidean algorithm
• Greatest common divisor of two polynomials
• Mathematics
• Polynomials
• Multiplicative functions

HIGHER CORRELATIONS OF DIVISOR SUMS RELATED TO PRIMES I: TRIPLE CORRELATIONS D. A. Goldston1 Department of Mathematics and Computer Science, San Jose State University, San Jose, CA 95192

Source URL: www.math.boun.edu.tr

• Integer sequences
• Factorial
• Mathematics
• Number theory
• Combinatorics