Save this PDF as:

Size: px
Start display at page:

Transcription

1 Chapter 6 A N ovel Solution Of Linear Congruenes Proeedings NCUR IX. (1995), Vol. II, pp. 708{712 Jerey F. Gold Department of Mathematis, Department of Physis University of Utah Salt Lake City, Utah DonH.Tuker Department of Mathematis University of Utah Salt Lake City, Utah Introdution Although the solutions of linear ongruenes have been of interest for a very long time, they still remain somewhat pedagogially diult. Beause of the importane of linear ongruenes in elds suh as publi-key ryptosystems, new and innovative approahes are needed both to attrat interest and to make them more aessible. While the potential for new ideas used in future researh is diult to assess, some use may be found here. In this paper, the authors make use of the remodulization method developed in [1] as a vehile to haraterize the onditions under whih solutions exist and then determine the solution spae. The method is more eient than those ited in the standard referenes. This novel approah relates the solution spae of x a mod b to the Euler totient funtion for rather than that 1

2 CHAPTER 6. A NOVEL SOLUTION OF LINEAR CONGRUENCES 2 of b, whih allows one to develop an alternative and somewhat more eient approah to the problem of reating eniphering and deiphering keys in publikey ryptosystems. Remodulization Denition 1 If a and b are integers, then a mod b = fa; a 6 b; a 6 2b;:::g : The notation x amodb, means that x is an element of the set a mod b. The ommon terminology is to say that x is ongruent to a modulo b. These sets are also frequently alled residue lasses sine they onsist of those integers whih, upon division by b, leave a remainder (residue) of a. It is ustomary to write a as the least non-negative residue. Denition 2 If a 1,a 2,:::,a n,b 2 Z, then [ a 1 ;a 2 ;::: ;a n ]modb = fa 1 mod bg[fa 2 mod bg[1 1 1[fa n mod bg = Theorem 1 Suppose a, b, and 2 Z and >0, then a mod b =[a; a + b; : : : ; a + b( 0 1)] mod b : n[ i=1 fa i mod bg : Proof. Write a mod b = f ::: a 0 b; a 0 ( 0 1)b; ::: a 0 b; a; a + b; ::: a +( 0 1)b; a + b; a +( +1)b; ::: a +(2 0 1)b; ::: g and upon rewriting the olumns, a mod b = f ::: a 0 b; a + b 0 b; ::: a +( 0 1)b 0 b; a; a + b; ::: a +( 0 1)b; a + b; a + b + b; ::: a +( 0 1)b + b; ::: g and forming unions on the extended olumns, the result follows. This proess is alled remodulization by the fator.

3 CHAPTER 6. A NOVEL SOLUTION OF LINEAR CONGRUENCES 3 Linear Congruenes Theorem 2 A linear ongruene x a mod b, where gd(;b) = 1, has as unique solution x a 0 mod b, where a 0 2f a+bk g 01. k=0 Proof. Suppose one has the linear ongruene, x a mod b; where gd(; b) = 1 and 0 <<b. (If does not satisfy this requirement, then may be redued or augmented by some multiple of b so that it satises the ondition 0 <<b.) Remodulizing a mod b by the fator gives x [a; a + b; : : : ; a + b( 0 1)] modb : Beause the set fa; a + b; : : : ; a + b( 0 1)g forms a omplete residue system modulo, there exists an element in this set, all it d, whih is divisible by. Sine x [a; a + b; : : : ; d; : : : ; a + b( 0 1)] mod b ; it is seen that the only solvable linear ongruene is The remaining linear ongruenes, x d mod b : x [ a; a + b; : : : ; d 0 b; d + b; : : : ; a + b ( 0 1)] mod b are not solvable, sine in eah ase the fator is pairwise relatively prime with the residues fa; a + b;::: ;d0 b; d + b; : : : ; a+ b( 01)g, and thus does not divide them. For the solution x d mod b, however, dividing through by the fator, or, x d mod b x d mod b: Note that the Eulidean algorithm has not been invoked; all that was neessary to solve this problem was the fat that gd(; b) = 1. The theorem is illustrated by the following example.

4 CHAPTER 6. A NOVEL SOLUTION OF LINEAR CONGRUENCES 4 Example 1 Suppose 12x 3 mod 7; this redues to 5x 3 mod 7. This linear ongruene issolvable sine 3 is divisible by gd(5; 7) = 1. Remodulizing 3mod7by the fator 5 gives so that 5x [3; 10; 17; 24; 31] mod x 10 mod 35 is the only possible solution and, upon dividing all three terms by 5, x 2mod7: Note that the remaining linear ongruenes 5x [3; 17; 24; 31] mod 35 do not admit any solutions, sine in this example gd(5; 35) = 5 does not divide any element in the set f3; 17; 24; 31g. Theorem 3 If gd(; b) =d and dja, then the linear ongruene x amodb, has d distint (inongruent) solutions modulo b. Proof. In the event gd(; b) = d, then a must be divisible by d, otherwise, the linear ongruene will not admit integer solutions. With that in mind, write = 0 d, a = a 0 d,andb = b 0 d. If all three terms of the original linear ongruene are divided by d, 0 x a 0 mod b 0 : Sine gd( 0 ;b 0 ) = 1, the resulting linear ongruene has a solution x x 0 mod b 0. However, the modulus of the original ongruene is b = b 0 d; therefore, by remodulizing the solution x 0 mod b 0 by the fator d one obtains x [x 0 ;x 0 + b 0 ;::: ;x 0 + b 0 (d 0 1)] mod b 0 d: Hene there are d distint (inongruent) solutions modulo b to the linear ongruene x a mod bif gd(; b) = d and dja. The theorem's utility is demonstrated by the following: Example 2 Suppose 6x 9mod15. Dividing through by the ommon fator 3, 2x 3mod5. This new linear ongruene is solvable beause 3 is divisible by gd(2; 5) = 1. Using the remodulization method, 2x [3; 8] mod 10, where the solution, by inspetion, is x 4mod5. Then, remodulizing 4mod5 by the fator 3, the solutions of the original linear ongruene 6x 9mod15 are x [4; 9; 14] mod 15. It is easily seen that the remodulization method is a trial-and-error method; however, after the solution is found, it is unneessary to arry on any further omputations. Another trial-and-error method onsists of trying all residues of

5 CHAPTER 6. A NOVEL SOLUTION OF LINEAR CONGRUENCES 5 the omplete residue system [1; 2;::: ; b]modb in the linear ongruene x a mod b until the solution is found. In the ase b, there are at most omputations using the remodulization method, ompared to b possible omputations of the alternate method. Example 3 Consider the linear ongruene 3x 5mod37. The remodulization method requires at most 3 steps, ompared to 37 possible steps trying solutions of the omplete residue system modulo 37. Remodulizing by the fator 3, 3x [5; 42;:::]mod111. By inspetion, and requiring only 2 steps, the solution is x 14 mod 37. Performing the other alulation would have required 14 steps. Of ourse, simply guessing the solution may sometimes be just as fruitful. Piking an easy example is also helpful. A standard method of solving linear ongruenes involves Euler's phi funtion [2,3], or totient, denoted by 8. The totient 8(b) enumerates the positive integers less than b whih are relatively prime to b. Euler's extension of Fermat's theorem states that 8(b) 1modb; if gd(; b) = 1. Therefore, multiplying the linear ongruene x a mod b through by the fator (8(b)01) gives or 8(b) x a 1 (8(b)01) mod b; x a 1 (8(b)01) mod b: Thus, nding the solution of the linear ongruene x a mod b requires knowing 8(b), or equivalently, the fatorization of b. The remodulization method predits nding solutions of linear ongruenes based on the fator, speially 8(), rather than the modulus b. In ases dealing with very large integers, and where is muh less than b, or those ases in whih the fatorization of is known, it may be more onvenient to alulate the totient of, rather than that of b. Theorem 4 The linear ongruene x a mod b, where gd(; b) =1, has as solution x a(1 0 b8() ) mod b: Proof. Note that the linear ongruene x a mod b, where and b are relatively prime and 0 < < b, implies the existene of integers x and y suh that x 0 by = a. Solving this equation instead for y, whih is equivalent to

6 CHAPTER 6. A NOVEL SOLUTION OF LINEAR CONGRUENCES 6 the linear ongruene by 0a mod, shows that the solution, using Euler's theorem, is y 0a 1 b (8()01) mod. Substituting this result into x 0 by = a, x = a + by = a + b [ 0a 1 b (8()01) mod ]. Solving for x, x a + b [ 0a 1 b(8()01) mod ] mod b; where 0a 1 b (8()01) is augmented by the proper multiple of to obtain the least non-negative residue modulo. In the remodulization method, the elements fa; a + b; : : : ; a + b( 0 1)g are generated by a + by, for y 2f0; 1; 2;::: ;0 1g. The y +1 st residue in the remodulized form [a; a + b;::: ;a+ b( 0 1)] mod b is the solution, upon division by. If one is not interested in nding the least non-negative residue, the solution redues to x a(1 0 b8() ) mod b: Theorem 3 gives the obvious orollary to Theorem 4 in ase gd(; b) =d. Corollary 1 If gd(; b) =d and dja, then the linear ongruene x a mod b has d distint solutions x [x 0 ;x 0 +b 0 ;::: ;x 0 +b 0 (d01)] mod b, where a = a 0 d, b = b 0 d, = 0 d,and " # x 0 a 0(1 0 b 8(0) 0 ) mod b 0 : 0 Remark 1 If one solves the diophantine equation x + by = a; i.e., x = a 0 by = a mod b formally, then the answer is x = a 0 b y, but the integer harater and information is lost and not easily reovered. In the modular arithmeti format, however, the formula of Theorem 4 (or its orollary by Theorem 3) haraterizes the ountably innitely many solutions. Appliations In publi-key ryptosystems [2,4,5], an eniphering modulus m is reated by multiplying two very large primes p and q, say m = pq; then one hooses an eniphering exponent e and a deiphering exponent d that satisfy the ongruene relation e 1 d 1mod8(m) ;

7 CHAPTER 6. A NOVEL SOLUTION OF LINEAR CONGRUENCES 7 where gd(e; 8(m)) = gd(d; 8(m)) = 1, and 8(m) =(p 0 1)(q 0 1). By large, it is meant that the primes p and q should have 100 or more digits eah. If one hooses the eniphering exponent e to be a prime suh thatgd(e; 8(m)) = 1, then it is unneessary to alulate 8(8(m)) for the usual or standard solution d e (8(8(m))01) mod 8(m) : Instead, one only needs to alulate the solution d 1 0 8(m)8(e) mod 8(m) ; e where 8(e) =e 0 1. It is muh easier (and more omputationally eient) to satisfy the ondition gd(e; 8(m)) = 1 than it is to alulate the prime deomposition of 8(m) and its totient 8(8(m)), even in those ases in whih e is not prime but its fatorization is known. Example 4 Suppose m =71 11 = 77, then 8(77) = 60. The problem is to nd an eniphering exponent e and a deiphering exponent d whih satisfy e 1 d 1mod60: If one hooses e =13,thend is found by d (13) mod mod mod 60 ; whereas 8(8(77)) = 8(60) = 8( ) = 16. Additionally, for e =7, d =43; e =11gives d =11; e =17gives d =53; and so on. This method may not supplant the Eulidean algorithm method. In order to extrat a solution from the linear ongruene nx 1 mod m, the Eulidean algorithm requires at most log 2 (m) iterations, or in the ase n m, only 1+log 2 (n) iterations. Aording to Bressoud [6], the method desribed here requires approximately the same number of iterations (perhaps one or two fewer), but sine one is dealing with very large integers, i.e., n and m , the dierene is negligible. Therefore, those who have inorporated the Eulidean algorithm in their omputer programs will not likely hange to this method. Those just starting may well nd this method preferable. Referenes [1] Jerey F. Gold and Don H. Tuker, Remodulization of Congruenes, Proeedings National Conferene on Undergraduate Researh, University of North

8 CHAPTER 6. A NOVEL SOLUTION OF LINEAR CONGRUENCES 8 Carolina Press, Asheville, North Carolina, 1992, Vol. II, 1036{41. [2] David M. Burton, Elementary Number Theory, Seond Edition, Wm. C. Brown Publishers, Iowa, 1989, 156{160, 175{179. [3] Oystein Ore, Number Theory and Its History, Dover Publiations, In., New York, 1988, 109{115. [4] David M. Bressoud, Fatorization and Primality Testing, Springer-Verlag New York, In., New York, 1989, 43{46. [5] Kenneth H. Rosen, Elementary Number Theory and Its Appliations, Third Edition, Addison-Wesley Publishing Company, Massahusetts, 1993, 253{264. [6] David M. Bressoud. Personal ommuniation.

Chapter 4 Complementary Sets Of Systems Of Congruences Proceedings NCUR VII. è1993è, Vol. II, pp. 793í796. Jeærey F. Gold Department of Mathematics, Department of Physics University of Utah Don H. Tucker

Chapter 2 Remodulization of Congruences Proceedings NCUR VI. è1992è, Vol. II, pp. 1036í1041. Jeærey F. Gold Department of Mathematics, Department of Physics University of Utah Don H. Tucker Department

5.2 The Master Theorem

170 CHAPTER 5. RECURSION AND RECURRENCES 5.2 The Master Theorem Master Theorem In the last setion, we saw three different kinds of behavior for reurrenes of the form at (n/2) + n These behaviors depended

Sebastián Bravo López

Transfinite Turing mahines Sebastián Bravo López 1 Introdution With the rise of omputers with high omputational power the idea of developing more powerful models of omputation has appeared. Suppose that

A Holistic Method for Selecting Web Services in Design of Composite Applications

A Holisti Method for Seleting Web Servies in Design of Composite Appliations Mārtiņš Bonders, Jānis Grabis Institute of Information Tehnology, Riga Tehnial University, 1 Kalu Street, Riga, LV 1658, Latvia,

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

Set Theory and Logic: Fundamental Concepts (Notes by Dr. J. Santos)

A.1 Set Theory and Logi: Fundamental Conepts (Notes by Dr. J. Santos) A.1. Primitive Conepts. In mathematis, the notion of a set is a primitive notion. That is, we admit, as a starting point, the existene

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

Channel Assignment Strategies for Cellular Phone Systems

Channel Assignment Strategies for Cellular Phone Systems Wei Liu Yiping Han Hang Yu Zhejiang University Hangzhou, P. R. China Contat: wliu5@ie.uhk.edu.hk 000 Mathematial Contest in Modeling (MCM) Meritorious

1.3 Complex Numbers; Quadratic Equations in the Complex Number System*

04 CHAPTER Equations and Inequalities Explaining Conepts: Disussion and Writing 7. Whih of the following pairs of equations are equivalent? Explain. x 2 9; x 3 (b) x 29; x 3 () x - 2x - 22 x - 2 2 ; x

chapter > Make the Connection Factoring CHAPTER 4 OUTLINE Chapter 4 :: Pretest 374

CHAPTER hapter 4 > Make the Connetion 4 INTRODUCTION Developing seret odes is big business beause of the widespread use of omputers and the Internet. Corporations all over the world sell enryption systems

Capacity at Unsignalized Two-Stage Priority Intersections

Capaity at Unsignalized Two-Stage Priority Intersetions by Werner Brilon and Ning Wu Abstrat The subjet of this paper is the apaity of minor-street traffi movements aross major divided four-lane roadways

USA Mathematical Talent Search. PROBLEMS / SOLUTIONS / COMMENTS Round 3 - Year 12 - Academic Year 2000-2001

USA Mathematial Talent Searh PROBLEMS / SOLUTIONS / COMMENTS Round 3 - Year - Aademi Year 000-00 Gene A. Berg, Editor /3/. Find the smallest positive integer with the property that it has divisors ending

An Introduction to the RSA Encryption Method

April 17, 2012 Outline 1 History 2 3 4 5 History RSA stands for Rivest, Shamir, and Adelman, the last names of the designers It was first published in 1978 as one of the first public-key crytographic systems

An Iterated Beam Search Algorithm for Scheduling Television Commercials. Mesut Yavuz. Shenandoah University

008-0569 An Iterated Beam Searh Algorithm for Sheduling Television Commerials Mesut Yavuz Shenandoah University The Harry F. Byrd, Jr. Shool of Business Winhester, Virginia, U.S.A. myavuz@su.edu POMS 19

Programming Basics - FORTRAN 77 http://www.physics.nau.edu/~bowman/phy520/f77tutor/tutorial_77.html

CWCS Workshop May 2005 Programming Basis - FORTRAN 77 http://www.physis.nau.edu/~bowman/phy520/f77tutor/tutorial_77.html Program Organization A FORTRAN program is just a sequene of lines of plain text.

Hierarchical Clustering and Sampling Techniques for Network Monitoring

S. Sindhuja Hierarhial Clustering and Sampling Tehniques for etwork Monitoring S. Sindhuja ME ABSTRACT: etwork monitoring appliations are used to monitor network traffi flows. Clustering tehniques are

Computer Networks Framing

Computer Networks Framing Saad Mneimneh Computer Siene Hunter College of CUNY New York Introdution Who framed Roger rabbit? A detetive, a woman, and a rabbit in a network of trouble We will skip the physial

cos t sin t sin t cos t

Exerise 7 Suppose that t 0 0andthat os t sin t At sin t os t Compute Bt t As ds,andshowthata and B ommute 0 Exerise 8 Suppose A is the oeffiient matrix of the ompanion equation Y AY assoiated with the

Consequently, for the remainder of this discussion we will assume that a is a quadratic residue mod p.

Computing square roots mod p We now have very effective ways to determine whether the quadratic congruence x a (mod p), p an odd prime, is solvable. What we need to complete this discussion is an effective

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

3. Applications of Number Theory

3. APPLICATIONS OF NUMBER THEORY 163 3. Applications of Number Theory 3.1. Representation of Integers. Theorem 3.1.1. Given an integer b > 1, every positive integer n can be expresses uniquely as n = a

THE PERFORMANCE OF TRANSIT TIME FLOWMETERS IN HEATED GAS MIXTURES

Proeedings of FEDSM 98 998 ASME Fluids Engineering Division Summer Meeting June 2-25, 998 Washington DC FEDSM98-529 THE PERFORMANCE OF TRANSIT TIME FLOWMETERS IN HEATED GAS MIXTURES John D. Wright Proess

Special Relativity and Linear Algebra

peial Relativity and Linear Algebra Corey Adams May 7, Introdution Before Einstein s publiation in 95 of his theory of speial relativity, the mathematial manipulations that were a produt of his theory

MA2C03 Mathematics School of Mathematics, Trinity College Hilary Term 2016 Lecture 59 (April 1, 2016) David R. Wilkins

MA2C03 Mathematics School of Mathematics, Trinity College Hilary Term 2016 Lecture 59 (April 1, 2016) David R. Wilkins The RSA encryption scheme works as follows. In order to establish the necessary public

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

Chemical Equilibrium. Chemical Equilibrium. Chemical Equilibrium. Chemical Equilibriu m. Chapter 14

Chapter 14 Chemial Equilibrium Chemial Equilibriu m Muh like water in a U-shaped tube, there is onstant mixing bak and forth through the lower portion of the tube. reatants produts It s as if the forward

Lecture 13 - Basic Number Theory.

Lecture 13 - Basic Number Theory. Boaz Barak March 22, 2010 Divisibility and primes Unless mentioned otherwise throughout this lecture all numbers are non-negative integers. We say that A divides B, denoted

CHAPTER 14 Chemical Equilibrium: Equal but Opposite Reaction Rates

CHATER 14 Chemial Equilibrium: Equal but Opposite Reation Rates 14.1. Collet and Organize For two reversible reations, we are given the reation profiles (Figure 14.1). The profile for the onversion of

Lectures on Number Theory. Lars-Åke Lindahl

Lectures on Number Theory Lars-Åke Lindahl 2002 Contents 1 Divisibility 1 2 Prime Numbers 7 3 The Linear Diophantine Equation ax+by=c 12 4 Congruences 15 5 Linear Congruences 19 6 The Chinese Remainder

Homework 5 Solutions

Homework 5 Solutions 4.2: 2: a. 321 = 256 + 64 + 1 = (01000001) 2 b. 1023 = 512 + 256 + 128 + 64 + 32 + 16 + 8 + 4 + 2 + 1 = (1111111111) 2. Note that this is 1 less than the next power of 2, 1024, which

10.1 The Lorentz force law

Sott Hughes 10 Marh 2005 Massahusetts Institute of Tehnology Department of Physis 8.022 Spring 2004 Leture 10: Magneti fore; Magneti fields; Ampere s law 10.1 The Lorentz fore law Until now, we have been

Theory of linear elasticity. I assume you have learned the elements of linear

Physial Metallurgy Frature mehanis leture 1 In the next two letures (Ot.16, Ot.18), we will disuss some basis of frature mehanis using ontinuum theories. The method of ontinuum mehanis is to view a solid

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

Elementary Number Theory We begin with a bit of elementary number theory, which is concerned

CONSTRUCTION OF THE FINITE FIELDS Z p S. R. DOTY Elementary Number Theory We begin with a bit of elementary number theory, which is concerned solely with questions about the set of integers Z = {0, ±1,

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

Integer Factorization using the Quadratic Sieve

Integer Factorization using the Quadratic Sieve Chad Seibert* Division of Science and Mathematics University of Minnesota, Morris Morris, MN 56567 seib0060@morris.umn.edu March 16, 2011 Abstract We give

MODULAR ARITHMETIC. a smallest member. It is equivalent to the Principle of Mathematical Induction.

MODULAR ARITHMETIC 1 Working With Integers The usual arithmetic operations of addition, subtraction and multiplication can be performed on integers, and the result is always another integer Division, on

On Generalized Fermat Numbers 3 2n +1

Applied Mathematics & Information Sciences 4(3) (010), 307 313 An International Journal c 010 Dixie W Publishing Corporation, U. S. A. On Generalized Fermat Numbers 3 n +1 Amin Witno Department of Basic

9 Modular Exponentiation and Cryptography

9 Modular Exponentiation and Cryptography 9.1 Modular Exponentiation Modular arithmetic is used in cryptography. In particular, modular exponentiation is the cornerstone of what is called the RSA system.

Factoring Algorithms

Factoring Algorithms The p 1 Method and Quadratic Sieve November 17, 2008 () Factoring Algorithms November 17, 2008 1 / 12 Fermat s factoring method Fermat made the observation that if n has two factors

Neural network-based Load Balancing and Reactive Power Control by Static VAR Compensator

nternational Journal of Computer and Eletrial Engineering, Vol. 1, No. 1, April 2009 Neural network-based Load Balaning and Reative Power Control by Stati VAR Compensator smail K. Said and Marouf Pirouti

From (2) follows, if z0 = 0, then z = vt, thus a2 =?va (2.3) Then 2:3 beomes z0 = z (z? vt) (2.4) t0 = bt + b2z Consider the onsequenes of (3). A ligh

Chapter 2 Lorentz Transformations 2. Elementary Considerations We assume we have two oordinate systems S and S0 with oordinates x; y; z; t and x0; y0; z0; t0, respetively. Physial events an be measured

arxiv:astro-ph/0304006v2 10 Jun 2003 Theory Group, MS 50A-5101 Lawrence Berkeley National Laboratory One Cyclotron Road Berkeley, CA 94720 USA

LBNL-52402 Marh 2003 On the Speed of Gravity and the v/ Corretions to the Shapiro Time Delay Stuart Samuel 1 arxiv:astro-ph/0304006v2 10 Jun 2003 Theory Group, MS 50A-5101 Lawrene Berkeley National Laboratory

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

Trigonometry & Pythagoras Theorem

Trigonometry & Pythagoras Theorem Mathematis Skills Guide This is one of a series of guides designed to help you inrease your onfidene in handling Mathematis. This guide ontains oth theory and exerises

) ( )( ) ( ) ( )( ) ( ) ( ) (1)

OPEN CHANNEL FLOW Open hannel flow is haraterized by a surfae in ontat with a gas phase, allowing the fluid to take on shapes and undergo behavior that is impossible in a pipe or other filled onduit. Examples

SUM OF TWO SQUARES JAHNAVI BHASKAR

SUM OF TWO SQUARES JAHNAVI BHASKAR Abstract. I will investigate which numbers can be written as the sum of two squares and in how many ways, providing enough basic number theory so even the unacquainted

Pattern Recognition Techniques in Microarray Data Analysis

Pattern Reognition Tehniques in Miroarray Data Analysis Miao Li, Biao Wang, Zohreh Momeni, and Faramarz Valafar Department of Computer Siene San Diego State University San Diego, California, USA faramarz@sienes.sdsu.edu

Problem Set 7 - Fall 2008 Due Tuesday, Oct. 28 at 1:00

18.781 Problem Set 7 - Fall 2008 Due Tuesday, Oct. 28 at 1:00 Throughout this assignment, f(x) always denotes a polynomial with integer coefficients. 1. (a) Show that e 32 (3) = 8, and write down a list

Chapter 1 Microeconomics of Consumer Theory

Chapter 1 Miroeonomis of Consumer Theory The two broad ategories of deision-makers in an eonomy are onsumers and firms. Eah individual in eah of these groups makes its deisions in order to ahieve some

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

EULER S THEOREM. 1. Introduction Fermat s little theorem is an important property of integers to a prime modulus. a p 1 1 mod p.

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

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

Improved Vehicle Classification in Long Traffic Video by Cooperating Tracker and Classifier Modules

Improved Vehile Classifiation in Long Traffi Video by Cooperating Traker and Classifier Modules Brendan Morris and Mohan Trivedi University of California, San Diego San Diego, CA 92093 {b1morris, trivedi}@usd.edu

Granular Problem Solving and Software Engineering

Granular Problem Solving and Software Engineering Haibin Zhu, Senior Member, IEEE Department of Computer Siene and Mathematis, Nipissing University, 100 College Drive, North Bay, Ontario, P1B 8L7, Canada

Static Fairness Criteria in Telecommunications

Teknillinen Korkeakoulu ERIKOISTYÖ Teknillisen fysiikan koulutusohjelma 92002 Mat-208 Sovelletun matematiikan erikoistyöt Stati Fairness Criteria in Teleommuniations Vesa Timonen, e-mail: vesatimonen@hutfi

Weighting Methods in Survey Sampling

Setion on Survey Researh Methods JSM 01 Weighting Methods in Survey Sampling Chiao-hih Chang Ferry Butar Butar Abstrat It is said that a well-designed survey an best prevent nonresponse. However, no matter

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

Convergence of c k f(kx) and the Lip α class

Convergene of and the Lip α lass Christoph Aistleitner Abstrat By Carleson s theorem a trigonometri series k osπkx or k sin πkx is ae onvergent if < (1) Gaposhkin generalized this result to series of the

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.

Learning Curves and Stochastic Models for Pricing and Provisioning Cloud Computing Services

T Learning Curves and Stohasti Models for Priing and Provisioning Cloud Computing Servies Amit Gera, Cathy H. Xia Dept. of Integrated Systems Engineering Ohio State University, Columbus, OH 4310 {gera.,

An Enhanced Critical Path Method for Multiple Resource Constraints

An Enhaned Critial Path Method for Multiple Resoure Constraints Chang-Pin Lin, Hung-Lin Tai, and Shih-Yan Hu Abstrat Traditional Critial Path Method onsiders only logial dependenies between related ativities

Mathematics. Draft, subject to endorsement

- 9 PROGRESSION Edexel GCSE (9-) Mathematis Higher Student Book Sample unit Confidene Flueny Problem-solving Reasoning Draft, subjet to endorsement We are seeking endorsement for use with the Edexel GCSE

Primality - Factorization

Primality - Factorization Christophe Ritzenthaler November 9, 2009 1 Prime and factorization Definition 1.1. An integer p > 1 is called a prime number (nombre premier) if it has only 1 and p as divisors.

FACTORING. n = 2 25 + 1. fall in the arithmetic sequence

FACTORING The claim that factorization is harder than primality testing (or primality certification) is not currently substantiated rigorously. As some sort of backward evidence that factoring is hard,

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

Henley Business School at Univ of Reading. Pre-Experience Postgraduate Programmes Chartered Institute of Personnel and Development (CIPD)

MS in International Human Resoure Management For students entering in 2012/3 Awarding Institution: Teahing Institution: Relevant QAA subjet Benhmarking group(s): Faulty: Programme length: Date of speifiation:

Computing exponents modulo a number: Repeated squaring

Computing exponents modulo a number: Repeated squaring How do you compute (1415) 13 mod 2537 = 2182 using just a calculator? Or how do you check that 2 340 mod 341 = 1? You can do this using the method

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

Classical Electromagnetic Doppler Effect Redefined. Copyright 2014 Joseph A. Rybczyk

Classial Eletromagneti Doppler Effet Redefined Copyright 04 Joseph A. Rybzyk Abstrat The lassial Doppler Effet formula for eletromagneti waves is redefined to agree with the fundamental sientifi priniples

12 Greatest Common Divisors. The Euclidean Algorithm

Arkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan 12 Greatest Common Divisors. The Euclidean Algorithm As mentioned at the end of the previous section, we would like to

Computational Analysis of Two Arrangements of a Central Ground-Source Heat Pump System for Residential Buildings

Computational Analysis of Two Arrangements of a Central Ground-Soure Heat Pump System for Residential Buildings Abstrat Ehab Foda, Ala Hasan, Kai Sirén Helsinki University of Tehnology, HVAC Tehnology,

User s Guide VISFIT: a computer tool for the measurement of intrinsic viscosities

File:UserVisfit_2.do User s Guide VISFIT: a omputer tool for the measurement of intrinsi visosities Version 2.a, September 2003 From: Multiple Linear Least-Squares Fits with a Common Interept: Determination

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

FIRE DETECTION USING AUTONOMOUS AERIAL VEHICLES WITH INFRARED AND VISUAL CAMERAS. J. Ramiro Martínez-de Dios, Luis Merino and Aníbal Ollero

FE DETECTION USING AUTONOMOUS AERIAL VEHICLES WITH INFRARED AND VISUAL CAMERAS. J. Ramiro Martínez-de Dios, Luis Merino and Aníbal Ollero Robotis, Computer Vision and Intelligent Control Group. University

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.

Discovering Trends in Large Datasets Using Neural Networks

Disovering Trends in Large Datasets Using Neural Networks Khosrow Kaikhah, Ph.D. and Sandesh Doddameti Department of Computer Siene Texas State University San Maros, Texas 78666 Abstrat. A novel knowledge

AUDITING COST OVERRUN CLAIMS *

AUDITING COST OVERRUN CLAIMS * David Pérez-Castrillo # University of Copenhagen & Universitat Autònoma de Barelona Niolas Riedinger ENSAE, Paris Abstrat: We onsider a ost-reimbursement or a ost-sharing

The application of prime numbers to RSA encryption

The application of prime numbers to RSA encryption Prime number definition: Let us begin with the definition of a prime number p The number p, which is a member of the set of natural numbers N, is considered

1. LINEAR EQUATIONS. A linear equation in n unknowns x 1, x 2,, x n is an equation of the form

1. LINEAR EQUATIONS A linear equation in n unknowns x 1, x 2,, x n is an equation of the form a 1 x 1 + a 2 x 2 + + a n x n = b, where a 1, a 2,..., a n, b are given real numbers. For example, with x and

Fundamentals of Chemical Reactor Theory

UNIVERSITY OF CALIFORNIA, LOS ANGELES Civil & Environmental Engineering Department Fundamentals of Chemial Reator Theory Mihael K. Stenstrom Professor Diego Rosso Teahing Assistant Los Angeles, 3 Introdution

i_~f e 1 then e 2 else e 3

A PROCEDURE MECHANISM FOR BACKTRACK PROGRAMMING* David R. HANSON + Department o Computer Siene, The University of Arizona Tuson, Arizona 85721 One of the diffiulties in using nondeterministi algorithms

An Overview of Integer Factoring Algorithms. The Problem

An Overview of Integer Factoring Algorithms Manindra Agrawal IITK / NUS The Problem Given an integer n, find all its prime divisors as efficiently as possible. 1 A Difficult Problem No efficient algorithm

Discrete Mathematics, Chapter 4: Number Theory and Cryptography

Discrete Mathematics, Chapter 4: Number Theory and Cryptography Richard Mayr University of Edinburgh, UK Richard Mayr (University of Edinburgh, UK) Discrete Mathematics. Chapter 4 1 / 35 Outline 1 Divisibility

APPLICATIONS OF THE ORDER FUNCTION

APPLICATIONS OF THE ORDER FUNCTION LECTURE NOTES: MATH 432, CSUSM, SPRING 2009. PROF. WAYNE AITKEN In this lecture we will explore several applications of order functions including formulas for GCDs and

Continued Fractions. Darren C. Collins

Continued Fractions Darren C Collins Abstract In this paper, we discuss continued fractions First, we discuss the definition and notation Second, we discuss the development of the subject throughout history

CIS 5371 Cryptography. 8. Encryption --

CIS 5371 Cryptography p y 8. Encryption -- Asymmetric Techniques Textbook encryption algorithms In this chapter, security (confidentiality) is considered in the following sense: All-or-nothing secrecy.

NOMCLUST: AN R PACKAGE FOR HIERARCHICAL CLUSTERING OF OBJECTS CHARACTERIZED BY NOMINAL VARIABLES

The 9 th International Days of Statistis and Eonomis, Prague, September 10-1, 015 NOMCLUST: AN R PACKAGE FOR HIERARCHICAL CLUSTERING OF OBJECTS CHARACTERIZED BY NOMINAL VARIABLES Zdeněk Šul Hana Řezanková

ECURE hird Edition SHAFS: ORSION OADING AND DEFORMAION A. J. Clark Shool of Engineering Department of Civil and Environmental Engineering 6 Chapter 3.1-3.5 by Dr. Ibrahim A. Assakkaf SPRING 2003 ENES 220

Overview of Number Theory Basics. Divisibility

Overview of Number Theory Basics Murat Kantarcioglu Based on Prof. Ninghui Li s Slides Divisibility Definition Given integers a and b, b 0, b divides a (denoted b a) if integer c, s.t. a = cb. b is called

Discrete Square Root. Koç (http://cs.ucsb.edu/~koc) ucsb cs 178 intro to crypto winter / 11

Discrete Square Root Çetin Kaya Koç http://cs.ucsb.edu/~koc/cs178 koc@cs.ucsb.edu Koç (http://cs.ucsb.edu/~koc) ucsb cs 178 intro to crypto winter 2013 1 / 11 Discrete Square Root Problem The discrete

Cryptography and Network Security Chapter 8

Cryptography and Network Security Chapter 8 Fifth Edition by William Stallings Lecture slides by Lawrie Brown (with edits by RHB) Chapter 8 Introduction to Number Theory The Devil said to Daniel Webster:

Basic Properties of Probability

Basi Properties of Probability Definitions: A random experiment is a proedure or an operation whose outome is unertain and annot be predited with ertainty in advane. The olletion of all possible outomes

BUILDING A SPAM FILTER USING NAÏVE BAYES. CIS 391- Intro to AI 1

BUILDING A SPAM FILTER USING NAÏVE BAYES 1 Spam or not Spam: that is the question. From: "" Subjet: real estate is the only way... gem oalvgkay Anyone an buy real estate with no

QUADRATIC RECIPROCITY IN CHARACTERISTIC 2 KEITH CONRAD 1. Introduction Let F be a finite field. When F has odd characteristic, the quadratic reciprocity law in F[T ] (see [4, Section 3.2.2] or [5]) lets

Parametric model of IP-networks in the form of colored Petri net

Parametri model of IP-networks in the form of olored Petri net Shmeleva T.R. Abstrat A parametri model of IP-networks in the form of olored Petri net was developed; it onsists of a fixed number of Petri

(x + a) n = x n + a Z n [x]. Proof. If n is prime then the map

22. A quick primality test Prime numbers are one of the most basic objects in mathematics and one of the most basic questions is to decide which numbers are prime (a clearly related problem is to find