Dedekind Sums with Equal Values
|
|
- Harvey Knight
- 5 years ago
- Views:
Transcription
1 Dedekind Sums with Equal Values Yiwang Chen, Nicholas Dunn, Campbell Hewett and Shashwat Silas Brown University August 6, 2014 Yiwang Chen, Nicholas Dunn, Campbell Hewett anddedekind Shashwat Sums Silas with (ICERM) Equal Values August 6, / 29
2 Overview The Dedekind sum s(a, b) for (a, b) = 1 is defined by, b 1 s(a, b) = i=1 (( i b )) (( )) ai b where (()) denotes the sawtooth function, { x x 1 ((x)) = 2 if x Z 0 if x Z We would like to be able to characterize a 1, a 2 such that s(a 1, b) = s(a 2, b) Yiwang Chen, Nicholas Dunn, Campbell Hewett anddedekind Shashwat Sums Silas with (ICERM) Equal Values August 6, / 29
3 Overview 1 Conjectures for when b is a prime power in s(a, b) 2 Generating Functions I 3 Generating Functions II 4 On the Number of Inversions Yiwang Chen, Nicholas Dunn, Campbell Hewett anddedekind Shashwat Sums Silas with (ICERM) Equal Values August 6, / 29
4 Preliminary Results and Facts 1 s(a, b) = s(a + kb, b) for k Z. b 1 (( )) (( i (a + kb)i s(a + kb, b) = b b i=1 2 s(a 1, b) = s(a 2, b) if a 1 a 2 1 (modb). )) b 1 = i=1 b 1 = i=1 (( )) (( i ai b b + kbi )) b (( i b )) (( )) ai = s(a, b) b 3 b 1 s(a 1, b) = i=1 (( i b )) (( )) a1 i = b b 1 i=1 (( a2 i b s(a, b) + s(b, a) = ( a 12 b + 1 ab + b ) a Remark: This allows us to compute Dedekind Sums fast. )) (( )) a2 a 1 i = s(a 2, b) b Yiwang Chen, Nicholas Dunn, Campbell Hewett anddedekind Shashwat Sums Silas with (ICERM) Equal Values August 6, / 29
5 Visualization Strategies Here s a simple graph of what s(a, 37) looks like, Yiwang Chen, Nicholas Dunn, Campbell Hewett anddedekind Shashwat Sums Silas with (ICERM) Equal Values August 6, / 29
6 Visualization Strategies Here s a graph of many values of b (divided by b on both axes), This gives a few insights especially relating to the highest/n th highest values of the function. But doesn t tell us much about the equality. Yiwang Chen, Nicholas Dunn, Campbell Hewett anddedekind Shashwat Sums Silas with (ICERM) Equal Values August 6, / 29
7 Visualization Strategies (b is prime) But then we came up with another visualization which was somewhat more fruitful for a while, Each of the axes range up to b. Yiwang Chen, Nicholas Dunn, Campbell Hewett anddedekind Shashwat Sums Silas with (ICERM) Equal Values August 6, / 29
8 A Theorem by Jabuka, Robins and Wang Let b be a positive integer and a 1, a 2 any two integers that are relatively prime to b. If s(a 1, b) = s(a 2, b), then b (a 1 a 2 1)(a 1 a 2 ). This is gives us the corollary that when b is prime, s(a 1, b) = s(a 2.b) a 1 a 2 (mod b) or if a 1 a 2 1 (mod b). So all equal Dedekind Sums can be explained by the previous two one line proofs when b is prime. Let s take a look at our old picture again. Yiwang Chen, Nicholas Dunn, Campbell Hewett anddedekind Shashwat Sums Silas with (ICERM) Equal Values August 6, / 29
9 Prime Case Explained The red dots correspond to pairs which are inverses mod b and the blue ones obviously correspond to ones that are the same mod b. Yiwang Chen, Nicholas Dunn, Campbell Hewett anddedekind Shashwat Sums Silas with (ICERM) Equal Values August 6, / 29
10 What About the b = p 2? We looked at the same kinds of graphs again, Pairs for b The green dots correspond to pairs which are inverses mod b and the blue ones correspond to ones that are the same mod b. And the red dots are the ones which are aren t in either of those cases. Yiwang Chen, Nicholas Dunn, Campbell Hewett anddedekind Shashwat Sums Silas with (ICERM) Equal Values August 6, / 29
11 Red Dots They look suspiciously well organized, so we were able to guess what lines they lie on. 350 Pairs for b The lines in each graph are kp ± 1 for 0 < k < p and k Z. Yiwang Chen, Nicholas Dunn, Campbell Hewett anddedekind Shashwat Sums Silas with (ICERM) Equal Values August 6, / 29
12 Coming Up With Formulae This led us to the conjecture: s(a 1, p 2 ) = s(a 2, p 2 ) if and only if one of the following is true: (i) a 1 = a 2 (mod p 2 ), (ii) a 1 = a2 1 (mod p 2 ), (iii) a 1 = a 2 = ±1 (mod p). That is, the non trivial pairs can be given by, s(kp 1, p 2 ) = (p 1)(p + 1) 6p 2 = p 2, and s(kp + 1, p 2 (p 1)(p + 1) ) = 6p 2 = p 2. Yiwang Chen, Nicholas Dunn, Campbell Hewett anddedekind Shashwat Sums Silas with (ICERM) Equal Values August 6, / 29
13 Coming Up With Formulae From p n (a1 a2 )(a1 a2 1), we know a1 = a2 (mod p k ) and a1 = a2 1 (mod p n k ) for some k. Pairs for b=72 Pairs for b=73 Pairs for b= Yiwang Chen, Nicholas Dunn, Campbell Hewett and Dedekind Shashwat Sums Silaswith (ICERM) Equal Values August 6, / 29
14 For b = p n, some nontrivial pairs are given by and s(kp n m 1, p n ) = p2n 2m 3p n p n = 1 4 pn 2m p n, s(kp n m + 1, p n ) = p2n 2m 3p n p n for 1 m n/2 and (k, p) = 1. = pn 2m p n Yiwang Chen, Nicholas Dunn, Campbell Hewett anddedekind Shashwat Sums Silas with (ICERM) Equal Values August 6, / 29
15 For the b = pq case, there were no clear patterns Pairs for p Yiwang Chen, Nicholas Dunn, Campbell Hewett anddedekind Shashwat Sums Silas with (ICERM) Equal Values August 6, / 29
16 Some roots of the polynomial on the complex plane for various b: Some are on the unit circle, and some are roots of unity. Yiwang Chen, Nicholas Dunn, Campbell Hewett anddedekind Shashwat Sums Silas with (ICERM) Equal Values August 6, / 29
17 A plot of sizes of roots (blue dots) for several values of b: 2.0 Sizes of roots vs. b They are bounded by 8 log ϕ(b) e b log ϕ(b) < x < e b 2 1 Yiwang Chen, Nicholas Dunn, Campbell Hewett anddedekind Shashwat Sums Silas with (ICERM) Equal Values August 6, / 29
18 Some factorizations of the polynomial: b f b (x) x 4 (1 + x)(1 x + x 2 ) 5 (1 + x) 2 (1 x + x 2 ) 2 6 (1 + x 2 )(1 x 2 + x 4 x 6 + x 8 ) 7 (1 + x)(1 x + x 2 )(1 x 3 + 3x 6 x 9 + x 12 ) 8 (1 + x)(1 x + x 2 )(1 + x 4 )(1 x 3 + x 6 )(1 x 4 + x 8 ) x x 18 + x (1 + x 2 ) 2 (1 x 2 + x 4 ) 2 (1 x 6 + x 12 ) 2 11 (1 + x)(1 x + x 2 )(1 x 3 + x 6 x 9 + x 12 + x 15 + x 18 x 21 + x 24 + x 27 + x 30 x 33 + x 36 x 39 + x 42 ) 12 (1 + x)(1 x + x 2 )(1 + x 4 )(1 x 3 + x 6 )(1 x 9 + x 18 )(1 x 4 + x 8 x 12 + x 16 x 20 + x 24 ) 13 (1 + x) 2 (1 x + x 2 ) 2 (1 2x 3 + 3x 6 4x 9 + 5x 12 6x x 18 6x x 24 4x x 30 4x x 36 6x x 42 6x x 48 4x x 54 2x 57 + x 60 ) 14 (1 + x 2 )(1 x 2 + x 4 )(1 x 6 + x 12 x 18 + x 24 + x 30 x 36 + x 42 + x 48 x 54 + x 60 x 66 + x 72 ) Yiwang Chen, Nicholas Dunn, Campbell Hewett anddedekind Shashwat Sums Silas with (ICERM) Equal Values August 6, / 29
19 Proposition. (x + 1) f b (x) precisely when b is odd and not a square or when 4 b. Proof. If b is odd, then ( 1) inv(a,b) = ( ) a b. Hence, f b ( 1) = ( 1) inv(a,b) = { ( a ) 0 if b is not square = b ϕ(b) if b is square (a,b)=1 When b is even, it turns out ( 1) inv(a,b) = from which it follows that f b ( 1) = (a,b)=1 {( 1) a 1 2 if b = 0 (mod 4) 1 if b = 2 (mod 4) { 0 if b = 0 (mod 4) ϕ(b) if b = 2 (mod 4) Yiwang Chen, Nicholas Dunn, Campbell Hewett anddedekind Shashwat Sums Silas with (ICERM) Equal Values August 6, / 29
20 Other facts: 1 If b is odd, not a square, and not divisible by 3, then (x 3 + 1) f b (x). 2 If b is not a square and is 1 (mod 4), then (x + 1) 2 f b (x). If b is also not divisible by 3, then (x 3 + 1) 2 f b (x). 3 If b = ck is odd, c is not a square, and (c, k) = 1, then f b (ζ 2k ) = 0. If b is also not divisible by 3, then f b (ζ 6k ) = 0. Yiwang Chen, Nicholas Dunn, Campbell Hewett anddedekind Shashwat Sums Silas with (ICERM) Equal Values August 6, / 29
21 Conjecture. For b = ck, ζ 2k and ζ 6k are roots of f b (x) precisely under the following conditions: (i) If c = 2 (mod 4), then ζ 2k and ζ 6k are roots of f b (x) precisely when k = 4 (mod 8). (ii) If c = 0 (mod 4), then ζ 2k and ζ 6k are roots of f b (x) precisely when k 2 (mod 4) and 8 k. (iii) If c = 3 m n, m 1, and (n, 6) = 1, then only ζ 2k is a root of f b (x) precisely when 3n k and c is not a square. (iv) If (c, 6) = 1, then ζ 2k and ζ 6k are roots of f b (x) precisely when c k and c is not a square. Yiwang Chen, Nicholas Dunn, Campbell Hewett anddedekind Shashwat Sums Silas with (ICERM) Equal Values August 6, / 29
22 In trying to understand this conjecture, we discovered that the polynomial takes values of Kloosterman sums: If 4k b, then If 2k b but 4k b, then f b ( K m (x, y) = f b ( e πi k e πi k (a,m)=1 e 2πi m (xa+ya 1 ) ) = 1 ( 2 e πi b 2k K2b 4k, b ) 4k ) = 1 ( πi b ie 2k K4b 4 2k, b ) (1 b) 2k Yiwang Chen, Nicholas Dunn, Campbell Hewett anddedekind Shashwat Sums Silas with (ICERM) Equal Values August 6, / 29
23 The conjecture seems to cover all cases when ζ 2k or ζ 6k is a root for k b. There are rarer cases when k b which are more mysterious. b Unexplained roots b Unexplained roots 8 ζ ζ 8 18 ζ ζ 18, ζ ζ 20, ζ ζ ζ 20, ζ ζ 18, ζ ζ ζ ζ 18, ζ ζ ζ 8, ζ ζ ζ ζ ζ ζ ζ ζ ζ 18, ζ ζ ζ ζ 18, ζ ζ 14, ζ ζ ζ ζ ζ ζ ζ ζ 18 Yiwang Chen, Nicholas Dunn, Campbell Hewett anddedekind Shashwat Sums Silas with (ICERM) Equal Values August 6, / 29
24 If we have the following sequence r 1 = b, r 0 = a, r 1, r 2, r 2,..., r n, r n+1 = 1 where r j+2 is r j reduced modulo r j+1 for all 1 j n 1, then inv(a, b) = a 1 (a 1)(a 2) 4a b n ( 1) j (a 1)2 (r j 1)(r j 1 1)(r j + r j 1 1) b 4a 4 r j=1 j r j 1 4a This means that every inv value lies on a parabola in b. Yiwang Chen, Nicholas Dunn, Campbell Hewett anddedekind Shashwat Sums Silas with (ICERM) Equal Values August 6, / 29
25 inv values vs. b Yiwang Chen, Nicholas Dunn, Campbell Hewett anddedekind Shashwat Sums Silas with (ICERM) Equal Values August 6, / 29
26 Proposition. If 2 a b 2, then b inv(a, b) 3b2 12b Proof. The proof is by induction on b. There are three cases: 1 If b ±1 (mod a), then use the induction hypothesis: inv(a, b) 1 8 (b + 2)a (b2 + 3b + 2) 1 8 (2b2 + 5b + 2) 1 a. 2 If b = 1 (mod a), then by reciprocity, inv(a, b) = 1 4 (b 1)a (b2 3b + 2) 1 4 (b2 2b + 1) 1 a. 3 If b = 1 (mod a), then again by reciprocity, inv(a, b) = 1 4 (b + 1)a (b2 + 3b + 2) 1 4 (b2 + 2b + 1) 1 a. Yiwang Chen, Nicholas Dunn, Campbell Hewett anddedekind Shashwat Sums Silas with (ICERM) Equal Values August 6, / 29
27 More generally, it appears that inv(k, b) is the kth smallest value of inv(a, b) for 1 k 6. More specifically, the kth smallest value occurs with the remainder sequence b, k, k 1, 1 The longer the remainder sequence b, a,..., 1, the closer inv(a, b) is to (b 1)(b 2) 4. Yiwang Chen, Nicholas Dunn, Campbell Hewett anddedekind Shashwat Sums Silas with (ICERM) Equal Values August 6, / 29
28 Values of invha,bl vs. Length of remainder sequence for b= Yiwang Chen, Nicholas Dunn, Campbell Hewett and Dedekind Shashwat Sums Silaswith (ICERM) Equal Values August 6, / 29
29 Questions? Yiwang Chen, Nicholas Dunn, Campbell Hewett anddedekind Shashwat Sums Silas with (ICERM) Equal Values August 6, / 29
WORKSHEET MATH 215, FALL 15, WHYTE. We begin our course with the natural numbers:
WORKSHEET MATH 215, FALL 15, WHYTE We begin our course with the natural numbers: N = {1, 2, 3,...} which are a subset of the integers: Z = {..., 2, 1, 0, 1, 2, 3,... } We will assume familiarity with their
More informationInduction. Induction. Induction. Induction. Induction. Induction 2/22/2018
The principle of mathematical induction is a useful tool for proving that a certain predicate is true for all natural numbers. It cannot be used to discover theorems, but only to prove them. If we have
More informationMath 109 HW 9 Solutions
Math 109 HW 9 Solutions Problems IV 18. Solve the linear diophantine equation 6m + 10n + 15p = 1 Solution: Let y = 10n + 15p. Since (10, 15) is 5, we must have that y = 5x for some integer x, and (as we
More informationReview Sheet for the Final Exam of MATH Fall 2009
Review Sheet for the Final Exam of MATH 1600 - Fall 2009 All of Chapter 1. 1. Sets and Proofs Elements and subsets of a set. The notion of implication and the way you can use it to build a proof. Logical
More informationMath 110 HW 3 solutions
Math 0 HW 3 solutions May 8, 203. For any positive real number r, prove that x r = O(e x ) as functions of x. Suppose r
More informationSolutions to Assignment 1
Solutions to Assignment 1 Question 1. [Exercises 1.1, # 6] Use the division algorithm to prove that every odd integer is either of the form 4k + 1 or of the form 4k + 3 for some integer k. For each positive
More informationWilson s Theorem and Fermat s Little Theorem
Wilson s Theorem and Fermat s Little Theorem Wilson stheorem THEOREM 1 (Wilson s Theorem): (p 1)! 1 (mod p) if and only if p is prime. EXAMPLE: We have (2 1)!+1 = 2 (3 1)!+1 = 3 (4 1)!+1 = 7 (5 1)!+1 =
More informationFour Basic Sets. Divisors
Four Basic Sets Z = the integers Q = the rationals R = the real numbers C = the complex numbers Divisors Definition. Suppose a 0 and b = ax, where a, b, and x are integers. Then we say a divides b (or
More information= 1 2x. x 2 a ) 0 (mod p n ), (x 2 + 2a + a2. x a ) 2
8. p-adic numbers 8.1. Motivation: Solving x 2 a (mod p n ). Take an odd prime p, and ( an) integer a coprime to p. Then, as we know, x 2 a (mod p) has a solution x Z iff = 1. In this case we can suppose
More informationNumber Theory Homework.
Number Theory Homewor. 1. The Theorems of Fermat, Euler, and Wilson. 1.1. Fermat s Theorem. The following is a special case of a result we have seen earlier, but as it will come up several times in this
More informationWORKSHEET ON NUMBERS, MATH 215 FALL. We start our study of numbers with the integers: N = {1, 2, 3,...}
WORKSHEET ON NUMBERS, MATH 215 FALL 18(WHYTE) We start our study of numbers with the integers: Z = {..., 2, 1, 0, 1, 2, 3,... } and their subset of natural numbers: N = {1, 2, 3,...} For now we will not
More informationNUMBER SYSTEMS. Number theory is the study of the integers. We denote the set of integers by Z:
NUMBER SYSTEMS Number theory is the study of the integers. We denote the set of integers by Z: Z = {..., 3, 2, 1, 0, 1, 2, 3,... }. The integers have two operations defined on them, addition and multiplication,
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 informationPart V. Chapter 19. Congruence of integers
Part V. Chapter 19. Congruence of integers Congruence modulo m Let m be a positive integer. Definition. Integers a and b are congruent modulo m if and only if a b is divisible by m. For example, 1. 277
More informationEECS 1028 M: Discrete Mathematics for Engineers
EECS 1028 M: Discrete Mathematics for Engineers Suprakash Datta Office: LAS 3043 Course page: http://www.eecs.yorku.ca/course/1028 Also on Moodle S. Datta (York Univ.) EECS 1028 W 18 1 / 32 Proofs Proofs
More informationMath 319 Problem Set #2 Solution 14 February 2002
Math 39 Problem Set # Solution 4 February 00. (.3, problem 8) Let n be a positive integer, and let r be the integer obtained by removing the last digit from n and then subtracting two times the digit ust
More informationCorollary 4.2 (Pepin s Test, 1877). Let F k = 2 2k + 1, the kth Fermat number, where k 1. Then F k is prime iff 3 F k 1
4. Primality testing 4.1. Introduction. Factorisation is concerned with the problem of developing efficient algorithms to express a given positive integer n > 1 as a product of powers of distinct primes.
More informationNotes on Systems of Linear Congruences
MATH 324 Summer 2012 Elementary Number Theory Notes on Systems of Linear Congruences In this note we will discuss systems of linear congruences where the moduli are all different. Definition. Given the
More informationPLEASE DO ANY 6 of the following 8 problems. Work carefully
Ma2201/CS2022 Discrete Mathematics D Term, 2016 FINAL EXAM PRINT NAME NEATLY: SIGN : PLEASE DO ANY 6 of the following 8 problems. Work carefully and neatly. 1. (5 pts) A tech company currently has 5 programmers,
More informationOutline. We will cover (over the next few weeks) Induction Strong Induction Constructive Induction Structural Induction
Outline We will cover (over the next few weeks) Induction Strong Induction Constructive Induction Structural Induction Induction P(1) ( n 2)[P(n 1) P(n)] ( n 1)[P(n)] Why Does This Work? I P(1) ( n 2)[P(n
More informationAlgebra 2 Notes AII.7 Polynomials Part 2
Algebra 2 Notes AII.7 Polynomials Part 2 Mrs. Grieser Name: Date: Block: Zeros of a Polynomial Function So far: o If we are given a zero (or factor or solution) of a polynomial function, we can use division
More informationSUBGROUPS OF CYCLIC GROUPS. 1. Introduction In a group G, we denote the (cyclic) group of powers of some g G by
SUBGROUPS OF CYCLIC GROUPS KEITH CONRAD 1. Introduction In a group G, we denote the (cyclic) group of powers of some g G by g = {g k : k Z}. If G = g, then G itself is cyclic, with g as a generator. Examples
More informationThe following is an informal description of Euclid s algorithm for finding the greatest common divisor of a pair of numbers:
Divisibility Euclid s algorithm The following is an informal description of Euclid s algorithm for finding the greatest common divisor of a pair of numbers: Divide the smaller number into the larger, and
More informationCSC 344 Algorithms and Complexity. Proof by Mathematical Induction
CSC 344 Algorithms and Complexity Lecture #1 Review of Mathematical Induction Proof by Mathematical Induction Many results in mathematics are claimed true for every positive integer. Any of these results
More information2017 Michigan Mathematics Prize Competition Solutions
017 Michigan Mathematics Prize Competition Solutions 1. Consider a normal 8 8 chessboard, where each square is labelled with either 1 or 1. Let a k be the product of the numbers in the kth row, and let
More information2-7 Solving Quadratic Inequalities. ax 2 + bx + c > 0 (a 0)
Quadratic Inequalities In One Variable LOOKS LIKE a quadratic equation but Doesn t have an equal sign (=) Has an inequality sign (>,
More informationCHAPTER 2: Polynomial and Rational Functions
1) (Answers for Chapter 2: Polynomial and Rational Functions) A.2.1 CHAPTER 2: Polynomial and Rational Functions SECTION 2.1: QUADRATIC FUNCTIONS (AND PARABOLAS) ( ) ; c) x = 1 ( ) ( ) and ( 4, 0) ( )
More informationSection 4.1: Polynomial Functions and Models
Section 4.1: Polynomial Functions and Models Learning Objectives: 1. Identify Polynomial Functions and Their Degree 2. Graph Polynomial Functions Using Transformations 3. Identify the Real Zeros of a Polynomial
More informationDivisibility in the Fibonacci Numbers. Stefan Erickson Colorado College January 27, 2006
Divisibility in the Fibonacci Numbers Stefan Erickson Colorado College January 27, 2006 Fibonacci Numbers F n+2 = F n+1 + F n n 1 2 3 4 6 7 8 9 10 11 12 F n 1 1 2 3 8 13 21 34 89 144 n 13 14 1 16 17 18
More informationSums of Squares. Bianca Homberg and Minna Liu
Sums of Squares Bianca Homberg and Minna Liu June 24, 2010 Abstract For our exploration topic, we researched the sums of squares. Certain properties of numbers that can be written as the sum of two squares
More informationEquality of Dedekind sums: experimental data and theory
Equality of Dedekind sums: experimental data and theory Challenges in 21st Century Experimental Mathematical Computation Sinai Robins Nanyang Technological University ICERM Brown University What are Dedekind
More informationIntroduction: Pythagorean Triplets
Introduction: Pythagorean Triplets On this first day I want to give you an idea of what sorts of things we talk about in number theory. In number theory we want to study the natural numbers, and in particular
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 informationElementary Algebra Chinese Remainder Theorem Euclidean Algorithm
Elementary Algebra Chinese Remainder Theorem Euclidean Algorithm April 11, 2010 1 Algebra We start by discussing algebraic structures and their properties. This is presented in more depth than what we
More informationExplicit Methods in Algebraic Number Theory
Explicit Methods in Algebraic Number Theory Amalia Pizarro Madariaga Instituto de Matemáticas Universidad de Valparaíso, Chile amaliapizarro@uvcl 1 Lecture 1 11 Number fields and ring of integers Algebraic
More information198 VOLUME 46/47, NUMBER 3
LAWRENCE SOMER Abstract. Rotkiewicz has shown that there exist Fibonacci pseudoprimes having the forms p(p + 2), p(2p 1), and p(2p + 3), where all the terms in the products are odd primes. Assuming Dickson
More informationIntegers and Division
Integers and Division Notations Z: set of integers N : set of natural numbers R: set of real numbers Z + : set of positive integers Some elements of number theory are needed in: Data structures, Random
More informationCOUNTING THE ROOTS OF A POLYNOMIAL IN A RING MODULO n. Curt Minich
COUNTING THE ROOTS OF A POLYNOMIAL IN A RING MODULO n Curt Minich Master s Thesis (MAT 600 - Elements of Research) August 16, 1994 Shippensburg University ACKNOWLEDGEMENTS The author would like to acknowledge
More informationMath 473: Practice Problems for Test 1, Fall 2011, SOLUTIONS
Math 473: Practice Problems for Test 1, Fall 011, SOLUTIONS Show your work: 1. (a) Compute the Taylor polynomials P n (x) for f(x) = sin x and x 0 = 0. Solution: Compute f(x) = sin x, f (x) = cos x, f
More informationSpectra of Semidirect Products of Cyclic Groups
Spectra of Semidirect Products of Cyclic Groups Nathan Fox 1 University of Minnesota-Twin Cities Abstract The spectrum of a graph is the set of eigenvalues of its adjacency matrix A group, together with
More informationRMT 2013 Power Round Solutions February 2, 2013
RMT 013 Power Round Solutions February, 013 1. (a) (i) {0, 5, 7, 10, 11, 1, 14} {n N 0 : n 15}. (ii) Yes, 5, 7, 11, 16 can be generated by a set of fewer than 4 elements. Specifically, it is generated
More informationMATH 433 Applied Algebra Lecture 4: Modular arithmetic (continued). Linear congruences.
MATH 433 Applied Algebra Lecture 4: Modular arithmetic (continued). Linear congruences. Congruences Let n be a postive integer. The integers a and b are called congruent modulo n if they have the same
More information= 10 such triples. If it is 5, there is = 1 such triple. Therefore, there are a total of = 46 such triples.
. Two externally tangent unit circles are constructed inside square ABCD, one tangent to AB and AD, the other to BC and CD. Compute the length of AB. Answer: + Solution: Observe that the diagonal of the
More informationLecture 5: Arithmetic Modulo m, Primes and Greatest Common Divisors Lecturer: Lale Özkahya
BBM 205 Discrete Mathematics Hacettepe University http://web.cs.hacettepe.edu.tr/ bbm205 Lecture 5: Arithmetic Modulo m, Primes and Greatest Common Divisors Lecturer: Lale Özkahya Resources: Kenneth Rosen,
More informationDefinitions. Notations. Injective, Surjective and Bijective. Divides. Cartesian Product. Relations. Equivalence Relations
Page 1 Definitions Tuesday, May 8, 2018 12:23 AM Notations " " means "equals, by definition" the set of all real numbers the set of integers Denote a function from a set to a set by Denote the image of
More informationSolutions 2016 AB Exam
Solutions 206 AB Exam Texas A&M High School Math Contest October 22, 206. If (x, y) is a point on the circle x 2 + y 2 = and the distance from (x, y) to (0, ) is 6 5, what is the value of y? ANSWER: 7
More informationCongruences. September 16, 2006
Congruences September 16, 2006 1 Congruences If m is a given positive integer, then we can de ne an equivalence relation on Z (the set of all integers) by requiring that an integer a is related to an integer
More informationMATH 3030, Abstract Algebra FALL 2012 Toby Kenney Midyear Examination Friday 7th December: 7:00-10:00 PM
MATH 3030, Abstract Algebra FALL 2012 Toby Kenney Midyear Examination Friday 7th December: 7:00-10:00 PM Basic Questions 1. Compute the factor group Z 3 Z 9 / (1, 6). The subgroup generated by (1, 6) is
More informationClimbing an Infinite Ladder
Section 5.1 Section Summary Mathematical Induction Examples of Proof by Mathematical Induction Mistaken Proofs by Mathematical Induction Guidelines for Proofs by Mathematical Induction Climbing an Infinite
More informationOn the Dynamic Chromatic Number of Graphs
On the Dynamic Chromatic Number of Graphs Maryam Ghanbari Joint Work with S. Akbari and S. Jahanbekam Sharif University of Technology m_phonix@math.sharif.ir 1. Introduction Let G be a graph. A vertex
More informationClimbing an Infinite Ladder
Section 5.1 Section Summary Mathematical Induction Examples of Proof by Mathematical Induction Mistaken Proofs by Mathematical Induction Guidelines for Proofs by Mathematical Induction Climbing an Infinite
More informationSolutions to 2015 Entrance Examination for BSc Programmes at CMI. Part A Solutions
Solutions to 2015 Entrance Examination for BSc Programmes at CMI Part A Solutions 1. Ten people sitting around a circular table decide to donate some money for charity. You are told that the amount donated
More informationFantastic Factoring. Difference of Cubes. Difference of Squares. Sum of Cubes. Binomial Squares. Factor the following expressions
Fantastic Factoring Following are some factoring patterns that you might already recognize. x and y can both represent variables in the expressions, or y might be a constant. These rules work for all real
More informationMath 312/ AMS 351 (Fall 17) Sample Questions for Final
Math 312/ AMS 351 (Fall 17) Sample Questions for Final 1. Solve the system of equations 2x 1 mod 3 x 2 mod 7 x 7 mod 8 First note that the inverse of 2 is 2 mod 3. Thus, the first equation becomes (multiply
More informationModular Arithmetic Instructor: Marizza Bailey Name:
Modular Arithmetic Instructor: Marizza Bailey Name: 1. Introduction to Modular Arithmetic If someone asks you what day it is 145 days from now, what would you answer? Would you count 145 days, or find
More informationProcedure for Graphing Polynomial Functions
Procedure for Graphing Polynomial Functions P(x) = a nx n + a n-1x n-1 + + a 1x + a 0 To graph P(x): As an example, we will examine the following polynomial function: P(x) = 2x 3 3x 2 23x + 12 1. Determine
More informationToday. Polynomials. Secret Sharing.
Today. Polynomials. Secret Sharing. A secret! I have a secret! A number from 0 to 10. What is it? Any one of you knows nothing! Any two of you can figure it out! Example Applications: Nuclear launch: need
More informationQuasi-reducible Polynomials
Quasi-reducible Polynomials Jacques Willekens 06-Dec-2008 Abstract In this article, we investigate polynomials that are irreducible over Q, but are reducible modulo any prime number. 1 Introduction Let
More informationSolution Set 2. Problem 1. [a] + [b] = [a + b] = [b + a] = [b] + [a] ([a] + [b]) + [c] = [a + b] + [c] = [a + b + c] = [a] + [b + c] = [a] + ([b + c])
Solution Set Problem 1 (1) Z/nZ is the set of equivalence classes of Z mod n. Equivalence is determined by the following rule: [a] = [b] if and only if b a = k n for some k Z. The operations + and are
More informationClassification of Finite Fields
Classification of Finite Fields In these notes we use the properties of the polynomial x pd x to classify finite fields. The importance of this polynomial is explained by the following basic proposition.
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 informationCONTINUED FRACTIONS, PELL S EQUATION, AND TRANSCENDENTAL NUMBERS
CONTINUED FRACTIONS, PELL S EQUATION, AND TRANSCENDENTAL NUMBERS JEREMY BOOHER Continued fractions usually get short-changed at PROMYS, but they are interesting in their own right and useful in other areas
More informationDiscrete Mathematics. Spring 2017
Discrete Mathematics Spring 2017 Previous Lecture Principle of Mathematical Induction Mathematical Induction: rule of inference Mathematical Induction: Conjecturing and Proving Climbing an Infinite Ladder
More informationInstructor: Bobby Kleinberg Lecture Notes, 25 April The Miller-Rabin Randomized Primality Test
Introduction to Algorithms (CS 482) Cornell University Instructor: Bobby Kleinberg Lecture Notes, 25 April 2008 The Miller-Rabin Randomized Primality Test 1 Introduction Primality testing is an important
More informationPRINCIPLE OF MATHEMATICAL INDUCTION
Chapter 4 PRINCIPLE OF MATHEMATICAL INDUCTION 4.1 Overview Mathematical induction is one of the techniques which can be used to prove variety of mathematical statements which are formulated in terms of
More informationMath 121 Homework 3 Solutions
Math 121 Homework 3 Solutions Problem 13.4 #6. Let K 1 and K 2 be finite extensions of F in the field K, and assume that both are splitting fields over F. (a) Prove that their composite K 1 K 2 is a splitting
More informationNotes on Continued Fractions for Math 4400
. Continued fractions. Notes on Continued Fractions for Math 4400 The continued fraction expansion converts a positive real number α into a sequence of natural numbers. Conversely, a sequence of natural
More informationHMMT February 2018 February 10, 2018
HMMT February 018 February 10, 018 Algebra and Number Theory 1. For some real number c, the graphs of the equation y = x 0 + x + 18 and the line y = x + c intersect at exactly one point. What is c? 18
More informationb) since the remainder is 0 I need to factor the numerator. Synthetic division tells me this is true
Section 5.2 solutions #1-10: a) Perform the division using synthetic division. b) if the remainder is 0 use the result to completely factor the dividend (this is the numerator or the polynomial to the
More informationEE 229B ERROR CONTROL CODING Spring 2005
EE 9B ERROR CONTROL CODING Spring 005 Solutions for Homework 1. (Weights of codewords in a cyclic code) Let g(x) be the generator polynomial of a binary cyclic code of length n. (a) Show that if g(x) has
More informationMa/CS 6a Class 2: Congruences
Ma/CS 6a Class 2: Congruences 1 + 1 5 (mod 3) By Adam Sheffer Reminder: Public Key Cryptography Idea. Use a public key which is used for encryption and a private key used for decryption. Alice encrypts
More informationIntroduction to Induction (LAMC, 10/14/07)
Introduction to Induction (LAMC, 10/14/07) Olga Radko October 1, 007 1 Definitions The Method of Mathematical Induction (MMI) is usually stated as one of the axioms of the natural numbers (so-called Peano
More informationHere is another characterization of prime numbers.
Here is another characterization of prime numbers. Theorem p is prime it has no divisors d that satisfy < d p. Proof [ ] If p is prime then it has no divisors d that satisfy < d < p, so clearly no divisor
More informationSelf-Dual Cyclic Codes
Self-Dual Cyclic Codes Bas Heijne November 29, 2007 Definitions Definition Let F be the finite field with two elements and n a positive integer. An [n, k] (block)-code C is a k dimensional linear subspace
More informationThe following techniques for methods of proofs are discussed in our text: - Vacuous proof - Trivial proof
Ch. 1.6 Introduction to Proofs The following techniques for methods of proofs are discussed in our text - Vacuous proof - Trivial proof - Direct proof - Indirect proof (our book calls this by contraposition)
More informationThe Class Equation X = Gx. x X/G
The Class Equation 9-9-2012 If X is a G-set, X is partitioned by the G-orbits. So if X is finite, X = x X/G ( x X/G means you should take one representative x from each orbit, and sum over the set of representatives.
More informationLecture 5: Latin Squares and Magic
Latin Squares Instructor: Padraic Bartlett Lecture 5: Latin Squares and Magic Week Mathcamp 0 Today s application is to magic! Not the friendship kind though ; instead we re going to talk about magic squares
More informationCryptosystem. Traditional Cryptosystems: The two parties agree on a secret (one to one) function f. To send a message M, thesendersendsthemessage
Cryptosystem Traditional Cryptosystems: The two parties agree on a secret (one to one) function f. To send a message M, thesendersendsthemessage f(m). The receiver computes f 1 (f(m)). Advantage: Cannot
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 informationGENERATING SETS KEITH CONRAD
GENERATING SETS KEITH CONRAD 1 Introduction In R n, every vector can be written as a unique linear combination of the standard basis e 1,, e n A notion weaker than a basis is a spanning set: a set of vectors
More informationFACTORING IN QUADRATIC FIELDS. 1. Introduction
FACTORING IN QUADRATIC FIELDS KEITH CONRAD For a squarefree integer d other than 1, let 1. Introduction K = Q[ d] = {x + y d : x, y Q}. This is closed under addition, subtraction, multiplication, and also
More informationCongruence of Integers
Congruence of Integers November 14, 2013 Week 11-12 1 Congruence of Integers Definition 1. Let m be a positive integer. For integers a and b, if m divides b a, we say that a is congruent to b modulo m,
More informationSECTION 2.5: FINDING ZEROS OF POLYNOMIAL FUNCTIONS
SECTION 2.5: FINDING ZEROS OF POLYNOMIAL FUNCTIONS Assume f ( x) is a nonconstant polynomial with real coefficients written in standard form. PART A: TECHNIQUES WE HAVE ALREADY SEEN Refer to: Notes 1.31
More information3 Polynomial and Rational Functions
3 Polynomial and Rational Functions 3.1 Polynomial Functions and their Graphs So far, we have learned how to graph polynomials of degree 0, 1, and. Degree 0 polynomial functions are things like f(x) =,
More informationSolutions to Practice Final
s to Practice Final 1. (a) What is φ(0 100 ) where φ is Euler s φ-function? (b) Find an integer x such that 140x 1 (mod 01). Hint: gcd(140, 01) = 7. (a) φ(0 100 ) = φ(4 100 5 100 ) = φ( 00 5 100 ) = (
More informationHASSE-MINKOWSKI THEOREM
HASSE-MINKOWSKI THEOREM KIM, SUNGJIN 1. Introduction In rough terms, a local-global principle is a statement that asserts that a certain property is true globally if and only if it is true everywhere locally.
More informationBasic Proof Examples
Basic Proof Examples Lisa Oberbroeckling Loyola University Maryland Fall 2015 Note. In this document, we use the symbol as the negation symbol. Thus p means not p. There are four basic proof techniques
More informationHomework 8 Solutions to Selected Problems
Homework 8 Solutions to Selected Problems June 7, 01 1 Chapter 17, Problem Let f(x D[x] and suppose f(x is reducible in D[x]. That is, there exist polynomials g(x and h(x in D[x] such that g(x and h(x
More informationMATH 215 Final. M4. For all a, b in Z, a b = b a.
MATH 215 Final We will assume the existence of a set Z, whose elements are called integers, along with a well-defined binary operation + on Z (called addition), a second well-defined binary operation on
More informationWhat is proof? Lesson 1
What is proof? Lesson The topic for this Math Explorer Club is mathematical proof. In this post we will go over what was covered in the first session. The word proof is a normal English word that you might
More informationCycle Length Parities and the Chromatic Number
Cycle Length Parities and the Chromatic Number Christian Löwenstein, Dieter Rautenbach and Ingo Schiermeyer 2 Institut für Mathematik, TU Ilmenau, Postfach 00565, D-98684 Ilmenau, Germany, emails: christian.loewenstein@tu-ilmenau.de,
More informationName: Mathematics 1C03
Name: Student ID Number: Mathematics 1C03 Day Class Instructor: M. Harada Duration: 2.5 hours April 2018 McMaster University PRACTICE Final Examination This is a PRACTICE final exam. The actual final exam
More informationPrimality Testing. 1 Introduction. 2 Brief Chronology of Primality Testing. CS265/CME309, Fall Instructor: Gregory Valiant
CS265/CME309, Fall 2018. Instructor: Gregory Valiant Primality Testing [These notes may not be distributed outside this class without the permission of Gregory Valiant.] 1 Introduction Prime numbers are
More informationSimultaneous Diophantine Approximation with Excluded Primes. László Babai Daniel Štefankovič
Simultaneous Diophantine Approximation with Excluded Primes László Babai Daniel Štefankovič Dirichlet (1842) Simultaneous Diophantine Approximation Given reals integers α,,...,, 1 α 2 α n Q r1,..., r n
More informationChapter 3: Polynomial and Rational Functions
Chapter 3: Polynomial and Rational Functions 3.1 Polynomial Functions and Their Graphs A polynomial function of degree n is a function of the form P (x) = a n x n + a n 1 x n 1 + + a 1 x + a 0 The numbers
More informationComposing Two Non-Tricolorable Knots
Composing Two Non-Tricolorable Knots Kelly Harlan August 2010, Math REU at CSUSB Abstract In this paper we will be using modp-coloring, determinants of coloring matrices and knots, and techniques from
More informationSimple groups and the classification of finite groups
Simple groups and the classification of finite groups 1 Finite groups of small order How can we describe all finite groups? Before we address this question, let s write down a list of all the finite groups
More informationDiscrete Mathematics and Probability Theory Spring 2016 Rao and Walrand Note 8
CS 70 Discrete Mathematics and Probability Theory Spring 2016 Rao and Walrand Note 8 Polynomials Polynomials constitute a rich class of functions which are both easy to describe and widely applicable in
More information171S4.4 Theorems about Zeros of Polynomial Functions. March 27, 2012
MAT 171 Precalculus Algebra Dr. Claude Moore Cape Fear Community College CHAPTER 4: Polynomial and Rational Functions 4.1 Polynomial Functions and Models 4.2 Graphing Polynomial Functions 4.3 Polynomial
More informationEULER S THEOREM KEITH CONRAD
EULER S THEOREM KEITH CONRAD. Introduction Fermat s little theorem is an important property of integers to a prime modulus. Theorem. (Fermat). For prime p and any a Z such that a 0 mod p, a p mod p. If
More information