Math 609/597: Cryptography 1
|
|
- Lucinda Stevens
- 6 years ago
- Views:
Transcription
1 Math 609/597: Cryptography 1 The Solovay-Strasse Primality Test 12 October, 1993 Burt Roseberg Revised: 6 October, Itroductio We describe the Solovay-Strasse primality test. There is quite a bit of umber-theoretic backgroud ecessary to the full uderstadig of the algorithm, however, i practice it is very simple. It is also curious because it works icredibly quickly to give you a probably correct aswer, however o oe has foud a less tha expoetial-time algorithm to tell you for certai whether a umber is prime. The algorithm works by selectig radom itegers ad computig large powers of them i the rig Z/Z, where is the umber you wat to test. Also, the so called Jacobi symbol is calculated for these itegers. If ever these calculatios disagree, the is composite. For if were prime, the Jacobi symbol would i fact be the Legedre symbol, ad for the Legedre symbol equality of the two methods of calculatio is a theorem. It is ot ecessary for the two calculatios to disagree whe is composite, but it is likely. Half of the itegers betwee 1 ad 1 which are relatively prime to will make the calculatios disagree. (If we happe to choose a iteger which is ot relatively prime to, we are eve better off: we ot oly kow is composite, we have a o-trival factor!) Hece, the probablity that after k choices of a radom iteger you would wrogly proclaim a composite to be prime is less tha 1/2 k. I practice, the results are eve better. We by explaiig the Legedre Symbol, the exted the defiitio to the Jacobi Symbol. From there we apply the Jacobi Symbol to primality testig. Fially, a Pascal program is preseted. 2 Quadratic Residues Suppose p is a odd prime. I (Z/pZ), the group of ivertible elemets mod p, that is to say, Z/pZ without 0, half of the itegers are squares ad the rest are ot. This is quickly see by cosiderig the map x x 2. Each elemet a i the rage of this map receives exactly two elemets, amely, if b 2 a the ( b) 2 a, that is, if we ca assume that b b, which is equivalet to assumig p 2. The elemets which are squares are called quadratic residues, the rest are quadratic o-residues. Defiitio 1 (Legedre Symbol) For p a prime, ad b a positive iteger, The Legedre Symbol is defied by, [ ] b 0 if b ad p are ot relatively prime, 1 if b is a quadratic residue mod p, p 1 if b is a quadratic o-residue mod p If p is two, the the value of the Legedre Symbol is oe for ay odd b ad 0 else. For p a odd prime, we ca use this theorem: Theorem 1 For ay odd prime p ad ay positive iteger b, [ ] b b (p 1)/2 (mod p). p
2 Math 609/597: Cryptography 2 Proof: If (b, p) 1 the b 0 (mod p) ad the equality follows. We heceforth cosider itegers b relatively prime to p. It is quickly see that the set, A { a (Z/pZ) a (p 1)/2 1 (mod p) }, form a subgroup of (Z/pZ). Ay quadratic residue b a 2 is i A, sice, b (p 1)/2 a 2(p 1)/2 1 (mod p), by Little Fermat. We remarked above that half the elemets of (Z/pZ) are quadratic residues, hece A is of size either (p 1) ad (p 1)/2 (the order of a subgroup must divide the order of the group). The subgroup A does ot iclude ay geerator of the group, hece its size is ot (p 1). Therefore A cotais exactly the quadratic residues. O the other had, by Little Fermat, the square of b (p 1)/2 is 1, hece for those itegers relatively prime to p but outside of A, the power must evaluate to the oly other root of oe, that is, 1. There are several rules for computig with Legedre symbols, for istace: that the Legedre symbol depeds oly o the residue of b mod p, that the Legedre symbol of 1 over p is always 1, ad that, [ ] [ ] [ ] b1 b 2 b1 b2. p p p These are easy to verify. Two rules which are more difficult to show are: Theorem 2 For p a odd prime, [ ] 2 ( 1) (p2 1)/8 p { 1 if p ±1 (mod 8) 1 if p ±3 (mod 8) Theorem 3 (Law of Quadratic Reciprocity) For p ad q odd primes, [ ] [ ] { p q ( 1) (p 1)(q 1)/4 1 if p q 3 (mod 4) q p 1 else. For proofs see Neal Koblitz s A Course i Number Theory ad Cryptography, or for a echatigly elemetary proof, Adré Weil s Number Theory for Begiers. 3 Jacobi Symbols The Jacobi Symbol exteds the defiitio of the Legedre Symbol to deomiators other tha primes. I doig so, it loses the umber-theoretic iterpretatio, it o loger idicates which itegers are quadratic residues, ad it is o loger possible to calculate it by takig the umerator to a certai power mod the deomiator.
3 Math 609/597: Cryptography 3 Defiitio 2 (Jacobi Symbol) For ay positive iger, we defie the Jacobi symbol accordig to the prime decompositio of by, r ( α if p i m ) r [ ] αi m i, the. i1 Note immediately that the Jacobi symbol has values either 1, 1 or 0, ad it is zero oly if oe of its factors is zero, that is, m ad are ot relatively prime. Sice the Euclidea algorithm efficietly determies if two itegers are relatively prime, from the poit of view of calculatig the Jacobi symbol, attetio focuses o the case of m ad relatively prime. Theorem 4 For itegers ad m, ad factorizatios of 1 2 ad m m 1 m 2, the Jacobi symbols obeys: ( m1 m ) ( 2 m1 ) ( m2 ), ad ( ) ( ) ( ) m m m, Proof: For the first equivalece, write out the Jacobi symbol as a product of Legedre symbols, apply the rule, [ 1 ] [ 2 1 ] [ 2 ], m m m for Legedre symbols, the rearrage ad collect terms. For the secod equivalece, write out the Jacobi symbol accordig to its defiitio, the collect terms. Theorem 5 For ad m relatively prime ad odd, ( ) ( m ) ( 1) (m 1)( 1)/4. m Proof: Let i be the umber of prime factors i ad j the umber of prime factors i m, coutig multiplicity. We use iductio o i ad j. Whe i j 1, the basis case, the theorem is exactly the law of quadratic reciprocity. Assume ow that the theorem is true for ay i < I ad j < J, with I ad J greater tha oe. We show it is true for ay i < I + 1 ad j < J + 1. Let be a iteger with I + 1 factors. Write it as the product of two itegers 1 2 each havig less tha I factors, ad apply the iductio hypothesis to the factored Jacobi symbols: ( ) ( ) ( ) ( ) ( ) ( ) 1 2 m 1 2 m m m 1 2 m m 1 2 i1 ( 1) (1 1)(m 1)/4 ( 1) (2 1)(m 1)/4 p i ( 1) ( )(m 1)/4. Hece our product is 1 if both m ad are 3 mod 4, ad 1 else. Note that, sice 1 ad 2 are both odd, ( 1 1)( 2 1) is divisible by 4. Multiplig this out, we get mod 4. So the product is 1 if ad m are 3 mod 4, ad 1 else. That is, ( 1) ( )(m 1)/4 ( 1) ( 1)(m 1)/4,
4 Math 609/597: Cryptography 4 which proves the theorem for i I ad ad ay j < J. Swappig the role of ad m gives that the theorem is true for i I ad j J. Cotiuig by iductio, the theorem is true for all i ad j. I calculatig the Jacobi symbol we use the previous theorem ad reductio of the umerator modulo the deomiator to reduce step by step the calculatio, except if the umerator or deomiator is eve. If both are eve, the the result is zero. We ca throw out all factors of two of the deomiator, sice ay odd is a quadratic residue mod 2. If the umerator is eve, its factors of two are treated usig the followig theorem. Theorem 6 For ay odd iteger, ( ) 2 ( 1) (2 1)/8. Proof: Similar to the previous theorem, we use a iductio o the umber of elemets i the prime decompositio of. The basis case is is a prime, whe the Jacobi symbol equals the Legedre symbol ad the theorem is true by defiitio. Suppose the theorem is true for all which are the product of less tha I primes. Write, a product of I primes, as 1 2 ad calculate, usig the iductio hypothesis: ( ) ( ) ( ) ( 1) ( )/8 Note that a odd iteger is either 1 or 3 mod 4, so ay square of a odd iteger is 1 mod 4. Therefore ( 1 2 1)( 2 2 1) is zero mod 16. Multiplig this out we fid, (mod 16). Recall that m 2 1 is divisible by 8 for ay odd m, so 2 1 ad are equal ad both either 0 or 8 mod 16. I ay case, ( 1) ( )/8 ( 1) (2 1)/8, provig the theorem for ay iteger a product of I primes. Proceedig the iductio, we have the theorem for all odd. 4 Applicatio to Primality Testig The Jacobi symbol is used to test for primality of a give iteger by testig for agreemet betwee two calculatios, ( ) b (?) b ( 1)/2 (mod ), which, if is a prime, is a idetity for the Legedre symbol. If is ot a prime, however, either b will ot be relatively prime to, or the two calculatios might ot agree. How ofte they do ot agree is discussed ext.
5 Math 609/597: Cryptography 5 Theorem 7 For ay prime p, there is a geerator for (Z/p 2 Z). Proof: For ay prime p, there is a geerator g for (Z/pZ). Let h equal g or g(1 + p), depedig o whether or ot g p 1? 1 (mod p 2 ). If g p 1 1 (mod p 2 ), the (g(1 + p)) p (p 1)p + p 2 w 1 + p(p 1) (mod p 2 ), where w is some iteger. Hece h ca be chose so that its p 1 power mod p 2 is ot oe. Sice i either case h g (mod p), h is a geerator of (Z/pZ), We show that h is a geerator of (Z/p 2 Z). Let h j 1 (mod p 2 ). This this cogruece remais true modulo p, therefore (p 1) j. This beig so, we ca write j as j (p 1)j. But j must also divide the order of the group, j p(p 1), hece j p. Sice h p 1 is ot oe, j caot be oe, so it must be p. Therefore the order of h is the size of the group. Theorem 8 For ay odd composite, there is a b relatively prime to such that, ( ) b b ( 1)/2 (mod ). Proof: If p 2, for a prime p, let g geerate (Z/p 2 Z). Select a b such that b g (mod p 2 ) ad b 1 (mod q) for ay other distict prime q dividig. The existece of b is assured by the Chiese Remaider Theorem. If the equatio were true, the b 1 1 (mod ), which beig a cogruece remaiig true i Z/p 2 Z, would imply that p(p 1) ( 1). However, the p would divide both ad 1. So we ca suppose is square free. Let g be a quadratic o-residue i some Z/pZ where p. Select a b, agai by the Chiese Remaider theorem, such that b g (mod p) ad b 1 (mod q) for ay other prime q dividig. The it is impossible for b ( 1)/2 1 (mod ), else this would be true Z/qZ for those primes where b is oe. However, the rules of calculatio for the Jacobi symbol give: ( ) b ( b p ) q ( ) b 1. q We used that is odd i two places, that there are quadratic o-residues ad that 1 1 (mod q). Theorem 9 If is a odd composite, the for at least half of the itegers b relatively prime to i the iterval [1, 1], ( ) b b ( 1)/2 (mod ).
6 Math 609/597: Cryptography 6 Proof: Let A be the set of a for which (a, ) 1 ad the equality holds. Sice there is a b relatively prime to for which the equality does ot hold, take ay a A ad cosider ab. It is agai relatively prime to ad, ( a ) ( ) b a ( 1)/2 b ( 1)/2 (mod ) because we are iside the group (Z/Z). Hece we have that all of ba does ot satisfy the equality, ad hece A caot accout for more tha half the elemets i [1, 1]. 5 Program program SolovayStrasse (iput,output) ; fuctio gcd( a, b : iteger ) : iteger ; var t : iteger ; if a < 0 the a : - a ; if b < 0 the b : - b ; if a < b the t : a ; a : b ; b : t ; while b<>0 do t : a mod b ; a : b ; b : t ; gcd : a fuctio twofactor( var a : iteger ) : iteger ; var i : iteger ; i : 0 ; while ((a mod 2) 0 ) do i : i + 1 ; a : a div 2 ; twofactor : i ;
7 Math 609/597: Cryptography 7 fuctio jacobi( m, : iteger ) : iteger ; { assume (m,)1, is odd, 0 < m <. } var i, j, d : iteger ; i : 1 ; while (m>1) do { it could be zero or 1 to exit} j : twofactor( m ) ; if ( j mod 2 ) 1 the d : mod 8 ; if ( d 3 ) or ( d 5 ) the i : - i ; if ( (m mod 4) 3 ) AND ( ( mod 4 ) 3 ) the i : - i ; d : mod m ; : m ; m : d ; jacobi : i ; fuctio multiply( a, b, c : iteger ) : iteger ; { retur a * b mod c, without overflow by repeated doublig } { assume 0 < a, b < c } var i : iteger ; if (a0) the i : 0 else if (a mod 2) 1 the i : multiply( (a-1) div 2, b, c ) ; if ( (c - i ) > i ) the i : i + i else i : ( i - c ) + i ; if ( (c - i ) > b ) the i : i + b else i : ( i - c ) + b ; ed else
8 Math 609/597: Cryptography 8 i : multiply( a div 2, b, c ) ; if ( (c - i ) > i ) the i : i + i else i : ( i - c ) + i ; ed multiply : i ; fuctio fastexp( b, j, : iteger ) : iteger ; { take b to the j mod } var i : iteger32 ; if (j0) the i : 1 else if ( j mod 2 ) 1 the i : fastexp( b, (j-1) div 2, ) ; i : multiply( multiply( b, i, ), i, ) ; ed else i : fastexp( b, j div 2, ) ; i : multiply( i, i, ) ; fastexp : i fuctio primality( p, i : iteger ) : iteger ; { give a iteger p, test for primality, usig i iteratios of some umbers, here they are the umber 2, 3,..., i+1. Returs 0 if o cotradictio betwee the jacobi ad legedre symbols was foud. Else returs the evidece that p is composite, either a factor or a iteger such that the sumbols differ. } var j : iteger ; dl, dj : iteger ; b : boolea ; if (p<2) the j : 1 { ot prime } else if (p2) the j : 0 { prime } else if (p mod 2)0 the j : 2 { ot prime } else {Precoditio: p is odd, 3 or larger}
9 Math 609/597: Cryptography 9 {Check if i is uecessarily large, ad correct} if (i+1)>p the i : p-2 ; j : 1 ; b : false ; repeat j : j + 1 ; if (j > (i+1) ) the b : true else { test for o-trivial gcd } if gcd(j,p)>1 the b : true else { apply tests } dl : fastexp( j, (p-1) div 2, p ) ; if (dl<>1) the dl : dl - p ; dj : jacobi( j, p ) ; if ( dj<>dl) the b : true ; util b ; if (j > (i+1)) the {test ra to completio} j : 0 ; primality : j ; var i,j,k : iteger ; c : char ; write( Quit [y/]? ) ; readl(c) ; while (c<> y ) do writel( Primality test of p, i iteratios, ) ; write( p? ) ; readl(j) ; write( i? ) ; readl(i) ; k : primality( j, i ) ; if ( k 0 ) the writel(j:0, might be a prime. ) else writel(j:0, is ot a prime, fails test usig,k:0) ; write( Quit [y/]? ) ; readl(c) ; ed.
YALE UNIVERSITY DEPARTMENT OF COMPUTER SCIENCE
YALE UNIVERSITY DEPARTMENT OF COMPUTER SCIENCE CPSC 467a: Crytograhy ad Comuter Security Notes 16 (rev. 1 Professor M. J. Fischer November 3, 2008 68 Legedre Symbol Lecture Notes 16 ( Let be a odd rime,
More informationPrimality Test. Rong-Jaye Chen
Primality Test Rog-Jaye Che OUTLINE [1] Modular Arithmetic Algorithms [2] Quadratic Residues [3] Primality Testig p2. [1] Modular Arithmetic Algorithms 1. The itegers a divides b a b a{ 1, b} If b has
More informationMATH 304: MIDTERM EXAM SOLUTIONS
MATH 304: MIDTERM EXAM SOLUTIONS [The problems are each worth five poits, except for problem 8, which is worth 8 poits. Thus there are 43 possible poits.] 1. Use the Euclidea algorithm to fid the greatest
More informationTrial division, Pollard s p 1, Pollard s ρ, and Fermat s method. Christopher Koch 1. April 8, 2014
Iteger Divisio Algorithm ad Cogruece Iteger Trial divisio,,, ad with itegers mod Iverses mod Multiplicatio ad GCD Iteger Christopher Koch 1 1 Departmet of Computer Sciece ad Egieerig CSE489/589 Algorithms
More informationInfinite Sequences and Series
Chapter 6 Ifiite Sequeces ad Series 6.1 Ifiite Sequeces 6.1.1 Elemetary Cocepts Simply speakig, a sequece is a ordered list of umbers writte: {a 1, a 2, a 3,...a, a +1,...} where the elemets a i represet
More informationMATH 324 Summer 2006 Elementary Number Theory Solutions to Assignment 2 Due: Thursday July 27, 2006
MATH 34 Summer 006 Elemetary Number Theory Solutios to Assigmet Due: Thursday July 7, 006 Departmet of Mathematical ad Statistical Scieces Uiversity of Alberta Questio [p 74 #6] Show that o iteger of the
More informationand each factor on the right is clearly greater than 1. which is a contradiction, so n must be prime.
MATH 324 Summer 200 Elemetary Number Theory Solutios to Assigmet 2 Due: Wedesday July 2, 200 Questio [p 74 #6] Show that o iteger of the form 3 + is a prime, other tha 2 = 3 + Solutio: If 3 + is a prime,
More informationBertrand s Postulate
Bertrad s Postulate Lola Thompso Ross Program July 3, 2009 Lola Thompso (Ross Program Bertrad s Postulate July 3, 2009 1 / 33 Bertrad s Postulate I ve said it oce ad I ll say it agai: There s always a
More informationChapter 4. Fourier Series
Chapter 4. Fourier Series At this poit we are ready to ow cosider the caoical equatios. Cosider, for eample the heat equatio u t = u, < (4.) subject to u(, ) = si, u(, t) = u(, t) =. (4.) Here,
More informationThe Structure of Z p when p is Prime
LECTURE 13 The Structure of Z p whe p is Prime Theorem 131 If p > 1 is a iteger, the the followig properties are equivalet (1) p is prime (2) For ay [0] p i Z p, the equatio X = [1] p has a solutio i Z
More informationNICK DUFRESNE. 1 1 p(x). To determine some formulas for the generating function of the Schröder numbers, r(x) = a(x) =
AN INTRODUCTION TO SCHRÖDER AND UNKNOWN NUMBERS NICK DUFRESNE Abstract. I this article we will itroduce two types of lattice paths, Schröder paths ad Ukow paths. We will examie differet properties of each,
More information6.3 Testing Series With Positive Terms
6.3. TESTING SERIES WITH POSITIVE TERMS 307 6.3 Testig Series With Positive Terms 6.3. Review of what is kow up to ow I theory, testig a series a i for covergece amouts to fidig the i= sequece of partial
More informationPROBLEM SET 5 SOLUTIONS. Solution. We prove that the given congruence equation has no solutions. Suppose for contradiction that. (x 2) 2 1 (mod 7).
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
More informationJacobi symbols. p 1. Note: The Jacobi symbol does not necessarily distinguish between quadratic residues and nonresidues. That is, we could have ( a
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
More informationCSE 1400 Applied Discrete Mathematics Number Theory and Proofs
CSE 1400 Applied Discrete Mathematics Number Theory ad Proofs Departmet of Computer Scieces College of Egieerig Florida Tech Sprig 01 Problems for Number Theory Backgroud Number theory is the brach of
More informationSquare-Congruence Modulo n
Square-Cogruece Modulo Abstract This paper is a ivestigatio of a equivalece relatio o the itegers that was itroduced as a exercise i our Discrete Math class. Part I - Itro Defiitio Two itegers are Square-Cogruet
More information(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
MATH 337 Sequeces Dr. Neal, WKU Let X be a metric space with distace fuctio d. We shall defie the geeral cocept of sequece ad limit i a metric space, the apply the results i particular to some special
More informationTHE ASYMPTOTIC COMPLEXITY OF MATRIX REDUCTION OVER FINITE FIELDS
THE ASYMPTOTIC COMPLEXITY OF MATRIX REDUCTION OVER FINITE FIELDS DEMETRES CHRISTOFIDES Abstract. Cosider a ivertible matrix over some field. The Gauss-Jorda elimiatio reduces this matrix to the idetity
More informationMAT 271 Project: Partial Fractions for certain rational functions
MAT 7 Project: Partial Fractios for certai ratioal fuctios Prerequisite kowledge: partial fractios from MAT 7, a very good commad of factorig ad complex umbers from Precalculus. To complete this project,
More informationSOME TRIBONACCI IDENTITIES
Mathematics Today Vol.7(Dec-011) 1-9 ISSN 0976-38 Abstract: SOME TRIBONACCI IDENTITIES Shah Devbhadra V. Sir P.T.Sarvajaik College of Sciece, Athwalies, Surat 395001. e-mail : drdvshah@yahoo.com The sequece
More informationCALCULATION OF FIBONACCI VECTORS
CALCULATION OF FIBONACCI VECTORS Stuart D. Aderso Departmet of Physics, Ithaca College 953 Daby Road, Ithaca NY 14850, USA email: saderso@ithaca.edu ad Dai Novak Departmet of Mathematics, Ithaca College
More informationIn number theory we will generally be working with integers, though occasionally fractions and irrationals will come into play.
Number Theory Math 5840 otes. Sectio 1: Axioms. I umber theory we will geerally be workig with itegers, though occasioally fractios ad irratioals will come ito play. Notatio: Z deotes the set of all itegers
More informationPROPERTIES OF THE POSITIVE INTEGERS
PROPERTIES OF THE POSITIVE ITEGERS The first itroductio to mathematics occurs at the pre-school level ad cosists of essetially coutig out the first te itegers with oe s figers. This allows the idividuals
More informationMa 530 Introduction to Power Series
Ma 530 Itroductio to Power Series Please ote that there is material o power series at Visual Calculus. Some of this material was used as part of the presetatio of the topics that follow. What is a Power
More informationSolutions to Math 347 Practice Problems for the final
Solutios to Math 347 Practice Problems for the fial 1) True or False: a) There exist itegers x,y such that 50x + 76y = 6. True: the gcd of 50 ad 76 is, ad 6 is a multiple of. b) The ifiimum of a set is
More informationA Simple Derivation for the Frobenius Pseudoprime Test
A Simple Derivatio for the Frobeius Pseudoprime Test Daiel Loebeberger Bo-Aache Iteratioal Ceter for Iformatio Techology March 17, 2008 Abstract Probabilistic compositeess tests are of great practical
More information6 Integers Modulo n. integer k can be written as k = qn + r, with q,r, 0 r b. So any integer.
6 Itegers Modulo I Example 2.3(e), we have defied the cogruece of two itegers a,b with respect to a modulus. Let us recall that a b (mod ) meas a b. We have proved that cogruece is a equivalece relatio
More informationStatistics 511 Additional Materials
Cofidece Itervals o mu Statistics 511 Additioal Materials This topic officially moves us from probability to statistics. We begi to discuss makig ifereces about the populatio. Oe way to differetiate probability
More informationMath 155 (Lecture 3)
Math 55 (Lecture 3) September 8, I this lecture, we ll cosider the aswer to oe of the most basic coutig problems i combiatorics Questio How may ways are there to choose a -elemet subset of the set {,,,
More informationUNITARY HARMONIC NUMBERS. CHARLES R. WALL Trident Technical College, Charleston, SC (Submitted October 1981) 1. INTRODUCTION
CHARLES R. WALL Tridet Techical College, Charlesto, SC 911 (Submitted October 1981) 1. INTRODUCTION Ore [] ivestigated the harmoic mea H() of the divisors of ad showed that H() x () I'o(), where,
More informationMath F215: Induction April 7, 2013
Math F25: Iductio April 7, 203 Iductio is used to prove that a collectio of statemets P(k) depedig o k N are all true. A statemet is simply a mathematical phrase that must be either true or false. Here
More informationSeunghee Ye Ma 8: Week 5 Oct 28
Week 5 Summary I Sectio, we go over the Mea Value Theorem ad its applicatios. I Sectio 2, we will recap what we have covered so far this term. Topics Page Mea Value Theorem. Applicatios of the Mea Value
More information62. Power series Definition 16. (Power series) Given a sequence {c n }, the series. c n x n = c 0 + c 1 x + c 2 x 2 + c 3 x 3 +
62. Power series Defiitio 16. (Power series) Give a sequece {c }, the series c x = c 0 + c 1 x + c 2 x 2 + c 3 x 3 + is called a power series i the variable x. The umbers c are called the coefficiets of
More informationChapter 6 Principles of Data Reduction
Chapter 6 for BST 695: Special Topics i Statistical Theory. Kui Zhag, 0 Chapter 6 Priciples of Data Reductio Sectio 6. Itroductio Goal: To summarize or reduce the data X, X,, X to get iformatio about a
More informationDIVISIBILITY PROPERTIES OF GENERALIZED FIBONACCI POLYNOMIALS
DIVISIBILITY PROPERTIES OF GENERALIZED FIBONACCI POLYNOMIALS VERNER E. HOGGATT, JR. Sa Jose State Uiversity, Sa Jose, Califoria 95192 ad CALVIN T. LONG Washigto State Uiversity, Pullma, Washigto 99163
More informationSummary: Congruences. j=1. 1 Here we use the Mathematica syntax for the function. In Maple worksheets, the function
Summary: Cogrueces j whe divided by, ad determiig the additive order of a iteger mod. As described i the Prelab sectio, cogrueces ca be thought of i terms of coutig with rows, ad for some questios this
More informationInduction: Solutions
Writig Proofs Misha Lavrov Iductio: Solutios Wester PA ARML Practice March 6, 206. Prove that a 2 2 chessboard with ay oe square removed ca always be covered by shaped tiles. Solutio : We iduct o. For
More informationPERIODS OF FIBONACCI SEQUENCES MODULO m. 1. Preliminaries Definition 1. A generalized Fibonacci sequence is an infinite complex sequence (g n ) n Z
PERIODS OF FIBONACCI SEQUENCES MODULO m ARUDRA BURRA Abstract. We show that the Fiboacci sequece modulo m eriodic for all m, ad study the eriod i terms of the modulus.. Prelimiaries Defiitio. A geeralized
More informationZeros of Polynomials
Math 160 www.timetodare.com 4.5 4.6 Zeros of Polyomials I these sectios we will study polyomials algebraically. Most of our work will be cocered with fidig the solutios of polyomial equatios of ay degree
More informationSOLVED EXAMPLES
Prelimiaries Chapter PELIMINAIES Cocept of Divisibility: A o-zero iteger t is said to be a divisor of a iteger s if there is a iteger u such that s tu I this case we write t s (i) 6 as ca be writte as
More informationExam 2 CMSC 203 Fall 2009 Name SOLUTION KEY Show All Work! 1. (16 points) Circle T if the corresponding statement is True or F if it is False.
1 (1 poits) Circle T if the correspodig statemet is True or F if it is False T F For ay positive iteger,, GCD(, 1) = 1 T F Every positive iteger is either prime or composite T F If a b mod p, the (a/p)
More informationTopic 9: Sampling Distributions of Estimators
Topic 9: Samplig Distributios of Estimators Course 003, 2018 Page 0 Samplig distributios of estimators Sice our estimators are statistics (particular fuctios of radom variables), their distributio ca be
More informationThe multiplicative structure of finite field and a construction of LRC
IERG6120 Codig for Distributed Storage Systems Lecture 8-06/10/2016 The multiplicative structure of fiite field ad a costructio of LRC Lecturer: Keeth Shum Scribe: Zhouyi Hu Notatios: We use the otatio
More informationCHAPTER 10 INFINITE SEQUENCES AND SERIES
CHAPTER 10 INFINITE SEQUENCES AND SERIES 10.1 Sequeces 10.2 Ifiite Series 10.3 The Itegral Tests 10.4 Compariso Tests 10.5 The Ratio ad Root Tests 10.6 Alteratig Series: Absolute ad Coditioal Covergece
More information3.2.4 Integer and Number Theoretical Functions
418 3. Advaced Mathematics i Mathematica 3.2.4 Iteger ad Number Theoretical Fuctios Mod[k, ] k modulo (positive remaider from dividig k by ) Quotiet[m, ] the quotiet of m ad (iteger part of m/) GCD[ 1,
More informationSequences and Series of Functions
Chapter 6 Sequeces ad Series of Fuctios 6.1. Covergece of a Sequece of Fuctios Poitwise Covergece. Defiitio 6.1. Let, for each N, fuctio f : A R be defied. If, for each x A, the sequece (f (x)) coverges
More informationThe picture in figure 1.1 helps us to see that the area represents the distance traveled. Figure 1: Area represents distance travelled
1 Lecture : Area Area ad distace traveled Approximatig area by rectagles Summatio The area uder a parabola 1.1 Area ad distace Suppose we have the followig iformatio about the velocity of a particle, how
More information[ 47 ] then T ( m ) is true for all n a. 2. The greatest integer function : [ ] is defined by selling [ x]
[ 47 ] Number System 1. Itroductio Pricile : Let { T ( ) : N} be a set of statemets, oe for each atural umber. If (i), T ( a ) is true for some a N ad (ii) T ( k ) is true imlies T ( k 1) is true for all
More informationFactoring Algorithms and Other Attacks on the RSA 1/12
Factorig Algorithms ad Other Attacks o the RSA T-79550 Cryptology Lecture 8 April 8, 008 Kaisa Nyberg Factorig Algorithms ad Other Attacks o the RSA / The Pollard p Algorithm Let B be a positive iteger
More informationRecurrence Relations
Recurrece Relatios Aalysis of recursive algorithms, such as: it factorial (it ) { if (==0) retur ; else retur ( * factorial(-)); } Let t be the umber of multiplicatios eeded to calculate factorial(). The
More information11. FINITE FIELDS. Example 1: The following tables define addition and multiplication for a field of order 4.
11. FINITE FIELDS 11.1. A Field With 4 Elemets Probably the oly fiite fields which you ll kow about at this stage are the fields of itegers modulo a prime p, deoted by Z p. But there are others. Now although
More informationMath 61CM - Solutions to homework 3
Math 6CM - Solutios to homework 3 Cédric De Groote October 2 th, 208 Problem : Let F be a field, m 0 a fixed oegative iteger ad let V = {a 0 + a x + + a m x m a 0,, a m F} be the vector space cosistig
More informationACCESS TO SCIENCE, ENGINEERING AND AGRICULTURE: MATHEMATICS 1 MATH00030 SEMESTER / Statistics
ACCESS TO SCIENCE, ENGINEERING AND AGRICULTURE: MATHEMATICS 1 MATH00030 SEMESTER 1 018/019 DR. ANTHONY BROWN 8. Statistics 8.1. Measures of Cetre: Mea, Media ad Mode. If we have a series of umbers the
More informationIt is always the case that unions, intersections, complements, and set differences are preserved by the inverse image of a function.
MATH 532 Measurable Fuctios Dr. Neal, WKU Throughout, let ( X, F, µ) be a measure space ad let (!, F, P ) deote the special case of a probability space. We shall ow begi to study real-valued fuctios defied
More informationChapter 0. Review of set theory. 0.1 Sets
Chapter 0 Review of set theory Set theory plays a cetral role i the theory of probability. Thus, we will ope this course with a quick review of those otios of set theory which will be used repeatedly.
More informationMath 140A Elementary Analysis Homework Questions 1
Math 14A Elemetary Aalysis Homewor Questios 1 1 Itroductio 1.1 The Set N of Natural Numbers 1 Prove that 1 2 2 2 2 1 ( 1(2 1 for all atural umbers. 2 Prove that 3 11 (8 5 4 2 for all N. 4 (a Guess a formula
More informationTEACHER CERTIFICATION STUDY GUIDE
COMPETENCY 1. ALGEBRA SKILL 1.1 1.1a. ALGEBRAIC STRUCTURES Kow why the real ad complex umbers are each a field, ad that particular rigs are ot fields (e.g., itegers, polyomial rigs, matrix rigs) Algebra
More informationFrequentist Inference
Frequetist Iferece The topics of the ext three sectios are useful applicatios of the Cetral Limit Theorem. Without kowig aythig about the uderlyig distributio of a sequece of radom variables {X i }, for
More informationCongruence Modulo a. Since,
Cogruece Modulo - 03 The [ ] equivalece classes refer to the Differece of quares relatio ab if a -b o defied as Theorem 3 - Phi is Periodic, a, [ a ] [ a] The period is Let ad a We must show ( a ) a ice,
More information1. By using truth tables prove that, for all statements P and Q, the statement
Author: Satiago Salazar Problems I: Mathematical Statemets ad Proofs. By usig truth tables prove that, for all statemets P ad Q, the statemet P Q ad its cotrapositive ot Q (ot P) are equivalet. I example.2.3
More informationMath 61CM - Solutions to homework 1
Math 61CM - Solutios to homework 1 Cédric De Groote October 1 st, 2018 Problem 1: Use mathematical iductio to check the validity of the formula j 3 = 2 ( + 1) 2 for = 1, 2,.... Note: The priciple of mathematical
More informationComplex Numbers Solutions
Complex Numbers Solutios Joseph Zoller February 7, 06 Solutios. (009 AIME I Problem ) There is a complex umber with imagiary part 64 ad a positive iteger such that Fid. [Solutio: 697] 4i + + 4i. 4i 4i
More informationTopic 9: Sampling Distributions of Estimators
Topic 9: Samplig Distributios of Estimators Course 003, 2016 Page 0 Samplig distributios of estimators Sice our estimators are statistics (particular fuctios of radom variables), their distributio ca be
More informationBasic Sets. Functions. MTH299 - Examples. Example 1. Let S = {1, {2, 3}, 4}. Indicate whether each statement is true or false. (a) S = 4. (e) 2 S.
Basic Sets Example 1. Let S = {1, {2, 3}, 4}. Idicate whether each statemet is true or false. (a) S = 4 (b) {1} S (c) {2, 3} S (d) {1, 4} S (e) 2 S. (f) S = {1, 4, {2, 3}} (g) S Example 2. Compute the
More informationRandom Models. Tusheng Zhang. February 14, 2013
Radom Models Tusheg Zhag February 14, 013 1 Radom Walks Let me describe the model. Radom walks are used to describe the motio of a movig particle (object). Suppose that a particle (object) moves alog the
More information1 Generating functions for balls in boxes
Math 566 Fall 05 Some otes o geeratig fuctios Give a sequece a 0, a, a,..., a,..., a geeratig fuctio some way of represetig the sequece as a fuctio. There are may ways to do this, with the most commo ways
More informationCS / MCS 401 Homework 3 grader solutions
CS / MCS 401 Homework 3 grader solutios assigmet due July 6, 016 writte by Jāis Lazovskis maximum poits: 33 Some questios from CLRS. Questios marked with a asterisk were ot graded. 1 Use the defiitio of
More informationSequences A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence
Sequeces A sequece of umbers is a fuctio whose domai is the positive itegers. We ca see that the sequece 1, 1, 2, 2, 3, 3,... is a fuctio from the positive itegers whe we write the first sequece elemet
More informationStochastic Matrices in a Finite Field
Stochastic Matrices i a Fiite Field Abstract: I this project we will explore the properties of stochastic matrices i both the real ad the fiite fields. We first explore what properties 2 2 stochastic matrices
More informationDirichlet s Theorem on Arithmetic Progressions
Dirichlet s Theorem o Arithmetic Progressios Athoy Várilly Harvard Uiversity, Cambridge, MA 0238 Itroductio Dirichlet s theorem o arithmetic progressios is a gem of umber theory. A great part of its beauty
More informationLecture 9: Pseudo-random generators against space bounded computation,
Lecture 9: Pseudo-radom geerators agaist space bouded computatio, Primality Testig Topics i Pseudoradomess ad Complexity (Sprig 2018) Rutgers Uiversity Swastik Kopparty Scribes: Harsha Tirumala, Jiyu Zhag
More informationFermat 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.
Departmet of Mathematical Scieces Istructor: Daiva Puciskaite Discrete Mathematics Fermat s Little Theorem 43.. For all a Z 3, calculate a 2 ad a 3. Case a = 0. 0 0 2-times Case a 0. 0 0 3-times a a 2-times
More informationA sequence of numbers is a function whose domain is the positive integers. We can see that the sequence
Sequeces A sequece of umbers is a fuctio whose domai is the positive itegers. We ca see that the sequece,, 2, 2, 3, 3,... is a fuctio from the positive itegers whe we write the first sequece elemet as
More informationIntroduction to Computational Biology Homework 2 Solution
Itroductio to Computatioal Biology Homework 2 Solutio Problem 1: Cocave gap pealty fuctio Let γ be a gap pealty fuctio defied over o-egative itegers. The fuctio γ is called sub-additive iff it satisfies
More informationMath 140A Elementary Analysis Homework Questions 3-1
Math 0A Elemetary Aalysis Homework Questios -.9 Limits Theorems for Sequeces Suppose that lim x =, lim y = 7 ad that all y are o-zero. Detarime the followig limits: (a) lim(x + y ) (b) lim y x y Let s
More informationThe Random Walk For Dummies
The Radom Walk For Dummies Richard A Mote Abstract We look at the priciples goverig the oe-dimesioal discrete radom walk First we review five basic cocepts of probability theory The we cosider the Beroulli
More informationInjections, Surjections, and the Pigeonhole Principle
Ijectios, Surjectios, ad the Pigeohole Priciple 1 (10 poits Here we will come up with a sloppy boud o the umber of parethesisestigs (a (5 poits Describe a ijectio from the set of possible ways to est pairs
More informationMath 4400/6400 Homework #7 solutions
MATH 4400 problems. Math 4400/6400 Homewor #7 solutios 1. Let p be a prime umber. Show that the order of 1 + p modulo p 2 is exactly p. Hit: Expad (1 + p) p by the biomial theorem, ad recall from MATH
More informationSolutions to Problem Set 8
8.78 Solutios to Problem Set 8. We ow that ( ) ( + x) x. Now we plug i x, ω, ω ad add the three equatios. If 3 the we ll get a cotributio of + ω + ω + ω + ω 0, whereas if 3 we ll get a cotributio of +
More informationTopic 9: Sampling Distributions of Estimators
Topic 9: Samplig Distributios of Estimators Course 003, 2018 Page 0 Samplig distributios of estimators Sice our estimators are statistics (particular fuctios of radom variables), their distributio ca be
More informationProof of Goldbach s Conjecture. Reza Javaherdashti
Proof of Goldbach s Cojecture Reza Javaherdashti farzijavaherdashti@gmail.com Abstract After certai subsets of Natural umbers called Rage ad Row are defied, we assume (1) there is a fuctio that ca produce
More informationUSA Mathematical Talent Search Round 3 Solutions Year 27 Academic Year
/3/27. Fill i each space of the grid with either a or a so that all sixtee strigs of four cosecutive umbers across ad dow are distict. You do ot eed to prove that your aswer is the oly oe possible; you
More informationRecursive Algorithms. Recurrences. Recursive Algorithms Analysis
Recursive Algorithms Recurreces Computer Sciece & Egieerig 35: Discrete Mathematics Christopher M Bourke cbourke@cseuledu A recursive algorithm is oe i which objects are defied i terms of other objects
More informationMATH 205 HOMEWORK #2 OFFICIAL SOLUTION. (f + g)(x) = f(x) + g(x) = f( x) g( x) = (f + g)( x)
MATH 205 HOMEWORK #2 OFFICIAL SOLUTION Problem 2: Do problems 7-9 o page 40 of Hoffma & Kuze. (7) We will prove this by cotradictio. Suppose that W 1 is ot cotaied i W 2 ad W 2 is ot cotaied i W 1. The
More informationMA131 - Analysis 1. Workbook 3 Sequences II
MA3 - Aalysis Workbook 3 Sequeces II Autum 2004 Cotets 2.8 Coverget Sequeces........................ 2.9 Algebra of Limits......................... 2 2.0 Further Useful Results........................
More informationHomework 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
Homewor 3 Chapter 5 pp53: 3 40 45 Chapter 6 p85: 4 6 4 30 Use combiatorial reasoig to prove the idetity 3 3 Proof Let S be a set of elemets ad let a b c be distict elemets of S The umber of -subsets of
More informationLecture 10: Mathematical Preliminaries
Lecture : Mathematical Prelimiaries Obective: Reviewig mathematical cocepts ad tools that are frequetly used i the aalysis of algorithms. Lecture # Slide # I this
More informationFind a formula for the exponential function whose graph is given , 1 2,16 1, 6
Math 4 Activity (Due by EOC Apr. ) Graph the followig epoetial fuctios by modifyig the graph of f. Fid the rage of each fuctio.. g. g. g 4. g. g 6. g Fid a formula for the epoetial fuctio whose graph is
More informationINFINITE SEQUENCES AND SERIES
11 INFINITE SEQUENCES AND SERIES INFINITE SEQUENCES AND SERIES 11.4 The Compariso Tests I this sectio, we will lear: How to fid the value of a series by comparig it with a kow series. COMPARISON TESTS
More informationThe Boolean Ring of Intervals
MATH 532 Lebesgue Measure Dr. Neal, WKU We ow shall apply the results obtaied about outer measure to the legth measure o the real lie. Throughout, our space X will be the set of real umbers R. Whe ecessary,
More informationsubcaptionfont+=small,labelformat=parens,labelsep=space,skip=6pt,list=0,hypcap=0 subcaption ALGEBRAIC COMBINATORICS LECTURE 8 TUESDAY, 2/16/2016
subcaptiofot+=small,labelformat=pares,labelsep=space,skip=6pt,list=0,hypcap=0 subcaptio ALGEBRAIC COMBINATORICS LECTURE 8 TUESDAY, /6/06. Self-cojugate Partitios Recall that, give a partitio λ, we may
More informationFirst, note that the LS residuals are orthogonal to the regressors. X Xb X y = 0 ( normal equations ; (k 1) ) So,
0 2. OLS Part II The OLS residuals are orthogoal to the regressors. If the model icludes a itercept, the orthogoality of the residuals ad regressors gives rise to three results, which have limited practical
More informationThe structure of finite rings. The multiplicative residues. Modular exponentiation. and finite exponentiation
The structure of fiite rigs ad fiite expoetiatio The multiplicative residues We have see that the fiite rig Z p is a field, that is, every o-zero elemet of Z p has a multiplicative iverse It is a covetio
More information[ 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.
[ 11 ] 1 1.1 Polyomial Fuctios 1 Algebra Ay fuctio f ( x) ax a1x... a1x a0 is a polyomial fuctio if ai ( i 0,1,,,..., ) is a costat which belogs to the set of real umbers ad the idices,, 1,...,1 are atural
More information(b) What is the probability that a particle reaches the upper boundary n before the lower boundary m?
MATH 529 The Boudary Problem The drukard s walk (or boudary problem) is oe of the most famous problems i the theory of radom walks. Oe versio of the problem is described as follows: Suppose a particle
More information(ii) Two-permutations of {a, b, c}. Answer. (B) P (3, 3) = 3! (C) 3! = 6, and there are 6 items in (A). ... Answer.
SOLUTIONS Homewor 5 Due /6/19 Exercise. (a Cosider the set {a, b, c}. For each of the followig, (A list the objects described, (B give a formula that tells you how may you should have listed, ad (C verify
More informationMath 220A Fall 2007 Homework #2. Will Garner A
Math 0A Fall 007 Homewor # Will Garer Pg 3 #: Show that {cis : a o-egative iteger} is dese i T = {z œ : z = }. For which values of q is {cis(q): a o-egative iteger} dese i T? To show that {cis : a o-egative
More informationarxiv: v1 [math.nt] 10 Dec 2014
A DIGITAL BINOMIAL THEOREM HIEU D. NGUYEN arxiv:42.38v [math.nt] 0 Dec 204 Abstract. We preset a triagle of coectios betwee the Sierpisi triagle, the sum-of-digits fuctio, ad the Biomial Theorem via a
More informationMT5821 Advanced Combinatorics
MT5821 Advaced Combiatorics 1 Coutig subsets I this sectio, we cout the subsets of a -elemet set. The coutig umbers are the biomial coefficiets, familiar objects but there are some ew thigs to say about
More informationMath 475, Problem Set #12: Answers
Math 475, Problem Set #12: Aswers A. Chapter 8, problem 12, parts (b) ad (d). (b) S # (, 2) = 2 2, sice, from amog the 2 ways of puttig elemets ito 2 distiguishable boxes, exactly 2 of them result i oe
More information