PROBLEM SET 5 SOLUTIONS. Solution. We prove that the given congruence equation has no solutions. Suppose for contradiction that. (x 2) 2 1 (mod 7).

Similar documents
PERIODS OF FIBONACCI SEQUENCES MODULO m. 1. Preliminaries Definition 1. A generalized Fibonacci sequence is an infinite complex sequence (g n ) n Z

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

YALE UNIVERSITY DEPARTMENT OF COMPUTER SCIENCE

MATH 118 HW 7 KELLY DOUGAN, ANDREW KOMAR, MARIA SIMBIRSKY, BRANDEN LASKE

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

(II.G) PRIME POWER MODULI AND POWER RESIDUES

Solutions to Problem Set 7

Math 4400/6400 Homework #8 solutions. 1. Let P be an odd integer (not necessarily prime). Show that modulo 2,

x 2 a mod m. has a solution. Theorem 13.2 (Euler s Criterion). Let p be an odd prime. The congruence x 2 1 mod p,

Primality Test. Rong-Jaye Chen

Math 609/597: Cryptography 1

The Structure of Z p when p is Prime

SOLVED EXAMPLES

Notes on the prime number theorem

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

MATH 304: MIDTERM EXAM SOLUTIONS

Zeros of Polynomials

ON SUPERSINGULAR ELLIPTIC CURVES AND HYPERGEOMETRIC FUNCTIONS

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

Primes - Problem Sheet 5 - Solutions

Introduction to Arithmetic Geometry Fall 2013 Lecture #10 10/8/2013

Chapter 2. Finite Fields (Chapter 3 in the text)

Solutions to Problem Set 8

Math 4400/6400 Homework #7 solutions

PRIME RECIPROCALS AND PRIMES IN ARITHMETIC PROGRESSION

ECE534, Spring 2018: Final Exam

In number theory we will generally be working with integers, though occasionally fractions and irrationals will come into play.

CSE 1400 Applied Discrete Mathematics Number Theory and Proofs

MATH342 Practice Exam

M17 MAT25-21 HOMEWORK 5 SOLUTIONS

A Note on Bilharz s Example Regarding Nonexistence of Natural Density

Math 261 Exam 2. November 7, The use of notes and books is NOT allowed.

ANSWERS SOLUTIONS iiii i. and 1. Thus, we have. i i i. i, A.

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

Practice Final Solutions

3.2 Properties of Division 3.3 Zeros of Polynomials 3.4 Complex and Rational Zeros of Polynomials

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

An Account of Congruences Mod p k Using Halley s Method

The 4-Nicol Numbers Having Five Different Prime Divisors

Logarithm of the Kernel Function. 1 Introduction and Preliminary Results

3.2.4 Integer and Number Theoretical Functions

Equations and Inequalities Involving v p (n!)

University of Manitoba, Mathletics 2009

USA Mathematical Talent Search Round 3 Solutions Year 27 Academic Year

Putnam Training Exercise Counting, Probability, Pigeonhole Principle (Answers)

3 Gauss map and continued fractions

MATH 3240Q Introduction to Number Theory Homework 7

11. FINITE FIELDS. Example 1: The following tables define addition and multiplication for a field of order 4.

PUTNAM TRAINING PROBABILITY

SOME TRIBONACCI IDENTITIES

1+x 1 + α+x. x = 2(α x2 ) 1+x

Solutions for Math 411 Assignment #2 1

THE INTEGRAL TEST AND ESTIMATES OF SUMS

Properties and Tests of Zeros of Polynomial Functions

Seunghee Ye Ma 8: Week 5 Oct 28

M3P14 EXAMPLE SHEET 1 SOLUTIONS

