New modular multiplication and division algorithms based on continued fraction expansion
|
|
- Derrick Dixon
- 6 years ago
- Views:
Transcription
1 New modular multplcaton and dvson algorthms based on contnued fracton expanson Mourad Goucem a a UPMC Unv Pars 06 and CNRS UMR 7606, LIP6 4 place Jusseu, F-75252, Pars cedex 05, France Abstract In ths paper, we apply results on number systems based on contnued fracton expansons to modular arthmetc. We provde two new algorthms n order to compute modular multplcaton and modular dvson. The presented algorthms are based on the Eucldean algorthm and are of quadratc complexty.. Introducton Contnued fractons are commonly used to provde best ratonal approxmatons of an rratonal number. Ths sequence of best ratonal approxmatons (p /q ) N s called the convergents sequence. In the begnnng of the 20 th century, Ostrowsk ntroduced number systems derved from the contnued fracton expanson of any rratonal α []. He proved that the sequence (q ) N of the denomnators of the convergents of any rratonal α forms a number scale, and any nteger can be unquely wrtten n ths bass. In the same way, the sequence (q α p ) N also forms a number scale. In ths paper, we show how such number systems based on contnued fracton expansons can be used to perform modular arthmetc, and more partcularly modular multplcaton and modular dvson. The presented algorthms are of quadratc complexty lke many of the exstng mplemented algorthms [2, Chap. 2.4]. Furthermore, they present the advantage of beng only based on the extended Eucldean algorthm, and to ntegrate the reducton step. In the followng, we wll frst ntroduce notatons and some propertes of the number systems based on contnued fracton expansons n Secton 2. Then we descrbe the new algorthms n Secton 3. Fnally, we gve elements of complexty analyss of these algorthms n Secton 4, and perspectves n Secton Number systems and contnued fractons 2.. Notatons Frst, we gve some notatons on the contnued fracton expanson of an rratonal α wth 0 < α < [3]. We call the tals of the contnued fracton
2 expanson of α the real sequence (r ) N defned by r 0 = α, r = /r /r. We denote (k ) N the nteger sequence of the partal quotents of the contnued fracton expanson of α. They are computed as k = /r. We have α = k + k k + r := [0; k, k 2,..., k + r ]. We wrte p /q the th convergent of α. The sequences (p ) N and (q ) N are nteger valued and postve, p q = [0; k, k 2,..., k ]. We wll also wrte (θ ) N the postve real sequence of ( ) (q α p ) whch we call the sequence of the partal remanders as they are related to the tals by r = θ /θ. Hereafter, we recall the recurrence relatons to compute these sequences, p = p 0 = 0 p = p 2 + k p, q = 0 q 0 = q = q 2 + k q, θ = θ 0 = α θ = θ 2 k θ. We also wrte η = q α p the sequence of the sgned partal remanders, whch elements are of sgn ( ). The sequence (η ) N of the sgned partal remanders can be computed as (( ) θ ) N Related number systems over rratonal numbers In ths secton, we present two number systems based on the sequences of the sgned partal remanders (η ) N and the denomnators of the convergents (q ) N of an rratonal α. They have been extensvely studed durng the second part of the 20 th century [, 4]. Property 2. ([, Proposton ]). Gven (q ) N the denomnators of the convergents of any rratonal 0 < α <, every postve nteger N can be unquely wrtten as m N = + n q { 0 n k where, 0 n k, for 2, n = 0 f n + = k + ( Markovan condtons). 2
3 Algorthm : Integer decomposton n Ostrowsk number system. nput : N N, (q ) <m m output: n such that N = + n q tmp N ; 2 m; 3 whle do 4 n tmp/q ; 5 tmp tmp n q ; 6 ; Ths number system assocated to the (q ) N s named the Ostrowsk number system. To wrte an nteger n ths number system, we use a classcal decomposton algorthm (Algorthm ). The rank m s chosen such that q m > N. Property 2.2 ([, Proposton 2]). Gven (η ) N the sequence of the sgned partal remanders of any rratonal 0 < α <, every real β, wth 0 β < can be unquely wrtten as + β = α + b η { 0 b k where, 0 b k, for 2, b = 0 f b + = k + ( Markovan condtons). There also exsts two other number systems that are dual to these two. One decomposes ntegers n the bass (( ) q ) N and the other decomposes reals n the bass of the unsgned partal remanders (θ ) N []. The second Markovan condton then becomes b + = 0 f b = k. An algorthm to wrte real numbers n the (θ ) N number scale has been proposed by Ito [5]. It proceeds by teratng the mappng T : (α, β) (/α /α, β/α β/α ) Related number systems over ratonal numbers In ths subsecton, we consder α = p/q ratonal. We recall that the contnued fracton expanson of a ratonal s fnte. We denote p q = [0; k, k 2,..., k n ] the contnued fracton expanson of p/q, and recall p n = p and q n = q. The Ostrowsk number system stll holds for ntegers N < q n, snce the keypont n the Ostrowsk number system s that there exsts q m such that q m > N. The (η ) <n number system also stll holds under one supplemental condton: β must be ratonal wth precson at most q (.e. the denomnator of β must be less or equal than q). 3
4 3. Modular arthmetc and contnued fracton In ths secton, we consder α = a/d. We hghlght that the same decomposton (b,..., b n+ ) can be nterpreted n two ways dependng on the number system used. In the Ostrowsk number system, we obtan an nteger N whereas n the number scale (η ) N, we obtan the reduced value of Nα mod []. Hence, we wll use the fact that studyng an nteger a modulo d s smlar to consderng the ratonal a/d modulo. Ths enables us to use propertes 2. and 2.2 to compute modular multplcaton and dvson. 3.. Modular arthmetc and contnued fracton Frst, we brefly recall how contnued fracton expanson and the Eucldean algorthm are lnked. We wrte (θ ) N the nteger sequence of remanders when computng gcd(a, d). Ths sequence s composed of decreasng values less than d. We also wrte (η ) N the sequence (( ) θ ) N. We obtan the followng recurrence relaton, and recall the recurrence relaton over the (θ ) N sequence of partal remanders of the contnued fracton expanson of a/d : θ = d θ 0 = a θ = θ 2 θ 2 /θ θ θ = θ 0 = a/d θ = θ 2 θ 2 /θ θ. It s wdely known and can be easly proved by nducton that both sequences compute the same partal quotents, that we wll note k. Proof of k + = θ /θ = θ /θ. We prove t by provng θ /θ = θ /θ. Base case : θ /θ 0 = d/a = θ /θ 0 Inducton : Let such that θ /θ = θ /θ. θ θ θ + + θ /θ θ θ = θ θ = θ + + θ /θ θ θ whch mples θ /θ + = θ /θ +. θ + + θ /θ = θ + θ θ + θ /θ It can also be notced that η = η d. Actuallly, θ = θ d as the extended Eucldean algorthm compute the relatons θ = ( ) (q a p d). In partcular, t gves the Bezout s dentty wth θ n = ( ) n (q n a p n d) = gcd(a, d), and q n the nverse of a f a s nvertble modulo d (gcd(a, d) = ). 4
5 3.2. Modular multplcaton Now, gven a, b Z/dZ, we wrte c = a b mod d the nteger 0 c < d such that ab ab/d d = c. We can observe that the decompostons presented n propertes 2. and 2.2 are both unque and both need the same Markovan condton over ther coeffcents. Hence, we can nterpret the same decomposton n both bass. Theorem 3.. Gven a, b Z/dZ, and (q ) n, (η ) n from Eucldean algorthm on a and d, f we wrte b n the (q ) n number scale as then n+ b = + b q, n+ a b mod d = a + b η. Proof. Frst, we consder b < q n, t can be wrtten n the Ostrowsk number system as n b = + b q, and the coeffcents b respect the Markovan condton of the Ostrowsk number system. Hence, n α b = α + b q α. By defnton, η = q α p, thus α b = α + n b η + n b p. As the coeffcents b s verfy the Markovan condton, the unqueness of the decomposton n property 2.2 gves 0 α + n b η < and n b p N. Hence, n α b mod = α + b η. By multplyng ths nequalty by d, as α = a/d and η = η d, we obtan a b mod d = a + n b η. whch fnalzes the proof of the theorem for b < q n. Now f b q n and b = b n+ q n + b wth b < q n the remander of the dvson of b by q n, b can be unquely wrtten n the Ostrowsk number system. Furthermore, as η n = 0, b n+ η n = 0, whch fnshes the proof. 5
6 3.3. Modular dvson Inversely, gven a, b Z/dZ, wth a nvertble modulo d (gcd(a, d) = ) we can effcently compute a b mod d. Theorem 3.2. Gven a, b Z/dZ wth gcd(a, d) =, and (q ) n, (θ ) n from Eucldean algorthm on a and d, f we wrte b n the (θ ) <n number scale as n+ b = b θ, n+ then f we denote c = b ( ) q, a b mod d {c, d + c}. Proof. The proof of correctness s smlar to the one of theorem 3., usng the facts that θ = θ d and that θ = ( ) (q α p ). Now, the greatest nteger c s clearly the one assocated to the decomposton (k, 0, k 3, 0,..., k n ) when n s odd. However, k q = q q 2 by defnton, whch mples (n )/2 =0 k 2+ q 2 = q n. The smallest nteger that can be returned s clearly the one assocated to the decomposton (0, k 2, 0, k 4,..., k n ) when n s even. Once agan, as k q = q q 2, we get n/2 k 2 q 2 = q n. Hence, d < n+ b ( ) q < d, that s to say, the result needs at most a correcton by an addton by d. We menton that we also tred to decompose b n the (η ) n sgned remanders number scale and evaluate ths same decomposton n the (q ) n number scale to compute modular dvson. We used Ito T 2 transform [5] T 2 : (α, β) (/α /α, β/α β/α). In practce, t returns the rght result wthout the need of any correcton. However, as the decomposton computed by Ito T 2 transform does not verfy the same Markovan condtons as n the Ostrowsk number system, we were not able to gve a theoretcal proof that t always returns the reduced result of the modular dvson. 4. Elements of Complexty Analyss In ths secton, we ntroduce elements of complexty analyss of the proposed modular multplcaton algorthm based on theorem 3.. The same analyss holds for the dvson. 6
7 0.95 Probablty Max expected b n+ Fgure : Probablty law of the value of the coeffcent b n+ Frst, the algorthm computes (q ) n and (η ) n. Ths can be computed usng the classcal extended Eucldean algorthm n O(log (d) 2 ) bnary operatons. We notce here that the dvsons computed n the Eucldean algorthm can be computed by subtracton as the mean computed quotent equals to Khnchn s constant (approxmately 2.69) [3, p. 93]. Furthermore, bg quotents are very unlkely to occur as the quotents of any contnued fracton follow the Gauss- Kuzmn dstrbuton [3, p. 83] [6, p. 352], ) P(k = k) = log 2 ( (k + ) 2. Second, the decomposton n (q ) n as n algorthm also clearly has complexty n O(log (d) 2 ). By the same arguments, the coeffcents of the decomposton n (q ) n can be computed by subtracton as they are lkely small. The only quotent not followng the Gauss-Kuzmn dstrbuton s the coeffcent b n+ as t corresponds to the quotent b/q n. We prove n AppendxA that f a, d are unformly chosen ntegers n [, N] and b s unformly chosen n [, d], then when N tends to nfnty, P(b n+ k) tends to [ k+ ζ(2) (k + ) 3 + (k + )ζ(3) Fgure shows the probablty dstrbuton of P(b n+ k). In partcular, we obtan P(b n+ 3) 92.5%. To fnsh the complexty analyss, evaluatng the sum to return the fnal result can also be done n O(log (d) 2 ). ]. 7
8 5. Perspectves In ths paper, we presented an algorthm for modular multplcaton and an algorthm for modular dvson. Both are based on the extended Eucldean algorthm and are of quadratc complexty n the sze of the modulus. Furthermore, the two stated theorems mply that, knowng the remanders generated when computng the gcd of a number a and the modulus d, one can compute effcently reduced multplcatons by a or a. Ths can be useful n algorthms computng several multplcatons and/or dvsons by the same number a, as n the Gaussan elmnaton algorthm for example. The presented algorthms can also be useful n hardware mplementaton of modular arthmetc. They allow to perform nverson, multplcaton and dvson wth the same crcut. Further nvestgatons have to be led to fnd optmal decomposton algorthms, that mnmze the number of coeffcents of the produced decomposton and ther sze. Also, we are workng on an effcent software mplementaton of these algorthms. 6. Aknowledgement Ths work was supported by the TaMaD project of the french ANR (grant ANR 200 BLAN ). Ths work has also been greatly supported and mproved by many helpful proof readngs and dscussons wth Jean-Claude Bajard, Valére Berthé, Perre Fortn, Stef Grallat and Emmanuel Prouff. References [] V. Berthé, L. Imbert, Dophantne approxmaton, Ostrowsk numeraton and the double-base number system, Dscrete Mathematcs & Theoretcal Computer Scence () (2009) [2] R. Brent, P. Zmmermann, Modern computer arthmetc, Vol. 8, Cambrdge Unversty Press, 200. [3] A. Y. Khnchn, Contnued fractons, Dover, 997. [4] A. Vershk, N. Sdorov, Arthmetc expansons assocated wth a rotaton of the crcle and wth contnued fractons, Sant Petersburg Mathematcal Journal 5 (6) (994) [5] S. Ito, Some skew product transformatons assocated wth contnued fractons and ther nvarant measures, Tokyo Journal of Mathematcs 9 () (986) [6] D. E. Knuth, The Art of Computer Programmng, 2nd Edton, Vol. 2 (Semnumercal Algorthms), Addson-Wesley, 98. [7] G. H. Hardy, E. M. Wrght, An Introducton to the Theory of Numbers, 6 th Edton, Oxford Unversty Press,
9 AppendxA. Detaled proof of the dstrbuton functon of {b n+ < k}. Let U, U 2 and U 3 be three ndependent unform dstrbutons over [0, ]. We wrte a = U N, d = U 2 N and b = U 3 d. We denote A = {b < (k + )q n }, B = {gcd(a, d) k + }, B = {gcd(a, d) > k + } and B = {gcd(a, d) = }. Hence usng the law of total probablty we have P(A) = P(A B) + P(A B), = P(A B ) + k+ = k+ >k+ P(A B ) P(B ) + As the B are dsjont events, we have P(A) = k+ P(A B ) P(B ) + P(A B ), >k+ + =k+2 P(A B ) P(B ). P(A B ) P(B ). Frst, P(A B ) = for k + as b < d = gcd(a, d) q n (k + ) q n. Hence, k+ + P(A) = P(B ) + P(A B ) P(B ). =k+2 Now we want to determne P(A B ) for k + 2. Q ( ) = P( B ) and Hereafter, we wrte P(A B ) = Q (A), N N = Q ({a = l} {d = m}) Q (A {a = l} {d = m}). However, l= m= Q (A {a = l} {d = m}) = k + as b s unformly dstrbuted between and d = q n. If we consder the segment of length d and slce t n segments of length q n, t can be nterpreted as the probablty that b s n the frst k + slces. Hence P(A B ) = N N l= m= = k + Q ({a = l} {d = m}) k +, N l= m= N Q ({a = l} {d = m}). As {a = l} and {d = m} are ndependent by hypothess (U and U 2 are ndependent), Q ({a = l} {d = m}) = Q ({a = l}) Q ({d = m}), 9
10 and P(A B ) = k + N N Q ({a = l}) Q ({d = m}). l= Now, we use the fact that the sum of the probabltes over the whole sample space always sum to to obtan m= If we recaptulate, P(A B ) = k +. P(A) = k+ P(B ) + + =k+2 k + P(B ). Fnally, t s wdely known that P(B ) tends to ζ(2) 2 nfnty [7, p. 353]. Hence, we get when N tends to whch equals to k+ lm P(A) = N + ζ(2) 2 + =k+2 k + [ k+ = ζ(2) (k + ) ζ(2) 2, =k+2 [ k+ ( ζ(2) + k+ + (k + ) 2 3 [ k+ = ζ(2) (k + ) 3 + (k + ) By defnton, Remann zeta functon equals ζ(s) = ( + 3 ] )], Hence we get the followng smplfcaton, whch s more convenent for computaton and has been used to generate Fg., lm N + P(A)=ζ(2) [ k+ + s. 3 3 )] ] (k + ) 3 +(k+) ζ(3).., 0
Modular multiplication and division algorithms based on continued fraction expansion
205 IEEE 22nd Symposum on Computer Arthmetc Modular multplcaton and dvson algorthms based on contnued fracton expanson Mourad Goucem UPMC Unv Pars 06 and CNRS UMR 7606, LIP6, 4 place Jusseu, F-75252, Pars
More informationFoundations of Arithmetic
Foundatons of Arthmetc Notaton We shall denote the sum and product of numbers n the usual notaton as a 2 + a 2 + a 3 + + a = a, a 1 a 2 a 3 a = a The notaton a b means a dvdes b,.e. ac = b where c s an
More informationThe Order Relation and Trace Inequalities for. Hermitian Operators
Internatonal Mathematcal Forum, Vol 3, 08, no, 507-57 HIKARI Ltd, wwwm-hkarcom https://doorg/0988/mf088055 The Order Relaton and Trace Inequaltes for Hermtan Operators Y Huang School of Informaton Scence
More informationLectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix
Lectures - Week 4 Matrx norms, Condtonng, Vector Spaces, Lnear Independence, Spannng sets and Bass, Null space and Range of a Matrx Matrx Norms Now we turn to assocatng a number to each matrx. We could
More information2 More examples with details
Physcs 129b Lecture 3 Caltech, 01/15/19 2 More examples wth detals 2.3 The permutaton group n = 4 S 4 contans 4! = 24 elements. One s the dentty e. Sx of them are exchange of two objects (, j) ( to j and
More informationMore metrics on cartesian products
More metrcs on cartesan products If (X, d ) are metrc spaces for 1 n, then n Secton II4 of the lecture notes we defned three metrcs on X whose underlyng topologes are the product topology The purpose of
More informationU.C. Berkeley CS294: Spectral Methods and Expanders Handout 8 Luca Trevisan February 17, 2016
U.C. Berkeley CS94: Spectral Methods and Expanders Handout 8 Luca Trevsan February 7, 06 Lecture 8: Spectral Algorthms Wrap-up In whch we talk about even more generalzatons of Cheeger s nequaltes, and
More informationFINITELY-GENERATED MODULES OVER A PRINCIPAL IDEAL DOMAIN
FINITELY-GENERTED MODULES OVER PRINCIPL IDEL DOMIN EMMNUEL KOWLSKI Throughout ths note, s a prncpal deal doman. We recall the classfcaton theorem: Theorem 1. Let M be a fntely-generated -module. (1) There
More informationInner Product. Euclidean Space. Orthonormal Basis. Orthogonal
Inner Product Defnton 1 () A Eucldean space s a fnte-dmensonal vector space over the reals R, wth an nner product,. Defnton 2 (Inner Product) An nner product, on a real vector space X s a symmetrc, blnear,
More information2.3 Nilpotent endomorphisms
s a block dagonal matrx, wth A Mat dm U (C) In fact, we can assume that B = B 1 B k, wth B an ordered bass of U, and that A = [f U ] B, where f U : U U s the restrcton of f to U 40 23 Nlpotent endomorphsms
More informationAn efficient algorithm for multivariate Maclaurin Newton transformation
Annales UMCS Informatca AI VIII, 2 2008) 5 14 DOI: 10.2478/v10065-008-0020-6 An effcent algorthm for multvarate Maclaurn Newton transformaton Joanna Kapusta Insttute of Mathematcs and Computer Scence,
More informationExample: (13320, 22140) =? Solution #1: The divisors of are 1, 2, 3, 4, 5, 6, 9, 10, 12, 15, 18, 20, 27, 30, 36, 41,
The greatest common dvsor of two ntegers a and b (not both zero) s the largest nteger whch s a common factor of both a and b. We denote ths number by gcd(a, b), or smply (a, b) when there s no confuson
More informationSL n (F ) Equals its Own Derived Group
Internatonal Journal of Algebra, Vol. 2, 2008, no. 12, 585-594 SL n (F ) Equals ts Own Derved Group Jorge Macel BMCC-The Cty Unversty of New York, CUNY 199 Chambers street, New York, NY 10007, USA macel@cms.nyu.edu
More informationAPPENDIX A Some Linear Algebra
APPENDIX A Some Lnear Algebra The collecton of m, n matrces A.1 Matrces a 1,1,..., a 1,n A = a m,1,..., a m,n wth real elements a,j s denoted by R m,n. If n = 1 then A s called a column vector. Smlarly,
More informationErrors for Linear Systems
Errors for Lnear Systems When we solve a lnear system Ax b we often do not know A and b exactly, but have only approxmatons  and ˆb avalable. Then the best thng we can do s to solve ˆx ˆb exactly whch
More informationThe internal structure of natural numbers and one method for the definition of large prime numbers
The nternal structure of natural numbers and one method for the defnton of large prme numbers Emmanul Manousos APM Insttute for the Advancement of Physcs and Mathematcs 3 Poulou str. 53 Athens Greece Abstract
More informationFinding Primitive Roots Pseudo-Deterministically
Electronc Colloquum on Computatonal Complexty, Report No 207 (205) Fndng Prmtve Roots Pseudo-Determnstcally Ofer Grossman December 22, 205 Abstract Pseudo-determnstc algorthms are randomzed search algorthms
More informationSpeeding up Computation of Scalar Multiplication in Elliptic Curve Cryptosystem
H.K. Pathak et. al. / (IJCSE) Internatonal Journal on Computer Scence and Engneerng Speedng up Computaton of Scalar Multplcaton n Ellptc Curve Cryptosystem H. K. Pathak Manju Sangh S.o.S n Computer scence
More informationTHE CHINESE REMAINDER THEOREM. We should thank the Chinese for their wonderful remainder theorem. Glenn Stevens
THE CHINESE REMAINDER THEOREM KEITH CONRAD We should thank the Chnese for ther wonderful remander theorem. Glenn Stevens 1. Introducton The Chnese remander theorem says we can unquely solve any par of
More informationGrover s Algorithm + Quantum Zeno Effect + Vaidman
Grover s Algorthm + Quantum Zeno Effect + Vadman CS 294-2 Bomb 10/12/04 Fall 2004 Lecture 11 Grover s algorthm Recall that Grover s algorthm for searchng over a space of sze wors as follows: consder the
More informationSalmon: Lectures on partial differential equations. Consider the general linear, second-order PDE in the form. ,x 2
Salmon: Lectures on partal dfferental equatons 5. Classfcaton of second-order equatons There are general methods for classfyng hgher-order partal dfferental equatons. One s very general (applyng even to
More informationCOMPLEX NUMBERS AND QUADRATIC EQUATIONS
COMPLEX NUMBERS AND QUADRATIC EQUATIONS INTRODUCTION We know that x 0 for all x R e the square of a real number (whether postve, negatve or ero) s non-negatve Hence the equatons x, x, x + 7 0 etc are not
More informationLecture 3. Ax x i a i. i i
18.409 The Behavor of Algorthms n Practce 2/14/2 Lecturer: Dan Spelman Lecture 3 Scrbe: Arvnd Sankar 1 Largest sngular value In order to bound the condton number, we need an upper bound on the largest
More information18.781: Solution to Practice Questions for Final Exam
18.781: Soluton to Practce Questons for Fnal Exam 1. Fnd three solutons n postve ntegers of x 6y = 1 by frst calculatng the contnued fracton expanson of 6. Soluton: We have 1 6=[, ] 6 6+ =[, ] 1 =[,, ]=[,,
More information8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS
SECTION 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS 493 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS All the vector spaces you have studed thus far n the text are real vector spaces because the scalars
More informationLecture 4: Universal Hash Functions/Streaming Cont d
CSE 5: Desgn and Analyss of Algorthms I Sprng 06 Lecture 4: Unversal Hash Functons/Streamng Cont d Lecturer: Shayan Oves Gharan Aprl 6th Scrbe: Jacob Schreber Dsclamer: These notes have not been subjected
More informationn α j x j = 0 j=1 has a nontrivial solution. Here A is the n k matrix whose jth column is the vector for all t j=0
MODULE 2 Topcs: Lnear ndependence, bass and dmenson We have seen that f n a set of vectors one vector s a lnear combnaton of the remanng vectors n the set then the span of the set s unchanged f that vector
More informationDirichlet s Theorem In Arithmetic Progressions
Drchlet s Theorem In Arthmetc Progressons Parsa Kavkan Hang Wang The Unversty of Adelade February 26, 205 Abstract The am of ths paper s to ntroduce and prove Drchlet s theorem n arthmetc progressons,
More informationNUMERICAL DIFFERENTIATION
NUMERICAL DIFFERENTIATION 1 Introducton Dfferentaton s a method to compute the rate at whch a dependent output y changes wth respect to the change n the ndependent nput x. Ths rate of change s called the
More informationAnti-van der Waerden numbers of 3-term arithmetic progressions.
Ant-van der Waerden numbers of 3-term arthmetc progressons. Zhanar Berkkyzy, Alex Schulte, and Mchael Young Aprl 24, 2016 Abstract The ant-van der Waerden number, denoted by aw([n], k), s the smallest
More informationa b a In case b 0, a being divisible by b is the same as to say that
Secton 6.2 Dvsblty among the ntegers An nteger a ε s dvsble by b ε f there s an nteger c ε such that a = bc. Note that s dvsble by any nteger b, snce = b. On the other hand, a s dvsble by only f a = :
More informationTHERE ARE INFINITELY MANY FIBONACCI COMPOSITES WITH PRIME SUBSCRIPTS
Research and Communcatons n Mathematcs and Mathematcal Scences Vol 10, Issue 2, 2018, Pages 123-140 ISSN 2319-6939 Publshed Onlne on November 19, 2018 2018 Jyot Academc Press http://jyotacademcpressorg
More informationFirst day August 1, Problems and Solutions
FOURTH INTERNATIONAL COMPETITION FOR UNIVERSITY STUDENTS IN MATHEMATICS July 30 August 4, 997, Plovdv, BULGARIA Frst day August, 997 Problems and Solutons Problem. Let {ε n } n= be a sequence of postve
More informationStanford University CS254: Computational Complexity Notes 7 Luca Trevisan January 29, Notes for Lecture 7
Stanford Unversty CS54: Computatonal Complexty Notes 7 Luca Trevsan January 9, 014 Notes for Lecture 7 1 Approxmate Countng wt an N oracle We complete te proof of te followng result: Teorem 1 For every
More informationThe Exact Formulation of the Inverse of the Tridiagonal Matrix for Solving the 1D Poisson Equation with the Finite Difference Method
Journal of Electromagnetc Analyss and Applcatons, 04, 6, 0-08 Publshed Onlne September 04 n ScRes. http://www.scrp.org/journal/jemaa http://dx.do.org/0.46/jemaa.04.6000 The Exact Formulaton of the Inverse
More informationMA 323 Geometric Modelling Course Notes: Day 13 Bezier Curves & Bernstein Polynomials
MA 323 Geometrc Modellng Course Notes: Day 13 Bezer Curves & Bernsten Polynomals Davd L. Fnn Over the past few days, we have looked at de Casteljau s algorthm for generatng a polynomal curve, and we have
More informationStanford University CS359G: Graph Partitioning and Expanders Handout 4 Luca Trevisan January 13, 2011
Stanford Unversty CS359G: Graph Parttonng and Expanders Handout 4 Luca Trevsan January 3, 0 Lecture 4 In whch we prove the dffcult drecton of Cheeger s nequalty. As n the past lectures, consder an undrected
More informationLecture 10 Support Vector Machines II
Lecture 10 Support Vector Machnes II 22 February 2016 Taylor B. Arnold Yale Statstcs STAT 365/665 1/28 Notes: Problem 3 s posted and due ths upcomng Frday There was an early bug n the fake-test data; fxed
More informationTAIL BOUNDS FOR SUMS OF GEOMETRIC AND EXPONENTIAL VARIABLES
TAIL BOUNDS FOR SUMS OF GEOMETRIC AND EXPONENTIAL VARIABLES SVANTE JANSON Abstract. We gve explct bounds for the tal probabltes for sums of ndependent geometrc or exponental varables, possbly wth dfferent
More informationBernoulli Numbers and Polynomials
Bernoull Numbers and Polynomals T. Muthukumar tmk@tk.ac.n 17 Jun 2014 The sum of frst n natural numbers 1, 2, 3,..., n s n n(n + 1 S 1 (n := m = = n2 2 2 + n 2. Ths formula can be derved by notng that
More informationCurvature and isoperimetric inequality
urvature and sopermetrc nequalty Julà ufí, Agustí Reventós, arlos J Rodríguez Abstract We prove an nequalty nvolvng the length of a plane curve and the ntegral of ts radus of curvature, that has as a consequence
More informationPolynomials. 1 What is a polynomial? John Stalker
Polynomals John Stalker What s a polynomal? If you thnk you already know what a polynomal s then skp ths secton. Just be aware that I consstently wrte thngs lke p = c z j =0 nstead of p(z) = c z. =0 You
More informationAttacks on RSA The Rabin Cryptosystem Semantic Security of RSA Cryptology, Tuesday, February 27th, 2007 Nils Andersen. Complexity Theoretic Reduction
Attacks on RSA The Rabn Cryptosystem Semantc Securty of RSA Cryptology, Tuesday, February 27th, 2007 Nls Andersen Square Roots modulo n Complexty Theoretc Reducton Factorng Algorthms Pollard s p 1 Pollard
More informationVARIATION OF CONSTANT SUM CONSTRAINT FOR INTEGER MODEL WITH NON UNIFORM VARIABLES
VARIATION OF CONSTANT SUM CONSTRAINT FOR INTEGER MODEL WITH NON UNIFORM VARIABLES BÂRZĂ, Slvu Faculty of Mathematcs-Informatcs Spru Haret Unversty barza_slvu@yahoo.com Abstract Ths paper wants to contnue
More informationLecture 12: Discrete Laplacian
Lecture 12: Dscrete Laplacan Scrbe: Tanye Lu Our goal s to come up wth a dscrete verson of Laplacan operator for trangulated surfaces, so that we can use t n practce to solve related problems We are mostly
More informationLecture 2: Gram-Schmidt Vectors and the LLL Algorithm
NYU, Fall 2016 Lattces Mn Course Lecture 2: Gram-Schmdt Vectors and the LLL Algorthm Lecturer: Noah Stephens-Davdowtz 2.1 The Shortest Vector Problem In our last lecture, we consdered short solutons to
More informationSelf-complementing permutations of k-uniform hypergraphs
Dscrete Mathematcs Theoretcal Computer Scence DMTCS vol. 11:1, 2009, 117 124 Self-complementng permutatons of k-unform hypergraphs Artur Szymańsk A. Paweł Wojda Faculty of Appled Mathematcs, AGH Unversty
More informationVector Norms. Chapter 7 Iterative Techniques in Matrix Algebra. Cauchy-Bunyakovsky-Schwarz Inequality for Sums. Distances. Convergence.
Vector Norms Chapter 7 Iteratve Technques n Matrx Algebra Per-Olof Persson persson@berkeley.edu Department of Mathematcs Unversty of Calforna, Berkeley Math 128B Numercal Analyss Defnton A vector norm
More informationOn the size of quotient of two subsets of positive integers.
arxv:1706.04101v1 [math.nt] 13 Jun 2017 On the sze of quotent of two subsets of postve ntegers. Yur Shtenkov Abstract We obtan non-trval lower bound for the set A/A, where A s a subset of the nterval [1,
More informationRestricted divisor sums
ACTA ARITHMETICA 02 2002) Restrcted dvsor sums by Kevn A Broughan Hamlton) Introducton There s a body of work n the lterature on varous restrcted sums of the number of dvsors of an nteger functon ncludng
More informationarxiv: v1 [quant-ph] 6 Sep 2007
An Explct Constructon of Quantum Expanders Avraham Ben-Aroya Oded Schwartz Amnon Ta-Shma arxv:0709.0911v1 [quant-ph] 6 Sep 2007 Abstract Quantum expanders are a natural generalzaton of classcal expanders.
More informationIntroduction to Information Theory, Data Compression,
Introducton to Informaton Theory, Data Compresson, Codng Mehd Ibm Brahm, Laura Mnkova Aprl 5, 208 Ths s the augmented transcrpt of a lecture gven by Luc Devroye on the 3th of March 208 for a Data Structures
More informationSection 8.3 Polar Form of Complex Numbers
80 Chapter 8 Secton 8 Polar Form of Complex Numbers From prevous classes, you may have encountered magnary numbers the square roots of negatve numbers and, more generally, complex numbers whch are the
More informationarxiv: v1 [math.ho] 18 May 2008
Recurrence Formulas for Fbonacc Sums Adlson J. V. Brandão, João L. Martns 2 arxv:0805.2707v [math.ho] 8 May 2008 Abstract. In ths artcle we present a new recurrence formula for a fnte sum nvolvng the Fbonacc
More informationLinear Approximation with Regularization and Moving Least Squares
Lnear Approxmaton wth Regularzaton and Movng Least Squares Igor Grešovn May 007 Revson 4.6 (Revson : March 004). 5 4 3 0.5 3 3.5 4 Contents: Lnear Fttng...4. Weghted Least Squares n Functon Approxmaton...
More informationP A = (P P + P )A = P (I P T (P P ))A = P (A P T (P P )A) Hence if we let E = P T (P P A), We have that
Backward Error Analyss for House holder Reectors We want to show that multplcaton by householder reectors s backward stable. In partcular we wsh to show fl(p A) = P (A) = P (A + E where P = I 2vv T s the
More informationInexact Newton Methods for Inverse Eigenvalue Problems
Inexact Newton Methods for Inverse Egenvalue Problems Zheng-jan Ba Abstract In ths paper, we survey some of the latest development n usng nexact Newton-lke methods for solvng nverse egenvalue problems.
More informationMin Cut, Fast Cut, Polynomial Identities
Randomzed Algorthms, Summer 016 Mn Cut, Fast Cut, Polynomal Identtes Instructor: Thomas Kesselhem and Kurt Mehlhorn 1 Mn Cuts n Graphs Lecture (5 pages) Throughout ths secton, G = (V, E) s a mult-graph.
More informationj) = 1 (note sigma notation) ii. Continuous random variable (e.g. Normal distribution) 1. density function: f ( x) 0 and f ( x) dx = 1
Random varables Measure of central tendences and varablty (means and varances) Jont densty functons and ndependence Measures of assocaton (covarance and correlaton) Interestng result Condtonal dstrbutons
More informationComplex Numbers. x = B B 2 4AC 2A. or x = x = 2 ± 4 4 (1) (5) 2 (1)
Complex Numbers If you have not yet encountered complex numbers, you wll soon do so n the process of solvng quadratc equatons. The general quadratc equaton Ax + Bx + C 0 has solutons x B + B 4AC A For
More informationIntroduction to Algorithms
Introducton to Algorthms 6.046J/8.40J Lecture 7 Prof. Potr Indyk Data Structures Role of data structures: Encapsulate data Support certan operatons (e.g., INSERT, DELETE, SEARCH) Our focus: effcency of
More informationOn a direct solver for linear least squares problems
ISSN 2066-6594 Ann. Acad. Rom. Sc. Ser. Math. Appl. Vol. 8, No. 2/2016 On a drect solver for lnear least squares problems Constantn Popa Abstract The Null Space (NS) algorthm s a drect solver for lnear
More informationExercises. 18 Algorithms
18 Algorthms Exercses 0.1. In each of the followng stuatons, ndcate whether f = O(g), or f = Ω(g), or both (n whch case f = Θ(g)). f(n) g(n) (a) n 100 n 200 (b) n 1/2 n 2/3 (c) 100n + log n n + (log n)
More informationNotes on Frequency Estimation in Data Streams
Notes on Frequency Estmaton n Data Streams In (one of) the data streamng model(s), the data s a sequence of arrvals a 1, a 2,..., a m of the form a j = (, v) where s the dentty of the tem and belongs to
More information8.6 The Complex Number System
8.6 The Complex Number System Earler n the chapter, we mentoned that we cannot have a negatve under a square root, snce the square of any postve or negatve number s always postve. In ths secton we want
More informationA summation on Bernoulli numbers
Journal of Number Theory 111 (005 37 391 www.elsever.com/locate/jnt A summaton on Bernoull numbers Kwang-Wu Chen Department of Mathematcs and Computer Scence Educaton, Tape Muncpal Teachers College, No.
More informationFACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP
C O L L O Q U I U M M A T H E M A T I C U M VOL. 80 1999 NO. 1 FACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP BY FLORIAN K A I N R A T H (GRAZ) Abstract. Let H be a Krull monod wth nfnte class
More informationMaximizing the number of nonnegative subsets
Maxmzng the number of nonnegatve subsets Noga Alon Hao Huang December 1, 213 Abstract Gven a set of n real numbers, f the sum of elements of every subset of sze larger than k s negatve, what s the maxmum
More informationREGULAR POSITIVE TERNARY QUADRATIC FORMS. 1. Introduction
REGULAR POSITIVE TERNARY QUADRATIC FORMS BYEONG-KWEON OH Abstract. A postve defnte quadratc form f s sad to be regular f t globally represents all ntegers that are represented by the genus of f. In 997
More informationLOW BIAS INTEGRATED PATH ESTIMATORS. James M. Calvin
Proceedngs of the 007 Wnter Smulaton Conference S G Henderson, B Bller, M-H Hseh, J Shortle, J D Tew, and R R Barton, eds LOW BIAS INTEGRATED PATH ESTIMATORS James M Calvn Department of Computer Scence
More informationChapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems
Numercal Analyss by Dr. Anta Pal Assstant Professor Department of Mathematcs Natonal Insttute of Technology Durgapur Durgapur-713209 emal: anta.bue@gmal.com 1 . Chapter 5 Soluton of System of Lnear Equatons
More informationU.C. Berkeley CS294: Beyond Worst-Case Analysis Luca Trevisan September 5, 2017
U.C. Berkeley CS94: Beyond Worst-Case Analyss Handout 4s Luca Trevsan September 5, 07 Summary of Lecture 4 In whch we ntroduce semdefnte programmng and apply t to Max Cut. Semdefnte Programmng Recall that
More informationEEE 241: Linear Systems
EEE : Lnear Systems Summary #: Backpropagaton BACKPROPAGATION The perceptron rule as well as the Wdrow Hoff learnng were desgned to tran sngle layer networks. They suffer from the same dsadvantage: they
More informationDISCRIMINANTS AND RAMIFIED PRIMES. 1. Introduction A prime number p is said to be ramified in a number field K if the prime ideal factorization
DISCRIMINANTS AND RAMIFIED PRIMES KEITH CONRAD 1. Introducton A prme number p s sad to be ramfed n a number feld K f the prme deal factorzaton (1.1) (p) = po K = p e 1 1 peg g has some e greater than 1.
More informationProblem Set 9 Solutions
Desgn and Analyss of Algorthms May 4, 2015 Massachusetts Insttute of Technology 6.046J/18.410J Profs. Erk Demane, Srn Devadas, and Nancy Lynch Problem Set 9 Solutons Problem Set 9 Solutons Ths problem
More informationThe L(2, 1)-Labeling on -Product of Graphs
Annals of Pure and Appled Mathematcs Vol 0, No, 05, 9-39 ISSN: 79-087X (P, 79-0888(onlne Publshed on 7 Aprl 05 wwwresearchmathscorg Annals of The L(, -Labelng on -Product of Graphs P Pradhan and Kamesh
More informationAffine transformations and convexity
Affne transformatons and convexty The purpose of ths document s to prove some basc propertes of affne transformatons nvolvng convex sets. Here are a few onlne references for background nformaton: http://math.ucr.edu/
More information5 The Rational Canonical Form
5 The Ratonal Canoncal Form Here p s a monc rreducble factor of the mnmum polynomal m T and s not necessarly of degree one Let F p denote the feld constructed earler n the course, consstng of all matrces
More informationOn quasiperfect numbers
Notes on Number Theory and Dscrete Mathematcs Prnt ISSN 1310 5132, Onlne ISSN 2367 8275 Vol. 23, 2017, No. 3, 73 78 On quasperfect numbers V. Sva Rama Prasad 1 and C. Suntha 2 1 Nalla Malla Reddy Engneerng
More informationModule 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur
Module 3 LOSSY IMAGE COMPRESSION SYSTEMS Verson ECE IIT, Kharagpur Lesson 6 Theory of Quantzaton Verson ECE IIT, Kharagpur Instructonal Objectves At the end of ths lesson, the students should be able to:
More informationFormulas for the Determinant
page 224 224 CHAPTER 3 Determnants e t te t e 2t 38 A = e t 2te t e 2t e t te t 2e 2t 39 If 123 A = 345, 456 compute the matrx product A adj(a) What can you conclude about det(a)? For Problems 40 43, use
More information332600_08_1.qxp 4/17/08 11:29 AM Page 481
336_8_.qxp 4/7/8 :9 AM Page 48 8 Complex Vector Spaces 8. Complex Numbers 8. Conjugates and Dvson of Complex Numbers 8.3 Polar Form and DeMovre s Theorem 8.4 Complex Vector Spaces and Inner Products 8.5
More informationNumerical Properties of the LLL Algorithm
Numercal Propertes of the LLL Algorthm Frankln T. Luk a and Sanzheng Qao b a Department of Mathematcs, Hong Kong Baptst Unversty, Kowloon Tong, Hong Kong b Dept. of Computng and Software, McMaster Unv.,
More informationNumerical Heat and Mass Transfer
Master degree n Mechancal Engneerng Numercal Heat and Mass Transfer 06-Fnte-Dfference Method (One-dmensonal, steady state heat conducton) Fausto Arpno f.arpno@uncas.t Introducton Why we use models and
More informationSUCCESSIVE MINIMA AND LATTICE POINTS (AFTER HENK, GILLET AND SOULÉ) M(B) := # ( B Z N)
SUCCESSIVE MINIMA AND LATTICE POINTS (AFTER HENK, GILLET AND SOULÉ) S.BOUCKSOM Abstract. The goal of ths note s to present a remarably smple proof, due to Hen, of a result prevously obtaned by Gllet-Soulé,
More informationThe Jacobsthal and Jacobsthal-Lucas Numbers via Square Roots of Matrices
Internatonal Mathematcal Forum, Vol 11, 2016, no 11, 513-520 HIKARI Ltd, wwwm-hkarcom http://dxdoorg/1012988/mf20166442 The Jacobsthal and Jacobsthal-Lucas Numbers va Square Roots of Matrces Saadet Arslan
More informationWeek 2. This week, we covered operations on sets and cardinality.
Week 2 Ths week, we covered operatons on sets and cardnalty. Defnton 0.1 (Correspondence). A correspondence between two sets A and B s a set S contaned n A B = {(a, b) a A, b B}. A correspondence from
More informationNotes prepared by Prof Mrs) M.J. Gholba Class M.Sc Part(I) Information Technology
Inverse transformatons Generaton of random observatons from gven dstrbutons Assume that random numbers,,, are readly avalable, where each tself s a random varable whch s unformly dstrbuted over the range(,).
More informationLecture 10: May 6, 2013
TTIC/CMSC 31150 Mathematcal Toolkt Sprng 013 Madhur Tulsan Lecture 10: May 6, 013 Scrbe: Wenje Luo In today s lecture, we manly talked about random walk on graphs and ntroduce the concept of graph expander,
More informationCHAPTER III Neural Networks as Associative Memory
CHAPTER III Neural Networs as Assocatve Memory Introducton One of the prmary functons of the bran s assocatve memory. We assocate the faces wth names, letters wth sounds, or we can recognze the people
More informationJournal of Universal Computer Science, vol. 1, no. 7 (1995), submitted: 15/12/94, accepted: 26/6/95, appeared: 28/7/95 Springer Pub. Co.
Journal of Unversal Computer Scence, vol. 1, no. 7 (1995), 469-483 submtted: 15/12/94, accepted: 26/6/95, appeared: 28/7/95 Sprnger Pub. Co. Round-o error propagaton n the soluton of the heat equaton by
More informationarxiv: v1 [math.co] 1 Mar 2014
Unon-ntersectng set systems Gyula O.H. Katona and Dánel T. Nagy March 4, 014 arxv:1403.0088v1 [math.co] 1 Mar 014 Abstract Three ntersecton theorems are proved. Frst, we determne the sze of the largest
More informationAssortment Optimization under MNL
Assortment Optmzaton under MNL Haotan Song Aprl 30, 2017 1 Introducton The assortment optmzaton problem ams to fnd the revenue-maxmzng assortment of products to offer when the prces of products are fxed.
More informationarxiv: v1 [math.co] 12 Sep 2014
arxv:1409.3707v1 [math.co] 12 Sep 2014 On the bnomal sums of Horadam sequence Nazmye Ylmaz and Necat Taskara Department of Mathematcs, Scence Faculty, Selcuk Unversty, 42075, Campus, Konya, Turkey March
More informationContinuous Time Markov Chains
Contnuous Tme Markov Chans Brth and Death Processes,Transton Probablty Functon, Kolmogorov Equatons, Lmtng Probabltes, Unformzaton Chapter 6 1 Markovan Processes State Space Parameter Space (Tme) Dscrete
More informationMath 261 Exercise sheet 2
Math 261 Exercse sheet 2 http://staff.aub.edu.lb/~nm116/teachng/2017/math261/ndex.html Verson: September 25, 2017 Answers are due for Monday 25 September, 11AM. The use of calculators s allowed. Exercse
More informationAn Introduction to Morita Theory
An Introducton to Morta Theory Matt Booth October 2015 Nov. 2017: made a few revsons. Thanks to Nng Shan for catchng a typo. My man reference for these notes was Chapter II of Bass s book Algebrac K-Theory
More informationSome Consequences. Example of Extended Euclidean Algorithm. The Fundamental Theorem of Arithmetic, II. Characterizing the GCD and LCM
Example of Extended Eucldean Algorthm Recall that gcd(84, 33) = gcd(33, 18) = gcd(18, 15) = gcd(15, 3) = gcd(3, 0) = 3 We work backwards to wrte 3 as a lnear combnaton of 84 and 33: 3 = 18 15 [Now 3 s
More informationBallot Paths Avoiding Depth Zero Patterns
Ballot Paths Avodng Depth Zero Patterns Henrch Nederhausen and Shaun Sullvan Florda Atlantc Unversty, Boca Raton, Florda nederha@fauedu, ssull21@fauedu 1 Introducton In a paper by Sapounaks, Tasoulas,
More informationCHARACTERISTICS OF COMPLEX SEPARATION SCHEMES AND AN ERROR OF SEPARATION PRODUCTS OUTPUT DETERMINATION
Górnctwo Geonżynera Rok 0 Zeszyt / 006 Igor Konstantnovch Mladetskj * Petr Ivanovch Plov * Ekaterna Nkolaevna Kobets * Tasya Igorevna Markova * CHARACTERISTICS OF COMPLEX SEPARATION SCHEMES AND AN ERROR
More information