Check Digit Schemes and Error Detecting Codes. By Breanne Oldham Union University
|
|
|
- Brittany Pierce
- 10 years ago
- Views:
Transcription
1 Check Digit Schemes and Error Detecting Codes By Breanne Oldham Union University
2 What are Check Digit Schemes? Check digit schemes are numbers appended to an identification number that allow the accuracy of information stored to be checked by an algorithm.
3 What are error detecting codes? Error detecting codes are algorithms that utilize check digits to detect, but not to correct, errors in entering identification numbers.
4 Where can error detecting schemes and check digits be found? International Standard Book Numbers (ISBN) Driver s License Numbers Universal Product Codes (UPC) Personal Checks Library Cards Shipping Labels
5 Types of Common Errors Single digit (79.1%) Transposition of adjacent digits (10.2%) Jump transposition (0.8%)
6 Types of Common Errors (cont) Twin (0.5%) Phonetic (0.5%) Jump twin (0.3%)
7 3 Types of Error Detecting Codes Modular Arithmetic Permutations Noncommutative Schemes
8 ISBN Numbers A 10-digit number assigned to books published in most industrialized nations. Uses a modulo 11 arithmetic error detecting scheme with the last digit being the check digit. Detects 100% of single digit errors and adjacent transposition errors
9 ISBN with a Single Digit Error Take the ISBN number Let it be incorrectly transmitted as The ISBN check digit is determined by 10d 10 +9d 9 +8d 8 +7d 7 +6d 6 +5d 5 +4d 4 +3d 3 +2d 2 +d 1 0(mod11) So, for our example, 10(0)+9(6)+8(6)+7(9)+6(1)+5(6)+4(4)+3(9)+ 2(6)+1(4) 0(mod 11) 260 7(mod 11) Therefore, you know that there is a mistake.
10 ISBN with a Transposition of Adjacent Digits Error Take the ISBN number Let it be incorrectly transmitted as So, in our example, 10(0)+9(6)+8(6)+7(9)+6(9)+5(1)+4(4)+3(9)+ 2(6)+1(4)? 0(mod11) 283 0(mod11) 283 8(mod11) There is an error.
11 Proof of the ISBN Error Detecting Code (adjacent transposition) Let the ISBN number be denoted by d 10 d 9 d 8 d 7 d 6 d 5 d 4 d 3 d 2 d 1 Then, the following represents the incorrect ISBN with transposition of adjacent digits d 10 d 9 d 8 d 6 d 7 d 5 d 4 d 3 d 2 d 1 Let T denote the check sum for the ISBN number and let S denote the check sum for the incorrect ISBN number.
12 Proof of the ISBN Error Detecting Code (cont.) T = 10d 10 +9d 9 +8d 8 +7d 7 +6d 6 +5d 5 +4d 4 +3d 3 +2d 2 +d 1 and S = 10d 10 +9d 9 +8d 8 +7d 6 +6d 7 +5d 5 +4d 4 +3d 3 +2d 2 +d 1 Assume that T is a multiple of 11 and we show that S is not a multiple of 11. Consider T-S. After cancellations, we obtain T-S = 7d 7-7d 6 +6d 6-6d 7 = d 7 -d 6 Since d 7 -d 6 is a one-digit number, then -10< d 7 -d 6 < 10
13 Proof of the ISBN Error Detecting Code (cont.) The only multiple of 11 between -10 and 10 is zero. But if d 7 -d 6 = 0, then d 7 = d 6 and no error has occurred. This is a contradiction.
14 Problems with the ISBN Error Detecting Code Using mod 11 arithmetic, the check digit can be 10. Since 10 is not a single digit, it must be denoted by X Does not detect all double errors
15 The IBM Scheme Can be used with any length identification number Used by credit card companies, libraries, blood banks, DMVs, and German banks Catches ALL Single Digit Errors Uses the permutation σ = (0)(1,2,4,8,7,5)(3,6)(9)
16 Problems with the IBM Scheme Does not catch all transposition of adjacent digits errors Specifically does not catch errors involving 0 and 9
17 Definition of the IBM Check Digit Scheme Let a 1 a 2 a 3... a n-1 represent an identifying number. The check digit a n is appended to the number a 1 a 2 a 3... a n-1 a n by using the permutation σ = (0)(1,2,4,8,7,5)(3,6)(9) in one of the following two ways.
18 Definition of the IBM Check Digit Scheme (cont.) 1. If n is even, the check digit a n is assigned such that σ(a 1 )+a 2 +σ(a 3 )+a σ(a n-1 )+a n 0(mod10) 2. If n is odd, the check digit a n is assigned such that a 1 + σ (a 2 ) + a 3 + σ (a 4 )+... +a n-1 + σ (a n ) 0(mod10)
19 Proof of the IBM Error Detecting Code Let a 1... a i... a n be an identification number with n even and 1 i n. Let a single digit error occur transmitting a 1... a i... a n as a 1... b i... a n with a i b i Assume that the error is not caught.
20 Proof of the IBM Error Detecting Code (cont) Case I: Since both errors are not caught, σ(a 1 )+a σ(a i )+... +σ(a n-1 )+a n 0(mod10) and σ(a 1 )+a σ(b i )+... +σ(a n-1 )+a n 0(mod10) This can also be written (σ(a 1 )+a σ(a i )+... +σ(a n-1 )+a n ) (σ(a 1 )+a σ(b i )+... +σ(a n-1 )+a n) 0(mod10)
21 Proof of the IBM Error Detecting Code (cont) This results in: 0= (σ(a 1 )+a σ(a i )+... +σ(a n-1 )+a n ) (σ(a 1 )+a σ(b i )+... +σ(a n-1 )+a n ) (mod 10) = σ(a 1 )+a σ(a i )+... +σ(a n-1 )+a n σ(a 1 ) - a σ(b i ) σ(a n-1 ) a n (mod 10) = σ(a i ) σ(b i ) (mod 10)
22 Proof of the IBM Error Detecting Code (cont) Thus σ(a i ) σ(b i ) 0 (mod10). Since a i b i and σ is a permutation, σ(a i ) σ(b i )=0. Adding σ(b i ) to both sides yields the result σ(a i ) = σ(b i ). Since σ is a permutation, this means that a i =b i. This is a contradiction. Thus the assumption that the error is not caught is false, and the error is caught.
23 Proof of the IBM Error Detecting Code (cont) Case II: Since both errors are not caught, σ(a 1 )+a a i σ(a n-1 )+a n 0(mod10) and σ(a 1 )+a b i σ(a n-1 )+a n 0(mod10) This can also be written (σ(a 1 )+a a i σ(a n-1 )+a n ) (σ(a 1 )+a b i σ(a n-1 )+a n ) 0(mod10)
24 Proof of the IBM Error Detecting Code (cont) This results in: 0= (σ(a 1 )+a a i σ(a n-1 )+a n ) (σ(a 1 )+a b i σ(a n-1 )+a n ) (mod 10) = σ(a 1 )+a a i σ(a n-1 )+a n σ(a 1 ) - a b i σ(a n-1 ) a n (mod 10) = a i b i (mod 10)
25 Proof of the IBM Error Detecting Code (cont) Thus a i b i 0 (mod10). Since a i b i and both a i and b i are integers between 0 and 10, a i b i = 0. Adding b i to both sides, the calculation results in a i = b i. This is a contradiction. Thus the assumption that the error is not caught is false, and the error is caught.
26 Checking a Library Number for Errors Using the IBM Scheme Let a library book number be where 9 is the check digit. Suppose the number is entered as The calculation shows that σ(2)+1+σ(0)+0+σ(5)+2+σ(6)+0+σ(9)+1+σ(7) +9? 0 mod(10) ? 0 mod(10) 35? 0 mod(10) 35 5 mod(10) There is an error.
27 The Verhoeff Check Digit Scheme A noncommutative scheme Catches all errors previously mentioned Based on the Cayley Table for D 10 *
28 Definition of the Verhoeff Check Digit Scheme Let a 1 a 2... a n-1 a n be an identification number with check digit a n. The check digit a n is appended to the number a 1 a 2... a n-1 such that the following equation is satisfied: σ n-1 (a 1 ) * σ n-2 (a 2 ) * σ n-3 (a 3 ) *... * σ(a n-1 ) = 0 Where σ = (0)(1,4)(2,3)(5,6,7,8,9) and * is the group operation from D 10 as previously presented.
29 Checking an Identification Number Using the Verhoeff Scheme Let be an identification number that is incorrectly transmitted as (Single Digit Error) Compute the check scheme using the Cayley Table for D 10. σ 11 (3)*σ 10 (8)*σ 9 (6)*σ 8 (0)*σ 7 (1)*σ 6 (5)*σ 5 (4)*σ 4 (2)* σ 3 (9)*σ 2 (2)*σ(7)*8? 0
30 Checking an Identification Number Using the Verhoeff Scheme This leads to 2*8*5*0*4*6*1*2*7*2*8*8? Thus, there must be an error. This error would be caught. *
31 Checking an Identification Number Using the Verhoeff Scheme Let be an identification number that is incorrectly transmitted as (transpostion of adjacent digits error) Compute the check scheme using the Cayley Table for D 10. σ 11 (3)*σ 10 (8)*σ 9 (6)*σ 8 (0)*σ 7 (1)*σ 6 (8)*σ 5 (4)*σ 4 (9)* σ 3 (2)*σ 2 (2)*σ(7)*8? 0
32 Checking an Identification Number Using the Verhoeff Scheme This leads to 2*8*5*0*4*9*1*8*3*2*8*8? Thus, there must be an error. This error would be caught. *
33 What s Next? Multiple Check Digits in a single Identification Number Error Correcting Codes Similar to Error Detecting Codes Both detect and correct the errors that are found.
34 Conclusion Check digits are an integral part of error detecting codes. There are three different types of error detecting codes which are progressively more sophisticated and detect more errors
35 Bibliography Dixon, Emily. Take a Break. Gallian, Joseph A. The Mathematics of Identification Numbers. The College Mathematics Journal. May Kirtland, Joseph. Identification Numbers and Check Digit Schemes. Mathematical Assoc. of America Wheeler, Mary L. Check Digit Schemes. The Mathematics Teacher. April
Identification Numbers and Check Digits 1
Identification Numbers and Check Digits 1 Many products or documents today have an identification number stamped. This numbers codes information about the product. Some examples: 1. Credit Cards 2. Postal
Check Digits for Detecting Recording Errors in Horticultural Research: Theory and Examples
HORTSCIENCE 40(7):1956 1962. 2005. Check Digits for Detecting Recording Errors in Horticultural Research: Theory and Examples W.R. Okie U.S. Department of Agriculture, Agricultural Research Service, Southeastern
6.2 Permutations continued
6.2 Permutations continued Theorem A permutation on a finite set A is either a cycle or can be expressed as a product (composition of disjoint cycles. Proof is by (strong induction on the number, r, of
Number Theory. Proof. Suppose otherwise. Then there would be a finite number n of primes, which we may
Number Theory Divisibility and Primes Definition. If a and b are integers and there is some integer c such that a = b c, then we say that b divides a or is a factor or divisor of a and write b a. Definition
The College Mathematics Journal, Vol. 22, No. 3. (May, 1991), pp. 194-202.
The Mathematics of Identification Numbers Joseph A. Gallian The College Mathematics Journal, Vol. 22, No. 3. (May, 1991), pp. 194-202. Stable URL: http://links.jstor.org/sici?sici=0746-8342%28199105%2922%3a3%3c194%3atmoin%3e2.0.co%3b2-q
8 Primes and Modular Arithmetic
8 Primes and Modular Arithmetic 8.1 Primes and Factors Over two millennia ago already, people all over the world were considering the properties of numbers. One of the simplest concepts is prime numbers.
MII stands for major industry identifier; 4 and 5 indicate Banking and Financial. VISA cards begin with 4 and MasterCard cards with 5.
Credit Cards Credit cards have 16-digit numbers, of which the first 15 digits identify the credit card and the sixteenth digit is the check digit. The following figure shows the significance of the digits:
Breaking The Code. Ryan Lowe. Ryan Lowe is currently a Ball State senior with a double major in Computer Science and Mathematics and
Breaking The Code Ryan Lowe Ryan Lowe is currently a Ball State senior with a double major in Computer Science and Mathematics and a minor in Applied Physics. As a sophomore, he took an independent study
Lemma 5.2. Let S be a set. (1) Let f and g be two permutations of S. Then the composition of f and g is a permutation of S.
Definition 51 Let S be a set bijection f : S S 5 Permutation groups A permutation of S is simply a Lemma 52 Let S be a set (1) Let f and g be two permutations of S Then the composition of f and g is a
WOLLONGONG COLLEGE AUSTRALIA. Diploma in Information Technology
First Name: Family Name: Student Number: Class/Tutorial: WOLLONGONG COLLEGE AUSTRALIA A College of the University of Wollongong Diploma in Information Technology Final Examination Spring Session 2008 WUCT121
= 2 + 1 2 2 = 3 4, Now assume that P (k) is true for some fixed k 2. This means that
Instructions. Answer each of the questions on your own paper, and be sure to show your work so that partial credit can be adequately assessed. Credit will not be given for answers (even correct ones) without
Flaws & Frauds Hindering Credit Cards Security
Flaws & Frauds Hindering Credit Cards Security Abhishek Maheshwari #1, S.K. Saritha *2 # Department of Computer Science & Engineering, Maulana Azad National Institute of Technology Bhopal, Madhya Pradesh,
k, then n = p2α 1 1 pα k
Powers of Integers An integer n is a perfect square if n = m for some integer m. Taking into account the prime factorization, if m = p α 1 1 pα k k, then n = pα 1 1 p α k k. That is, n is a perfect square
The Prime Numbers. Definition. A prime number is a positive integer with exactly two positive divisors.
The Prime Numbers Before starting our study of primes, we record the following important lemma. Recall that integers a, b are said to be relatively prime if gcd(a, b) = 1. Lemma (Euclid s Lemma). If gcd(a,
Math 55: Discrete Mathematics
Math 55: Discrete Mathematics UC Berkeley, Spring 2012 Homework # 9, due Wednesday, April 11 8.1.5 How many ways are there to pay a bill of 17 pesos using a currency with coins of values of 1 peso, 2 pesos,
MATHEMATICAL INDUCTION. Mathematical Induction. This is a powerful method to prove properties of positive integers.
MATHEMATICAL INDUCTION MIGUEL A LERMA (Last updated: February 8, 003) Mathematical Induction This is a powerful method to prove properties of positive integers Principle of Mathematical Induction Let P
Reading 13 : Finite State Automata and Regular Expressions
CS/Math 24: Introduction to Discrete Mathematics Fall 25 Reading 3 : Finite State Automata and Regular Expressions Instructors: Beck Hasti, Gautam Prakriya In this reading we study a mathematical model
Math 319 Problem Set #3 Solution 21 February 2002
Math 319 Problem Set #3 Solution 21 February 2002 1. ( 2.1, problem 15) Find integers a 1, a 2, a 3, a 4, a 5 such that every integer x satisfies at least one of the congruences x a 1 (mod 2), x a 2 (mod
ON GALOIS REALIZATIONS OF THE 2-COVERABLE SYMMETRIC AND ALTERNATING GROUPS
ON GALOIS REALIZATIONS OF THE 2-COVERABLE SYMMETRIC AND ALTERNATING GROUPS DANIEL RABAYEV AND JACK SONN Abstract. Let f(x) be a monic polynomial in Z[x] with no rational roots but with roots in Q p for
Notes on Factoring. MA 206 Kurt Bryan
The General Approach Notes on Factoring MA 26 Kurt Bryan Suppose I hand you n, a 2 digit integer and tell you that n is composite, with smallest prime factor around 5 digits. Finding a nontrivial factor
ALGEBRAIC APPROACH TO COMPOSITE INTEGER FACTORIZATION
ALGEBRAIC APPROACH TO COMPOSITE INTEGER FACTORIZATION Aldrin W. Wanambisi 1* School of Pure and Applied Science, Mount Kenya University, P.O box 553-50100, Kakamega, Kenya. Shem Aywa 2 Department of Mathematics,
Mathematics of Internet Security. Keeping Eve The Eavesdropper Away From Your Credit Card Information
The : Keeping Eve The Eavesdropper Away From Your Credit Card Information Department of Mathematics North Dakota State University 16 September 2010 Science Cafe Introduction Disclaimer: is not an internet
GREATEST COMMON DIVISOR
DEFINITION: GREATEST COMMON DIVISOR The greatest common divisor (gcd) of a and b, denoted by (a, b), is the largest common divisor of integers a and b. THEOREM: If a and b are nonzero integers, then their
CHAPTER 5. Number Theory. 1. Integers and Division. Discussion
CHAPTER 5 Number Theory 1. Integers and Division 1.1. Divisibility. Definition 1.1.1. Given two integers a and b we say a divides b if there is an integer c such that b = ac. If a divides b, we write a
Elementary Number Theory and Methods of Proof. CSE 215, Foundations of Computer Science Stony Brook University http://www.cs.stonybrook.
Elementary Number Theory and Methods of Proof CSE 215, Foundations of Computer Science Stony Brook University http://www.cs.stonybrook.edu/~cse215 1 Number theory Properties: 2 Properties of integers (whole
Lecture 13: Factoring Integers
CS 880: Quantum Information Processing 0/4/0 Lecture 3: Factoring Integers Instructor: Dieter van Melkebeek Scribe: Mark Wellons In this lecture, we review order finding and use this to develop a method
Introduction. Appendix D Mathematical Induction D1
Appendix D Mathematical Induction D D Mathematical Induction Use mathematical induction to prove a formula. Find a sum of powers of integers. Find a formula for a finite sum. Use finite differences to
10.2 Series and Convergence
10.2 Series and Convergence Write sums using sigma notation Find the partial sums of series and determine convergence or divergence of infinite series Find the N th partial sums of geometric series and
Chapter 1 A Pri Characterization of T m e Pairs w in Proceedings NCUR V. (1991), Vol. I, pp. 362{366. Jerey F. Gold Department of Mathematics, Department of Physics University of Utah DonH.Tucker Department
Every Positive Integer is the Sum of Four Squares! (and other exciting problems)
Every Positive Integer is the Sum of Four Squares! (and other exciting problems) Sophex University of Texas at Austin October 18th, 00 Matilde N. Lalín 1. Lagrange s Theorem Theorem 1 Every positive integer
Revised Version of Chapter 23. We learned long ago how to solve linear congruences. ax c (mod m)
Chapter 23 Squares Modulo p Revised Version of Chapter 23 We learned long ago how to solve linear congruences ax c (mod m) (see Chapter 8). It s now time to take the plunge and move on to quadratic equations.
Universal hashing. In other words, the probability of a collision for two different keys x and y given a hash function randomly chosen from H is 1/m.
Universal hashing No matter how we choose our hash function, it is always possible to devise a set of keys that will hash to the same slot, making the hash scheme perform poorly. To circumvent this, we
Settling Multiple Debts Efficiently: Problems
Settling Multiple Debts Efficiently: Problems Tom Verhoeff Faculty of Mathematics and Computing Science Eindhoven University of Technology Email: [email protected] June 04 Abstract I present a series of
Settling a Question about Pythagorean Triples
Settling a Question about Pythagorean Triples TOM VERHOEFF Department of Mathematics and Computing Science Eindhoven University of Technology P.O. Box 513, 5600 MB Eindhoven, The Netherlands E-Mail address:
Mathematical Induction
Mathematical Induction (Handout March 8, 01) The Principle of Mathematical Induction provides a means to prove infinitely many statements all at once The principle is logical rather than strictly mathematical,
Solutions to Homework 6 Mathematics 503 Foundations of Mathematics Spring 2014
Solutions to Homework 6 Mathematics 503 Foundations of Mathematics Spring 2014 3.4: 1. If m is any integer, then m(m + 1) = m 2 + m is the product of m and its successor. That it to say, m 2 + m is the
Integer roots of quadratic and cubic polynomials with integer coefficients
Integer roots of quadratic and cubic polynomials with integer coefficients Konstantine Zelator Mathematics, Computer Science and Statistics 212 Ben Franklin Hall Bloomsburg University 400 East Second Street
Quotient Rings and Field Extensions
Chapter 5 Quotient Rings and Field Extensions In this chapter we describe a method for producing field extension of a given field. If F is a field, then a field extension is a field K that contains F.
8 Divisibility and prime numbers
8 Divisibility and prime numbers 8.1 Divisibility In this short section we extend the concept of a multiple from the natural numbers to the integers. We also summarize several other terms that express
Some facts about polynomials modulo m (Full proof of the Fingerprinting Theorem)
Some facts about polynomials modulo m (Full proof of the Fingerprinting Theorem) In order to understand the details of the Fingerprinting Theorem on fingerprints of different texts from Chapter 19 of the
University of Lille I PC first year list of exercises n 7. Review
University of Lille I PC first year list of exercises n 7 Review Exercise Solve the following systems in 4 different ways (by substitution, by the Gauss method, by inverting the matrix of coefficients
3 0 + 4 + 3 1 + 1 + 3 9 + 6 + 3 0 + 1 + 3 0 + 1 + 3 2 mod 10 = 4 + 3 + 1 + 27 + 6 + 1 + 1 + 6 mod 10 = 49 mod 10 = 9.
SOLUTIONS TO HOMEWORK 2 - MATH 170, SUMMER SESSION I (2012) (1) (Exercise 11, Page 107) Which of the following is the correct UPC for Progresso minestrone soup? Show why the other numbers are not valid
Properties of Real Numbers
16 Chapter P Prerequisites P.2 Properties of Real Numbers What you should learn: Identify and use the basic properties of real numbers Develop and use additional properties of real numbers Why you should
Applications of Fermat s Little Theorem and Congruences
Applications of Fermat s Little Theorem and Congruences Definition: Let m be a positive integer. Then integers a and b are congruent modulo m, denoted by a b mod m, if m (a b). Example: 3 1 mod 2, 6 4
Today s Topics. Primes & Greatest Common Divisors
Today s Topics Primes & Greatest Common Divisors Prime representations Important theorems about primality Greatest Common Divisors Least Common Multiples Euclid s algorithm Once and for all, what are prime
4.5 Finite Mathematical Systems
4.5 Finite Mathematical Systems We will be looking at operations on finite sets of numbers. We will denote the operation by a generic symbol, like *. What is an operation? An operation is a rule for combining
a 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2.
Chapter 1 LINEAR EQUATIONS 1.1 Introduction to linear equations A linear equation in n unknowns x 1, x,, x n is an equation of the form a 1 x 1 + a x + + a n x n = b, where a 1, a,..., a n, b are given
Elementary Number Theory
Elementary Number Theory A revision by Jim Hefferon, St Michael s College, 2003-Dec of notes by W. Edwin Clark, University of South Florida, 2002-Dec L A TEX source compiled on January 5, 2004 by Jim Hefferon,
Mathematical Induction. Lecture 10-11
Mathematical Induction Lecture 10-11 Menu Mathematical Induction Strong Induction Recursive Definitions Structural Induction Climbing an Infinite Ladder Suppose we have an infinite ladder: 1. We can reach
ABSTRACT ALGEBRA: A STUDY GUIDE FOR BEGINNERS
ABSTRACT ALGEBRA: A STUDY GUIDE FOR BEGINNERS John A. Beachy Northern Illinois University 2014 ii J.A.Beachy This is a supplement to Abstract Algebra, Third Edition by John A. Beachy and William D. Blair
THE SIGN OF A PERMUTATION
THE SIGN OF A PERMUTATION KEITH CONRAD 1. Introduction Throughout this discussion, n 2. Any cycle in S n is a product of transpositions: the identity (1) is (12)(12), and a k-cycle with k 2 can be written
Homework until Test #2
MATH31: Number Theory Homework until Test # Philipp BRAUN Section 3.1 page 43, 1. It has been conjectured that there are infinitely many primes of the form n. Exhibit five such primes. Solution. Five such
9.2 Summation Notation
9. Summation Notation 66 9. Summation Notation In the previous section, we introduced sequences and now we shall present notation and theorems concerning the sum of terms of a sequence. We begin with a
Stupid Divisibility Tricks
Stupid Divisibility Tricks 101 Ways to Stupefy Your Friends Appeared in Math Horizons November, 2006 Marc Renault Shippensburg University Mathematics Department 1871 Old Main Road Shippensburg, PA 17013
U.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009. Notes on Algebra
U.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009 Notes on Algebra These notes contain as little theory as possible, and most results are stated without proof. Any introductory
COMBINATORIAL PROPERTIES OF THE HIGMAN-SIMS GRAPH. 1. Introduction
COMBINATORIAL PROPERTIES OF THE HIGMAN-SIMS GRAPH ZACHARY ABEL 1. Introduction In this survey we discuss properties of the Higman-Sims graph, which has 100 vertices, 1100 edges, and is 22 regular. In fact
If n is odd, then 3n + 7 is even.
Proof: Proof: We suppose... that 3n + 7 is even. that 3n + 7 is even. Since n is odd, there exists an integer k so that n = 2k + 1. that 3n + 7 is even. Since n is odd, there exists an integer k so that
2 When is a 2-Digit Number the Sum of the Squares of its Digits?
When Does a Number Equal the Sum of the Squares or Cubes of its Digits? An Exposition and a Call for a More elegant Proof 1 Introduction We will look at theorems of the following form: by William Gasarch
Not for resale. 4.1 Divisibility of Natural Numbers 4.2 Tests for Divisibility 4.3 Greatest Common Divisors and Least Common Multiples
CHAPTER 4 Number Theory 4.1 Divisibility of Natural Numbers 4.2 Tests for Divisibility 4.3 Greatest Common Divisors and Least Common Multiples 4.4 Codes and Credit Card Numbers: Connections to Number Theory
11 Ideals. 11.1 Revisiting Z
11 Ideals The presentation here is somewhat different than the text. In particular, the sections do not match up. We have seen issues with the failure of unique factorization already, e.g., Z[ 5] = O Q(
Math 55: Discrete Mathematics
Math 55: Discrete Mathematics UC Berkeley, Fall 2011 Homework # 5, due Wednesday, February 22 5.1.4 Let P (n) be the statement that 1 3 + 2 3 + + n 3 = (n(n + 1)/2) 2 for the positive integer n. a) What
Trend and Seasonal Components
Chapter 2 Trend and Seasonal Components If the plot of a TS reveals an increase of the seasonal and noise fluctuations with the level of the process then some transformation may be necessary before doing
Chapter 7: Products and quotients
Chapter 7: Products and quotients Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 42, Spring 24 M. Macauley (Clemson) Chapter 7: Products
We can express this in decimal notation (in contrast to the underline notation we have been using) as follows: 9081 + 900b + 90c = 9001 + 100c + 10b
In this session, we ll learn how to solve problems related to place value. This is one of the fundamental concepts in arithmetic, something every elementary and middle school mathematics teacher should
WOLLONGONG COLLEGE AUSTRALIA. Diploma in Information Technology
First Name: Family Name: Student Number: Class/Tutorial: WOLLONGONG COLLEGE AUSTRALIA A College of the University of Wollongong Diploma in Information Technology Mid-Session Test Summer Session 008-00
Collatz Sequence. Fibbonacci Sequence. n is even; Recurrence Relation: a n+1 = a n + a n 1.
Fibonacci Roulette In this game you will be constructing a recurrence relation, that is, a sequence of numbers where you find the next number by looking at the previous numbers in the sequence. Your job
Lecture 3: Finding integer solutions to systems of linear equations
Lecture 3: Finding integer solutions to systems of linear equations Algorithmic Number Theory (Fall 2014) Rutgers University Swastik Kopparty Scribe: Abhishek Bhrushundi 1 Overview The goal of this lecture
SUBGROUPS 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
arxiv:1112.0829v1 [math.pr] 5 Dec 2011
![arxiv:1112.0829v1 [math.pr] 5 Dec 2011](/thumbs/39/18839218.jpg "arxiv:1112.0829v1 [math.pr] 5 Dec 2011")
How Not to Win a Million Dollars: A Counterexample to a Conjecture of L. Breiman Thomas P. Hayes arxiv:1112.0829v1 [math.pr] 5 Dec 2011 Abstract Consider a gambling game in which we are allowed to repeatedly
WRITING PROOFS. Christopher Heil Georgia Institute of Technology
WRITING PROOFS Christopher Heil Georgia Institute of Technology A theorem is just a statement of fact A proof of the theorem is a logical explanation of why the theorem is true Many theorems have this
The last three chapters introduced three major proof techniques: direct,
CHAPTER 7 Proving Non-Conditional Statements The last three chapters introduced three major proof techniques: direct, contrapositive and contradiction. These three techniques are used to prove statements
Clock Arithmetic and Modular Systems Clock Arithmetic The introduction to Chapter 4 described a mathematical system
CHAPTER Number Theory FIGURE FIGURE FIGURE Plus hours Plus hours Plus hours + = + = + = FIGURE. Clock Arithmetic and Modular Systems Clock Arithmetic The introduction to Chapter described a mathematical
Generating Elementary Combinatorial Objects
Fall 2009 Combinatorial Generation Combinatorial Generation: an old subject Excerpt from: D. Knuth, History of Combinatorial Generation, in pre-fascicle 4B, The Art of Computer Programming Vol 4. Combinatorial
Discrete Mathematics Problems
Discrete Mathematics Problems William F. Klostermeyer School of Computing University of North Florida Jacksonville, FL 32224 E-mail: [email protected] Contents 0 Preface 3 1 Logic 5 1.1 Basics...............................
Labeling outerplanar graphs with maximum degree three
Labeling outerplanar graphs with maximum degree three Xiangwen Li 1 and Sanming Zhou 2 1 Department of Mathematics Huazhong Normal University, Wuhan 430079, China 2 Department of Mathematics and Statistics
Math Workshop October 2010 Fractions and Repeating Decimals
Math Workshop October 2010 Fractions and Repeating Decimals This evening we will investigate the patterns that arise when converting fractions to decimals. As an example of what we will be looking at,
FACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z
FACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z DANIEL BIRMAJER, JUAN B GIL, AND MICHAEL WEINER Abstract We consider polynomials with integer coefficients and discuss their factorization
4: EIGENVALUES, EIGENVECTORS, DIAGONALIZATION
4: EIGENVALUES, EIGENVECTORS, DIAGONALIZATION STEVEN HEILMAN Contents 1. Review 1 2. Diagonal Matrices 1 3. Eigenvectors and Eigenvalues 2 4. Characteristic Polynomial 4 5. Diagonalizability 6 6. Appendix:
CONTINUED FRACTIONS AND PELL S EQUATION. Contents 1. Continued Fractions 1 2. Solution to Pell s Equation 9 References 12
CONTINUED FRACTIONS AND PELL S EQUATION SEUNG HYUN YANG Abstract. In this REU paper, I will use some important characteristics of continued fractions to give the complete set of solutions to Pell s equation.
COMMUTATIVE RINGS. Definition: A domain is a commutative ring R that satisfies the cancellation law for multiplication:
COMMUTATIVE RINGS Definition: A commutative ring R is a set with two operations, addition and multiplication, such that: (i) R is an abelian group under addition; (ii) ab = ba for all a, b R (commutative
MATHEMATICAL EXCURSIONS Math and Bar Codes
MATHEMATICAL EXCURSIONS Math and Bar Codes If you examine most consumer products, you will find a small rectangular area with a pattern of black bars and white spaces of various widths on the packaging
Test1. Due Friday, March 13, 2015.
1 Abstract Algebra Professor M. Zuker Test1. Due Friday, March 13, 2015. 1. Euclidean algorithm and related. (a) Suppose that a and b are two positive integers and that gcd(a, b) = d. Find all solutions
THE NUMBER OF REPRESENTATIONS OF n OF THE FORM n = x 2 2 y, x > 0, y 0
THE NUMBER OF REPRESENTATIONS OF n OF THE FORM n = x 2 2 y, x > 0, y 0 RICHARD J. MATHAR Abstract. We count solutions to the Ramanujan-Nagell equation 2 y +n = x 2 for fixed positive n. The computational
1 The Brownian bridge construction
The Brownian bridge construction The Brownian bridge construction is a way to build a Brownian motion path by successively adding finer scale detail. This construction leads to a relatively easy proof
Digital Signatures. (Note that authentication of sender is also achieved by MACs.) Scan your handwritten signature and append it to the document?
Cryptography Digital Signatures Professor: Marius Zimand Digital signatures are meant to realize authentication of the sender nonrepudiation (Note that authentication of sender is also achieved by MACs.)
4/1/2017. PS. Sequences and Series FROM 9.2 AND 9.3 IN THE BOOK AS WELL AS FROM OTHER SOURCES. TODAY IS NATIONAL MANATEE APPRECIATION DAY
PS. Sequences and Series FROM 9.2 AND 9.3 IN THE BOOK AS WELL AS FROM OTHER SOURCES. TODAY IS NATIONAL MANATEE APPRECIATION DAY 1 Oh the things you should learn How to recognize and write arithmetic sequences
Math Circle Beginners Group October 18, 2015
Math Circle Beginners Group October 18, 2015 Warm-up problem 1. Let n be a (positive) integer. Prove that if n 2 is odd, then n is also odd. (Hint: Use a proof by contradiction.) Suppose that n 2 is odd
A characterization of trace zero symmetric nonnegative 5x5 matrices
A characterization of trace zero symmetric nonnegative 5x5 matrices Oren Spector June 1, 009 Abstract The problem of determining necessary and sufficient conditions for a set of real numbers to be the
P. Jeyanthi and N. Angel Benseera
Opuscula Math. 34, no. 1 (014), 115 1 http://dx.doi.org/10.7494/opmath.014.34.1.115 Opuscula Mathematica A TOTALLY MAGIC CORDIAL LABELING OF ONE-POINT UNION OF n COPIES OF A GRAPH P. Jeyanthi and N. Angel
Number of Divisors. Terms. Factors, prime factorization, exponents, Materials. Transparencies Activity Sheets Calculators
of Divisors Purpose: Participants will investigate the relationship between the prime-factored form of a number and its total number of factors. Overview: In small groups, participants will generate the
Computer and Network Security
MIT 6.857 Computer and Networ Security Class Notes 1 File: http://theory.lcs.mit.edu/ rivest/notes/notes.pdf Revision: December 2, 2002 Computer and Networ Security MIT 6.857 Class Notes by Ronald L. Rivest
Introduction to Algebraic Coding Theory
Introduction to Algebraic Coding Theory Supplementary material for Math 336 Cornell University Sarah A. Spence Contents 1 Introduction 1 2 Basics 2 2.1 Important code parameters..................... 4
Chapter Objectives. Chapter 9. Sequential Search. Search Algorithms. Search Algorithms. Binary Search
Chapter Objectives Chapter 9 Search Algorithms Data Structures Using C++ 1 Learn the various search algorithms Explore how to implement the sequential and binary search algorithms Discover how the sequential
RSA Question 2. Bob thinks that p and q are primes but p isn t. Then, Bob thinks Φ Bob :=(p-1)(q-1) = φ(n). Is this true?
RSA Question 2 Bob thinks that p and q are primes but p isn t. Then, Bob thinks Φ Bob :=(p-1)(q-1) = φ(n). Is this true? Bob chooses a random e (1 < e < Φ Bob ) such that gcd(e,φ Bob )=1. Then, d = e -1
A simple criterion on degree sequences of graphs
Discrete Applied Mathematics 156 (2008) 3513 3517 Contents lists available at ScienceDirect Discrete Applied Mathematics journal homepage: www.elsevier.com/locate/dam Note A simple criterion on degree
Doug Ravenel. October 15, 2008
Doug Ravenel University of Rochester October 15, 2008 s about Euclid s Some s about primes that every mathematician should know (Euclid, 300 BC) There are infinitely numbers. is very elementary, and we
Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 10
CS 70 Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 10 Introduction to Discrete Probability Probability theory has its origins in gambling analyzing card games, dice,
All trees contain a large induced subgraph having all degrees 1 (mod k)
All trees contain a large induced subgraph having all degrees 1 (mod k) David M. Berman, A.J. Radcliffe, A.D. Scott, Hong Wang, and Larry Wargo *Department of Mathematics University of New Orleans New
WHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT?
WHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT? introduction Many students seem to have trouble with the notion of a mathematical proof. People that come to a course like Math 216, who certainly