Number-Theoretic Function
|
|
- Vivian Barker
- 5 years ago
- Views:
Transcription
1 Chapter 1 Number-Theoretic Function 1.1 The function τ and σ Definition Given a positive integer n, let τ(n) denote the number of positive divisor of n and σ(n) denote the sum of these divisor. Definition Any function whose domain of definition is the set of positive integers is called number theoretic function. Note σ(n), τ(n) are non theoretic function. n Theorem If n = p k i i = p k 1 1 p k p kr r is the prime factorization of n > 1, then a) τ(n) = (k 1 + 1)(k 2 + 1) (k r + 1). b) σ(n) = ( pk pk2+1 p 1 )( p 2 1 ) ( pkr+1 r 1 ). p r 1 Proof. Any divisor d of n is of the form d = p α 1 1 p α p αr r where 0 α i k i, there are k choices for the exponent α 1, k choices for the exponent α 2,..., k r +1 choices for the exponent α r, hence there are (k 1 +1)(k 2 +1) (k r +1) possible divisor of n. τ(n) = (k 1 + 1)(k 2 + 1) (k r + 1) = To evaluate σ(n) consider the product r (k i + 1). (1 + p 1 + p p k 1 1 )(1 + p 2 + p p k 2 2 ) (1 + p r + p 2 r p kr r )...(1) each positive divisor of n is one of the terms in the expansion of this product (1), so that 1
2 σ(n) = ( pk 1 +1 = 1 1 pk2+1 p 1 )( p 2 1 ( pk i+1 i 1 r p i 1 ). ) ( pkr+1 r 1 ) p r 1 Example n = = 376 τ(n) = (3 + 1)(1 + 1) = 8. σ(n) = ( 24 1 ) (472 1) = = (47 1) Definition A number theoretic functions f is called multiplicative number theoretic functions if f(mn) = f(m) f(n), where gcd(m, n) = 1. Theorem The functions τ and σ are both multiplicative functions. Proof. If gcd(m, n) = 1, then the result true if m = n = 1. Assume m > 1, n > 1, if m = p k 1 1 p kr r, n = q j 1 1 q js s, p i q i for 1 i r, 1 i s, then mn = p k 1 1 p kr r q j 1 1 qs js τ(mn) = (k 1 + 1)(k 2 + 1) (k r + 1)(j 1 + 1)(j 2 + 1) (j s + 1) also σ(mn) = = τ(m) τ(n). r i 1 s p i 1 ) ( pk i+1 = σ(m) σ(n). j=1 j 1 p j 1 ) ( pk j+1 Definition f(d) means the value f(d) runs over all the positive divisors of the positive integer n. Example d 20 f(d) = f(1) + f(2) + f(4) + f(5) + f(10) + f(20). special cases: τ(n) = σ(n) = 1 = number of divisor. d sum of divisor. Example τ(10) = d 10 σ(10) = d 10 d = = 18 1 = = 4 2
3 Lemma If gcd(m, n) = 1, then the set of positive divisor of mn consists of all products d 1 d 2, where d 1 n, d 2 n and gcd(d 1, d 2 ) = 1, further more, these products are all distinct. Theorem If f is a multiplicative function and F is defined by F (n) = f(d); then F is also multiplicative. Proof. Let g.c.d(m, n) = 1, then F (mn) = f(d) = f(d 1 d 2 ) d 1 n,d 2 n Since every divisor of mn can be uniquely written as a product of a divisor d 1 of m and a divisor d 2 of n, where g.c.d(d 1, d 2 ) = 1. By the definition of a multiplicative functions we get f(d 1 d 2 ) = f(d 1 )f(d 2 ) F (mn) = Example Let m = 8, n = 3 d 1 n,d 2 n f(d 1 )f(d 2 ) = f(d 1 ) f(d 2 ) d 1 n d 2 n = F (m) F (n) F (8 3) = f(d) d 24 = f(1) + f(2) + f(3) + f(4) + f(6) + f(8) + f(12) + f(24) = f(1 1)+f(2 1)+f(1 3)+f(4 1)+f(2 3)+f(8 1)+f(4 3)+f(8 3) = f(1) f(1) + f(2) f(1) + f(1) f(3) + f(4) f(1) + f(2) f(3)+ f(8) f(1) + f(4) f(3) + f(8) f(3) = [f(1) + f(2) + f(4) + f(8)][f(1) + f(3)] = f(d) f(d) d 8 d 3 = F (8) F (3). 3
4 Definition We say that n is not a square free if p 2 n, p is prime. And n is a square free if n = p 1 p 2 p r 1.2 The Möbius inversion formula Definition For a positive integer n, define µby the rules 1, if n = 1 µ = 0, if p 2 n for some p ( 1) r, if n = p 1 p 2 p r, where the p i are distinct primes Example µ(30) = µ(2 3 5) = ( 1) 3 = 1, µ(1) = 1, µ(2) = 1, µ(4) = 0, µ(6) = µ(2 3) = ( 1) 2 = 1. Note If p is a prime number, it is clear that µ(p) = 1; also, µ(p k ) = 0 for k 2. Theorem The function µ is a multiplicative function. Proof. We want to show that µ(mn) = µ(m) µ(n), where g.c.d(m, n) = 1. If either p 2 m or p a prime, then p 2 mn. Hence, µ(mn) = µ(m) µ(n), and the formula holds. Let m = p 1 p 2 p r, n = q 1 q 2 q s, where p i q j for 1 i r, 1 j s, then µ(mn) = µ(p 1 p 2 p r ) µ(q 1 q 2 q s ) = ( 1) r+s = ( 1) r ( 1) s = µ(m) µ(n). Note If n = 1, then µ(d) = 1, µ(d) = 1 suppose n > 1 and put F (n) = µ(d) let n = p k, the positive divisor of p k are k + 1 integers (1, p, p 2,..., p k ), so that F (n) = F (p k ) = d p k µ(d) = µ(1) + µ(p) + µ(p 2 ) µ(p k ) = µ(1) + µ(p) = 1 + ( 1) = 0 If n = p k 1 1 p k 2 2 p kr r if p i p j for 1 i r, 1 j r, g.c.d(p i, p j ) = 1. F (n) = µ(d) is multiplicative (since µ(d) is multiplicative) F (n) = F (p k 1 1 )F (p k 2 2 ) F (p kr r ) = 0 Theorem { For each positive integer n 1 1, if n = 1 µ(d) = 0, if n > 1 where d runs through the positive divisors of n. 4
5 Example n = 10, The divisor of n are 1, 2, 5, 10 µ(d) = µ(1) + µ(2) + µ(5) + µ(10) d/10 = µ(1) + µ(2) + µ(5) + µ(10) = 1 + ( 1) + ( 1) + 1 = 0 Theorem (Möbius inversion formula) let F and f be tow number-theoretic functions related by the formula F (n) = f(d) then f(n) = µ(d)f () = µ(n d)f (d) Proof. let d = n d, as d ranges over all positive divisors of n, so dose d. (1) claim: µ(d)f () = and c d = n d iff c n and d n c. (µ(d) c ( n d ) f(c)) = k Z n = d k, k = n d n = d n d If c n c n ( because c n and d n) d d n also, s Z n d = cs n d = ds d n d Because of this, the last expression in (1) becomes (2) ( µ(d)f(c)) c d ( µ(d)f(c)) = (f(c)µ(d)) c d c n d ( n c ) = (f(c) µ(d)). c n d ( n c ) By theorem 6.6 µ(d) = 0 except when n = 1 d d ( n c ) That is when n = c, in this case it is equal to 1. so the right hand side of equation(2) simplifies to c n (f(c) d ( n c ) µ(d)) = f(c) 1 = f(n) c=n 5
6 Example Let n = 10, to illustrate how the double sum in (2) is turned. In this instance we find that d 10 c ( 10 d ) (µ(d)f(c)) = µ(1)[f(1) + f(2) + f(5) + f(10)] + µ(2)[f(1) + f(5)]+ µ(5)[f(1) + f(2)] + µ(10)[f(1)] = f(1)[µ(1) + µ(2) + µ(5) + µ(10)+]+ f(2)[µ(1) + µ(5)+] + f(5)[µ(1) + µ(2)+] + f(10)[µ(1)+] = (f(c)µ(d)) c 10 d ( 10 c ) To see how Möbius inversion works in a particular case, we remind the reader that the functions τ and σ may both be described as sum functions τ(n) = 1 and σ(n) = d By theorem = ( µ( n d )τ(d)) and n = ( µ( n d )σ(d)) valid for all n 1. Theorem If F is a multiplicative function and F (n) = f(d), then f is also multiplicative Proof. Let m and n be relatively prime positive integers. we recalled that any divisor d of mn can be uniquely written as d = d 1 d 2, where d 1 m, d 2 n and gcd(d 1, d 2 ) = 1. Thus, using the inversion formula. f(mn) = µ(d)f ( mn d ) = µ(d 1 d 2 )F ( mn ) d 1 d 2 d mn d 1 m,d 2 n = µ(d 1 )µ(d 2 )F ( m )F ( n ) d 1 d 2 d 1 m,d 2 n = µ(d 1 )F ( m ) µ(d 2 )F ( n ) d 1 d 2 d 1 m d 2 n = f(m)f(n) 6
Number Theory and Graph Theory. Arithmetic functions and roots of unity
1 Number Theory and Graph Theory Chapter 3 Arithmetic functions and roots of unity By A. Satyanarayana Reddy Department of Mathematics Shiv Nadar University Uttar Pradesh, India E-mail: satya8118@gmail.com
More informationAny real-valued function on the integers f:n R (or complex-valued function f:n C) is called an arithmetic function.
Arithmetic Functions Any real-valued function on the integers f:n R (or complex-valued function f:n C) is called an arithmetic function. Examples: τ(n) = number of divisors of n; ϕ(n) = number of invertible
More informationFIRST MIDTERM MATH 104B, UCSD, WINTER 18
FIRST MIDTERM MATH 104B, UCSD, WINTER 18 You have 80 minutes. There are 4 problems, and the total number of points is 70. Show all your work. Please make your work as clear and easy to follow as possible.
More informationMath 324, Fall 2011 Assignment 6 Solutions
Math 324, Fall 2011 Assignment 6 Solutions Exercise 1. (a) Find all positive integers n such that φ(n) = 12. (b) Show that there is no positive integer n such that φ(n) = 14. (c) Let be a positive integer.
More informationElementary Number Theory Review. Franz Luef
Elementary Number Theory Review Principle of Induction Principle of Induction Suppose we have a sequence of mathematical statements P(1), P(2),... such that (a) P(1) is true. (b) If P(k) is true, then
More informationSmol Results on the Möbius Function
Karen Ge August 3, 207 Introduction We will address how Möbius function relates to other arithmetic functions, multiplicative number theory, the primitive complex roots of unity, and the Riemann zeta function.
More informationSummary Slides for MATH 342 June 25, 2018
Summary Slides for MATH 342 June 25, 2018 Summary slides based on Elementary Number Theory and its applications by Kenneth Rosen and The Theory of Numbers by Ivan Niven, Herbert Zuckerman, and Hugh Montgomery.
More informationMosaics: A Prime-al Art
Mosaics: A Prime-al Art Kristen Bildhauser Saint Mary s College Notre Dame, IN 46556 kbildh01@saintmarys.edu Cara Tacoma Trinity Christian College Palos Heights, IL 60463 cara.tacoma@trnty.edu July 31,
More informationI(n) = ( ) f g(n) = d n
9 Arithmetic functions Definition 91 A function f : N C is called an arithmetic function Some examles of arithmetic functions include: 1 the identity function In { 1 if n 1, 0 if n > 1; 2 the constant
More informationThe Euler Phi Function
The Euler Phi Function 7-3-2006 An arithmetic function takes ositive integers as inuts and roduces real or comlex numbers as oututs. If f is an arithmetic function, the divisor sum Dfn) is the sum of the
More informationSome multiplicative arithmetical functions
Some multiplicative arithmetical functions an invitation to number theory K. N. Raghavan http://www.imsc.res.in/ knr/ IMSc, Chennai August 203 Standard form of prime factorization of a number; GCD and
More informationIntroductory Number Theory
Introductory Number Theory Lecture Notes Sudita Mallik May, 208 Contents Introduction. Notation and Terminology.............................2 Prime Numbers.................................. 2 2 Divisibility,
More informationName: There are 8 questions on 13 pages, including this cover.
Name: There are 8 questions on 13 pages, including this cover. There are several blank pages at the end of your exam which you may as scrap paper or as additional space to continue an answer, if needed.
More informationf(n) = f(p e 1 1 )...f(p e k k ).
3. Arithmetic functions 3.. Arithmetic functions. These are functions f : N N or Z or maybe C, usually having some arithmetic significance. An important subclass of such functions are the multiplicative
More informationMöbius Inversion Formula and Applications to Cyclotomic Polynomials
Degree Project Möbius Inversion Formula and Applications to Cyclotomic Polynomials 2012-06-01 Author: Zeynep Islek Subject: Mathematics Level: Bachelor Course code: 2MA11E Abstract This report investigates
More informationThe Chinese Remainder Theorem
Chapter 5 The Chinese Remainder Theorem 5.1 Coprime moduli Theorem 5.1. Suppose m, n N, and gcd(m, n) = 1. Given any remainders r mod m and s mod n we can find N such that N r mod m and N s mod n. Moreover,
More informationarxiv: v1 [math.nt] 26 Apr 2016
Ramanuan-Fourier series of certain arithmetic functions of two variables Noboru Ushiroya arxiv:604.07542v [math.nt] 26 Apr 206 Abstract. We study Ramanuan-Fourier series of certain arithmetic functions
More informationϕ : Z F : ϕ(t) = t 1 =
1. Finite Fields The first examples of finite fields are quotient fields of the ring of integers Z: let t > 1 and define Z /t = Z/(tZ) to be the ring of congruence classes of integers modulo t: in practical
More informationElementary Properties of Cyclotomic Polynomials
Elementary Properties of Cyclotomic Polynomials Yimin Ge Abstract Elementary properties of cyclotomic polynomials is a topic that has become very popular in Olympiad mathematics. The purpose of this article
More informationObjective Type Questions
DISTANCE EDUCATION, UNIVERSITY OF CALICUT NUMBER THEORY AND LINEARALGEBRA Objective Type Questions Shyama M.P. Assistant Professor Department of Mathematics Malabar Christian College, Calicut 7/3/2014
More informationProperties of Arithmetical Functions
Properties of Arithmetical Functions Zack Clark Math 336, Spring 206 Introduction Arithmetical functions, as dened by Delany [2], are the functions f(n) that take positive integers n to complex numbers.
More informationChapter 1. Number of special form. 1.1 Introduction(Marin Mersenne) 1.2 The perfect number. See the book.
Chapter 1 Number of special form 1.1 Introduction(Marin Mersenne) See the book. 1.2 The perfect number Definition 1.2.1. A positive integer n is said to be perfect if n is equal to the sum of all its positive
More informationMath 314 Course Notes: Brief description
Brief description These are notes for Math 34, an introductory course in elementary number theory Students are advised to go through all sections in detail and attempt all problems These notes will be
More informationSieve weight smoothings and moments
Sieve weight smoothings and moments Andrew Granville, with Dimitris Koukoulopoulos & James Maynard Université de Montréal & UCL Workshop in Number Theory and Function Fields Exeter, Friday, January 21,
More informationLECTURE 4: CHINESE REMAINDER THEOREM AND MULTIPLICATIVE FUNCTIONS
LECTURE 4: CHINESE REMAINDER THEOREM AND MULTIPLICATIVE FUNCTIONS 1. The Chinese Remainder Theorem We now seek to analyse the solubility of congruences by reinterpreting their solutions modulo a composite
More informationTrifectas in geometric progression
189 Trifectas in geometric progression Gerry Myerson Abstract The trifecta in the 2007 Melbourne Cup was the numbers 6 12 24, a geometric progression. How many trifectas in geometric progression are there
More informationMathematics 4: Number Theory Problem Sheet 3. Workshop 26 Oct 2012
Mathematics 4: Number Theory Problem Sheet 3 Workshop 26 Oct 2012 The aim of this workshop is to show that Carmichael numbers are squarefree and have at least 3 distinct prime factors (1) (Warm-up question)
More informationSelberg s proof of the prime number theorem
Fall 20 Independent Study Selberg s proof of the prime number theorem Sana Jaber List of study units 000 0002 The notion of finite limit of a function at infinity. A first discussion of prime numbers.
More informationMATH 145 Algebra, Solutions to Assignment 4
MATH 145 Algebra, Solutions to Assignment 4 1: a Let a 975 and b161 Find d gcda, b and find s, t Z such that as + bt d Solution: The Euclidean Algorithm gives 161 975 1 + 86, 975 86 3 + 117, 86 117 + 5,
More informationSolutions to Problem Set 3 - Fall 2008 Due Tuesday, Sep. 30 at 1:00
Solutions to 18.781 Problem Set 3 - Fall 2008 Due Tuesday, Sep. 30 at 1:00 1. (Niven 2.3.3) Solve the congruences x 1 (mod 4), x 0 (mod 3), x 5 (mod 7). First we note that 4, 3, and 7 are pairwise relatively
More informationNumbers and their divisors
Chapter 1 Numbers and their divisors 1.1 Some number theoretic functions Theorem 1.1 (Fundamental Theorem of Arithmetic). Every positive integer > 1 is uniquely the product of distinct prime powers: n
More informationCMPUT 403: Number Theory
CMPUT 403: Number Theory Zachary Friggstad February 26, 2016 Outline Factoring Sieve Multiplicative Functions Greatest Common Divisors Applications Chinese Remainder Theorem Factoring Theorem (Fundamental
More informationZsigmondy s Theorem. Lola Thompson. August 11, Dartmouth College. Lola Thompson (Dartmouth College) Zsigmondy s Theorem August 11, / 1
Zsigmondy s Theorem Lola Thompson Dartmouth College August 11, 2009 Lola Thompson (Dartmouth College) Zsigmondy s Theorem August 11, 2009 1 / 1 Introduction Definition o(a modp) := the multiplicative order
More informationTHE RELATION AMONG EULER S PHI FUNCTION, TAU FUNCTION, AND SIGMA FUNCTION
International Journal of Pure and Applied Mathematics Volume 118 No. 3 018, 675-684 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu doi: 10.173/ijpam.v118i3.15
More informationNOTES ON SIMPLE NUMBER THEORY
NOTES ON SIMPLE NUMBER THEORY DAMIEN PITMAN 1. Definitions & Theorems Definition: We say d divides m iff d is positive integer and m is an integer and there is an integer q such that m = dq. In this case,
More information2 More on Congruences
2 More on Congruences 2.1 Fermat s Theorem and Euler s Theorem definition 2.1 Let m be a positive integer. A set S = {x 0,x 1,,x m 1 x i Z} is called a complete residue system if x i x j (mod m) whenever
More informationAverage value of the Euler function on binary palindromes
Average value of the Euler function on binary palindromes William D. Banks Department of Mathematics, University of Missouri Columbia, MO 652 USA bbanks@math.missouri.edu Igor E. Shparlinski Department
More informationa = mq + r where 0 r m 1.
8. Euler ϕ-function We have already seen that Z m, the set of equivalence classes of the integers modulo m, is naturally a ring. Now we will start to derive some interesting consequences in number theory.
More informationSums of distinct divisors
Oberlin College February 3, 2017 1 / 50 The anatomy of integers 2 / 50 What does it mean to study the anatomy of integers? Some natural problems/goals: Study the prime factors of integers, their size and
More information4 Powers of an Element; Cyclic Groups
4 Powers of an Element; Cyclic Groups Notation When considering an abstract group (G, ), we will often simplify notation as follows x y will be expressed as xy (x y) z will be expressed as xyz x (y z)
More informationM381 Number Theory 2004 Page 1
M81 Number Theory 2004 Page 1 [[ Comments are written like this. Please send me (dave@wildd.freeserve.co.uk) details of any errors you find or suggestions for improvements. ]] Question 1 20 = 2 * 10 +
More informationChapter 1. From Euclid to Gauss. 1.1 Prime numbers. If a, b Z we say that a divides b (or is a divisor of b) and we write a b, if.
Chapter 1 From Euclid to Gauss 1.1 Prime numbers If a, b Z we say that a divides b (or is a divisor of b) and we write a b, if for some c Z. Thus 2 0 but 0 2. b = ac Definition 1.1. The number p N is said
More informationPart II. Number Theory. Year
Part II Year 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2017 Paper 3, Section I 1G 70 Explain what is meant by an Euler pseudoprime and a strong pseudoprime. Show that 65 is an Euler
More informationAll variables a, b, n, etc are integers unless otherwise stated. Each part of a problem is worth 5 points.
Math 152, Problem Set 2 solutions (2018-01-24) All variables a, b, n, etc are integers unless otherwise stated. Each part of a problem is worth 5 points. 1. Let us look at the following equation: x 5 1
More informationTheory of Numbers Problems
Theory of Numbers Problems Antonios-Alexandros Robotis Robotis October 2018 1 First Set 1. Find values of x and y so that 71x 50y = 1. 2. Prove that if n is odd, then n 2 1 is divisible by 8. 3. Define
More informationPerfect Numbers in ACL2
Perfect Numbers in ACL2 John Cowles Ruben Gamboa University of Wyoming perfect number n: n is a positive integer n equals the sum of all positive integer proper divisors of n. k is proper divisor of n
More information1. Introduction. Let P and Q be non-zero relatively prime integers, α and β (α > β) be the zeros of x 2 P x + Q, and, for n 0, let
C O L L O Q U I U M M A T H E M A T I C U M VOL. 78 1998 NO. 1 SQUARES IN LUCAS SEQUENCES HAVING AN EVEN FIRST PARAMETER BY PAULO R I B E N B O I M (KINGSTON, ONTARIO) AND WAYNE L. M c D A N I E L (ST.
More informationSome Arithmetic Functions Involving Exponential Divisors
2 3 47 6 23 Journal of Integer Sequences, Vol. 3 200, Article 0.3.7 Some Arithmetic Functions Involving Exponential Divisors Xiaodong Cao Department of Mathematics and Physics Beijing Institute of Petro-Chemical
More informationA Concise Course in Number Theory Alan Baker, Cambridge University Press, 1983
A Concise Course in Number Theory Alan Baker, Cambridge University Press, 1983 Chapter 1: Divisibility Prime number: a positive integer that cannot be factored into strictly smaller factors. For example,,
More information18.785: Analytic Number Theory, MIT, spring 2006 (K.S. Kedlaya) Dirichlet series and arithmetic functions
18.785: Analytic Number Theory, MIT, spring 2006 (K.S. Kedlaya) Dirichlet series and arithmetic functions 1 Dirichlet series The Riemann zeta function ζ is a special example of a type of series we will
More informationNumber Theory Solutions Packet
Number Theory Solutions Pacet 1 There exist two distinct positive integers, both of which are divisors of 10 10, with sum equal to 157 What are they? Solution Suppose 157 = x + y for x and y divisors of
More informationHecke-Operators. Alex Maier. 20th January 2007
Hecke-Operators Alex Maier 20th January 2007 Abstract At the beginning we introduce the Hecke-operators and analyse some of their properties. Then we have a look at normalized eigenfunctions of them and
More informationMULTIPLICATIVE FUNCTIONS: A REWRITE OF ANDREWS CHAPTER 6
MULTIPLICATIVE FUNCTIONS: A REWRITE OF ANDREWS CHAPTER 6 In these notes we offer a rewrte of Andrews Chapter 6. Our am s to replace some of the messer arguments n Andrews. To acheve ths, we need to change
More informationOn a problem of Nicol and Zhang
Journal of Number Theory 28 2008 044 059 www.elsevier.com/locate/jnt On a problem of Nicol and Zhang Florian Luca a, József Sándor b, a Instituto de Matemáticas, Universidad Nacional Autonoma de México,
More informationPrimitive Lambda-Roots. Peter J. Cameron and D. A. Preece
Primitive Lambda-Roots Peter J. Cameron and D. A. Preece Version of January 2014 Preface The most important examples of finite commutative rings with identity are undoubtedly the rings Z/(n) of integers
More informationAn arithmetical equation with respect to regular convolutions
The final publication is available at Springer via http://dx.doi.org/10.1007/s00010-017-0473-z An arithmetical equation with respect to regular convolutions Pentti Haukkanen School of Information Sciences,
More informationCyclotomic Polynomials in Olympiad Number Theory
Cyclotomic Polynomials in Olympiad Number Theory Lawrence Sun lala-sun@hotmail.com February 17, 2013 Abstract This is a paper discussing the powerful applications cyclotomic polynomials have in olympiad
More informationNAP Module 4. Homework 2 Friday, July 14, 2017.
NAP 2017. Module 4. Homework 2 Friday, July 14, 2017. These excercises are due July 21, 2017, at 10 pm. Nepal time. Please, send them to nap@rnta.eu, to laurageatti@gmail.com and schoo.rene@gmail.com.
More informationSOLUTIONS TO PROBLEM SET 1. Section = 2 3, 1. n n + 1. k(k + 1) k=1 k(k + 1) + 1 (n + 1)(n + 2) n + 2,
SOLUTIONS TO PROBLEM SET 1 Section 1.3 Exercise 4. We see that 1 1 2 = 1 2, 1 1 2 + 1 2 3 = 2 3, 1 1 2 + 1 2 3 + 1 3 4 = 3 4, and is reasonable to conjecture n k=1 We will prove this formula by induction.
More informationArithmetic properties of the Ramanujan function
Proc. Indian Acad. Sci. (Math. Sci.) Vol. 116, No. 1, February 2006, pp. 1 8. Printed in India Arithmetic properties of the Ramanujan function FLORIAN LUCA 1 and IGOR E SHPARLINSKI 2 1 Instituto de Matemáticas,
More informationExtremal Orders of Certain Functions Associated with Regular Integers (mod n)
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 16 2013), Article 13.7.5 Extremal Orders of Certain Functions Associated with Regular Integers mod n) Brăduţ Apostol Spiru Haret Pedagogical High School
More informationCyclic Group Supplement. g = g k : k Z.
Theorem 1. Let g be an element of a group G and write { } g = g k : k Z. Then g is a subgroup of G. Proof. Since 1 = g 0, 1 g. Suppose a, b g. Then a = g k, b = g m and ab = g k g m = g k+m. Hence ab g
More informationcse547, math547 DISCRETE MATHEMATICS Professor Anita Wasilewska
cse547, math547 DISCRETE MATHEMATICS Professor Anita Wasilewska LECTURE 12 CHAPTER 4 NUMBER THEORY PART1: Divisibility PART 2: Primes PART 1: DIVISIBILITY Basic Definitions Definition Given m,n Z, we say
More informationMATH 506: INTRODUCTION TO NUMBER THEORY, SPRING Introduction. Kronecker: God created the natural numbers. Everything else is man s handiwork.
MATH 506: INTRODUCTION TO NUMBER THEORY, SPRING 2013 TODD COCHRANE N = Natural Numbers: 1, 2, 3, 4, 5, 6,.... 1. Introduction Kronecker: God created the natural numbers. Everything else is man s handiwork.
More informationSome properties and applications of a new arithmetic function in analytic number theory
NNTDM 17 (2011), 3, 38-48 Some properties applications of a new arithmetic function in analytic number theory Ramesh Kumar Muthumalai Department of Mathematics, D.G. Vaishnav College Chennai-600 106, Tamil
More informationLecture 4: Number theory
Lecture 4: Number theory Rajat Mittal IIT Kanpur In the next few classes we will talk about the basics of number theory. Number theory studies the properties of natural numbers and is considered one of
More informationMATH 361: NUMBER THEORY THIRD LECTURE
MATH 36: NUMBER THEORY THIRD LECTURE. Introduction The toic of this lecture is arithmetic functions and Dirichlet series. By way of introduction, consider Euclid s roof that there exist infinitely many
More informationAdvanced Number Theory Note #6: Reformulation of the prime number theorem using the Möbius function 7 August 2012 at 00:43
Advanced Number Theory Note #6: Reformulation of the prime number theorem using the Möbius function 7 August 2012 at 00:43 Public One of the more intricate and tricky proofs concerning reformulations of
More informationNumber Theory. Zachary Friggstad. Programming Club Meeting
Number Theory Zachary Friggstad Programming Club Meeting Outline Factoring Sieve Multiplicative Functions Greatest Common Divisors Applications Chinese Remainder Theorem Throughout, problems to try are
More informationTry the assignment f(1) = 2; f(2) = 1; f(3) = 4; f(4) = 3;.
I. Precisely complete the following definitions: 1. A natural number n is composite whenever... See class notes for the precise definitions 2. Fix n in N. The number s(n) represents... 3. For A and B sets,
More informationGod made the integers, all else is the work of man. Leopold Kronecker
i God made the integers, all else is the work of man. Leopold Kronecker NUMBER THEORY Structures, Examples, and Problems Titu Andreescu Dorin Andrica Contents Foreword 7 Acknowledgments 9 Notation 11 I
More informationCS Asymptotic Notations for Algorithm Analysis Outline
CS483-02 Asymptotic Notations for Algorithm Analysis Instructor: Fei Li Room 443 ST II Office hours: Tue. & Thur. 4:30pm - 5:30pm or by appointments lifei@cs.gmu.edu with subject: CS483 http://www.cs.gmu.edu/
More informationProblem-Solving and Selected Topics in Number Theory
Problem-Solving and Selected Topics in Number Theory Michael Th. Rassias Problem-Solving and Selected Topics in Number Theory In the Spirit of the Mathematical Olympiads ( Foreword by Preda Mihailescu
More informationMath 324, Fall 2011 Assignment 7 Solutions. 1 (ab) γ = a γ b γ mod n.
Math 324, Fall 2011 Assignment 7 Solutions Exercise 1. (a) Suppose a and b are both relatively prime to the positive integer n. If gcd(ord n a, ord n b) = 1, show ord n (ab) = ord n a ord n b. (b) Let
More informationThe Number of Irreducible Polynomials of Even Degree over F 2 with the First Four Coefficients Given
The Number of Irreducible Polynomials of Even Degree over F 2 with the First Four Coefficients Given B. Omidi Koma School of Mathematics and Statistics Carleton University bomidi@math.carleton.ca July
More informationAxioms for Set Theory
Axioms for Set Theory The following is a subset of the Zermelo-Fraenkel axioms for set theory. In this setting, all objects are sets which are denoted by letters, e.g. x, y, X, Y. Equality is logical identity:
More informationMath 118: Advanced Number Theory. Samit Dasgupta and Gary Kirby
Math 8: Advanced Number Theory Samit Dasgupta and Gary Kirby April, 05 Contents Basics of Number Theory. The Fundamental Theorem of Arithmetic......................... The Euclidean Algorithm and Unique
More informationExact formulae for the prime counting function
Notes on Number Theory and Discrete Mathematics Vol. 19, 013, No. 4, 77 85 Exact formulae for the prime counting function Mladen Vassilev Missana 5 V. Hugo Str, 114 Sofia, Bulgaria e-mail: missana@abv.bg
More informationThe Fundamental Theorem of Arithmetic
Chapter 1 The Fundamental Theorem of Arithmetic 1.1 Primes Definition 1.1. We say that p N is prime if it has just two factors in N, 1 and p itself. Number theory might be described as the study of the
More informationPRIME NUMBERS YANKI LEKILI
PRIME NUMBERS YANKI LEKILI We denote by N the set of natural numbers:,2,..., These are constructed using Peano axioms. We will not get into the hilosohical questions related to this and simly assume the
More informationNumber Theory Naoki Sato
Number Theory Naoki Sato 0 Preface This set of notes on number theory was originally written in 1995 for students at the IMO level. It covers the basic background material that an IMO
More informationMATH 409 Advanced Calculus I Lecture 12: Uniform continuity. Exponential functions.
MATH 409 Advanced Calculus I Lecture 12: Uniform continuity. Exponential functions. Uniform continuity Definition. A function f : E R defined on a set E R is called uniformly continuous on E if for every
More informationThe group (Z/nZ) February 17, In these notes we figure out the structure of the unit group (Z/nZ) where n > 1 is an integer.
The group (Z/nZ) February 17, 2016 1 Introduction In these notes we figure out the structure of the unit group (Z/nZ) where n > 1 is an integer. If we factor n = p e 1 1 pe, where the p i s are distinct
More informationMATH 501 Discrete Mathematics. Lecture 6: Number theory. German University Cairo, Department of Media Engineering and Technology.
MATH 501 Discrete Mathematics Lecture 6: Number theory Prof. Dr. Slim Abdennadher, slim.abdennadher@guc.edu.eg German University Cairo, Department of Media Engineering and Technology 1 Number theory Number
More informationFriend of 38 JAGST Vol. 14(1) 2012 NECESSARY CONDITIONS FOR EXISTENCE OF A FRIEND OF 38
NECESSARY CONDITIONS FOR EXISTENCE OF A FRIEND OF 38 R. K. Gachimu 1, C. W. Mwathi 2 and I. N. Kamuti 3 1, 2 Department of Pure and Applied Mathematics, Jomo Kenyatta University of Agriculture and Technology,
More informationCS2800 Questions selected for fall 2017
Discrete Structures Final exam sample questions Solutions CS2800 Questions selected for fall 2017 1. Determine the prime factorizations, greatest common divisor, and least common multiple of the following
More informationA Simple Proof that ζ(n 2) is Irrational
A Simple Proof that ζ(n 2) is Irrational Timothy W. Jones February 3, 208 Abstract We prove that partial sums of ζ(n) = z n are not given by any single decimal in a number base given by a denominator of
More informationSection 11 Direct products and finitely generated abelian groups
Section 11 Direct products and finitely generated abelian groups Instructor: Yifan Yang Fall 2006 Outline Direct products Finitely generated abelian groups Cartesian product Definition The Cartesian product
More informationCOMBINATORIAL APPLICATIONS OF MÖBIUS INVERSION
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 00, Number 0, Pages 000 000 S 0002-9939(XX)0000-0 COMBINATORIAL APPLICATIONS OF MÖBIUS INVERSION MARIE JAMESON AND ROBERT P. SCHNEIDER (Communicated
More informationOn the subgroups of the group Z m Z n
On the subgroups of the group Z m Z n Mario Hampejs, Nicki Holighaus, László Tóth and Christoph Wiesmeyr Abstract We discuss properties of the subgroups of the group Z m Z n, where m and n are arbitrary
More informationANALYTIC NUMBER THEORY AND DIRICHLET S THEOREM
ANALYTIC NUMBER THEORY AND DIRICHLET S THEOREM JOHN BINDER Abstract. In this aer, we rove Dirichlet s theorem that, given any air h, k with h, k) =, there are infinitely many rime numbers congruent to
More informationPolynomial Ideals. Euclidean algorithm Multiplicity of roots Ideals in F[x].
Polynomial Ideals Euclidean algorithm Multiplicity of roots Ideals in F[x]. Euclidean algorithms Lemma. f,d nonzero polynomials in F[x]. deg d deg f. Then there exists a polynomial g in F[x] s.t. either
More informationSome infinite series involving arithmetic functions
Notes on Number Theory and Discrete Mathematics ISSN 131 5132 Vol. 21, 215, No. 2, 8 14 Some infinite series involving arithmetic functions Ramesh Kumar Muthumalai Department of Mathematics, Saveetha Engineering
More informationDimensions of the spaces of cusp forms and newforms on Γ 0 (N) and Γ 1 (N)
Journal of Number Theory 11 005) 98 331 www.elsevier.com/locate/jnt Dimensions of the spaces of cusp forms and newforms on Γ 0 N) and Γ 1 N) Greg Martin Department of Mathematics, University of British
More informationFALL 07 CSE 213: HW4
FALL 07 CSE 213: HW4 1) R 1 is not a partial ordered relation, since it is not antisymmetric. Having (1,3) and (3,1) in the relation; does not imply that 1=3 because 1 3. R 2 is a partial order because
More informationSolutions for November. f(x + f(y)) = f(x) + y
Solutions for November 647. Find all continuous functions f : R R such that for every x, y R. f(x + f(y)) = f(x) + y Solution 1. Setting (x, y) = (t, 0) yields f(t + f(0)) = f(t) for all real t. Setting
More informationSum of cubes is square of sum
Notes on Number Theory and Discrete Mathematics Vol. 19, 2013, No. 1, 1 13 Sum of cubes is square of sum Edward Barbeau and Samer Seraj University of Toronto e-mails: barbeau@math.toronto.edu, samer.seraj@mail.utoronto.ca
More informationSOME RESULTS AND PROBLEMS IN PROBABILISTIC NUMBER THEORY
Annales Univ. Sci. Budapest., Sect. Comp. 43 204 253 265 SOME RESULTS AND PROBLEMS IN PROBABILISTIC NUMBER THEORY Imre Kátai and Bui Minh Phong Budapest, Hungary Le Manh Thanh Hue, Vietnam Communicated
More informationArithmetic Functions Evaluated at Factorials!
Arithmetic Functions Evaluated at Factorials! Dan Baczkowski (joint work with M. Filaseta, F. Luca, and O. Trifonov) (F. Luca) Fix r Q, there are a finite number of positive integers n and m for which
More informationAnalytic Number Theory
University of Cambridge Mathematics Tripos Part III Analytic Number Theory Lent, 209 Lectures by T. F. Bloom Notes by Qiangru Kuang Contents Contents 0 Introduction 2 Elementary techniques 3. Arithmetic
More information