Jacobi symbols. p 1. Note: The Jacobi symbol does not necessarily distinguish between quadratic residues and nonresidues. That is, we could have ( a

Similar documents
42 Dependence and Bases

Lecture 10: Bounded Linear Operators and Orthogonality in Hilbert Spaces

COMP 2804 Solutions Assignment 1

Bernoulli Polynomials Talks given at LSBU, October and November 2015 Tony Forbes

Math 4707 Spring 2018 (Darij Grinberg): midterm 2 page 1. Math 4707 Spring 2018 (Darij Grinberg): midterm 2 with solutions [preliminary version]

On the transcendence of infinite sums of values of rational functions

Bertrand s postulate Chapter 2

distinct distinct n k n k n! n n k k n 1 if k n, identical identical p j (k) p 0 if k > n n (k)

INMO-2018 problems and solutions

Different kinds of Mathematical Induction

Math 609/597: Cryptography 1

SOME FINITE SIMPLE GROUPS OF LIE TYPE C n ( q) ARE UNIQUELY DETERMINED BY THEIR ELEMENT ORDERS AND THEIR ORDER

The Structure of Z p when p is Prime

Primes of the form n 2 + 1

6.4 Binomial Coefficients

ECE 901 Lecture 4: Estimation of Lipschitz smooth functions

Lecture Outline. 2 Separating Hyperplanes. 3 Banach Mazur Distance An Algorithmist s Toolkit October 22, 2009

It is often useful to approximate complicated functions using simpler ones. We consider the task of approximating a function by a polynomial.

A PROBABILITY PROBLEM

Summer MA Lesson 13 Section 1.6, Section 1.7 (part 1)

FACTORS OF SUMS OF POWERS OF BINOMIAL COEFFICIENTS. Dedicated to the memory of Paul Erdős. 1. Introduction. n k. f n,a =

Zeros of Polynomials

THE GREATEST ORDER OF THE DIVISOR FUNCTION WITH INCREASING DIMENSION

Chapter 2. Asymptotic Notation

Al Lehnen Madison Area Technical College 10/5/2014

Math 4400/6400 Homework #7 solutions

M17 MAT25-21 HOMEWORK 5 SOLUTIONS

TEACHER CERTIFICATION STUDY GUIDE

Problem. Consider the sequence a j for j N defined by the recurrence a j+1 = 2a j + j for j > 0

Ma/CS 6a Class 22: Power Series

Probability Theory. Exercise Sheet 4. ETH Zurich HS 2017

Seunghee Ye Ma 8: Week 5 Oct 28

DIRICHLET CHARACTERS AND PRIMES IN ARITHMETIC PROGRESSIONS

MATH 324 Summer 2006 Elementary Number Theory Solutions to Assignment 2 Due: Thursday July 27, 2006

MATH 304: MIDTERM EXAM SOLUTIONS

Chapter 0. Review of set theory. 0.1 Sets

ECE Spring Prof. David R. Jackson ECE Dept. Notes 20

Some remarks on the paper Some elementary inequalities of G. Bennett

Queueing Theory II. Summary. M/M/1 Output process Networks of Queue Method of Stages. General Distributions

Week 5-6: The Binomial Coefficients

Name Period ALGEBRA II Chapter 1B and 2A Notes Solving Inequalities and Absolute Value / Numbers and Functions

19.1 The dictionary problem

Double Derangement Permutations

18.S34 (FALL, 2007) GREATEST INTEGER PROBLEMS. n + n + 1 = 4n + 2.

Math 140A Elementary Analysis Homework Questions 1

[ 47 ] then T ( m ) is true for all n a. 2. The greatest integer function : [ ] is defined by selling [ x]

Complete Solutions to Supplementary Exercises on Infinite Series

THE ARTIN CARMICHAEL PRIMITIVE ROOT PROBLEM ON AVERAGE

SEQUENCE AND SERIES NCERT

CSE 1400 Applied Discrete Mathematics Number Theory and Proofs

Polynomial Functions and Their Graphs

1. By using truth tables prove that, for all statements P and Q, the statement

MATH 205 HOMEWORK #2 OFFICIAL SOLUTION. (f + g)(x) = f(x) + g(x) = f( x) g( x) = (f + g)( x)

b i u x i U a i j u x i u x j

(A sequence also can be thought of as the list of function values attained for a function f :ℵ X, where f (n) = x n for n 1.) x 1 x N +k x N +4 x 3

Bertrand s Postulate

Math 4107: Abstract Algebra I Fall Webwork Assignment1-Groups (5 parts/problems) Solutions are on Webwork.

REVIEW OF CALCULUS Herman J. Bierens Pennsylvania State University (January 28, 2004) x 2., or x 1. x j. ' ' n i'1 x i well.,y 2

BOUNDS ON SOME VAN DER WAERDEN NUMBERS. Tom Brown Department of Mathematics, Simon Fraser University, Burnaby, BC V5A 1S6

MATH10040 Chapter 4: Sets, Functions and Counting

ON THE LEHMER CONSTANT OF FINITE CYCLIC GROUPS

Chapter 2. Periodic points of toral. automorphisms. 2.1 General introduction

(s)h(s) = K( s + 8 ) = 5 and one finite zero is located at z 1

On The Prime Numbers In Intervals

Convergence of random variables. (telegram style notes) P.J.C. Spreij

Homework 1 Solutions. The exercises are from Foundations of Mathematical Analysis by Richard Johnsonbaugh and W.E. Pfaffenberger.

Math 7409 Homework 2 Fall from which we can calculate the cycle index of the action of S 5 on pairs of vertices as

1.2 AXIOMATIC APPROACH TO PROBABILITY AND PROPERTIES OF PROBABILITY MEASURE 1.2 AXIOMATIC APPROACH TO PROBABILITY AND

Iterative Techniques for Solving Ax b -(3.8). Assume that the system has a unique solution. Let x be the solution. Then x A 1 b.

Fourier Analysis, Stein and Shakarchi Chapter 8 Dirichlet s Theorem

Teacher s Marking. Guide/Answers

5.6 Absolute Convergence and The Ratio and Root Tests

Sequences, Mathematical Induction, and Recursion. CSE 2353 Discrete Computational Structures Spring 2018

sin(n) + 2 cos(2n) n 3/2 3 sin(n) 2cos(2n) n 3/2 a n =

Complex Numbers Solutions

subcaptionfont+=small,labelformat=parens,labelsep=space,skip=6pt,list=0,hypcap=0 subcaption ALGEBRAIC COMBINATORICS LECTURE 8 TUESDAY, 2/16/2016

Infinite Sequences and Series

Matrix Algebra 2.3 CHARACTERIZATIONS OF INVERTIBLE MATRICES Pearson Education, Inc.

GENERALIZED LEGENDRE POLYNOMIALS AND RELATED SUPERCONGRUENCES

International Baccalaureate LECTURE NOTES MATHEMATICS HL FURTHER MATHEMATICS HL Christos Nikolaidis TOPIC NUMBER THEORY

Orthogonal Functions

Chapter IV Integration Theory

Homework 3. = k 1. Let S be a set of n elements, and let a, b, c be distinct elements of S. The number of k-subsets of S is

JORGE LUIS AROCHA AND BERNARDO LLANO. Average atchig polyoial Cosider a siple graph G =(V E): Let M E a atchig of the graph G: If M is a atchig, the a

(b) What is the probability that a particle reaches the upper boundary n before the lower boundary m?

DIVISIBILITY PROPERTIES OF GENERALIZED FIBONACCI POLYNOMIALS

PROBLEM SET 5 SOLUTIONS 126 = , 37 = , 15 = , 7 = 7 1.

NICK DUFRESNE. 1 1 p(x). To determine some formulas for the generating function of the Schröder numbers, r(x) = a(x) =

1. ARITHMETIC OPERATIONS IN OBSERVER'S MATHEMATICS

Inverse Matrix. A meaning that matrix B is an inverse of matrix A.

[ 11 ] z of degree 2 as both degree 2 each. The degree of a polynomial in n variables is the maximum of the degrees of its terms.

Generating Functions and Their Applications

arxiv: v1 [math.co] 3 Feb 2013

Brief Review of Functions of Several Variables

Cardinality Homework Solutions

GROUPOID CARDINALITY AND EGYPTIAN FRACTIONS

SOLVED EXAMPLES

d) If the sequence of partial sums converges to a limit L, we say that the series converges and its