Fermat s Little Theorem. mod 13 = 0, = }{{} mod 13 = 0. = a a a }{{} mod 13 = a 12 mod 13 = 1, mod 13 = a 13 mod 13 = a.

Final Solutions. 1. (25pts) Define the following terms. Be as precise as you can.

k-equitable mean labeling

Different kinds of Mathematical Induction

Perfect Numbers 6 = Another example of a perfect number is 28; and we have 28 =

Solutions to Math 347 Practice Problems for the final

Solutions to Problem Sheet 1

[ 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.

Solutions for May. 3 x + 7 = 4 x x +

Question 1: The magnetic case

Integer Points on Elliptic Curve

Square-Congruence Modulo n

BINOMIAL PREDICTORS. + 2 j 1. Then n + 1 = The row of the binomial coefficients { ( n

MATH10212 Linear Algebra B Proof Problems

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

Jacobi symbols and application to primality

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

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

Matrix Algebra 2.2 THE INVERSE OF A MATRIX Pearson Education, Inc.

6. Uniform distribution mod 1

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

Quadratic Residues, Quadratic Reciprocity. 2 4 So we may as well start with x 2 a mod p. p 1 1 mod p a 2 ±1 mod p

arxiv: v1 [math.nt] 10 Dec 2014

Lecture 1. January 8, 2018

Trial division, Pollard s p 1, Pollard s ρ, and Fermat s method. Christopher Koch 1. April 8, 2014

3.1. Introduction Assumptions.

IMAR Problema 1. Fie P un punct situat în interiorul unui triunghi ABC. Dreapta AP intersectează

CSI 2101 Discrete Structures Winter Homework Assignment #4 (100 points, weight 5%) Due: Thursday, April 5, at 1:00pm (in lecture)

Find a formula for the exponential function whose graph is given , 1 2,16 1, 6

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

THE KENNESAW STATE UNIVERSITY HIGH SCHOOL MATHEMATICS COMPETITION PART II Calculators are NOT permitted Time allowed: 2 hours

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

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

6.3 Testing Series With Positive Terms

6 Integers Modulo n. integer k can be written as k = qn + r, with q,r, 0 r b. So any integer.

3. Z Transform. Recall that the Fourier transform (FT) of a DT signal xn [ ] is ( ) [ ] = In order for the FT to exist in the finite magnitude sense,

Summary: Congruences. j=1. 1 Here we use the Mathematica syntax for the function. In Maple worksheets, the function

PROBLEM SET I (Suggested Solutions)

Cardinality Homework Solutions

On the Diophantine equation x 2 2 ˆ y n

QUADRATIC RECIPROCITY

Diophantine Equation. Has Infinitely Many Prime Solutions

QUADRATIC RECIPROCITY

SYMMETRIC POSITIVE SEMI-DEFINITE SOLUTIONS OF AX = B AND XC = D

Transcription:

PROBLEM SET 5 SOLUTIONS 1 Fid every iteger solutio to x 17x 5 0 mod 45 Solutio We rove that the give cogruece equatio has o solutios Suose for cotradictio that the equatio x 17x 5 0 mod 45 has a solutio Sice 45 is divisible by 7, there must exists a solutio to the cogruece equatio x 17x 5 0 mod 7 We may simlify this equatio to x 4x 5 0 mod 7, which ca be also writte as This imlies that 1 However, we have 7 desired cotradictio, comletig the roof x 1 mod 7 1 sice 7 3 mod 4 Hece we obtai a 7 Let be a odd rime, ad a, N, with a Cosider the equatio x a mod a Show that if, 1 1, a solutio always exists Solutio Let g be a rimitive root modulo Note that x 0 mod is ot a solutio sice a 0 mod Hece we may write x g k mod ad a g l mod for some itegers k ad l The we have x g k g k mod, so we ca rewrite the give equatio as g k g l mod Sice the order of g is 1, this is equivalet to k l mod 1

We ca solve this cogruece equatio for k, amely k 1 l mod 1 where 1 is the iverse of modulo 1 Note that 1 exists because, 1 1 Hece we fid a solutio x g k mod to the give equatio x a mod b Assume that 1 mod Prove there exists a solutio if ad oly if a 1 mod Solutio Suose first that we have a solutio to the equatio x a mod The we have x 0 mod as already oted i art a Hece we immediately see that a x x 1 mod where the last cogruece follows from Fermat s little theorem For the coverse, suose ow that a 1 mod As i art a, take a rimitive root g modulo ad write a g l mod for some iteger l The we have l g g l a 1 mod Sice the order of g modulo is 1, we deduce that l 1 is divisible by 1, or equivaletly that l is divisible by If we write l t for some iteger t, we have g t g t g l a mod Hece the equatio x a mod has a solutio, amely x g t mod 3 Let a, m > 1 be odd itegers with a, m 1 Suose that the rime factorizatio of a is a α1 1 α αr r q β1 1 qβ qβs s where each i 1 mod 4 ad each q j 3 mod 4 Put b solutio for all rimes m s β j Assume x mod a has a j1 a Prove that if 1 mod 4 for all rimes m, the x a mod m has a solutio Solutio We begi with the followig stadard lemma: Lemma The cogruece equatio x a mod m has a solutio if ad oly if rimes m 1 for all

Proof Let us first rove the oly if art If the equatio x a mod m has a solutio, for all rimes m the equatio x a mod also has a solutio, meaig that 0 or 1 However, a 0 mod for all rimes m sice a ad m are relatively rime Hece we deduce that 1 for all rimes m For the if art, we assume that 1 for all rimes m Our goal is to show that the equatio x a mod m has a solutio For each m, let e be the exoet of i the rime factorizatio of m By the Chiese Remaider Theorem, it suffices to show that the equatio x a mod e has a solutio for all rimes m Take fx x a Note that the equatio fx 0 mod has a solutio sice 1 We have f x x 0 mod if ad oly if x 0 mod However, x 0 mod is ot a solutio to fx 0 mod sice a 0 mod as see i the first aragrah Hece Hesel s lemma tells us that the equatio fx 0 mod e has a solutio We ow retur to the roblem Fix a rime dividig m By Lemma, it suffices to show that 1 By multilicity of Legedre symbols, we have a α1 1 α αr r 1 α1 α q β1 1 qβ qβs s r αr q1 β1 β q βs qs Let us ow comute each Legedre symbol i the above equatio Sice the equatio x mod a has a solutio, the equatios x mod i ad x mod q j have a solutio for all i ad j We also have, i, q j 1 for all i ad j sice a ad m are relatively rime Hece we fid that 1 for all i 1,,, r ad j 1,,, s i q j Now we aly ad the quadratic recirocity law to obtai i i i q j 1 i 1 for all i 1,,, r, 1 q j 1 for all j 1,,, s 1

For each i 1,,, r the umber i 1 is eve sice i 1 mod 4 O the other had, for each j 1,,, s the umber q j 1 is odd sice q j 3 mod 4 Hece we obtai i 1 for all i 1,,, r, 1 for all j 1,,, s Note that 1 is a eve umber sice 1 mod 4 Hece we have i 1 for all i 1,,, r ad j 1,,, s By 1 we deduce that 1, thereby comletig the roof 3 b Prove that if 3 mod 4 for some rime m, the x a mod m has a solutio if ad oly if b is eve Solutio By Lemma, the equatio x a mod m has a solutio if ad oly if 1 for all a rimes m O the other had, we roved i art a that 1 whe 1 mod 4 Hece we deduce that the equatio x a mod m has a solutio if ad oly if 1 for all rimes m with 3 mod 4 Let us ow fix a rime m such that 3 mod 4 Note that 1 ad 3 remai valid However, 1 is ow a odd umber sice 3 mod 4 Hece 3 yields i 1 for all i 1,,, r, 1 for all j 1,,, s We substitute these umbers to 1 ad fid that 1 α1 1 α 1 αr 1 β1 1 β 1 βs 1 β1β βs 1 b Hece we coclude that 1 if ad oly if b is eve We thus comlete the roof by the discussio i the first aragrah

4 Let a be a o-zero iteger For a rime, let deote the umber of mod iteger solutios x, y of the equatio y x 3 ax mod a Show that for a odd rime, r 3 r1 Solutio For a fixed umber r {1,,, }, the air r, y is a solutio if ad oly if y r 3 mod r 3 Note that the umber of y mod satisfyig this equatio is 1 Hece we have r1 [ 1 b Prove that if 3 mod 4, r 3 ] r 3 r 3 Solutio Note that the value of deeds oly o r mod Hece we may write r 3 r1 r 3 r1 r1 1 r 3 r1 r r 3 [ r 3 r1 r1 r 3 r 3 a r r 3 ] r1 r 1 r 3 3 a 3 a 3 a 3 a Note that the last term vaishes sice 3 a 0 mod Hece it suffices to rove the followig: r 3 r 3 I fact, this follows from the fact that r 3 1 0 for each r 1,,, 1 1 if 3 mod 4; more recisely, we have r 3 r 3 for each r 1,,, 1