ii19a la. Ill/lI II"' chart TEST RESOLUTION MICROCOPY NATIONAL BUREAU OF VANDARDS-1963-A
|
|
- Herbert Byrd
- 5 years ago
- Views:
Transcription
1 RD-A THE CHINESE REMAINDER PROBLEM AND POLYNOMIAL 1/1 INTERPOLATION(U) WISICONSIN UNIV-MADISON MATHEMATICS RESEARCH CENTER I J SCHOENBERG AUG 86 MRC-TSR-2954 I EhiLA NLSSIFIED DAAG29-8 -C-8041 F,'G 1211i U i
2 LI. ii19a la. Ill/lI II"' MICROCOPY RESOLUTION TEST chart NATIONAL BUREAU OF VANDARDS-1963-A
3 MRC Technical Summary Report #2954 THE CHINESE REMAINDER PROBLEM AND POLYNOMIAL INTERPOLATION Isaac J. Schoenberg Mathematics Research Center University of Wisconsin-Madison * 610 Walnut Street Madison, Wisconsin August 1986 (Received August 13, 1986) DTIC OCTS B C31 LAU A- Approved for public release Distribution unlimited Sponsored by U. S. Army Research Office P. 0. Box Research Triangle Park North Carolina a
4 UNIVERSITY OF WISCONSIN-MADISON MATEMATICS RESEARCH CENTER THE CHINESE REMAINDER PROBLEM AND POLYNOMIAL INTERPOLATION Isaac J. Schoenberg Technical Summary Report #2954 August 1986 ABSTRACT The Chinese Remainder Theorem is as follows: Given integers a i (i - 1,2,...,n) and corresponding moduli m i, which are pairwise relatively prime, than the n congruences (1) x ai mod m (i - have a unique solution x mod m, where m - mlm 2 ***' n. Sometimes in the 1950s the late Hungarian-Swedish mathematician Marcel Riesz visited the University of Pennsylvania and told us informally that the above theorem is an analogue of the unique interpolation at n distinct data by a polynomial of degree n - I. It follows that (1) can be solved in two different ways: 1. By an analogue of Lagrange's interpolation formula. 2. By an analogue of Newton's solution by divided differences. This analogy gives sufficient insight to furnish a proof of the theorem that V(mim 2... mn) - V(Ml )... (sn), where 1(m) is Euler's function. ANS (MOS) Subject Classifications: loa10, 41A10 Key Words: Chinese Remainder Theorem, Polynomial Interpolation Work Unit Number 3 (Numerical Analysis and Scientific Computing) Sponsored by the United States Army under Contract No. DAAG29-80-C uy,
5 SIGNIFICANCE AND EXPLANATION The Chinese Remainder Theorem is one of the most important results of elementary Number Theory as it was used by Kurt G~del in one of his most fundamental papers in Logic. The paper uses the analogy with the theorem of polynomial interpolation to solve it in two different ways. Nl' Dist 1 The responsibility for the wording and views expressed in this descriptive summary Iles with NRC, and not with the author of this report. P 1 1
6 THU CHINESE REMAINDER PROBLEM AND POLYNOMIAL INTERPOLATION Isaac J. Schoenberg For given Integers ai (1 a I 5 n) and positive integers mj1 (1 S ± S n) that are pairvise relatively prime, the Chxinese Remainder Problem (abbreviated to C.R.P.) my be stated as follows: 2be Problin. To find an integer x satisfying the congruences x S a I (mod m I), (i - 1,2,...,n). (1) If we have found one solution x then clearly all solutions of (1) belong to a residue class modulo N - m Im 2 **mn Sometimes in the 19501s the late Hungarian-Swedish mathematician Marcel Ries: visited the University of Pennsylvania and told us informally that the C.R.P. (1) can be thought of as an analogue of the interpolation by polynomials: Given real values y I (1 5i n) and distinct real values i *to find a polynomial P(x) of degree n I such that we can solve (2) by Lagrange's formula P(x) - Yi yil(x) (3) where the fundamental functions Li (x) -H n1 x-x* Sponsored by the United States Army under Contract No. D&AG29-0-C-0041.
7 are such that they satisfy the equations Lj(xj) ' Sij (ij -,.,).(4) Here the Sij, called the Kronecker deltas, are defined by I if i - j 8i 0 if i 0j(5 To solve the C.R.P. suppose that we proceed similarly, letting the integers a i be the analogues of the yi, and defining integers bi such that bi~ =45i (mod i.) (i,j -1,...,n),(6) as the analogues of the functions L i(x). This leads to Theores 1. A solution of the system (1) is given by n x a ib 1(7 Indeed, as the bi satisfy (6), we find from (7) that n n x aib i ai6ij-, aj (mod mji) for all j =1,.n 3xaxple I. To find x satisfying x -=2(mod 5), x E6 (mod 7), x 5 (mod 11).(8) we are to solve (6) which in our case is bi 1 (mod 5), b, 0 (mod 7), b 1 0 (mod 11), b 0 (mod 5), bs 1 (mod 7), b 0O (mod 11), b 0 (mod 5), b 0 (mod 7), b 3 1 (mod 11), from which we obtain that bi=231, b - 330, b 3 1 By (7) we find that all solutions of (8) are given by x 527 (mod 385), where
8 The solution (7) of the C.R.P. (1) is essentially the solution as given by G. E. Andrews in [1], and by E. Grosswald in (2), without mentioning the analogy with Lagrange's formula. My colleague Richard Askey tells me that Riesz' remark is well known to computer scientists, but apparently not to mathematicians. Besides recording Riesz' remark, the author's contribution is the following remark: Newton solves the interpolation problem (2) using successive divided differences ci to obtain P(x) = c 1 + c 2 (x - x 1 ) + c 3 (x - x 1 )(x - x 2 ) + *.. + Cn(x - xl)(x- x 2 )... (x - Xn.i), (9) where the coefficients ci are obtained by solving Yl Cl Y2 cl + c 2 (x 2 - x 1 ) Yn C 1 + c2(xn xl) + c 3 (xn " Xl)(Xn " x 2 ) Cn (xn - xl)(x n - x 2 )... (xn - Xni) * (10) Applying Newton's idea to the solution of the C.R.P. (1), we consider the mi to be the analogues of the x - xi and seek to determine the integer di (1 1 i j n) from the system of congruences ad I a I (mod m 1 ) 1 + d 2 m 1 _ a 2 (mod m 2 ) d 1 + d 2 m 1 + d 3 m 1 m 2 a 3 (mod m 3 ) (11) d 1 + d 2 m 1 + d 3 m 1 m dnmlm 2... n- a n (mod m n ) In this way we obtain!.~ -3- -AI
9 2heoren 2. A solution of the C.R.P. (1) is obtained as follows: We first determine the inteqrs di as solutions of the congruences (11), and then a solution of (1) is given by x - d 1 + d 2 m I + d 3 mim 2 + *'" + dnmlm 2... _ (12) Indeed, notice that by (11), the x given by (12), satisfies all congruences (1): For any k, 1 I k I n, from (12) we get that x = di + d 2 ml + oo, + dkmlm2... ik. I (mod m x ) and therefore, by the k-th congruence (11), 4e have that x - ak (mod mk). 3xmple 2. Let us solve the C.R.P. (8) by the Newton approach. For (8) we have n - 3, a 1 2, a 2 - = 6, a 3 5, m I - 5, m 2-7, m As we can always choose d 1 a 1 = 2, the remaining n congruence (11) are 2 + 5<2 6 (mod 7), 2 + 5d d 3 5 (mod 11) The first has the solution d 2-5 and the second now becomes d 3-5 (mod 11) whose solhv ion is d 3-0 (mod 11). From (12), for n = 3 we obtain that x - 27 is a solution of (8). A consequence of Theorem 1, or of Theorem 2, is the following Corollary I. The Chinese Remainder Problem (1) has always a unique solution x, mod M, where M = mlm 2...mn - Moreover, either of the theorems gives a method of finding this unique solution. Let us keep fixed the n pairwise relatively prime moduli mi'm 2,... n. How many Chinese Residue Problems (1) correspond to them? Evidently their number is M for we may restrict the ai to assume the values of a residue system mod mi, for instance For every choice of the n-tuple (a,a 2,...,an) there corresponds a unique -4-.1ji
10 solution x of (1) which assmes one of the values x C 1} ),1,...,M- (14-, ). (14) Corollary 2. There is a one-to-one correspondence between the n-tuples (a1,...,an), subject to (13), and the M possible values (14) of x. For if two distinct n-tuples (a,a 2,...,an ) JO (a' a (15) lead to equal x's: x - x' we would get from (1) that ai = a,' (mod mi), (i - 1,...,n), in contradiction to our assumption (15). Rzale 3. we choose the simplest possible example: Let n = 2, m, = 2, M 2 = 3, hence M = 6. Here, by (13) we may choose a 1 = 0,1 and ir a 2 = 0,1,2. Denoting by x r C.R.Ps to be the solutions of the 6 C.R.Ps. we find these (a) x 1 = 0 (mod 2) (b) x 2-0 (mod 2) (c) x 3 0 (mod 2) x 1 = 0 (mod 3) x 2 1 (mod 3) x 3 2 (mod 3) (d) x 4 1 (mod 2) (e) x 5 " I (mod 2) (f) x 6 1 (mod 2) x 0 (mod 3) x 5 1 (mod 3) x 6 2 (mod 3) 4-6 Their solutions are easily found to be (16) x 1 = 0, x 2 " 4, x 3 = 2, x 4 = 3, x 5 " 1, x 6 5, (17) which indeed form a residue system modulo M - 6. We wish to close our note with an elementary application of the one-toone mapping expressed by Corollary 2. For this we need Corollary 3. In the Chinese Remainder Problem (1) we have (ai,mi) - I for all i - 1,...,n (18) if and only if for the solution x of (1) we have (x,mim 2...m n ) 1. (19) -5- %~.. -. ;.:a
11 Indeed, by (1) we see that (18) holds iff (x,m I ) - 1 for all i, which is equivalent to (19). As usual we denote by 9(m) the Euler function giving the number of positive numbers < m which are relatively prime to m. The application we had in mind is Corollary 4. r'or the pairwise relatively prime m i we have (P(mlm 2...m) = (ml)(m 2 )... 4(m n ). (20) Because the left side is = number of solutions x of (1) satisfying (19), while the right side gives the number of C.R.Ps. (1) satisfying the conditions (18). Example 4. For the moduli m, = 1 and m 2 = 3 of Example 3 only two C.R.Ps. (e) and (f) satisfy the conditions (18). Also notice that their solutions x 5 = 1 and x 6 = 5 indeed form a reduced residue system mod 6 as they should. Remarks. 1. The second Newton approach is slightly more economical then the first approach: while the first requires to determine the n integers b i (i = 1,2,...,n), the Newton approach requires only to find the n - 1 integers di (i = 2,3,...,n). 2. I owe to Gerald Goodman the reference [3] in which Ulrich Oberst shows that appropriate abstract formulations of the Chinese Remainder Problem can be made the basis of much of Modern Algebra including the main theorems of Galois theory. 4V 3. My colleague Stephen C. Kleene informs me that Kurt G8del uses the solution of the Chinese Remainder Problem (without its name) in his fundamental paper "On formally undecidable propositions of Principia Mathematica and related systems 1" in (4], , especially Lemma 1 on page 135. See also Footnote i on page 136. I, Rk II' IM e-6-
12 4. Originally I wrote this note very briefly, even tersely. I owe to the Editor an expanded version of this note which I found very helpful in casting it in the present form. 5. In a sequel to the present paper it will be shown how to apply the Chinese Remainder theorem to obtain indices for moduli which do not admit primitive roots. These indices will be vectors...:: IP U. & ' ',I. '-".;,-4 - -""-.-'..';',-.'-.-' ':-,
13 REFERENCES 1. G. E. Andrews, Number Theory, W. B. Saunders Co., Philadelphia, Emil Grosswald, Topics from the Theory of Numbers, The Macmillan Co., New York, Ulrich Oberst, Anwendungen des chinesischen Restsatzes, Expositiones Mathematicae, vol. 3 (1985), Kurt G6del, Collected Works, volume 1, Oxford University Press, New York, I. J. Schoenberg, On the theory and practice of indices mod m, to appear. IJS :scr -8-
14 SECURITY CLASSIFICATION OF THIS PAGE (1rhe Data Bnter E REPORT DOCUMENTATION PAGE READ INSTRUCTIONS BEFORE COMPLETING FORM 1. REPORT NUMBER 2. GOVT ACCESSION NO. 3. RECIPIENT'S CATALOG NUMBER It 9 I TITLE (and Subtitle) S. TYPE OF REPORT & PERIOD COVERED THE CHINESE REMAINDER PROBLEM AND POLYNOMIAL Summary Report - no specific INTERPOLATION reporting period 6. PERFORMING ORG. REPORT NUMBER 7. AUTHOR(e) S. CONTRACT OR GRANT NUMBER() Isaac J. Schoenberg DAAG9-80-C PERFORMING ORGANIZATION NAME AND AOORESS 10. PROGRAM ELEMENT. PROJECT. TASK AREA & WORK UNIT NUMBERS Mathematics Research Center, University of ;ork Unit Number Walnut Street Wisconsin Numerical Analysis and Madison, Wisconsin Scientific Computing " 11. CONTROLLING OFFICE NAME AND ADDRESS 12. REPORT DATE U. S. Army Research Office August 1986 P.O. Box I3. NUMBER OF PAGES Research Triangle Park, North Carolina MONITORING XGENCY NAME A ADDRESS(I1 dilferent from Controlling Office) IS. SEC'URITY CLASS. (of this report) 16. DISTRIBUTION STATEMENT (of thl Report) Approved for public release; distribution unlimited. UNCLASSIFIED 15a. DECL ASSI FICATION/DOWN GRADING SCHEDULE 17. DISTRIBUTION STATEMENT (of the abetract metered In Block 20, It different from Report) IS. SUPPLEMENTARY NOTES -I. IS. KEY WORDS (Continue on reverse side if necessary and identify by block number) Chinese Remainder Theorem Polynomial Interpolation 20. ABSTRACT (Continue an reverse side if ncessar and identify by block number) The Chinese Remainder Theorem is as follows: Given integers a. 1 (i = 1,2,...,n) and corresponding moduli mi., which are pairwise relatively prime, than the n congruences (1) x a. mod m. (i = 1,...,n) 1 1 have a unique solution x mod m, where m = m 2... ran. 4 DD I 'i AN 1473 EDITION OF I NOV Of 1 OBSOLETE UNCLASSIFIED SECURITY CLASSIFICATION OF THIS PAGE (When Date Entered).:% %-'-
15 20. ABSTRACT - cont'd. Sometimes in the 1950s the late Hungarian-Swedish mathematician Marcel Riesz visited the University of Pennsylvania and told us informally that the above theorem is an analogue of the unique interpolation at n distinct data by a polynomial of degree n - 1. It follows that (1) can be solved in two different ways: 1. By an analogue of Lagrange's interpolation formula. 2. By an analogue of Newton's solution by divided differences. This analogy gives sufficient insight to furnish a proof of the theorem that ( 1 m 2... m = p (ml )v(m 2 )...p (m ), where 'p(m) is Euler's function. n 1 2 n "4
16 ~*>. ;~ I
UN MADISON MATHEMSTICS RESEARCH CENTER A P SUMS UNCLASSIFIE FER4 MONSRR2648 DAAG29-0C04 RDr C91 04
7 AD-A141 509 A NOTE ON EQUALT IN ANDERSON'S THEOREM(UA WISCONSIN 1/1 UN MADISON MATHEMSTICS RESEARCH CENTER A P SUMS UNCLASSIFIE FER4 MONSRR2648 DAAG29-0C04 RDr C91 04 ANA FS 7 1 3 III8 1.2. IlI.25iiI.
More informationS 7ITERATIVELY REWEIGHTED LEAST SQUARES - ENCYCLOPEDIA ENTRY.(U) FEB 82 D B RUBIN DAAG29-80-C-O0N1 UNCLASSIFIED MRC-TSR-2328
AD-A114 534 WISCONSIN UNIV-MADISON MATHEMATICS RESEARCH CENTER F/B 12/1 S 7ITERATIVELY REWEIGHTED LEAST SQUARES - ENCYCLOPEDIA ENTRY.(U) FEB 82 D B RUBIN DAAG29-80-C-O0N1 UNCLASSIFIED MRC-TSR-2328 NL MRC
More informationApplication of Polynomial Interpolation in the Chinese Remainder Problem
Journal of Mathematical Research with Applications Jan., 017, Vol. 37, No. 1, pp. 90 96 DOI:10.3770/j.issn:095-651.017.01.008 Http://jmre.dlut.edu.cn Application of Polynomial Interpolation in the Chinese
More information*jfflfllflfflfl AD-A 'ON THE EQUIDECOMPOSABILT OF A REGULAR TRIANGLE AND A -SQUARE OF
p AD-A739 270 'ON THE EQUIDECOMPOSABILT OF A REGULAR TRIANGLE AND A -SQUARE OF *jfflfllflfflfl EQAL AR..U AWISCONSIN ANIV-MADISON MATHEMATICS RESEARCH CENTER 0 W CRONE ET AL JAN 84 ANCtASSIFIED MRC-TSR-2632
More information'N7 7 DA4 5 AU) WISCONSIN UNIV MADISON MATHEMATICS RESEARCH CENTER NDA4 5 DIRECT APPROACH TO THE VILLARCEAU CIRCLES OF AJORUS /
NDA4 5 DIRECT APPROACH TO THE VILLARCEAU CIRCLES OF AJORUS / 7 DA4 5 AU) WISCONSIN UNIV MADISON MATHEMATICS RESEARCH CENTER I J SCHOENBERG MAR 84 MRC-TSR-2651 DAAG29 80 C 0041 UNCLASSIFIED /121 N 'N7 Ifl=j~.2
More informationNotes on Systems of Linear Congruences
MATH 324 Summer 2012 Elementary Number Theory Notes on Systems of Linear Congruences In this note we will discuss systems of linear congruences where the moduli are all different. Definition. Given the
More information(U) WISCONSIN UN! V-VIADISON MATHEMATICS RESEARCH CENTER J M VANDEN-BROECK JAN 84 MRC-TSR-2631 DAAG29-89-C-894i
I 7,-AD-Ai39 266 BUBBLES RISING IN A TUBE AND JETS FALLING FROM R NOZZLE 1/i I (U) WISCONSIN UN! V-VIADISON MATHEMATICS RESEARCH CENTER J M VANDEN-BROECK JAN 84 MRC-TSR-2631 DAAG29-89-C-894i UNCLASSIFIED
More informationLECTURE 4: CHINESE REMAINDER THEOREM AND MULTIPLICATIVE FUNCTIONS
LECTURE 4: CHINESE REMAINDER THEOREM AND MULTIPLICATIVE FUNCTIONS 1. The Chinese Remainder Theorem We now seek to analyse the solubility of congruences by reinterpreting their solutions modulo a composite
More informationA STUDY OF SEQUENTIAL PROCEDURES FOR ESTIMATING. J. Carroll* Md Robert Smith. University of North Carolina at Chapel Hill.
A STUDY OF SEQUENTIAL PROCEDURES FOR ESTIMATING THE LARGEST OF THREE NORMAL t4eans Ra~nond by J. Carroll* Md Robert Smith University of North Carolina at Chapel Hill -e Abstract We study the problem of
More informationI North * ~ Mathematics Research Center University of Wisconsin- Madisonl 510 Walnut Street Madison. Wisconsin 53706
A 851 WISCONSIN UNIV MADISON MATHEMATICS RESEARCH CENTER A CLASS OF LOCAL EXPLICIT MANY-KNOT SPLINE INTERPOLATION SCHEME--ETC(U) JUL 81 D X ai DAAG29-80-C-0041 UNCLASSIFIED MRC-TSR-2238 NL :hlllllllli
More informationRD-R14i 390 A LIMIT THEOREM ON CHARACTERISTIC FUNCTIONS VIA RN ini EXTREMAL PRINCIPLE(U) TEXAS UNIV AT AUSTIN CENTER FOR CYBERNETIC STUDIES A BEN-TAL
RD-R14i 390 A LIMIT THEOREM ON CHARACTERISTIC FUNCTIONS VIA RN ini EXTREMAL PRINCIPLE(U) TEXAS UNIV AT AUSTIN CENTER FOR CYBERNETIC STUDIES A BEN-TAL DEC 83 CCS-RR-477 UNCLASSIFIED N@884-i-C-236 F/0 2/1
More informationConstruction of latin squares of prime order
Construction of latin squares of prime order Theorem. If p is prime, then there exist p 1 MOLS of order p. Construction: The elements in the latin square will be the elements of Z p, the integers modulo
More informationLecture notes: Algorithms for integers, polynomials (Thorsten Theobald)
Lecture notes: Algorithms for integers, polynomials (Thorsten Theobald) 1 Euclid s Algorithm Euclid s Algorithm for computing the greatest common divisor belongs to the oldest known computing procedures
More informationWilson s Theorem and Fermat s Little Theorem
Wilson s Theorem and Fermat s Little Theorem Wilson stheorem THEOREM 1 (Wilson s Theorem): (p 1)! 1 (mod p) if and only if p is prime. EXAMPLE: We have (2 1)!+1 = 2 (3 1)!+1 = 3 (4 1)!+1 = 7 (5 1)!+1 =
More informationRD-Ai6i 457 LIMITING PERFORMANCE OF NONLINEAR SYSTEMS WITH APPLICATIONS TO HELICOPTER (U) VIRGINIA UNIV CHARLOTTESVILLE DEPT OF MECHANICAL AND
RD-Ai6i 457 LIMITING PERFORMANCE OF NONLINEAR SYSTEMS WITH APPLICATIONS TO HELICOPTER (U) VIRGINIA UNIV CHARLOTTESVILLE DEPT OF MECHANICAL AND AEROSPAC UNCLASSIFIED W D PILKEV AUG 85 ARO-186431 if-eg F/G
More information.IEEEEEEIIEII. fflllffo. I ll, 7 AO-AO CALIFORNIA UN IV BERKELEY OPERATIONS RESEARCH CENTER FIG 12/1
7 AO-AO95 140 CALIFORNIA UN IV BERKELEY OPERATIONS RESEARCH CENTER FIG 12/1.IEEEEEEIIEII AVAILABILITY OF SERIES SYSTEMS WITH COMPONENTS SUBJECT TO VARIO--ETC(U) JUN 80 Z S KHALIL AFOSR-77-3179 UNCLASSIFIED
More informationAD OUTDOOR SCULP:URES(U) WISCONSIN UNIY-NADISON / NATHdEMRTICS RESEARCH CENTER I J SCHOENBERG JAN 86 UNCLSSIFIEV R-S-90OR2-DC94 F/C 13/1 NL
AD-8167 466 OUTDOOR SCULP:URES(U) WISCONSIN UNIY-NADISON / NATHdEMRTICS RESEARCH CENTER I J SCHOENBERG JAN 86 UNCLSSIFIEV R-S-90OR2-DC94 F/C 13/1 NL U! IO 21I 111111.25 Hill- I:.M micnro L CHART m~% MRC
More informationComputing with polynomials: Hensel constructions
Course Polynomials: Their Power and How to Use Them, JASS 07 Computing with polynomials: Hensel constructions Lukas Bulwahn March 28, 2007 Abstract To solve GCD calculations and factorization of polynomials
More informationU-.-._ AD-A TWO STOCHASTIC MODE.ING PROBLEMS IN COMMUJNICATIONS AND NAVIG6ATON I/J U) VIRGINIA P0 TECHNIC INS A ND STE BLACKSBURG UNIV
AD-A133 458 TWO STOCHASTIC MODE.ING PROBLEMS IN COMMUJNICATIONS AND NAVIG6ATON I/J U) VIRGINIA P0 TECHNIC INS A ND STE BLACKSBURG UNIV U-.-._ W E KO06 ER 12 SEP 83 ARO 16539.6-MA UNCLASSIFED DAAG2V V -C
More informationNumber Theory Homework.
Number Theory Homewor. 1. The Theorems of Fermat, Euler, and Wilson. 1.1. Fermat s Theorem. The following is a special case of a result we have seen earlier, but as it will come up several times in this
More informationDTIC : D o 01, Euler's Theorem for Polynomials. Naval Research Laboratory. OV,,,FB2 90I February 9, NRL Memorandum Report 6605
* flti' FILE COPY Naval Research Laboratory Washington, DC 20375-5000 NRL Memorandum Report 6605 0 CO Euler's Theorem for Polynomials ~WU.UAM ~Identification DTIC WARDLAW Systemts Branch Radar Division
More informationSaL1a. fa/ SLECTE '1~AIR FORCE GECOPNYSICS LABORATORY AIR FORCE SYSTEMS COMMAND AFGL-TH
AD-Alla 950 BOSTON COLL CHESTNUT HILL MA DEPT OF PHYSICS FB2/ '5 PARTICLE TRAJECTORIES IN A MODEL ELECTRIC FIELD II.CU) DEC SI P CARINI. 6 KALMAN, Y SHIMA F19628-79-C-0031 UNCLASSIFIED SCIENTIFIC-2 AFGL-TR-B2-0149
More informationMICROCOPY RESOLUTION TEST CHART NATIOAL BUREAU OF STANDARDS-1963-A. *9. ~ ~ ~ MCOCP REOUTO TEST CHA.<:~ RTrz ~
RAD-A122 134 ALGEBRAIC THEORY OF LINEAR TIME-VARYING SYSTEMS AND I/1 LINEAR INFINITE-DIMEN.. (U) FLORIDA UNIV GAINESVILLE DEPT OF ELECTRICAL ENGINEERING E W KAMEN NOV 82 UNCLASSIFIED ARO-13162. i-nr DARG29-7-G-8863
More informationA MARTINGALE INEQUALITY FOR THE SQUARE AND MAXIMAL FUNCTIONS LOUIS H.Y. CHEN TECHNICAL REPORT NO. 31 MARCH 15, 1979
A MARTINGALE INEQUALITY FOR THE SQUARE AND MAXIMAL FUNCTIONS BY LOUIS H.Y. CHEN TECHNICAL REPORT NO. 31 MARCH 15, 1979 PREPARED UNDER GRANT DAAG29-77-G-0031 FOR THE U.S. ARMY RESEARCH OFFICE Reproduction
More informationThe Chinese Remainder Theorem
The Chinese Remainder Theorem Kyle Miller Feb 13, 2017 The Chinese Remainder Theorem says that systems of congruences always have a solution (assuming pairwise coprime moduli): Theorem 1 Let n, m N with
More informationChapter 5. Modular arithmetic. 5.1 The modular ring
Chapter 5 Modular arithmetic 5.1 The modular ring Definition 5.1. Suppose n N and x, y Z. Then we say that x, y are equivalent modulo n, and we write x y mod n if n x y. It is evident that equivalence
More informationVAD-Ri POURING FLOU(U) WISCONSIN UNIV-MADISON MATHEMATICS /
VAD-Ri72 775 POURING FLOU(U) WISCONSIN UNIV-MADISON MATHEMATICS / I RESEARCH CENTER J VANDENd-BROECK ET AL MAY 86 MRC-TSR-2936 DAAG29-88-C-084i UNCLASSIFIED F/G 29/4 U am 111.25 1 14 11. MICROCoPY RESOLUIRON
More information1.0~ O. 1*1.8.2IIII II5 uuu11~ I 1 I6 MICROCOPY RESOLUTION TEST CHART NATIONAL BUREAU OF STANDARDS 1963-A
6AD-Ai5@ 148 NUMERICAL ALGORITHMS AND SOFTWARE FOR MATRIX.RICCATI i/i EGUATIONS(U) UNIVERSITY OF SOUTHERN CALIFORNIA LOS ANGELES A J LAUB 25 OCT 84 RlRO-i8289 15-MAl UNCLASSIFIED MEOMONEE OAAG29-i-K-8i3i
More informationEEEJ AA CHICAGO UNIV ILL DEPT OF CHEMISTRY F/6 7/4 ION-ION NEUTRALIZATION PROCESSES AND THEIR CONSEQUENCES. (U)
AA099 05 CHICAGO UNIV ILL DEPT OF CHEMISTRY F/6 7/4 ION-ION NEUTRALIZATION PROCESSES AND THEIR CONSEQUENCES. (U) EEEJ MA Y 81 R S BERRY DAAG29RO0-K-0016 UNCLASSIFIED 880 169451C NL UNCLASS!FIED, SECUI4ITY
More informationADl-AO PUDUE UMIV LAFAYETTE IN DEPT OF CHEMISTRY F/6 7/4
ADl-AO84 712 PUDUE UMIV LAFAYETTE IN DEPT OF CHEMISTRY F/6 7/4 UCLASSIFIED - PHIOTOCHEMICAL CONSEQUENCES OF INTERCHROMOPHORIC INTERACTICNS.(Ul MAY 80 H MORRISON OAA629-79 0 0009 ARO-13088.9-C NRL 6-SO
More informationAD-AISS "3 IMPACT OF DETECTOR LOCATION AND ORIENTATION ERRORS ON in THE PERPENDICULAR METHOD AN INTRODUCTION(U) JET PROPULSION LAB PASADENA CA 03 OCT
AD-AISS "3 IMPACT OF DETECTOR LOCATION AND ORIENTATION ERRORS ON in THE PERPENDICULAR METHOD AN INTRODUCTION(U) JET PROPULSION LAB PASADENA CA 03 OCT 05 JPL-D-4301 UNCLASSIFIED, F/G 17/11 NL if I 258 KiE
More information3 Solutions of congruences
3 Solutions of congruences 3.1 The Chinese Remainder Theorem revisited Let f(x) be a polynomial with coefficients in Z. A congruence equation is of the form f(x) 0 (mod m), where m is a positive integer.
More informationAD-A ROCHESTER UNIV NY GRADUATE SCHOOL OF MANAGEMENT F/B 12/1. j FEB 82.J KEILSON F C-0003 UNCLASSIFIED AFGL-TR NL
AD-A115 793 ROCHESTER UNIV NY GRADUATE SCHOOL OF MANAGEMENT F/B 12/1 F EFFORTS IN MARKOV MODELING OF WEATHER DURATIONS.(U) j FEB 82.J KEILSON F1962980-C-0003 UNCLASSIFIED AFGL-TR-82-0074 NL A'FGL -TR-82-0074
More informationarxiv: v1 [math.co] 21 Sep 2015
Chocolate Numbers arxiv:1509.06093v1 [math.co] 21 Sep 2015 Caleb Ji, Tanya Khovanova, Robin Park, Angela Song September 22, 2015 Abstract In this paper, we consider a game played on a rectangular m n gridded
More informationIEEE". UNIY-NILUAUKEE J SEDER 25 APR 85 AFOSR-TR i RFOSR UNCLASSIFIED F/G 12/1 NL
D- Ai5S 762 SIEVES ND FILTER FOR AUSSI N PROCESSES (U WISCONSIN 1/1 UNIY-NILUAUKEE J SEDER 25 APR 85 AFOSR-TR-85-062i I IEEE". RFOSR-84-9329 UNCLASSIFIED F/G 12/1 NL 110 128 12- ~fll M111 11111!;m NATIONAL
More informationTHE GROUP OF UNITS OF SOME FINITE LOCAL RINGS I
J Korean Math Soc 46 (009), No, pp 95 311 THE GROUP OF UNITS OF SOME FINITE LOCAL RINGS I Sung Sik Woo Abstract The purpose of this paper is to identify the group of units of finite local rings of the
More informationFUNCTIONS OVER THE RESIDUE FIELD MODULO A PRIME. Introduction
FUNCTIONS OVER THE RESIDUE FIELD MODULO A PRIME DAVID LONDON and ZVI ZIEGLER (Received 7 March 966) Introduction Let F p be the residue field modulo a prime number p. The mappings of F p into itself are
More informationMEMORANDUM No THE CHINESE R EMA IN DER TH EOR EM AND MULTI**PRF RADARS. Authorý J Clarke
MEMORANDUM No. 3650 0AL SIGNALS & RADAR THE CHINESE R EMA IN DER TH EOR EM AND MULTI**PRF RADARS Authorý J Clarke f~.4 PROCUREMENT EXECUTIVE, MlINiSYRY OF DEFENCE, RSP.F MALVERN, WORC 4 t' AfELECTE 4 ~A05
More informationi of 6. PERFORMING ORG. REPORT NUMBER Approved for public Dtatibuft Unlimited
SECURITY CLASSIFICATION OF THIS PAGE (When Data Entered) REPORT DOCUMENTATION PAGE READ INSTRUCTIONS BEFORE COMPLETING FORM I. REPORT NUMBER 2. GOVT ACCESSION NO. 3. RECIPIENT'S CATALOG NUMBER WP-MDSGA-65-4
More informationSection VI.33. Finite Fields
VI.33 Finite Fields 1 Section VI.33. Finite Fields Note. In this section, finite fields are completely classified. For every prime p and n N, there is exactly one (up to isomorphism) field of order p n,
More informationN _IC.25 N/PS. Bill~ 11 2 WA' ,' mm_
AD-RIi 946 EXPERIMENTAL RESEARCH ON OPTOGALVANIC EFFECTS(U) 1/1 WISCONSIN UNIV-MADISON DEPT OF PHYSICS J E LAWLER 85 JUN 86 AFOSR-RR-86-8518 AFOSR-84-2298 UNCLASS IF [ED F/G 14/2 NL IEEEII. N-8 N/PS 11111_IC.25
More informationA0A TEXAS UNIV AT AUSTIN DEPT OF CHEMISTRY F/G 7/5 PHOTOASSISTED WATER-GAS SHIFT REACTION ON PLATINIZED T7TANIAI T--ETCIUI
AA113 878 TEXAS UNIV AT AUSTIN DEPT OF CHEMISTRY F/G 7/5 PHOTOASSISTED WATER-GAS SHIFT REACTION ON PLATINIZED T7TANIAI T--ETCIUI APR 82 S FANG. 8 CHEN..J M WHITE N14-75-C-922 UNCLASSIFIED NL OFFICE OF
More informationNotes on Primitive Roots Dan Klain
Notes on Primitive Roots Dan Klain last updated March 22, 2013 Comments and corrections are welcome These supplementary notes summarize the presentation on primitive roots given in class, which differed
More informationMatrix Arithmetic. j=1
An m n matrix is an array A = Matrix Arithmetic a 11 a 12 a 1n a 21 a 22 a 2n a m1 a m2 a mn of real numbers a ij An m n matrix has m rows and n columns a ij is the entry in the i-th row and j-th column
More information;E (" DataEntered,) 1.GOVT ACCESSION NO.
;E (" DataEntered,) AD-A 196 504:NTATION PAGE 1.GOVT ACCESSION NO. fitic f ILE GUM. BEFORCOMLETINFOR 3. RECIPIENT'S CATALOG NUMBER ALGO PUB 0120 4. TITLE (and Subtitle) S. TYPE OF REPORT & PERIOD COVERED
More informationReverse Berlekamp-Massey Decoding
Reverse Berlekamp-Massey Decoding Jiun-Hung Yu and Hans-Andrea Loeliger Department of Information Technology and Electrical Engineering ETH Zurich, Switzerland Email: {yu, loeliger}@isi.ee.ethz.ch arxiv:1301.736v
More informationFIXED-POINT FREE ENDOMORPHISMS OF GROUPS RELATED TO FINITE FIELDS
FIXED-POINT FREE ENDOMORPHISMS OF GROUPS RELATED TO FINITE FIELDS LINDSAY N. CHILDS Abstract. Let G = F q β be the semidirect product of the additive group of the field of q = p n elements and the cyclic
More informationIntroduction to Number Theory
INTRODUCTION Definition: Natural Numbers, Integers Natural numbers: N={0,1,, }. Integers: Z={0,±1,±, }. Definition: Divisor If a Z can be writeen as a=bc where b, c Z, then we say a is divisible by b or,
More informationA Few Primality Testing Algorithms
A Few Primality Testing Algorithms Donald Brower April 2, 2006 0.1 Introduction These notes will cover a few primality testing algorithms. There are many such, some prove that a number is prime, others
More informationThe Chinese Remainder Theorem
Chapter 5 The Chinese Remainder Theorem 5.1 Coprime moduli Theorem 5.1. Suppose m, n N, and gcd(m, n) = 1. Given any remainders r mod m and s mod n we can find N such that N r mod m and N s mod n. Moreover,
More informationThe primitive root theorem
The primitive root theorem Mar Steinberger First recall that if R is a ring, then a R is a unit if there exists b R with ab = ba = 1. The collection of all units in R is denoted R and forms a group under
More informationDiscrete Mathematics and Probability Theory Fall 2014 Anant Sahai Note 7
EECS 70 Discrete Mathematics and Probability Theory Fall 2014 Anant Sahai Note 7 Polynomials Polynomials constitute a rich class of functions which are both easy to describe and widely applicable in topics
More informationChinese Remainder Algorithms. Çetin Kaya Koç Spring / 22
Chinese Remainder Algorithms http://koclab.org Çetin Kaya Koç Spring 2018 1 / 22 The Chinese Remainder Theorem Some cryptographic algorithms work with two (such as RSA) or more moduli (such as secret-sharing)
More informationCourse MA2C02, Hilary Term 2013 Section 9: Introduction to Number Theory and Cryptography
Course MA2C02, Hilary Term 2013 Section 9: Introduction to Number Theory and Cryptography David R. Wilkins Copyright c David R. Wilkins 2000 2013 Contents 9 Introduction to Number Theory 63 9.1 Subgroups
More informationMath.3336: Discrete Mathematics. Primes and Greatest Common Divisors
Math.3336: Discrete Mathematics Primes and Greatest Common Divisors Instructor: Dr. Blerina Xhabli Department of Mathematics, University of Houston https://www.math.uh.edu/ blerina Email: blerina@math.uh.edu
More informationNew Negative Latin Square Type Partial Difference Sets in Nonelementary Abelian 2-groups and 3-groups
New Negative Latin Square Type Partial Difference Sets in Nonelementary Abelian 2-groups and 3-groups John Polhill Department of Mathematics, Computer Science, and Statistics Bloomsburg University Bloomsburg,
More informationMODULAR PERIODICITY OF LINEAR RECURRENCE SEQUENCES
MODULAR PERIODICITY OF LINEAR RECURRENCE SEQUENCES CURTIS BRIGHT Abstract. Integers which satisfy linear recurrence relations are always periodic modulo m. Many results on the period and pre-period length
More informationCENTER FOR CYBERNETIC
IMC FILE GLPY CENTER FOR CYBERNETIC STUDIES The University of Texas Austin,Texas 78712 DTIC StELECTED NOV 1 4 l988..8-.. 1 4... CCS Research Report 605 A GEOMETRIC PROPERTY OF THE LEAST SQUARES SOLUTION
More informationDiscrete Mathematics and Probability Theory Spring 2016 Rao and Walrand Note 8
CS 70 Discrete Mathematics and Probability Theory Spring 2016 Rao and Walrand Note 8 Polynomials Polynomials constitute a rich class of functions which are both easy to describe and widely applicable in
More informationI I ! MICROCOPY RESOLUTION TEST CHART NATIONAL BUREAU OF STANDARDS-1963-A
, D-Ri33 816 ENERGETIC ION BERM PLASMA INTERRCTIONS(U) PRINCETON / UNIV N J PLASMA PHYSICS LAB R MI KULSRUD 30 JUN 83 UNCLSSIFEDAFOSR-TR-83-0816 AFOSR-81-0106F/209 N EEEEONEE"_ I I 11111.!2 1.1. IL MICROCOPY
More informationfn" <si> f2(i) i + [/i + [/f] (1.1) ELEMENTARY SEQUENCES (1.2)
Internat. J. Math. & Math. Sci. VOL. 15 NO. 3 (1992) 581-588 581 ELEMENTARY SEQUENCES SCOTT J. BESLIN Department of Mathematics Nicholls State University Thibodaux, LA 70310 (Received December 10, 1990
More informationMINIMAL GENERATING SETS OF GROUPS, RINGS, AND FIELDS
MINIMAL GENERATING SETS OF GROUPS, RINGS, AND FIELDS LORENZ HALBEISEN, MARTIN HAMILTON, AND PAVEL RŮŽIČKA Abstract. A subset X of a group (or a ring, or a field) is called generating, if the smallest subgroup
More information1.0 1m liii sm mm
AD-Ai72 779 AN EXTENSION OF THE KREISS MATRIX THEOREM(U) WISCONSIN i/i UUNIV-MRDISON MATHEMATICS RESEARCH CENTER B A WIADE ET AL AUG 86 MRC-TSR-2951 DAA229-Se-C BB4i SN C L A SSD E/G 2 11N L IEEE.S '.
More informationNumber Theory Alex X. Liu & Haipeng Dai
Number Theory Alex X. Liu & Haipeng Dai haipengdai@nju.edu.cn 313 CS Building Department of Computer Science and Technology Nanjing University How to compute gcd(x,y) Observation: gcd(x,y) = gcd(x-y, y)
More informationSOME AMAZING PROPERTIES OF THE FUNCTION f(x) = x 2 * David M. Goldschmidt University of California, Berkeley U.S.A.
SOME AMAZING PROPERTIES OF THE FUNCTION f(x) = x 2 * David M. Goldschmidt University of California, Berkeley U.S.A. 1. Introduction Today we are going to have a look at one of the simplest functions in
More informationA SURVEY OF PRIMALITY TESTS
A SURVEY OF PRIMALITY TESTS STEFAN LANCE Abstract. In this paper, we show how modular arithmetic and Euler s totient function are applied to elementary number theory. In particular, we use only arithmetic
More informationChapter 0. Introduction: Prerequisites and Preliminaries
Chapter 0. Sections 0.1 to 0.5 1 Chapter 0. Introduction: Prerequisites and Preliminaries Note. The content of Sections 0.1 through 0.6 should be very familiar to you. However, in order to keep these notes
More informationMathematical Olympiad Training Polynomials
Mathematical Olympiad Training Polynomials Definition A polynomial over a ring R(Z, Q, R, C) in x is an expression of the form p(x) = a n x n + a n 1 x n 1 + + a 1 x + a 0, a i R, for 0 i n. If a n 0,
More informationManagement Science Research Report #MSRR-570. Decomposition of Balanced Matrices. Part II: Wheel-and-Parachute-Free Graphs
AD-A247 398 111111! IN1!1111 I 111! 1 U Management Science Research Report #MSRR-570 Decomposition of Balanced Matrices. Part II: Wheel-and-Parachute-Free Graphs Michele ConfortiI Gerard Cornu~Jols 2 and
More informationLetting be a field, e.g., of the real numbers, the complex numbers, the rational numbers, the rational functions W(s) of a complex variable s, etc.
1 Polynomial Matrices 1.1 Polynomials Letting be a field, e.g., of the real numbers, the complex numbers, the rational numbers, the rational functions W(s) of a complex variable s, etc., n ws ( ) as a
More informationBENJAMIN LEVINE. 2. Principal Ideal Domains We will first investigate the properties of principal ideal domains and unique factorization domains.
FINITELY GENERATED MODULES OVER A PRINCIPAL IDEAL DOMAIN BENJAMIN LEVINE Abstract. We will explore classification theory concerning the structure theorem for finitely generated modules over a principal
More informationUNCLASSIFIED MRC-TSR2141 N
I 7 AD-A096 658 WISCONSIN UNIV-MADISON MATHEMATICS RESEARCH CENTER F/6 12/1 LEAST-SQUARES SOLUTION OF LINEAR INEQUALITIES.U NV Al0 S HAN ;M DAAG29-8I C 2041 UNCLASSIFIED MRC-TSR2141 N i MRC Technical Summary
More informationRMT 2013 Power Round Solutions February 2, 2013
RMT 013 Power Round Solutions February, 013 1. (a) (i) {0, 5, 7, 10, 11, 1, 14} {n N 0 : n 15}. (ii) Yes, 5, 7, 11, 16 can be generated by a set of fewer than 4 elements. Specifically, it is generated
More informationπ X : X Y X and π Y : X Y Y
Math 6130 Notes. Fall 2002. 6. Hausdorffness and Compactness. We would like to be able to say that all quasi-projective varieties are Hausdorff and that projective varieties are the only compact varieties.
More informationIntroducing an Analysis in Finite Fields
Introducing an Analysis in Finite Fields Hélio M de Oliveira and Ricardo M Campello de Souza Universidade Federal de Pernambuco UFPE CP78-57-97 - Recife - PE, Brazil E-mail: {hmo,ricardo}@ufpebr Abstract
More informationFILTERED RINGS AND MODULES. GRADINGS AND COMPLETIONS.
FILTERED RINGS AND MODULES. GRADINGS AND COMPLETIONS. Let A be a ring, for simplicity assumed commutative. A filtering, or filtration, of an A module M means a descending sequence of submodules M = M 0
More informationMath 312/ AMS 351 (Fall 17) Sample Questions for Final
Math 312/ AMS 351 (Fall 17) Sample Questions for Final 1. Solve the system of equations 2x 1 mod 3 x 2 mod 7 x 7 mod 8 First note that the inverse of 2 is 2 mod 3. Thus, the first equation becomes (multiply
More informationBasic elements of number theory
Cryptography Basic elements of number theory Marius Zimand 1 Divisibility, prime numbers By default all the variables, such as a, b, k, etc., denote integer numbers. Divisibility a 0 divides b if b = a
More informationChinese Remainder Theorem
Chinese Remainder Theorem Çetin Kaya Koç koc@cs.ucsb.edu Çetin Kaya Koç http://koclab.org Winter 2017 1 / 16 The Chinese Remainder Theorem Some cryptographic algorithms work with two (such as RSA) or more
More informationBasic elements of number theory
Cryptography Basic elements of number theory Marius Zimand By default all the variables, such as a, b, k, etc., denote integer numbers. Divisibility a 0 divides b if b = a k for some integer k. Notation
More informationWeek 15-16: Combinatorial Design
Week 15-16: Combinatorial Design May 8, 2017 A combinatorial design, or simply a design, is an arrangement of the objects of a set into subsets satisfying certain prescribed properties. The area of combinatorial
More informationMATH Fundamental Concepts of Algebra
MATH 4001 Fundamental Concepts of Algebra Instructor: Darci L. Kracht Kent State University April, 015 0 Introduction We will begin our study of mathematics this semester with the familiar notion of even
More informationSelected Chapters from Number Theory and Algebra
Selected Chapters from Number Theory and Algebra A project under construction Franz Rothe Department of Mathematics University of North Carolina at Charlotte Charlotte, NC 83 frothe@uncc.edu December 8,
More informationTechnical Note
Technical Note 1975-50 The Use of Finite Fields and Rings to Compute Convolutions I. S. Reed 6 June 1975 undi P n Lincoln Laboratory MASSACHUSETTS INSTITUTE OF TECH LEXINGTON, MASSACHI Approved for pn
More informationOleg Eterevsky St. Petersburg State University, Bibliotechnaya Sq. 2, St. Petersburg, , Russia
ON THE NUMBER OF PRIME DIVISORS OF HIGHER-ORDER CARMICHAEL NUMBERS Oleg Eterevsky St. Petersburg State University, Bibliotechnaya Sq. 2, St. Petersburg, 198904, Russia Maxim Vsemirnov Sidney Sussex College,
More information= 1 2x. x 2 a ) 0 (mod p n ), (x 2 + 2a + a2. x a ) 2
8. p-adic numbers 8.1. Motivation: Solving x 2 a (mod p n ). Take an odd prime p, and ( an) integer a coprime to p. Then, as we know, x 2 a (mod p) has a solution x Z iff = 1. In this case we can suppose
More informationQuadratic reciprocity and the Jacobi symbol Stephen McAdam Department of Mathematics University of Texas at Austin
Quadratic reciprocity and the Jacobi symbol Stephen McAdam Department of Mathematics University of Texas at Austin mcadam@math.utexas.edu Abstract: We offer a proof of quadratic reciprocity that arises
More informationRO-AI55614? CONFIDENCE INTERYALS USIlNG THE REGENERTIYE METHOD FOR 1/1 SIMULATION OUTPUT.. (U) STANFORD UNJY CA DEPT OF 1"'7 1OPERTIONS RESEARCH P W
RO-AI55614? CONFIDENCE INTERYALS USIlNG THE REGENERTIYE METHOD FOR 1/1 SIMULATION OUTPUT.. (U) STANFORD UNJY CA DEPT OF 1"'7 1OPERTIONS RESEARCH P W GLYNN ET AL. SEP 84 TR-3 UNCLSSIFIED RO-2927. 3-MA DAA029-84-K-930
More informationOn transitive polynomials modulo integers
Notes on Number Theory and Discrete Mathematics Print ISSN 1310 5132, Online ISSN 2367 8275 Vol. 22, 2016, No. 2, 23 35 On transitive polynomials modulo integers Mohammad Javaheri 1 and Gili Rusak 2 1
More informationFast Polynomial Multiplication
Fast Polynomial Multiplication Marc Moreno Maza CS 9652, October 4, 2017 Plan Primitive roots of unity The discrete Fourier transform Convolution of polynomials The fast Fourier transform Fast convolution
More information9. Integral Ring Extensions
80 Andreas Gathmann 9. Integral ing Extensions In this chapter we want to discuss a concept in commutative algebra that has its original motivation in algebra, but turns out to have surprisingly many applications
More informationTHESIS. Presented in Partial Fulfillment of the Requirements for the Degree Master of Science in the Graduate School of The Ohio State University
The Hasse-Minkowski Theorem in Two and Three Variables THESIS Presented in Partial Fulfillment of the Requirements for the Degree Master of Science in the Graduate School of The Ohio State University By
More informationAD-At AN OUTPUT MATCHING APPROACH TO MULTIVARIABLE LINEAR Il 0001 UNCLASSIFIED AFOSR-TR AFOSR U/ 14/2 NL 1
AD-At28 662 AN OUTPUT MATCHING APPROACH TO MULTIVARIABLE LINEAR Il DIGITAL MATHEMATICS CONTROL(U) ANDSTATISTIC. WRIGHT STATE D FMLLER30DNOV82 UNIV DAYTON OH DEPT 0001 OF UNCLASSIFIED AFOSR-TR-83-0400 AFOSR-82-0208
More informationProblems and Solutions
Problems and Solutions Problems and Solutions. The aim of this section is to encourage readers to participate in the intriguing process of problem solving in Mathematics. This section publishes problems
More informationLEGENDRE S THEOREM, LEGRANGE S DESCENT
LEGENDRE S THEOREM, LEGRANGE S DESCENT SUPPLEMENT FOR MATH 370: NUMBER THEORY Abstract. Legendre gave simple necessary and sufficient conditions for the solvablility of the diophantine equation ax 2 +
More informationJournal of Combinatorics and Number Theory 1(2009), no. 1, ON SUMS OF PRIMES AND TRIANGULAR NUMBERS. Zhi-Wei Sun
Journal of Combinatorics and Number Theory 1(009), no. 1, 65 76. ON SUMS OF PRIMES AND TRIANGULAR NUMBERS Zhi-Wei Sun Department of Mathematics, Nanjing University Nanjing 10093, People s Republic of China
More informationMath 120 HW 9 Solutions
Math 120 HW 9 Solutions June 8, 2018 Question 1 Write down a ring homomorphism (no proof required) f from R = Z[ 11] = {a + b 11 a, b Z} to S = Z/35Z. The main difficulty is to find an element x Z/35Z
More informationCHAPTER 3. Congruences. Congruence: definitions and properties
CHAPTER 3 Congruences Part V of PJE Congruence: definitions and properties Definition. (PJE definition 19.1.1) Let m > 0 be an integer. Integers a and b are congruent modulo m if m divides a b. We write
More informationEu... p UNCLASSIFIED ARO-i72672-EG DAAO2-8-C-i42 F/G 21/2 NL. D-A INVESTIGATION OF THE KINETICS OF CATALYZED COMBUSTION i/i
I D-A142 153 INVESTIGATION OF THE KINETICS OF CATALYZED COMBUSTION i/i OF FUEL(U) UNITED TECHNOLOGIES RESEARCH CENTER EAST I HARTFORD CT P J IARTENEY 04 MAY 84 UTRC/955279-i p UNCLASSIFIED ARO-i72672-EG
More informationCOMP239: Mathematics for Computer Science II. Prof. Chadi Assi EV7.635
COMP239: Mathematics for Computer Science II Prof. Chadi Assi assi@ciise.concordia.ca EV7.635 The Euclidean Algorithm The Euclidean Algorithm Finding the GCD of two numbers using prime factorization is
More information