Bertrand s Postulate. Theorem (Bertrand s Postulate): For every positive integer n, there is a prime p satisfying n < p 2n.

Transcription:

Jacobi sybols efiitio Let be a odd positive iteger If 1, the Jacobi sybol : Z C is the costat fuctio 1 1 If > 1, it has a decopositio ( as ) a product of (ot ecessarily distict) pries p 1 p r The Jacobi sybol : Z C is give by a a a Note: The Jacobi sybol does ot ecessarily distiguish betwee quadratic residues ad oresidues That is, we could have ( a ) 1 just because two of the factors happe to be 1 For istace, ( 1)( 1) 1, 15 3 5 but is ot a square odulo 15 The followig properties of the Jacobi sybol are direct cosequeces of its defiitio Propositio 1 Let, be positive odd itegers ad a, b Z The 1 (i) 1; a (ii) 0 (a, ) > 1; a b (iii) a b (od ) ; ab a b (iv) ; (v) ( a ) ( a ) a ; 1 p 1 p r

(vi) (a, ) 1 a b b Proof Exercise Theore Let, be positive odd itegers The 1 (i) ( 1) 1 ; (ii) ( 1) 1 ; (iii) ( 1) 1 1 Proof The first two forulas are trivially true whe 1 ad so is the third if 1 or 1 or if (, ) > 1 We assue that, > 1 ad (, ) 1 Thus p 1 p r ad q 1 q s for soe pries p i ad q j ad p i q j for all 1 i r, 1 j s The p i (1 + (p i 1)) 1 + (p i 1) + (p i1 1)(p i 1)+ 1 i 1 <i r products of 3, 4 ad so o factors Sice is odd, so are the pries p i Therefore p i 1 0 (od ) ad (p i1 1)(p i 1) 0 (od 4) Therefore all the ters i the above su that are iplicit are also divisible by 4 Hece 1 + (p i 1) (od 4), which is to say 1 (p i 1) (od 4) Sice ad the p i s are odd, it follows that 1 0 (od ) ad p 1 1 0 (od ), 1 i r Thus we ca divide each ter above by ad still get itegers It follows that so Siilarly, 1 ( 1) 1 ( 1) r p i 1 p i 1 ( 1) p i 1 (od ), (1) 1 p i 1

