Some Connections Between Primitive Roots and Quadratic Non-Residues Modulo a Prime
|
|
- Sabina Phillips
- 6 years ago
- Views:
Transcription
1 Some Connections Between Primitive Roots nd Qudrtic Non-Residues Modulo Prime Sorin Iftene Dertment of Comuter Science Al. I. Cuz University Isi, Romni Emil: Abstrct In this er we resent some interesting connections between rimitive roots nd qudrtic non-residues modulo rime. Using these correltions, we roose some olynomil deterministic lgorithms for generting rimitive roots for rimes with secil forms (for exmle, for sfe rimes. Index Terms rimitive roots, Legendre-Jcobi symbol, qudrtic non-residues, squre roots. I. INTRODUCTION Generting rimitive roots modulo rime is n fundmentl roblem in number theory, with mjor lictions in crytogrhy. Diffie-Hellmn key estblishment scheme [1], ElGml ublic-key crytosystem [], Schnorr identifiction scheme [3] nd Digitl Signture Scheme [4] re only few exmles which rely on generting rimitive roots or elements of certin order. Finding qudrtic non-residues modulo rime is nother interesting roblem in number theory. Tonelli- Shnks lgorithm ( [5], [6] nd Ciol-Lehmer lgorithm ( [7], [8] for comuting squre roots modulo rime nd Goldwsser-Micli robbilistic encrytion scheme [9] re the most imortnt lictions tht rely on generting qudrtic non-residues. In this er we discuss comrtively these two issues. After resenting the existing rndomized lgorithm for generting rimitive roots, we roose some olynomil deterministic lgorithms for generting rimitive roots for rimes with secil forms. The er is structured s follows. Section is dedicted to some mthemticl reliminries on rimitive roots nd qudrtic non-residues. Section 3 resents some connections between rimitive roots nd qudrtic non-residues modulo rime. Generting rimitive roots is discussed in Section 4. The lst section concludes the er. II. MATHEMATICAL BACKGROUND In this section we resent some bsic fcts on number theory, focusing on rimitive roots nd qudrtic non-residues. For more detils, the reder is referred to [10], [11], [1], [13]. Comuttionl sects cn be found in [14]. A. The order of n element. Primitive roots Definition 1: Let m nd Z m. The order of modulo m, denoted by ord m (, is defined s ord m ( min({l N l 1 mod m} The most imortnt roerties of the order of n element re summrized in Proosition 1. Proosition 1: Let m, Z m, nd k, l some integers. 1 If k 1 mod m then ord m ( k. As rticulr cse, we obtin ord m ( φ(m, where φ denotes Euler s totient function; The reltion k l mod m is equivlent with k l mod ord m (; 3 The next reltion holds true ord m ( k mod m ord m( (ord m (, k. Definition : Let m nd α Z m. The element α is clled rimitive root modulo m if ord m (α φ(m. Remrk 1: In cse tht α is rimitive root modulo m, every element β from the set Z m cn be uniquely exressed s β α i mod m, for i Z φ(m. The vlue i will be referred to s the discrete logrithm (modulo m to the bse α of β nd we will write i log α β. While n exression of form β α i mod m cn be efficiently comuted given α, i, m (see, for exmle, [14], the roblem of finding the discrete logrithm modulo m to the bse α of β, given α, β, m is intrctble. The most imortnt roerties of the rimitive roots re resented in Proosition. Proosition : Let m, α Z m. Then 1 Z m hs rimitive roots if nd only if m {, 4, k, k }, where is n odd rime nd k 1 (Guss Theorem; If Z m hs rimitive roots, then there re exctly φ(φ(m rimitives roots modulo m; 3 If Z m hs rimitive roots, α is rimitive root modulo m if nd only if the next reltion holds: α φ(m r 1 mod m, for ny rime divisor r of φ(m. Proosition (3 does not lwys llow to efficiently generte rimitive roots modulo m becuse comuting φ(m nd fctoring φ(m re intrctble for lrge integers m. Elements of order q my be generted vi rimitive roots. More exctly, if q φ(m, α is rimitive root modulo m,
2 nd β α φ(m q Proosition 1(3, ord m (α φ(m q mod m φ(m (φ(m, φ(m q q. mod m, then ord m (β q. Indeed, by the B. Qudrtic (non-residues. Squre roots ord m(α (ord m(α, φ(m q Definition 3: Let be rime nd Z. We sy tht is qudrtic residue modulo if there exists b Z with the roerty b mod. Otherwise, is qudrtic nonresidue modulo. For the simlicity of the nottion, from this oint forwrd we will omit the modulr reduction modulo but the reder must be wre tht ll comuttions re erformed modulo if not exlicitly stted otherwise. If b then b will be referred to s squre root of. We hve to remrk tht if is qudrtic residue modulo, odd rime, then hs exctly two squre roots - if b is squre root of, then b is the other one. In rticulr, 1 hs the squre roots 1 nd ( 1 (in this cse, ( 1 will be regrded s being 1 or, equivlently, 1 ( 1 ( 1. Definition ( 4: The Legendre symbol of modulo, denoted s, is defined to be equl to ±1 deending on whether is qudrtic residue modulo. More exctly, ( { 1, if is qudrtic residue mod ; 1, otherwise. The Jcobi symbol is generliztion of the Legendre symbol to rbitrry moduli nd is defined s (the sme nottion is used: ( ( e1 ( e ( ek, n 1 k for ny odd ositive integer n, Z n, where e1 1 e e k k is the rime fctoriztion of n. The most imortnt roerties of the Legendre-Jcobi symbol re summrized in Proosition 3 (for more detils, see [1], [13]. Proosition 3: 1 (Euler s criterion For ny rime nd Z, the following reltion holds true: ( 1 1 ( ; ( 1 1, tht imlies tht ( 1 is qudrtic non-residue modulo if nd only if 3 mod 4; ( 3 ( 1 1 8, tht imlies tht is qudrtic nonresidue modulo if nd only if ±3 mod 8; 4 ( ( b n ( b n n ; 5 ( ( n b ( n if nd only if b mod n; in rticulr, ( n mod n n ; 6 (lw of qudrtic recirocity ( 1 ( 1 n 1, ( n n for ny corime odd ositive integers, n. These roerties led to the following lgorithm for comuting the Legendre-Jcobi symbol ( [1, ge 113]: LegendreJcobi (,n inut: ( n, n odd ositive integer, Z n ; outut: n ; t : 1; while 0 do while mod 0 do : div ; if n ±3 mod 8 then t : t; sw(,n; if ( 3 mod 4 nd n 3 mod 4 then t : t; : mod n; return( t Fig. 1: An lgorithm for comuting the Legendre-Jcobi symbol The comlexity of this lgorithm is O((log ((log (n. Euler s criterion lso rovides method of comuting the Legendre symbol of modulo using n exonentition modulo, whose comlexity is O((log ( 3 (see, for exmle, [14]. There re fster methods for evluting the Legendre- Jcobi symbol - see, for exmle, [15], in which re resented lgorithms of comlexity O( (log( log (log ( for comuting the Legendre-Jcobi symbol modulo. Thus, is imortnt to remrk tht the evlution of the Legendre-Jcobi symbol is much fster thn n exonentition. It is known (see, for exmle, [16][Remrk.151] tht for n odd rime, hlf of the elements in Z re qudrtic non-residues modulo. Still, no deterministic olynomil lgorithm is known for finding qudrtic non-residue modulo rime. A rndomized lgorithm for finding qudrtic non-residue modulo rime is to simly generte rndom elements in Z until one is found hving its Legendre- Jcobi symbol equl with 1. The exected number itertions before qudrtic non-residue modulo is found is two. An lgorithm for generting qudrtic residue is resented next. GenerteQudrticNonResidue( inut:, n odd rime; outut: qudrtic non-residue modulo ; if 3 mod 4 then return( 1 if 5 mod 8 then return( reet generte rndomly Z until LegendreJcobi(, 1 return( Fig. : An lgorithm for generting qudrtic non-residue modulo rime
3 Comuting squre roots modulo rime is nother fundmentl roblem in number theory, with mjor lictions s rimlity testing, fctoriztion or ellitic oint comression. According to Bch nd Shllit [1, Notes on Chter 7, ge 194] nd Lemmermeyer [13, Exercise 1.16, Pge 9], Lgrnge ws the first one who hs stted n exlicit formul for comuting squre roots in the cse 3 mod 4 in According to the sme sources ( [1, Exercise 1, ge 188] nd [13, Exercise 1.17, Pge 9], the cse 5 mod 8 hs been solved by Legendre in Atkin [17] hs lso found simle solution for the cse 5 mod 8 in 199. For the rest of the cses, Tonelli-Shnks lgorithm ( [5], [6] nd Ciol- Lehmer lgorithm ( [7], [8] cn be used, these lgorithms relying on qudrtic non-residue modulo. An lgorithm for finding the set of squre roots modulo rime, for given element Z, is sketched next. SqureRoots(, inut:, n odd rime, Z ; outut: the set of the squre roots modulo of ; if LegendreJcobi(, 1 then return( if 1 then return({1, 1} if 3 mod 4 then return({ +1 4, +1 4 } if 5 mod 8 then u : ( 5 8 ; v : u ; b u(v 1; return({b, b} end cll Tonelli-Shnks or Ciol-Lehmer Fig. 3: An lgorithm for finding the set of squre roots This lgorithm cn be recursively clled for obtining the set of the solutions of the eqution x s 1, for given s. III. PRIMITIVE ROOTS VERSUS QUADRATIC NON-RESIDUES (MODULO A PRIME In this section we discuss some interesting connections between these two toics. Some of these correltions will be exloited in the next section in order to develo deterministic lgorithms for generting rimitive roots modulo secil rimes. Proosition 4: Let be n odd rime nd α rimitive root modulo. Then α is qudrtic non-residue modulo. Proof: Using Proosition (3, we obtin tht α 1 r 1 for ny rime divisor r of ( 1. For r (( 1 is even we hve tht α 1 1 (this is equivlent with α 1 1 becuse (α 1 1 by Fermt s Theorem nd 1 hs the only squre roots 1 nd 1 modulo rime which, in dition with Euler s criterion (Pro 3(1 leds to the fct tht α is qudrtic non-residue modulo. Proosition 5: Let be n odd rime nd α qudrtic non-residue modulo. Then α is rimitive root modulo if nd only if α 1 r 1 for ny odd rime divisor r of ( 1. Proof: Directly from Proosition (3 nd Euler s criterion (Pro 3(1. Directly from Proosition 4 nd Proosition 5 we obtin: Proosition 6: Let be n odd rime such tht there is s 1 so tht 1 s nd α Z. Then α is rimitive root modulo if nd only if α is qudrtic non-residue modulo. Proosition 7: Let be n odd rime nd, α Z. The following reltions hold true: 1 If is qudrtic non-residue modulo nd k Z then k is qudrtic non-residue modulo if nd only if k is odd; If α is rimitive root modulo nd k Z then α k is rimitive root modulo if nd only if (k, 1 1. Proof: ( ( k 1 It follows directly from the roerty k ( k mod ; From Proosition 1(3 we obtin tht ord (α k ord (α (if α is rimitive root then its (ord (α,k 1 (k, 1 order is φ( 1. Thus, α k is rimitive root if nd only if ord (α k 1, or, equivlently, (k, 1 1. Proosition 8: Let be n odd rime. The following reltions hold true: 1 If nd b re qudrtic non-residues modulo then b is qudrtic residue modulo ; If is qudrtic non-residue modulo nd b is qudrtic residue modulo then b is qudrtic nonresidue modulo ; 3 If nd b re qudrtic residues modulo then b is qudrtic residue modulo ; 4 If α nd β re rimitive roots modulo then αβ is non-rimitive root modulo. Proof: (1, (, (3 follow directly from Proosition 3(4; (4 From Proosition 4 we obtin tht α nd β re qudrtic non-residues modulo which leds to the fct tht αβ is qudrtic residue modulo nd, thus, αβ is not rimitive root modulo (lso by Proosition 4; Remrk : 1 It is interesting tht result similr to the roerty resented in Proosition 8( does not hold for rimitive roots. More exctly, if α is rimitive root modulo nd β is non-rimitive root modulo then αβ my be or not rimitive root modulo. Indeed, in this cse β cn be exressed s α k, with (k, 1 1 (from Proosition 7(. We obtin tht αβ α k+1. We my hve (k+1, 1 1 (for exmle, in cse 7, k 4 nd in this cse αβ is rimitive root modulo or we my hve (k + 1, 1 1 (for exmle, in cse
4 7, k which imlies tht αβ is non-rimitive root modulo. Also, result similr to the roerty resented in Proosition 8(3 does not hold for rimitive roots. More exctly, if α is non-rimitive root modulo nd β is non-rimitive root modulo then αβ my be or not rimitive root modulo. Indeed, in this cse, if we consider γ, rimitive root modulo then α cn be exressed s γ k1, with (k 1, 1 1 nd β cn be exressed s γ k, with (k, 1 1 (from Proosition 7(. We obtin tht αβ γ k1+k. We my hve (k 1 + k, 1 1 (for exmle, in cse 7, k 1, k 3 nd in this cse αβ is rimitive root modulo or we my hve (k 1 + k, 1 1 (for exmle, in cse 7, k 1, k 4 which imlies tht αβ is non-rimitive root modulo. IV. GENERATING PRIMITIVE ROOTS MODULO A PRIME Proosition (3 from Section II gives method of generting rimitive root modulo n odd rime, knowing the rime decomosition of φ( 1, s resented in Figure 4 (which resents the clssic rndomized lgorithm for generting rimitive root modulo n odd rime. PrimitiveRoot1( inut:, n odd rime; dditionl inut: the rime fctoriztion of ( 1; generte rndomly α Z ; ok : 1; for ech rime r, r ( 1 do if α 1 r 1 then ok : 0 if ok 1 then return(α Fig. 4: The clssic lgorithm for generting rimitive root modulo n odd rime, knowing the rime fctoriztion of ( 1 The robbility of success, denoted by success, of the clssic rndomized lgorithm (which is of Ls Vegs tye resented bove is given by the rtio between the number of rimitive roots nd the totl number of elements in Z, i.e., success φ(φ( φ( (by Proosition (. Using Proosition 5 from Section III we obtin the following imroved lgorithm: PrimitiveRoot( inut:, n odd rime; dditionl inut: the rime fctoriztion of ( 1; α :GenerteQudrticNonResidue(; ok : 1; for ech odd rime r, r ( 1 do if α 1 r 1 then ok : 0 if ok 1 then return(α Fig. 5: An imroved lgorithm for generting rimitive root modulo n odd rime, knowing the rime fctoriztion of ( 1 In fct, the min difference between PrimitiveRoot1 nd PrimitiveRoot is tht the exonentition α 1 (which is the oertion with the gretest exonent mong those involved in Algorithm PrimitiveRoot1 is relced with the evlution of the Legendre-Jcobi symbol (in order to verify tht α is qudrtic non-residue modulo. The imrovement is given by the fct tht the evlution of Legendre- Jcobi symbol is much fster thn n exonentition (see, e.g., [1, ge 113] or [15]. Moreover, for rimes with certin forms, qudrtic non-residue modulo cn be generted without effectively evluting the Legendre-Jcobi symbol (see Algorithm GenerteQudrticNonResidue from Section II nd this cn led to further imrovements. The sme seedu hs been discovered by Cohen in [10]. The biggest imct of this relcement is obtined in the cse of the rimes of secil form s q + 1, where s 1 nd q is n odd rime (in this cse Algorithm PrimitiveRoot1 imlies only two exonentitions, with exonents 1 nd 1 q nd in Algorithm PrimitiveRoot the oertion with exonent 1 is relced with the evlution of the Legendre-Jcobi symbol. For such rimes, n element α Z is rimitive root if nd only if (α qudrtic non-residue modulo α s 1. We obtin the following lgorithm: PrimitiveRoot3( inut: rime, s q + 1, s 1, q odd rime; α :GenerteQudrticNonResidue(; if α s 1 then return(α Fig. 6: An lgorithm for generting rimitive root modulo rime, s q + 1, s 1, q odd rime For rime, s q + 1, s 1, q is n odd rime, we
5 obtin tht success φ(φ( φ( (s s 1 (q 1 s q q 1 q 1 Evidently, this lgorithm my be iterted until rimitive root is finlly oututted. The exected number itertions before rimitive root is found is two. A. Finding Deterministic Algorithms for Generting Primitive Roots Modulo Secil Primes In this rt of the er we try to find efficient deterministic lgorithms for generting rimitive roots modulo, s q + 1, s 1, q odd rime, for certin smll vlues of s (s {1, }. In these cses, qudrtic non-residues re known: ( 1 for s 1 (in this cse, 3 mod 4 nd for s (in this cse, 5 mod 8. The min ide is to find, with single rndom genertion, n element tht is simultneously qudrtic non-residue nd non-solution for the eqution x s 1. We my use the following tricks (see Proosition 8: 1 If α is qudrtic residue then, by multilying it with qudrtic non-residue, we will obtin qudrtic nonresidue; If α is qudrtic non-residue then, by multilying it with qudrtic residue, we will obtin qudrtic nonresidue; 3 If α is solution of the eqution x s 1 then, by multilying it with non-solution of the sme eqution, we will obtin non-solution of the sme eqution; 4 If α is non-solution of the eqution x s 1 then, by multilying it with solution of the sme eqution, we will obtin non-solution of the sme eqution. Thus, in cse tht qudrtic non-residue β is somehow rovided, we need to consider two cses: 1 If β s 1 - then α β is rimitive root modulo ; If β s 1 - then, by multilying β with non-solution of the eqution x s 1 which is simultneously qudrtic residue modulo, we will obtin rimitive root modulo - more exctly, ny trnsformtion of tye α βγ will work s long (γ s 1 (we hve to remrk tht there exist qudrtic residues tht re non-solutions for the eqution x s 1 becuse this eqution hs t most s solutions in Z wheres there re 1 s 1 q qudrtic residues modulo. The simlest otion is to choose γ (when 4 s 1, which trnsltes in multilying β with 4 modulo. We obtin the following lgorithm: PrimitiveRoot4( inut: rime, s q + 1, s 1, q odd rime; dditionl inut: β, qudrtic non-residue mod ; if β s 1 then return(β γ : ; while (γ s 1 do γ : γ + 1; α : βγ ; return(α Fig. 7: An lgorithm for generting rimitive root modulo rime, s q + 1, s 1, q odd rime, in cse tht qudrtic non-residue β is rovided A different strtegy (but less licble nd, moreover, less efficient is to strt with α s non-solution of the eqution x s 1. There re two roches for chieving this: generting rndom α nd testing if α s 1; comuting ll the solutions of the eqution x s 1 (using recursively the lgorithm SqureRoots resented in Section II nd generting α outside this set; this roch is suitble only for very smll s (s 1 or s. Then, if α is qudrtic non-residue modulo then α is rimitive root modulo ; else, by multilying α with β we will obtin rimitive root modulo roviding tht β is solution of the eqution x s 1. We will roose next some efficient deterministic lgorithms for generting rimitive roots in the cses s 1, s. 1 The Cse s 1: This is exctly the cse of sfe rimes, i.e, rimes of form q + 1, q odd rime. These rimes stisfy 3 mod 4 nd thus ( 1 is qudrtic non-residue modulo. The element ( 1 is lso solution for the eqution x 1 1. Becuse 1 nd ( 1 re the only solutions of this eqution, it is sufficient to find qudrtic non-residue in the set {, 3,..., }. The second strtegy resented bove leds to the following deterministic lgorithm: PrimitiveRootSfePrime1( inut: rime, q + 1, q odd rime; generte rndomly α {, 3,..., }; if LegendreJcobi(α, 1 then return(α else return( α Fig. 8: An initil deterministic lgorithm for generting rimitive root modulo rime, q + 1, q odd rime Indeed, if α is qudrtic residue modulo then ( α is qudrtic non-residue modulo (becuse ( 1 is qudrtic non-residue modulo. Moreover, if α {, 3,..., } then lso ( α {, 3,..., }. The comlexity of the
6 bove lgorithm is O((log ( if we use the Algorithm LegendreJcobi resented in Section II but if we use fster methods for evluting the Legendre-Jcobi symbol (see, for exmle, [15], we cn obtin n lgorithm of comlexity O( (log( log. (log ( The lgorithm PrimitiveRoot4, for rimes of form q+1, q odd rime (in this cse, we my choose β 1, reduces to the following very simle lgorithm: PrimitiveRootSfePrime( inut: rime, q + 1, q odd rime; generte rndomly γ {, 3,..., }; α : γ ; return(α Fig. 9: An lterntive deterministic lgorithm for generting rimitive root modulo rime, q + 1, q odd rime Indeed, in this cse, β 1 1 nd (γ 1 1 γ ±1. Algorithm PrimitiveRootSfePrime involves only one modulr squring modulo nd, therefore, its comlexity is O((log ( (see, for exmle, [14]. Exmle 1 illustrtes the liction of the lgorithms PrimitiveRootSfePrime1 nd PrimitiveRootSfePrime. Exmle 1: (with rtificilly smll rmeters Let 11 (q 5. In this cse is rimitive root modulo 11 becuse nd The rest of the rimitive roots cn be obtined s 3, 7, 9 (see Proosition 7( which leds to the elements 8, 7, nd, resectively, 6. PrimitiveRootSfePrime1 - suose tht α 5 is ( generted in the first ste of the lgorithm; becuse (5 4 mod 11 then ( 5 6 is returned, which is indeed rimitive root modulo 11; PrimitiveRootSfePrime - by considering ll the vlues γ {, 3, 4, 5} we my obtin ll the rimitive roots modulo 11; these re: ( 7, ( 3, ( 4 6, nd, finlly, ( 5 8. The Cse s : This is the cse of rimes q +1, q odd rime, tht stisfy 5 mod 8. Thus, is qudrtic non-residue modulo. If is lso non-solution for the eqution x 1 then is rimitive root modulo. The reltion 1 mod is equivlent with 15. Becuse is rime nd 13 (becuse q 3 then we obtin tht cnnot be solution for the eqution x 1 mod nd, thus, is rimitive root modulo. If we re interested in finding nother rimitive roots, we my rise t ny odd ower tht is not divisible by q. V. CONCLUSIONS AND FUTURE WORK In this er we hve nlysed some interesting connections between rimitive roots nd qudrtic non-residues modulo rime. Using some correltions between the mentioned toics, we hve roosed some efficient deterministic lgorithms for generting rimitive roots modulo, s q + 1, s 1, q odd rime, for certin smll vlues of s (s {1, }. Becuse in these cses, qudrtic non-residues re known, some simle lgorithms cn be develoed, s resented in Section IV-A. It is interesting to investigte more comlex cses, s s q r + 1 or even s q r1 1 qr + 1. We will consider these issues in our future work. Acknowledgements We thnk D. J. Bernstein for ointing us the fct tht relcing the exonention α 1 with the evlution of the Legendre-Jcobi symbol hs been lredy resented by Cohen in [10]. REFERENCES [1] W. Diffie nd M. E. Hellmn, New directions in crytogrhy, IEEE Trnsctions on Informtion Theory, vol. IT-, no. 6, , [] T. ElGml, A ublic key crytosystem nd signture scheme bsed on discrete logrithms, IEEE Trnsctions on Informtion Theory, vol. 31, , 1985, ( reliminry version ered in Advnces in Crytology Cryto 84, G. R. Blkley nd D. Chum, eds., Lecture Notes in Comuter Science 196 (1985, [3] C.-P. Schnorr, Efficient identifiction nd signtures for smrt crds, in Advnces in Crytology - CRYPTO 89, ser. Lecture Notes in Comuter Science, G. Brssrd, Ed., vol Sringer, 1989, [4] FIPS 186-3, Digitl Signture Stndrd, Federl Informtion Processing Stndrds Publiction 186, June 009, htt://csrc.nist.gov/ublictions/fis/fis186-3/fis df. [5] A. Tonelli, Bemerkung über die Auflösung qudrtischer Congruenzen, Göttinger Nchrichten, , [6] D. Shnks, Five number-theoretic lgorithms, in Proceedings of the second Mnitob conference on numericl mthemtics, ser. Congressus Numerntium, R. Thoms nd H. Willims, Eds., vol. 7. Utilits Mthemtic, 1973, [7] M. Cioll, Un metodo er l risolutione dell congruenz di secondo grdo, RendicontodellAccdemi Scienze Fisiche e Mtemtiche, Noli, vol. 9, , [8] D. Lehmer, Comuter technology lied to the theory of numbers, in Studies in number theory, ser. MAA Studies in Mthemtics, W. Leveque, Ed., vol. 6. Prentice-Hll, 1969, [9] S. Goldwsser nd S. Micli, Probbilistic encrytion, Journl of Comuter nd System Sciences, vol. 8, no., , [10] H. Cohen, A Course in Comuttionl Algebric Number Theory, 4th ed., ser. Grdute Texts in Mthemtics. Sringer-Verlg, 000. [11] F. L. Ţile, Algebric Foundtions of Comuter Science. Polirom, 006, (in Romnin. [1] E. Bch nd J. Shllit, Algorithmic Number Theory, Volume I: Efficient Algorithms. MIT Press, [13] F. Lemmermeyer, Recirocity Lws. From Euler to Eisenstein. Sringer- Verlg, 000. [14] F. L. Ţile, S. Iftene, C. Hriţcu, I. Goric, R. Gordân, nd E. Erbicenu, MNT: A multi-recision number theory ckge. Number-theoretic lgorithms (I, Al.I.Cuz University of Işi, Fculty of Comuter Science, Tech. Re. TR 03-0, 003, (vilble t htt:// tr/tr.l.cgi. [15] S. Eikenberry nd J. Sorenson, Efficient lgorithms for comuting the Jcobi symbol, Journl of Symbolic Comuttion, vol. 6, no. 4, , [16] A. J. Menezes, P. C. vn Oorschot, nd S. A. Vnstone, Hndbook of Alied Crytogrhy, ser. Discrete Mthemtics nd Its Alictions. CRC Press, vol. 6. [17] A. Atkin, Probbilistic rimlity testing (summry by F. Morin, INRIA, Tech. Re. 1779, 199, URL:htt://lgo.inri.fr/seminrs/sem91-9/tkin.df.
LECTURE 9: QUADRATIC RESIDUES AND THE LAW OF QUADRATIC RECIPROCITY
LECTURE 9: QUADRATIC RESIDUES AND THE LAW OF QUADRATIC RECIPROCITY 1. Bsic roerties of qudrtic residues We now investigte residues with secil roerties of lgebric tye. Definition 1.1. (i) When (, m) 1 nd
More informationMATH 118 PROBLEM SET 6
MATH 118 PROBLEM SET 6 WASEEM LUTFI, GABRIEL MATSON, AND AMY PIRCHER Section 1 #16: Show tht if is qudrtic residue modulo m, nd b 1 (mod m, then b is lso qudrtic residue Then rove tht the roduct of the
More informationSolutions to Exam 1. Problem 1. a) State Fermat s Little Theorem and Euler s Theorem. b) Let m, n be relatively prime positive integers.
Solutions to Exam 1 Problem 1. a) State Fermat s Little Theorem and Euler s Theorem. b) Let m, n be relatively rime ositive integers. Prove that m φ(n) + n φ(m) 1 (mod mn). c) Find the remainder of 1 008
More informationExample: Modulo 11: Since Z p is cyclic, there is a generator. Let g be a generator of Z p.
Qudrtic Residues Defiitio: The umbers 0, 1,,, ( mod, re clled udrtic residues modulo Numbers which re ot udrtic residues modulo re clled udrtic o-residues modulo Exmle: Modulo 11: Itroductio to Number
More informationMATH 324 Elementary Number Theory Solutions to Practice Problems for Final Examination Monday August 8, 2005
MATH 324 Elementary Number Theory Solutions to Practice Problems for Final Examination Monday August 8, 2005 Deartment of Mathematical and Statistical Sciences University of Alberta Question 1. Find integers
More informationExam 1 7 = = 49 2 ( ) = = 7 ( ) =
Exam 1 Problem 1. a) Define gcd(a, b). Using Euclid s algorithm comute gcd(889, 168). Then find x, y Z such that gcd(889, 168) = x 889 + y 168 (check your answer!). b) Let a be an integer. Prove that gcd(3a
More informationNUMBER THEORY Amin Witno
WON Series in Discrete Mthemtics nd Modern Algebr Volume 2 NUMBER THEORY Amin Witno Prefce Written t Phildelphi University, Jordn for Mth 313, these notes 1 were used first time in the Fll 2005 semester.
More informationMT 430 Intro to Number Theory MIDTERM 2 PRACTICE
MT 40 Intro to Number Theory MIDTERM 2 PRACTICE Material covered Midterm 2 is comrehensive but will focus on the material of all the lectures from February 9 u to Aril 4 Please review the following toics
More informationIs 1 a Square Modulo p? Is 2?
Chater 21 Is 1 a Square Modulo? Is 2? In the revious chater we took various rimes and looked at the a s that were quadratic residues and the a s that were nonresidues. For examle, we made a table of squares
More informationIntroduction to Number Theory 2. c Eli Biham - November 5, Introduction to Number Theory 2 (12)
Introduction to Number Theory c Eli Biham - November 5, 006 345 Introduction to Number Theory (1) Quadratic Residues Definition: The numbers 0, 1,,...,(n 1) mod n, are called uadratic residues modulo n.
More informationQuadratic Residues. Legendre symbols provide a computational tool for determining whether a quadratic congruence has a solution. = a (p 1)/2 (mod p).
Quadratic Residues 4--015 a is a quadratic residue mod m if x = a (mod m). Otherwise, a is a quadratic nonresidue. Quadratic Recirocity relates the solvability of the congruence x = (mod q) to the solvability
More informationDomination and Independence on Square Chessboard
Engineering nd Technology Journl Vol. 5, Prt, No. 1, 017 A.A. Omrn Deprtment of Mthemtics, College of Eduction for Pure Science, University of bylon, bylon, Irq pure.hmed.omrn@uobby lon.edu.iq Domintion
More informationMTH 3527 Number Theory Quiz 10 (Some problems that might be on the quiz and some solutions.) 1. Euler φ-function. Desribe all integers n such that:
MTH 7 Number Theory Quiz 10 (Some roblems that might be on the quiz and some solutions.) 1. Euler φ-function. Desribe all integers n such that: (a) φ(n) = Solution: n = 4,, 6 since φ( ) = ( 1) =, φ() =
More informationTR : Optimal Reversible Quantum Circuit for Multiplication
City University of New York (CUNY) CUNY Acdemic Works Comuter Science Technicl Reorts Grdute Center 24 TR-24: Otiml Reversile Quntum Circuit for Multiliction Anh Quoc Nguyen Follow this nd dditionl works
More informationFrancis Gaspalou Second edition of February 10, 2012 (First edition on January 28, 2012) HOW MANY SQUARES ARE THERE, Mr TARRY?
Frncis Gslou Second edition of Ferury 10, 2012 (First edition on Jnury 28, 2012) HOW MANY SQUARES ARE THERE, Mr TARRY? ABSTRACT In this er, I enumerte ll the 8x8 imgic sures given y the Trry s ttern. This
More informationMAXIMUM FLOWS IN FUZZY NETWORKS WITH FUNNEL-SHAPED NODES
MAXIMUM FLOWS IN FUZZY NETWORKS WITH FUNNEL-SHAPED NODES Romn V. Tyshchuk Informtion Systems Deprtment, AMI corportion, Donetsk, Ukrine E-mil: rt_science@hotmil.com 1 INTRODUCTION During the considertion
More information30 HWASIN PARK, JOONGSOO PARK AND DAEYEOUL KIM Lemma 1.1. Let =2 k q +1, k 2 Z +. Then the set of rimitive roots modulo is the set of quadratic non-re
J. KSIAM Vol.4, No.1, 29-38, 2000 A CRITERION ON PRIMITIVE ROOTS MODULO Hwasin Park, Joongsoo Park and Daeyeoul Kim Abstract. In this aer, we consider a criterion on rimitive roots modulo where is the
More informationFirst Round Solutions Grades 4, 5, and 6
First Round Solutions Grdes 4, 5, nd 1) There re four bsic rectngles not mde up of smller ones There re three more rectngles mde up of two smller ones ech, two rectngles mde up of three smller ones ech,
More informationCHAPTER 2 LITERATURE STUDY
CHAPTER LITERATURE STUDY. Introduction Multipliction involves two bsic opertions: the genertion of the prtil products nd their ccumultion. Therefore, there re two possible wys to speed up the multipliction:
More informationPosition control of DC motor using fractional order controller
ARCHIVES OF ELECTRICAL ENGINEERING VOL. 6(). 55-516 (1) DOI 1.478/ee-1-41 Position control of DC motor using frctionl order controller ANDRZEJ RUSZEWSKI ANDRZEJ SOBOLEWSKI Fculty of Electricl Engineering
More informationMath 124 Homework 5 Solutions
Math 12 Homework 5 Solutions by Luke Gustafson Fall 2003 1. 163 1 2 (mod 2 gives = 2 the smallest rime. 2a. First, consider = 2. We know 2 is not a uadratic residue if and only if 3, 5 (mod 8. By Dirichlet
More informationSection 16.3 Double Integrals over General Regions
Section 6.3 Double Integrls over Generl egions Not ever region is rectngle In the lst two sections we considered the problem of integrting function of two vribles over rectngle. This sitution however is
More informationTheme: Don t get mad. Learn mod.
FERURY When 1 is divided by 5, the reminder is. nother wy to sy this is opyright 015 The Ntionl ouncil of Techers of Mthemtics, Inc. www.nctm.org. ll rights reserved. This mteril my not be copied or distributed
More informationSpiral Tilings with C-curves
Spirl Tilings with -curves Using ombintorics to Augment Trdition hris K. Plmer 19 North Albny Avenue hicgo, Illinois, 0 chris@shdowfolds.com www.shdowfolds.com Abstrct Spirl tilings used by rtisns through
More informationSOLUTIONS TO PROBLEM SET 5. Section 9.1
SOLUTIONS TO PROBLEM SET 5 Section 9.1 Exercise 2. Recall that for (a, m) = 1 we have ord m a divides φ(m). a) We have φ(11) = 10 thus ord 11 3 {1, 2, 5, 10}. We check 3 1 3 (mod 11), 3 2 9 (mod 11), 3
More informationSIZE OF THE SET OF RESIDUES OF INTEGER POWERS OF FIXED EXPONENT
SIZE OF THE SET OF RESIDUES OF INTEGER POWERS OF FIXED EXPONENT RICHARD J. MATHAR Abstract. The ositive integers corime to some integer m generate the abelian grou (Z/nZ) of multilication modulo m. Admitting
More information6. Find an inverse of a modulo m for each of these pairs of relatively prime integers using the method
Exercises Exercises 1. Show that 15 is an inverse of 7 modulo 26. 2. Show that 937 is an inverse of 13 modulo 2436. 3. By inspection (as discussed prior to Example 1), find an inverse of 4 modulo 9. 4.
More informationCS 135: Computer Architecture I. Boolean Algebra. Basic Logic Gates
Bsic Logic Gtes : Computer Architecture I Boolen Algebr Instructor: Prof. Bhgi Nrhri Dept. of Computer Science Course URL: www.ses.gwu.edu/~bhgiweb/cs35/ Digitl Logic Circuits We sw how we cn build the
More informationSynchronous Machine Parameter Measurement
Synchronous Mchine Prmeter Mesurement 1 Synchronous Mchine Prmeter Mesurement Introduction Wound field synchronous mchines re mostly used for power genertion but lso re well suited for motor pplictions
More informationCongruences for Stirling Numbers of the Second Kind Modulo 5
Southest Asin Bulletin of Mthemtics (2013 37: 795 800 Southest Asin Bulletin of Mthemtics c SEAMS. 2013 Congruences for Stirling Numbers of the Second Kind Modulo 5 Jinrong Zho School of Economic Mthemtics,
More information10.4 AREAS AND LENGTHS IN POLAR COORDINATES
65 CHAPTER PARAMETRIC EQUATINS AND PLAR CRDINATES.4 AREAS AND LENGTHS IN PLAR CRDINATES In this section we develop the formul for the re of region whose oundry is given y polr eqution. We need to use the
More informationChapter 6. Direct Current Motors
Chter 6 Direct Current Motors DC Motors A DC Motor Arture (rotor) long with the couttor Constructionl Fetures of DC Motors A 4-Pole DC Motor Couttor long with the rture on the rotor Slient-oles on the
More informationEnergy Harvesting Two-Way Channels With Decoding and Processing Costs
IEEE TRANSACTIONS ON GREEN COMMUNICATIONS AND NETWORKING, VOL., NO., MARCH 07 3 Energy Hrvesting Two-Wy Chnnels With Decoding nd Processing Costs Ahmed Arf, Student Member, IEEE, Abdulrhmn Bknin, Student
More informationTo be able to determine the quadratic character of an arbitrary number mod p (p an odd prime), we. The first (and most delicate) case concerns 2
Quadratic Reciprocity To be able to determine the quadratic character of an arbitrary number mod p (p an odd prime), we need to be able to evaluate q for any prime q. The first (and most delicate) case
More informationMETHOD OF LOCATION USING SIGNALS OF UNKNOWN ORIGIN. Inventor: Brian L. Baskin
METHOD OF LOCATION USING SIGNALS OF UNKNOWN ORIGIN Inventor: Brin L. Bskin 1 ABSTRACT The present invention encompsses method of loction comprising: using plurlity of signl trnsceivers to receive one or
More informationOn the Fibonacci Sequence. By: Syrous Marivani LSUA. Mathematics Department. Alexandria, LA 71302
On the Fibonacci Sequence By: Syrous Marivani LSUA Mathematics Deartment Alexandria, LA 70 The so-called Fibonacci sequence {(n)} n 0 given by: (n) = (n ) + (n ), () where (0) = 0, and () =. The ollowing
More informationSynchronous Machine Parameter Measurement
Synchronous Mchine Prmeter Mesurement 1 Synchronous Mchine Prmeter Mesurement Introduction Wound field synchronous mchines re mostly used for power genertion but lso re well suited for motor pplictions
More information(CATALYST GROUP) B"sic Electric"l Engineering
(CATALYST GROUP) B"sic Electric"l Engineering 1. Kirchhoff s current l"w st"tes th"t (") net current flow "t the junction is positive (b) Hebr"ic sum of the currents meeting "t the junction is zero (c)
More informationAn Efficient Time Domain Speech Compression Algorithm Based on LPC and Sub-Band Coding Techniques
JOURNAL OF COMMUNICATIONS, VOL. 4, NO. 6, JULY 2009 423 An Efficient Time Domin Seech Comression Algorithm Bsed on LPC nd Sub-Bnd Coding Techniques P.Venkteswrn Det. of Electronics & Tele-Communiction
More informationInterference Cancellation Method without Feedback Amount for Three Users Interference Channel
Open Access Librry Journl 07, Volume, e57 ISSN Online: -97 ISSN Print: -9705 Interference Cncelltion Method without Feedbc Amount for Three Users Interference Chnnel Xini Tin, otin Zhng, Wenie Ji School
More informationDiscrete Square Root. Çetin Kaya Koç Winter / 11
Discrete Square Root Çetin Kaya Koç koc@cs.ucsb.edu Çetin Kaya Koç http://koclab.cs.ucsb.edu Winter 2017 1 / 11 Discrete Square Root Problem The discrete square root problem is defined as the computation
More informationAlgebra Practice. Dr. Barbara Sandall, Ed.D., and Travis Olson, M.S.
By Dr. Brr Sndll, Ed.D., Dr. Melfried Olson, Ed.D., nd Trvis Olson, M.S. COPYRIGHT 2006 Mrk Twin Medi, Inc. ISBN 978-1-58037-754-6 Printing No. 404042-EB Mrk Twin Medi, Inc., Pulishers Distriuted y Crson-Dellos
More informationUNIVERSITY OF MANITOBA DATE: December 7, FINAL EXAMINATION TITLE PAGE TIME: 3 hours EXAMINER: M. Davidson
TITLE PAGE FAMILY NAME: (Print in ink) GIVEN NAME(S): (Print in ink) STUDENT NUMBER: SEAT NUMBER: SIGNATURE: (in ink) (I understand that cheating is a serious offense) INSTRUCTIONS TO STUDENTS: This is
More informationFoundations of Cryptography
Foundations of Cryptography Ville Junnila viljun@utu.fi Department of Mathematics and Statistics University of Turku 2015 Ville Junnila viljun@utu.fi Lecture 10 1 of 17 The order of a number (mod n) Definition
More informationMath Circles Finite Automata Question Sheet 3 (Solutions)
Mth Circles Finite Automt Question Sheet 3 (Solutions) Nickols Rollick nrollick@uwterloo.c Novemer 2, 28 Note: These solutions my give you the nswers to ll the prolems, ut they usully won t tell you how
More informationJoanna Towler, Roading Engineer, Professional Services, NZTA National Office Dave Bates, Operations Manager, NZTA National Office
. TECHNICA MEMOANDM To Cc repred By Endorsed By NZTA Network Mngement Consultnts nd Contrctors NZTA egionl Opertions Mngers nd Are Mngers Dve Btes, Opertions Mnger, NZTA Ntionl Office Jonn Towler, oding
More informationAlgorithms for Memory Hierarchies Lecture 14
Algorithms for emory Hierrchies Lecture 4 Lecturer: Nodri Sitchinv Scribe: ichel Hmnn Prllelism nd Cche Obliviousness The combintion of prllelism nd cche obliviousness is n ongoing topic of reserch, in
More informationUnit 1: Chapter 4 Roots & Powers
Unit 1: Chpter 4 Roots & Powers Big Ides Any number tht cn be written s the frction mm, nn 0, where m nd n re integers, is nn rtionl. Eponents cn be used to represent roots nd reciprocls of rtionl numbers.
More information9.4. ; 65. A family of curves has polar equations. ; 66. The astronomer Giovanni Cassini ( ) studied the family of curves with polar equations
54 CHAPTER 9 PARAMETRIC EQUATINS AND PLAR CRDINATES 49. r, 5. r sin 3, 5 54 Find the points on the given curve where the tngent line is horizontl or verticl. 5. r 3 cos 5. r e 53. r cos 54. r sin 55. Show
More informationExercise 1-1. The Sine Wave EXERCISE OBJECTIVE DISCUSSION OUTLINE. Relationship between a rotating phasor and a sine wave DISCUSSION
Exercise 1-1 The Sine Wve EXERCISE OBJECTIVE When you hve completed this exercise, you will be fmilir with the notion of sine wve nd how it cn be expressed s phsor rotting round the center of circle. You
More informationModule 9. DC Machines. Version 2 EE IIT, Kharagpur
Module 9 DC Mchines Version EE IIT, Khrgpur esson 40 osses, Efficiency nd Testing of D.C. Mchines Version EE IIT, Khrgpur Contents 40 osses, efficiency nd testing of D.C. mchines (esson-40) 4 40.1 Gols
More informationEfficient and Resilient Key Discovery based on Pseudo-Random Key Pre-Deployment
Efficient nd Resilient Key Discovery sed on Pseudo-Rndom Key Pre-Deployment p. 1 Efficient nd Resilient Key Discovery sed on Pseudo-Rndom Key Pre-Deployment Roerto Di Pietro, Luigi V. Mncini, nd Alessndro
More informationA Slot-Asynchronous MAC Protocol Design for Blind Rendezvous in Cognitive Radio Networks
Globecom 04 - Wireless Networking Symposium A Slot-Asynchronous MAC Protocol Design for Blind Rendezvous in Cognitive Rdio Networks Xingy Liu nd Jing Xie Deprtment of Electricl nd Computer Engineering
More informationEstimation Of The Fundamental Frequency Of The Speech signal Compressed By G.729 Algorithm Using PCC Interpolation
(IJIRSE) Interntionl Journl o Innovtive Reserch in Science & Engineering ISSN (Online) 7-07 Estimtion O The Fundmentl Frequency O The Seech signl Comressed By G.79 Algorithm Using PCC Interoltion Zorn
More informationKirchhoff s Rules. Kirchhoff s Laws. Kirchhoff s Rules. Kirchhoff s Laws. Practice. Understanding SPH4UW. Kirchhoff s Voltage Rule (KVR):
SPH4UW Kirchhoff s ules Kirchhoff s oltge ule (K): Sum of voltge drops round loop is zero. Kirchhoff s Lws Kirchhoff s Current ule (KC): Current going in equls current coming out. Kirchhoff s ules etween
More informationA Key Set Cipher for Wireless Sensor Networks
A Key Set Cipher for Wireless Sensor etworks Subhsh Kk Abstrct This pper proposes the use of sets of keys, together with corresponding identifiers, for use in wireless sensor networks (WS) nd similr computing
More informationUnderstanding Basic Analog Ideal Op Amps
Appliction Report SLAA068A - April 2000 Understnding Bsic Anlog Idel Op Amps Ron Mncini Mixed Signl Products ABSTRACT This ppliction report develops the equtions for the idel opertionl mplifier (op mp).
More informationTriangles and parallelograms of equal area in an ellipse
1 Tringles nd prllelogrms of equl re in n ellipse Roert Buonpstore nd Thoms J Osler Mthemtics Deprtment RownUniversity Glssoro, NJ 0808 USA uonp0@studentsrownedu osler@rownedu Introduction In the pper
More informationWI1402-LR Calculus II Delft University of Technology
WI402-LR lculus II elft University of Technology Yer 203 204 Michele Fcchinelli Version.0 Lst modified on Februry, 207 Prefce This summry ws written for the course WI402-LR lculus II, tught t the elft
More informationNONCLASSICAL CONSTRUCTIONS II
NONLSSIL ONSTRUTIONS II hristopher Ohrt UL Mthcircle - Nov. 22, 2015 Now we will try ourselves on oncelet-steiner constructions. You cn only use n (unmrked) stright-edge but you cn ssume tht somewhere
More information(1) Primary Trigonometric Ratios (SOH CAH TOA): Given a right triangle OPQ with acute angle, we have the following trig ratios: ADJ
Tringles nd Trigonometry Prepred y: S diyy Hendrikson Nme: Dte: Suppose we were sked to solve the following tringles: Notie tht eh tringle hs missing informtion, whih inludes side lengths nd ngles. When
More informationConjectures and Results on Super Congruences
Conjectures and Results on Suer Congruences Zhi-Wei Sun Nanjing University Nanjing 210093, P. R. China zwsun@nju.edu.cn htt://math.nju.edu.cn/ zwsun Feb. 8, 2010 Part A. Previous Wor by Others What are
More informationY9.ET1.3 Implementation of Secure Energy Management against Cyber/physical Attacks for FREEDM System
Y9.ET1.3 Implementtion of Secure Energy ngement ginst Cyber/physicl Attcks for FREED System Project Leder: Fculty: Students: Dr. Bruce cillin Dr. o-yuen Chow Jie Dun 1. Project Gols Develop resilient cyber-physicl
More informationLecture 20. Intro to line integrals. Dan Nichols MATH 233, Spring 2018 University of Massachusetts.
Lecture 2 Intro to line integrls Dn Nichols nichols@mth.umss.edu MATH 233, Spring 218 University of Msschusetts April 12, 218 (2) onservtive vector fields We wnt to determine if F P (x, y), Q(x, y) is
More informationGeneral Augmented Rook Boards & Product Formulas
Forml Power Series nd Algebric Combintorics Séries Formelles et Combintoire Algébriue Sn Diego, Cliforni 006 Generl Augmented Rook Bords & Product Formuls Brin K Miceli Abstrct There re number of so-clled
More informationGeometric quantities for polar curves
Roerto s Notes on Integrl Clculus Chpter 5: Bsic pplictions of integrtion Section 10 Geometric quntities for polr curves Wht you need to know lredy: How to use integrls to compute res nd lengths of regions
More informationAQA Level 2 Further mathematics Further algebra. Section 3: Inequalities and indices
AQA Level Further mthemtics Further lgebr Sectio : Iequlities d idices Notes d Emples These otes coti subsectios o Iequlities Lier iequlities Qudrtic iequlities Multiplyig epressios The rules of idices
More informationDataflow Language Model. DataFlow Models. Applications of Dataflow. Dataflow Languages. Kahn process networks. A Kahn Process (1)
The slides contin revisited mterils from: Peter Mrwedel, TU Dortmund Lothr Thiele, ETH Zurich Frnk Vhid, University of liforni, Riverside Dtflow Lnguge Model Drsticlly different wy of looking t computtion:
More informationExample. Check that the Jacobian of the transformation to spherical coordinates is
lss, given on Feb 3, 2, for Mth 3, Winter 2 Recll tht the fctor which ppers in chnge of vrible formul when integrting is the Jcobin, which is the determinnt of mtrix of first order prtil derivtives. Exmple.
More informationAdaptive Network Coding for Wireless Access Networks
Adptive Network Coding for Wireless Access Networks Tun Trn School of Electricl Engineering nd Computer Science Oregon Stte University, Corvllis, Oregon 9733 Emil: trntu@eecs.orst.edu Thinh Nguyen School
More informationChapter 5 Analytic Trigonometry
Section 5. Fundmentl Identities 03 Chter 5 Anlytic Trigonometry Section 5. Fundmentl Identities Exlortion. cos > sec, sec > cos, nd tn sin > cos. sin > csc nd tn > cot 3. csc > sin, cot > tn, nd cot cos
More informationA New Algorithm to Compute Alternate Paths in Reliable OSPF (ROSPF)
A New Algorithm to Compute Alternte Pths in Relile OSPF (ROSPF) Jin Pu *, Eric Mnning, Gholmli C. Shoj, Annd Srinivsn ** PANDA Group, Computer Science Deprtment University of Victori Victori, BC, Cnd Astrct
More informationRedundancy Data Elimination Scheme Based on Stitching Technique in Image Senor Networks
Sensors & Trnsducers 204 by IFSA Publishing, S. L. http://www.sensorsportl.com Redundncy Dt Elimintion Scheme Bsed on Stitching Technique in Imge Senor Networks hunling Tng hongqing Technology nd Business
More informationChapter 5 Analytic Trigonometry
Section 5. Fundmentl Identities 03 Chter 5 Anlytic Trigonometry Section 5. Fundmentl Identities Exlortion. cos / sec, sec / cos, nd tn sin / cos. sin / csc nd tn / cot 3. csc / sin, cot / tn, nd cot cos
More informationFuzzy Logic Controller for Three Phase PWM AC-DC Converter
Journl of Electrotechnology, Electricl Engineering nd Mngement (2017) Vol. 1, Number 1 Clusius Scientific Press, Cnd Fuzzy Logic Controller for Three Phse PWM AC-DC Converter Min Muhmmd Kml1,, Husn Ali2,b
More informationBP-P2P: Belief Propagation-Based Trust and Reputation Management for P2P Networks
BP-PP: Belief Propgtion-Bsed Trust nd Reputtion Mngement for PP Networs Ermn Aydy School of Electricl nd Comp. Eng. Georgi Institute of Technology Atlnt, GA 333, USA Emil: eydy@gtech.edu Frmrz Feri School
More informationStudy on SLT calibration method of 2-port waveguide DUT
Interntionl Conference on Advnced Electronic cience nd Technology (AET 206) tudy on LT clibrtion method of 2-port wveguide DUT Wenqing Luo, Anyong Hu, Ki Liu nd Xi Chen chool of Electronics nd Informtion
More informationSynchronous Generator Line Synchronization
Synchronous Genertor Line Synchroniztion 1 Synchronous Genertor Line Synchroniztion Introduction One issue in power genertion is synchronous genertor strting. Typiclly, synchronous genertor is connected
More informationA Novel Back EMF Zero Crossing Detection of Brushless DC Motor Based on PWM
A ovel Bck EMF Zero Crossing Detection of Brushless DC Motor Bsed on PWM Zhu Bo-peng Wei Hi-feng School of Electricl nd Informtion, Jingsu niversity of Science nd Technology, Zhenjing 1003 Chin) Abstrct:
More informationMulti-beam antennas in a broadband wireless access system
Multi-em ntenns in rodnd wireless ccess system Ulrik Engström, Mrtin Johnsson, nders Derneryd nd jörn Johnnisson ntenn Reserch Center Ericsson Reserch Ericsson SE-4 84 Mölndl Sweden E-mil: ulrik.engstrom@ericsson.com,
More informationInformation-Coupled Turbo Codes for LTE Systems
Informtion-Coupled Turbo Codes for LTE Systems Lei Yng, Yixun Xie, Xiowei Wu, Jinhong Yun, Xingqing Cheng nd Lei Wn rxiv:709.06774v [cs.it] 20 Sep 207 Abstrct We propose new clss of informtion-coupled
More informationUniversity of Twente
University of Twente Faculty of Electrical Engineering, Mathematics & Comuter Science Design of an audio ower amlifier with a notch in the outut imedance Remco Twelkemeijer MSc. Thesis May 008 Suervisors:
More informationHigh resolution radar signal detection based on feature analysis
Available online www.jocr.com Journal of Chemical and Pharmaceutical Research, 4, 6(6):73-77 Research Article ISSN : 975-7384 CODEN(USA) : JCPRC5 High resolution radar signal detection based on feature
More informationDevelopment and application of a patent-based design around. process
Authors: Yeh-Ling Hsu, Po-Er Hsu, Yung-Chieh Hung, Y-Dn Xio (--4); recommended: Yeh-Ling Hsu (-6-9). Note: his pper is presented t the st Interntionl Conference on Systemtic Innovtion, Hsinchu, iwn, Jnury.
More informationx 8 (mod 15) x 8 3 (mod 5) eli 2 2y 6 (mod 10) y 3 (mod 5) 6x 9 (mod 11) y 3 (mod 11) So y = 3z + 3u + 3w (mod 990) z = (990/9) (990/9) 1
Exercise help set 6/2011 Number Theory 1. x 2 0 (mod 2) x 2 (mod 6) x 2 (mod 3) a) x 5 (mod 7) x 5 (mod 7) x 8 (mod 15) x 8 3 (mod 5) (x 8 2 (mod 3)) So x 0y + 2z + 5w + 8u (mod 210). y is not needed.
More informationNUMBER THEORY AMIN WITNO
NUMBER THEORY AMIN WITNO.. w w w. w i t n o. c o m Number Theory Outlines and Problem Sets Amin Witno Preface These notes are mere outlines for the course Math 313 given at Philadelphia
More informationLecture 16: Four Quadrant operation of DC Drive (or) TYPE E Four Quadrant chopper Fed Drive: Operation
Lecture 16: Four Qudrnt opertion of DC Drive (or) TYPE E Four Qudrnt chopper Fed Drive: Opertion The rmture current I is either positive or negtive (flow in to or wy from rmture) the rmture voltge is lso
More informationBP-P2P: Belief Propagation-Based Trust and Reputation Management for P2P Networks
1 9th Annul IEEE Communictions Society Conference on Sensor, Mesh nd Ad Hoc Communictions nd Networs (SECON) BP-PP: Belief Propgtion-Bsed Trust nd Reputtion Mngement for PP Networs Ermn Aydy School of
More informationThe Math Learning Center PO Box 12929, Salem, Oregon Math Learning Center
Resource Overview Quntile Mesure: Skill or Concept: 300Q Model the concept of ddition for sums to 10. (QT N 36) Model the concept of sutrction using numers less thn or equl to 10. (QT N 37) Write ddition
More informationSamantha s Strategies page 1 of 2
Unit 1 Module 2 Session 3 Smnth s Strtegies pge 1 of 2 Smnth hs been working with vriety of multiplition strtegies. 1 Write n expression to desribe eh of the sttements Smnth mde. To solve 18 20, I find
More informationDesign And Implementation Of Luo Converter For Electric Vehicle Applications
Design And Implementtion Of Luo Converter For Electric Vehicle Applictions A.Mnikndn #1, N.Vdivel #2 ME (Power Electronics nd Drives) Deprtment of Electricl nd Electronics Engineering Sri Shkthi Institute
More informationarxiv: v1 [cs.cc] 29 Mar 2012
Solving Mhjong Solitire ords with peeking Michiel de Bondt rxiv:1203.6559v1 [cs.cc] 29 Mr 2012 Decemer 22, 2013 Astrct We first prove tht solving Mhjong Solitire ords with peeking is NPcomplete, even if
More informationMath 319 Problem Set #7 Solution 18 April 2002
Math 319 Problem Set #7 Solution 18 April 2002 1. ( 2.4, problem 9) Show that if x 2 1 (mod m) and x / ±1 (mod m) then 1 < (x 1, m) < m and 1 < (x + 1, m) < m. Proof: From x 2 1 (mod m) we get m (x 2 1).
More informationREVIEW, pages
REVIEW, pges 510 515 6.1 1. Point P(10, 4) is on the terminl rm of n ngle u in stndrd position. ) Determine the distnce of P from the origin. The distnce of P from the origin is r. r x 2 y 2 Substitute:
More informationINTRODUCTION TO TRIGONOMETRY AND ITS APPLICATIONS
CHAPTER 8 INTRODUCTION TO TRIGONOMETRY AND ITS APPLICATIONS (A) Min Concepts nd Results Trigonometric Rtios of the ngle A in tringle ABC right ngled t B re defined s: sine of A = sin A = side opposite
More informationApplication of Wavelet De-noising in Vibration Torque Measurement
IJCSI Interntionl Journl of Computer Science Issues, Vol. 9, Issue 5, No 3, September 01 www.ijcsi.org 9 Appliction of Wvelet De-noising in Vibrtion orque Mesurement Ho Zho 1 1 Jixing University, Jixing,
More informationMixed CMOS PTL Adders
Anis do XXVI Congresso d SBC WCOMPA l I Workshop de Computção e Aplicções 14 20 de julho de 2006 Cmpo Grnde, MS Mixed CMOS PTL Adders Déor Mott, Reginldo d N. Tvres Engenhri em Sistems Digitis Universidde
More informationAbacaba-Dabacaba! by Michael Naylor Western Washington University
Abcb-Dbcb! by Michel Nylor Western Wshington University The Abcb structure shows up in n mzing vriety of plces. This rticle explores 10 surprising ides which ll shre this pttern, pth tht will tke us through
More informationGRADE SECOND EDITION HOME CONNECTIONS ANSWER KEY
HOME CONNECTIONS SECOND EDITION ANSWER KEY GRADE 4 Bridges in Mthemtics Second Edition Grde 4 Home Connections Volumes 1 & 2 The Bridges in Mthemtics Grde 4 pckge consists of: Bridges in Mthemtics Grde
More informationRESIDUE NUMBER SYSTEM. (introduction to hardware aspects) Dr. Danila Gorodecky
RESIDUE NUMBER SYSTEM (introduction to hardware asects) Dr. Danila Gorodecky danila.gorodecky@gmail.com Terminology Residue number system (RNS) (refers to Chinese remainder theorem) Residue numeral system
More information