p i ( 1 + (p i 1) ) 1 + (p i 1) + (p i 1 1)(p i 1)+ 1 i 1 <i r products of 3, 4 ad so o factors We use agai the fact that both ad the p i are odd That eas that 1 ( 1)( + 1) is the product of two cosecutive eve itegers, so oe of the is divisible by 4 Thus 1 0 (od ) ad likewise p i 1 0 (od ), 1 i r It follows that the product of two or ore factors i the above suatio is divisible by 64, hece 1 (p i 1) (od 64) Moreover each ter is divisible by, so 1 p i 1 (od ), as itegers It follows that ( 1) 1 ( 1) r p i 1 ( 1) p i 1 p i The last part of the theore, i the case, > 1 ad (, ) 1, is equivalet to ( 1) 1 1 But where t By (1), we have t 1 p i 1 1 ( pi qj q j p i qj 1 ) ( 1) p i 1 q j 1 ( 1) t p i 1 q j 1 (od ) ad the quadratic reciprocity law follows Jacobi sybols have ay applicatios The followig result is a exaple of how they ca be used i the study of certai iophatie equatios 3

Propositio 3 The iophatie equatio y x 3 + k has o solutio if k (4 1) 3 4 ad o prie p 3 (od 4) divides Proof We argue by cotradictio Assue that (x, y) is a solutio Sice k 1 (od 4), it follows that y x 3 1 (od 4) But y 0, 1 (od 4), so x caot be eve ad x 1 (od 4) Therefore x 1 (od 4) Let a 4 1 The a 1 (od 4) ad k a 3 4 We have so y x 3 + k x 3 + a 3 4, y + 4 x 3 + a 3 (x + a)(x ax + a ) () Give that x 1 (od 4) ad a 1 (od 4), we have that the last factor x ax + a 3 (od 4) Thus x ax+a is odd ad it ust have soe prie divisor p 3 (od 4) But () iplies that p y + 4, ie 4 y (od p) so 4 1 p O the other had, sice p 3 (od 4), we have that p ad therefore 4 1 1 (cotradictio!) p p Propositio 4 If, are positive odd itegers ad is a iteger with 0, 1 (od 4) such that (od ), the Proof First we treat the case whe 1 (od 4) If > 0, the ( 1) 1 1 But 1 is eve, hece The arguet holds for ay positive odd iteger, ad it ca therefore be applied just as well to The result follows iediately sice (od ) 4

If < 0, set d The d > 0 ad d 3 (od 4), so d+1 is eve We have d 1 d ( 1) 1 ( 1) 1 d 1 ( 1) 1 d+1 d d Sice the sae holds for, the result follows fro the fact that (od d) Now cosider the other case, 0 (od 4) It follows that a b for soe positive odd iteger b ad a d If > 0, the a b ( 1) 1 a ( 1) 1 b 1 b Siilarly, ( 1) 1 The result would follow if we showed that ad 1 1 b 1 a ( 1) 1 b 1 b a 1 a (od ) (3) 1 b 1 (od ) (4) We have 1 b 1 1 b 1 b 1 ad this is eve sice 4 Thus (4) is proved For the other relatio, we have 1 a 1 a a ( )( + ) a Now + ad a Thus 0 (od 16) whe a 3 ad (3) follows i this case O the other had, if a, the a is agai eve ad we are doe (We used the fact that Z) If < 0, set d The d > 0 ad d 0 (od 4) Fro above it follows that d d We also have d ( 1 )( d ) ( 1) 1 d 5

ad, siilarly, The result follows fro the fact that 1 1 (od ) ( 1) 1 d 4 { (od ) 0 (od 4) Theore 5 Let 0, 1 (od 4) be a ozero iteger The there exists a uique group hooorphis χ : (Z/Z) {±1} such that χ ([p]) (the Legedre sybol odulo p) for all odd pries p p Furtherore, χ ([ 1]) { 1 if > 0; 1 if < 0 Proof First we show existece Let χ : (Z/Z) {±1}, χ([a]) where a (od ) is a odd positive iteger We eed to show that this is a well-defied ap, ad for that we eed to prove the followig two facts Clai 1 For ay (a, ) 1 there exists a positive odd iteger a (od ) Clai If, are positive odd itegers ad (od ), the The secod clai is a iediate cosequece of Propositio 4 The first oe, is also easy There exists soe iteger k for which a + k > 0 If is eve, the a has to be odd ad a + k is odd ad positive If is odd, the either a + k or a + k + is both odd ad positive The ap χ is clearly a group hooorphis sice the Jacobi sybol is copletely ultiplicative The coditio o pries is just as clear Now we have to prove uiqueess Assue that f : (Z/Z) {±1} is a group hooorphis with f([p]) for ay odd prie p Clearly f() 1 Also, for p ay odd iteger > 1, we have p 1 p r for soe odd pries p 1,, p r The f([]) f([p 1 ]) f([p r ]) χ([]) p 1 6 p r

Sice we have show that every class [a] (Z/Z) cotais a positive odd iteger, it follows that f([a]) χ([a]) for all [a] (Z/Z) The proof for the expressio of χ ([ 1]) is left as a exercise 7