THE CHINESE REMAINDER THEOREM. We should thank the Chinese for their wonderful remainder theorem. Glenn Stevens
|
|
- Miranda Marsh
- 6 years ago
- Views:
Transcription
1 THE CHINESE REMAINDER THEOREM KEITH CONRAD We should thank the Chnese for ther wonderful remander theorem. Glenn Stevens 1. Introducton The Chnese remander theorem says we can unquely solve any par of congruences that have relatvely prme modul. Theorem 1.1. Let m and n be relatvely prme postve ntegers. For any ntegers a and b, the par of congruences x a mod m, x b mod n has a soluton, and ths soluton s unquely determned modulo mn. What s mportant here s that m and n are relatvely prme. There are no constrants at all on a and b. Example 1.2. The congruences x 6 mod 9 and x 4 mod 11 hold when x = 15, and more generally when x 15 mod 99, and they do not hold for any other x. The modulus 99 s We wll prove the Chnese remander theorem, ncludng a verson for more than two modul, and see some ways t s appled to count solutons of congruences. 2. A proof of the Chnese remander theorem Proof. Frst we show there s always a soluton. Then we wll show t s unque modulo mn. Exstence of Soluton. To show that the smultaneous congruences x a mod m, x b mod n have a common soluton n Z, we gve two proofs. Frst proof: Wrte the frst congruence as an equaton n Z, say x = a + my for some y Z. Then the second congruence s the same as a + my b mod n. Subtractng a from both sdes, we need to solve for y n (2.1) my b a mod n. Snce (m, n) = 1, we know m mod n s nvertble. Let m be an nverse for m mod n, so mm 1 mod n. Multplyng through (2.1) by m, we have y m (b a) mod n, so y m (b a) + nz where z Z. Then x = a + my = a + m(m (b a) + nz) = a + mm (b a) + mnz. 1
2 2 KEITH CONRAD So f x satsfes the orgnal two congruences t must have ths form. Let s now check ths expresson, for every z Z, really satsfes the orgnal two congruences: a + mm (b a) + mnz a a mod m and a + mm (b a) + mnz a + 1(b a) + 0 b mod n. Second proof: Wrte both congruences as equatons n Z: x = a + my and x = b + nz for ntegers y and z that need to be determned. (Why would t be a bad dea to wrte x = a + my and x = b + ny?) The ntegers of the form a + my are the numbers that are congruent to a mod m, and the ntegers of the form b + nz are the numbers that are congruent to b mod n. Fndng a common soluton to the two congruences amounts to fndng y and z n Z such that a + my = b + nz, whch s the same as (2.2) my nz = b a. Can we fnd such y and z for any a, b, m, and n where (m, n) = 1? Bezout s dentty tells us 1 s a Z-lnear combnaton of m and n, and therefore any nteger s Z-lnear combnaton of m and n (why?). Therefore ntegers y and z satsfyng (2.2) exst. Unqueness of Soluton. If x = c and x = c both satsfy x a mod m, x b mod n, then we have c c mod m and c c mod n. Then m (c c ) and n (c c ). Snce (m, n) = 1, the product mn dvdes c c, whch means c c mod mn. Ths shows any two solutons to the ntal par of congruences are the same modulo mn. 3. Extenson to more than two congruences The Chnese remander theorem can be extended from two congruences to any fnte number of congruences, but we have to be careful about the way n whch the modul are relatvely prme. Consder the three congruences x 1 mod 6, x 4 mod 10, x 7 mod 15. Whle there s no common factor of 6, 10, and 15 greater than 1, these congruences do not admt a common soluton: any soluton to the frst congruence s odd, whle any soluton to the second congruence s even. When we have more than two modul, we have to be senstve to the dfference between sayng numbers are collectvely relatvely prme (no common factor greater than 1 dvdes them all) and parwse relatvely prme (no common factor greater than 1 dvdes any two of the numbers). For nstance, 6, 10, and 15 are collectvely relatvely prme but not parwse relatvely prme. Here s a more general form of the Chnese remander theorem. Theorem 3.1. For r 2, let m 1, m 2,..., m r be nonzero ntegers that are parwse relatvely prme: (m, m j ) = 1 for j. Then, for any ntegers a 1, a 2,..., a r, the system of congruences x a 1 mod m 1, x a 2 mod m 2,..., x a r mod m r, has a soluton, and ths soluton s unquely determned modulo m 1 m 2 m r. Example 3.2. The congruences x 1 mod 3, x 2 mod 5, x 2 mod 7 are satsfed when x = 37, more generally for any x 37 mod 105 and for no other x. Note 105 =
3 THE CHINESE REMAINDER THEOREM 3 Proof. Frst we show there s always a soluton. Then we wll show t s unque modulo m 1 m 2 m r. Exstence of Soluton. We argue by nducton on r. The base case r = 2 s Theorem 1.1, whch has been proved already. Now we pass to the nductve step. Suppose all smultaneous congruences wth r parwse relatvely prme modul can be solved. Consder a system of smultaneous congruences wth r + 1 parwse relatvely prme modul: x a 1 mod m 1,..., x a r mod m r, x a r+1 mod m r+1, where (m, m j ) = 1 for all j and the a s are arbtrary. By the nductve hypothess, there s a soluton b to the frst r congruences, say b a 1 mod m 1, b a 2 mod m 2,..., b a r mod m r. Now consder the system of two congruences (3.1) x b mod m 1 m 2 m r, x a r+1 mod m r+1. Snce (m, m r+1 ) = 1 for = 1, 2,..., r, we have (m 1 m 2 m r, m r+1 ) = 1, so the two modul n (3.1) are relatvely prme. Then by the case of two congruences, namely Theorem 1.1, there s a soluton to (3.1). Call t c. Snce c b mod m 1 m 2 m r, we have c b mod m for = 1, 2,..., r. From the choce of b we have b a mod m for = 1, 2,..., r. Therefore c a mod m for = 1, 2,..., r. Also, c a r+1 mod m r+1 from the choce of c, so we see c satsfes the r + 1 gven congruences. Ths concludes the nductve step, so a soluton exsts. Unqueness of Soluton. If x = c and x = c both satsfy x a 1 mod m 1, x a 2 mod m 2,..., x a r mod m r, then we have c c mod m for = 1, 2,..., r, so m (c c ) for = 1, 2,..., r. Snce the m s are parwse relatvely prme, ther product m 1 m 2 m r dvdes c c, whch means c c mod m 1 m 2 m r. Ths shows any two solutons to the gven system of congruences are the same when vewed modulo m 1 m 2 m r. 4. Applcatons The sgnfcance of the Chnese remander theorem s that t often reduces a queston about modulus mn, where (m, n) = 1, to the same queston for modulus m and n separately. In ths way, questons about modular arthmetc can often be reduced to the specal case of prme power modul. We wll see how ths works for several countng problems, often usng two features of modular arthmetc wth two modul: f d m t makes sense to reduce ntegers mod m to ntegers mod d: f x y mod m then x y mod d. For example, f x y mod 10 then x y mod 5 snce f x y s dvsble by 10 then t s also dvsble by 5. (In contrast, t makes no sense to reduce x mod 10 to x mod 3, snce there are congruent numbers mod 10 that are ncongruent mod 3, such as 5 and 15.) f x y mod m and x y mod n and (m, n) = 1 then x y mod mn. Ths was used n the unqueness part of the proof of the Chnese remander theorem. Our frst applcaton s to countng unts. Theorem 4.1. For relatvely prme postve ntegers m and n, ϕ(mn) = ϕ(m)ϕ(n).
4 4 KEITH CONRAD Proof. We work wth the sets U m = {a mod m, (a, m) = 1}, U n = {b mod n, (b, n) = 1}, U mn = {c mod mn, (c, mn) = 1}. Then U m = ϕ(m), U n = ϕ(n), and U mn = ϕ(mn). To show ϕ(mn) = ϕ(m)ϕ(n), we wll wrte down a bjecton between U mn and U m U n, whch mples the two sets have the same sze, and that s what the theorem s sayng (snce U m U n = ϕ(m)ϕ(n)). Let f : U mn U m U n by the rule f(c mod mn) = (c mod m, c mod n). For c U mn, we have (c, mn) = 1, so (c, m) and (c, n) equal 1, so c mod m and c mod n are unts. Let s stop for a moment to take a look at an example of ths functon. Take m = 3 and n = 5: U 3 = {1, 2}, U 5 = {1, 2, 3, 4}, and U 15 = {1, 2, 4, 7, 8, 11, 13, 14}. The followng table shows the values of the functon f on each number n U 15. Notce that the values fll up all of U 3 U 5 wthout repetton. c mod 15 f(c mod 15) 1 (1, 1) 2 (2, 2) 4 (4, 4) = (1, 4) 7 (7, 7) = (1, 2) 8 (8, 8) = (2, 3) 11 (11, 11) = (2, 1) 13 (13, 13) = (1, 3) 14 (14, 14) = (2, 4) There are 2 unts modulo 3 and 4 unts modulo 5, leadng to 8 ordered pars of unts modulo 3 and unts modulo 5: (1,1), (1,2), (1,3), (1,4), (2,1), (2,2), (2,3), and (2,4). All these pars show up (and just once) n the second column of the table. We return to the general stuaton and show f : U mn U m U n s a bjecton. To see that f s one-to-one, suppose f(k mod m) = f(l mod n) Then k l mod m and k l mod n, so snce (m, n) = 1 (aha!), we have k l mod mn. That means k = l n U mn, so f s one-to-one. Now we show f s onto. Pck any par (a mod m, b mod n) U m U n. By the Chnese remander theorem we can solve c a mod m and c b mod n for a c Z. Is (c, mn) = 1? Snce a mod m s a unt and c a mod m, c mod m s a unt so (c, m) = 1. Snce b mod n s a unt and c b mod n, c mod n s a unt so (c, n) = 1. From (c, m) = 1 and (c, n) = 1 we get (c, mn) = 1, so c U mn. From the congruence condtons on c, we have f(c) = (a, b). Corollary 4.2. For a postve nteger m, ϕ(m) = m p m ( 1 1 ), p where the product runs over the prmes p dvdng m. Proof. The formula s clear for m = 1 (nterpretng an empty product as 1). Now suppose m > 1, and factor m nto prme powers: m = p e 1 1 pe 2 2 per r.
5 THE CHINESE REMAINDER THEOREM 5 The p e s are parwse relatvely prme. By an extenson of Theorem 4.1 from two relatvely prme terms to any number of parwse relatvely prme terms (just nduct on the number of terms), we have ϕ(m) = ϕ(p e 1 1 )ϕ(pe 2 2 ) ϕ(per r ). Now usng the formula for ϕ on prme powers, ϕ(m) = p e (p 1 1)p e (p 2 1) p er 1 r (p r 1) ) ) ) = p e 1 1 (1 1p1 p e 2 2 (1 1p2 p er r (1 1pr = m p m ( 1 1 p ). Example 4.3. To compute ϕ(540) = ϕ( ), we have ( ϕ(540) = ) ( 1 1 ) ( 1 1 ) An alternate calculaton s = = 18 8 = 144. ϕ(540) = ϕ(4)ϕ(27)ϕ(5) = (4 2)(27 9)(5 1) = = 144. We now leave unts mod m and look at squares mod m. Theorem 4.4. For m Z + wth m 2, let S m = {x 2 mod m} be the set of squares modulo m. When (m, n) = 1, S mn = S m S n. Note S m s all squares modulo m, ncludng 0. So S 5 = {0, 1, 4}, for example. Proof. We wll use the Chnese remander theorem twce. If a x 2 mod mn then a x 2 mod m and a x 2 mod n. Thus any square modulo mn reduces to a square modulo m and a square modulo n. So we have a functon f : S mn S m S n by f(a mod mn) = (a mod m, a mod n). Let s take a look at an example. Set m = 3 and n = 5, so S 3 = {0, 1}, S 5 = {0, 1, 4} and S 15 = {0, 1, 4, 6, 9, 10}. The table below gves the values of f on S 15. The values fll up S 3 S 5 wthout repetton. c mod 15 f(c mod 15) 0 (0, 0) 1 (1, 1) 4 (4, 4) = (1, 4) 6 (6, 6) = (0, 1) 9 (9, 9) = (0, 4) 10 (10, 10) = (1, 0)
6 6 KEITH CONRAD Returnng to the general case, to show f s one-to-one let s suppose f(c mod mn) = f(c mod mn). Then c c mod m and c c mod n, so c c mod mn snce (m, n) = 1. To show f s onto, pck a par of squares b mod m and c mod n, say b y 2 mod m and c z 2 mod n. By the Chnese remander theorem, there s an nteger a satsfyng a b mod m, a c mod n. We want to say f(a) = (b, c), but s a mod mn a square? From the expressons for b mod m and c mod n as squares, a y 2 mod m and a z 2 mod n, but y and z are not related to each other. They certanly don t have to be the same nteger, so these two congruences on ther own don t tell us a mod mn s a square. Usng the Chnese remander theorem agan, however, there s x Z such that x y mod m, x z mod n, so x 2 y 2 mod m and x 2 z 2 mod n. Therefore a x 2 mod m and a x 2 mod n, so a x 2 mod mn, so a mod mn s n fact a square. Thus a S mn and f(a) = (b, c). Example 4.5. For a prme p, the number of nonzero squares mod p s (p 1)/2 and 0 s a square, so the total number of squares mod p s 1 + (p 1)/2 = (p + 1)/2. Thus S p = (p + 1)/2. So f n = p 1 p 2... p r s squarefree, S n = S p1 S pr = p pr+1 2. If n = p e 1 1 per r, we have S n = S e p 1 S 1 p er, so a formula for S r pe when e > 1 (whch we don t gve here) would lead to a formula for S m n general. We turn now from countng all the squares mod m to countng how often somethng s a square mod m. Example 4.6. We can wrte 1 mod 15 as a square n four ways: mod 15. Theorem 4.7. Let m Z + have prme factorzaton p e 1 1 per r. For any nteger a, the congruence x 2 a mod m s solvable f and only f the separate congruences x 2 a mod p e are solvable for = 1, 2,..., r. Furthermore, f the congruence x 2 a mod p e has N solutons, then the congruence x 2 a mod m has N 1 N 2 N r solutons. Example 4.8. The congruences x 2 1 mod 3 and x 2 1 mod 5 each have two solutons, so x 2 1 mod 15 has 2 2 = 4 solutons; we saw the four square roots of 1 mod 15 before the statement of Theorem 4.7. Proof. If x Z satsfes x 2 a mod m, then x 2 a mod p e for all. Conversely, suppose each of the congruences x 2 a mod p e has a soluton, say x 2 a mod p e for some ntegers x. Snce the p e s are parwse relatvely prme, the Chnese remander theorem tells us there s an x such that x x mod p e for all. Then x 2 x 2 mod pe for all, so x 2 a mod p e for all. Snce x 2 a s dvsble by each p e t s dvsble by m, so x 2 a mod m. To count the solutons modulo m, we agan use the Chnese remander theorem. Any choce of soluton x mod p e for each fts together n exactly one way to a number x mod m, and ths number wll satsfy x 2 a mod m. Therefore we can count solutons modulo m by countng solutons modulo each p e and multply the counts thanks to the ndependence of the choce of solutons for dfferent prmes.
7 THE CHINESE REMAINDER THEOREM 7 Example 4.9. To decde f 61 s a square modulo 75, we check whether 61 s a square modulo 3 and modulo 25. Snce 61 1 mod 3, t s a square modulo 3. Snce mod 25, t s a square modulo 25. Therefore 63 s a square modulo 75. In fact, we can get a square root by solvng the congruences A soluton s x = 31, so mod 75. x 1 mod 3, x 6 mod 25. If you scrutnze the proofs of Theorems 4.4 and 4.7 to see why t was mportant we were workng wth squares, you ll see that t really wasn t; the only thng that really matters s that squarng s a polynomal expresson. Wth ths n mnd, we get the followng generalzatons from squares to values of other polynomals. Theorem Let f(x) be any polynomal wth nteger coeffcents. For a postve nteger m 2, let N f (m) = {f(x) mod m : 0 x m 1} be the number of values of f on dfferent ntegers mod m. If m has prme factorzaton m = p e 1 1 per r, we have N f (m) = N f (p e 1 1 ) N f (p er r ). Proof. Proceed as n the proof of Theorem 4.4, whch s the specal case f(x) = x 2. Theorem Let f(x) be any polynomal wth nteger coeffcents. For a postve nteger m wth prme factorzaton m = p e 1 1 per r, the congruence f(x) 0 mod m s solvable f and only f the congruences f(x) 0 mod p e are each solvable. Moreover, f f(x) 0 mod p e has N solutons, then the congruence f(x) 0 mod m has N 1 N 2 N r solutons. Proof. Argue as n the proof of Theorem 4.7, whch s the specal case f(x) = x 2 a. Theorem 4.11 tells us that fndng solutons to a polynomal equaton modulo postve ntegers s reduced by the Chnese remander theorem to the case of understandng solutons modulo prme powers. Consder now the followng stuaton: f(x) s a polynomal wth ntegral coeffcents and every value f(n), for n Z, s ether a multple of 2 or a multple of 3. For nstance, f f(x) = x 2 x then f(n) = n 2 n s even for all n. Or f f(x) = x 3 x then f(n) = n 3 n s a multple of 3 for all n. But these examples are knd of weak: what about a mxed example where every f(n) s a multple of 2 or 3 but some f(n) are multples of 2 and not 3 whle other f(n) are multples of 3 and not 2? Actually, no such polynomal exsts! The only way f(n) can be dvsble ether by 2 or 3 for all n s f t s a multple of 2 for all n or a multple of 3 for all n. To explan ths, we wll use the Chnese remander theorem. Theorem Let f(x) be a polynomal wth ntegral coeffcents. Suppose there s a fnte set of prmes p 1,..., p r such that, for every nteger n, f(n) s dvsble by some p. Then there s one p such that p f(n) for every n Z. Proof. Suppose the concluson s false. Then, for each p, there s an a Z such that p does not dvde f(a ). Sad dfferently, f(a ) 0 mod p. Snce the p s are dfferent prmes, we can use the Chnese remander theorem to fnd a sngle nteger a such that a a mod p for = 1, 2,..., r. Then f(a) f(a ) mod p for
8 8 KEITH CONRAD = 1, 2,..., r (why?), so f(a) 0 mod p for all. However, the assumpton n the theorem was that every value of the polynomal on ntegers s dvsble by some p, so we have a contradcton. Remark It s natural to beleve an analogous result for dvsblty by squares of prmes. Specfcally, f f(x) s a polynomal wth ntegral coeffcents and there s a fnte set of prmes p 1,..., p r such that, for every nteger n, f(n) s dvsble by some p 2, then there should be one p such that p 2 f(n) for every n Z. If you try to adapt the proof of Theorem 4.12 to ths settng, t breaks down (where?). Whle ths analogue for dvsblty by squares of prmes s plausble, t s stll an open problem as far as I am aware. Our fnal applcaton of the Chnese remander theorem s to an nterpolaton problem. Gven n ponts n the plane, (a 1, b 1 ),..., (a n, b n ), wth the a s dstnct, we would lke to fnd a polynomal f(t ) n R[T ] whose graph passes through these ponts: f(a ) = b for = 1, 2,..., n. Ths task can be converted to a set of smultaneous congruences n R[T ], whch can be solved usng the Chnese remander theorem n R[T ], not Z. Frst let s state the Chnese remander theorem for polynomals. Theorem For r 2, let m 1 (T ), m 2 (T ),..., m r (T ) be nonzero polynomals n R[T ] whch are parwse relatvely prme: (m (T ), m j (T )) = 1 for j. Then, for any polynomals a 1 (T ), a 2 (T ),..., a r (T ), the system of congruences f(t ) a 1 (T ) mod m 1 (T ), f(t ) a 2 (T ) mod m 2 (T ),..., f(t ) a r (T ) mod m r (T ), has a soluton f(t ) n R[T ], and ths soluton s unque modulo m 1 (T )m 2 (T ) m r (T ). The proof of ths s dentcal to that of the Chnese remander theorem for Z, so we leave t to the reader as an exercse. Theorem In R, pck n dstnct numbers a 1, a 2,..., a n and any numbers b 1, b 2,..., b n. There s a unque polynomal f(t ) of degree < n n R[T ] such that f(a ) = b for all. Proof. To say f(a ) = b s the same as f(t ) b mod T a (why?). Consder the system of congruences f(t ) b 1 mod T a 1, f(t ) b 2 mod T a 2,..., f(t ) b n mod T a n for an unknown f(t ) n R[T ]. Snce the a s are dstnct, the polynomals T a 1,..., T a n are parwse relatvely prme n R[T ]. Therefore, by the Chnese remander theorem n R[T ], there s an f(t ) n R[T ] satsfyng all of the above congruences. It follows that f(a ) = b for all. We have no ntal control over deg f for the common soluton f. However, snce we can adjust f(t ) modulo (T a 1 ) (T a n ) wthout changng the congruence condtons, we can replace f(t ) wth ts remander under dvson by (T a 1 ) (T a n ), whch has degree n. Then deg f < n wth f(a ) = b for all. We have shown a desred f(t ) exsts. To see t s unque, suppose f 1 (T ) and f 2 (T ) both have degree less than n and satsfy f(t ) b 1 mod T a 1, f(t ) b 2 mod T a 2,..., f(t ) b n mod T a n. Then, by the unqueness n the Chnese remander theorem, we have f 1 (T ) f 2 (T ) mod (T a 1 ) (T a n ). Snce f 1 (T ) and f 2 (T ) have degree less than n, ths congruence modulo a polynomal of degree n mples f 1 (T ) = f 2 (T ) n R[T ].
9 THE CHINESE REMAINDER THEOREM 9 The fact that polynomal nterpolaton s dentcal to solvng a system of polynomal congruences (wth lnear modul) suggests that we should thnk about solvng a system of nteger congruences as arthmetc nterpolaton. There s nothng essental about R n Theorem 4.15 except that t s a feld. The Chnese remander theorem goes through for F [T ] wth F any feld, not just R, and Theorem 4.15 carres over to any feld: Theorem Let F be any feld. For n dstnct numbers a 1, a 2,..., a n n F and any numbers b 1, b 2,..., b n n F, there s a unque polynomal f(t ) of degree < n n F [T ] such that f(a ) = b for all. The proof s dentcal to that of Theorem 4.15.
Example: (13320, 22140) =? Solution #1: The divisors of are 1, 2, 3, 4, 5, 6, 9, 10, 12, 15, 18, 20, 27, 30, 36, 41,
The greatest common dvsor of two ntegers a and b (not both zero) s the largest nteger whch s a common factor of both a and b. We denote ths number by gcd(a, b), or smply (a, b) when there s no confuson
More information18.781: Solution to Practice Questions for Final Exam
18.781: Soluton to Practce Questons for Fnal Exam 1. Fnd three solutons n postve ntegers of x 6y = 1 by frst calculatng the contnued fracton expanson of 6. Soluton: We have 1 6=[, ] 6 6+ =[, ] 1 =[,, ]=[,,
More informationDISCRIMINANTS AND RAMIFIED PRIMES. 1. Introduction A prime number p is said to be ramified in a number field K if the prime ideal factorization
DISCRIMINANTS AND RAMIFIED PRIMES KEITH CONRAD 1. Introducton A prme number p s sad to be ramfed n a number feld K f the prme deal factorzaton (1.1) (p) = po K = p e 1 1 peg g has some e greater than 1.
More informationComplex Numbers. x = B B 2 4AC 2A. or x = x = 2 ± 4 4 (1) (5) 2 (1)
Complex Numbers If you have not yet encountered complex numbers, you wll soon do so n the process of solvng quadratc equatons. The general quadratc equaton Ax + Bx + C 0 has solutons x B + B 4AC A For
More informationMath 261 Exercise sheet 2
Math 261 Exercse sheet 2 http://staff.aub.edu.lb/~nm116/teachng/2017/math261/ndex.html Verson: September 25, 2017 Answers are due for Monday 25 September, 11AM. The use of calculators s allowed. Exercse
More informationa b a In case b 0, a being divisible by b is the same as to say that
Secton 6.2 Dvsblty among the ntegers An nteger a ε s dvsble by b ε f there s an nteger c ε such that a = bc. Note that s dvsble by any nteger b, snce = b. On the other hand, a s dvsble by only f a = :
More informationLectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix
Lectures - Week 4 Matrx norms, Condtonng, Vector Spaces, Lnear Independence, Spannng sets and Bass, Null space and Range of a Matrx Matrx Norms Now we turn to assocatng a number to each matrx. We could
More informationSection 3.6 Complex Zeros
04 Chapter Secton 6 Comple Zeros When fndng the zeros of polynomals, at some pont you're faced wth the problem Whle there are clearly no real numbers that are solutons to ths equaton, leavng thngs there
More informationSome Consequences. Example of Extended Euclidean Algorithm. The Fundamental Theorem of Arithmetic, II. Characterizing the GCD and LCM
Example of Extended Eucldean Algorthm Recall that gcd(84, 33) = gcd(33, 18) = gcd(18, 15) = gcd(15, 3) = gcd(3, 0) = 3 We work backwards to wrte 3 as a lnear combnaton of 84 and 33: 3 = 18 15 [Now 3 s
More informationThe Ramanujan-Nagell Theorem: Understanding the Proof By Spencer De Chenne
The Ramanujan-Nagell Theorem: Understandng the Proof By Spencer De Chenne 1 Introducton The Ramanujan-Nagell Theorem, frst proposed as a conjecture by Srnvasa Ramanujan n 1943 and later proven by Trygve
More informationMULTIPLICATIVE FUNCTIONS: A REWRITE OF ANDREWS CHAPTER 6
MULTIPLICATIVE FUNCTIONS: A REWRITE OF ANDREWS CHAPTER 6 In these notes we offer a rewrte of Andrews Chapter 6. Our am s to replace some of the messer arguments n Andrews. To acheve ths, we need to change
More informationFoundations of Arithmetic
Foundatons of Arthmetc Notaton We shall denote the sum and product of numbers n the usual notaton as a 2 + a 2 + a 3 + + a = a, a 1 a 2 a 3 a = a The notaton a b means a dvdes b,.e. ac = b where c s an
More information1 Matrix representations of canonical matrices
1 Matrx representatons of canoncal matrces 2-d rotaton around the orgn: ( ) cos θ sn θ R 0 = sn θ cos θ 3-d rotaton around the x-axs: R x = 1 0 0 0 cos θ sn θ 0 sn θ cos θ 3-d rotaton around the y-axs:
More informationLECTURE V. 1. More on the Chinese Remainder Theorem We begin by recalling this theorem, proven in the preceeding lecture.
LECTURE V EDWIN SPARK 1. More on the Chnese Remander Theorem We begn by recallng ths theorem, proven n the preceedng lecture. Theorem 1.1 (Chnese Remander Theorem). Let R be a rng wth deals I 1, I 2,...,
More informationProblem Solving in Math (Math 43900) Fall 2013
Problem Solvng n Math (Math 43900) Fall 2013 Week four (September 17) solutons Instructor: Davd Galvn 1. Let a and b be two nteger for whch a b s dvsble by 3. Prove that a 3 b 3 s dvsble by 9. Soluton:
More informationAPPENDIX A Some Linear Algebra
APPENDIX A Some Lnear Algebra The collecton of m, n matrces A.1 Matrces a 1,1,..., a 1,n A = a m,1,..., a m,n wth real elements a,j s denoted by R m,n. If n = 1 then A s called a column vector. Smlarly,
More informationKernel Methods and SVMs Extension
Kernel Methods and SVMs Extenson The purpose of ths document s to revew materal covered n Machne Learnng 1 Supervsed Learnng regardng support vector machnes (SVMs). Ths document also provdes a general
More information= z 20 z n. (k 20) + 4 z k = 4
Problem Set #7 solutons 7.2.. (a Fnd the coeffcent of z k n (z + z 5 + z 6 + z 7 + 5, k 20. We use the known seres expanson ( n+l ( z l l z n below: (z + z 5 + z 6 + z 7 + 5 (z 5 ( + z + z 2 + z + 5 5
More informationand problem sheet 2
-8 and 5-5 problem sheet Solutons to the followng seven exercses and optonal bonus problem are to be submtted through gradescope by :0PM on Wednesday th September 08. There are also some practce problems,
More informationHMMT February 2016 February 20, 2016
HMMT February 016 February 0, 016 Combnatorcs 1. For postve ntegers n, let S n be the set of ntegers x such that n dstnct lnes, no three concurrent, can dvde a plane nto x regons (for example, S = {3,
More informationFACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP
C O L L O Q U I U M M A T H E M A T I C U M VOL. 80 1999 NO. 1 FACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP BY FLORIAN K A I N R A T H (GRAZ) Abstract. Let H be a Krull monod wth nfnte class
More informationFirst day August 1, Problems and Solutions
FOURTH INTERNATIONAL COMPETITION FOR UNIVERSITY STUDENTS IN MATHEMATICS July 30 August 4, 997, Plovdv, BULGARIA Frst day August, 997 Problems and Solutons Problem. Let {ε n } n= be a sequence of postve
More informationPolynomials. 1 What is a polynomial? John Stalker
Polynomals John Stalker What s a polynomal? If you thnk you already know what a polynomal s then skp ths secton. Just be aware that I consstently wrte thngs lke p = c z j =0 nstead of p(z) = c z. =0 You
More informationPRIMES 2015 reading project: Problem set #3
PRIMES 2015 readng project: Problem set #3 page 1 PRIMES 2015 readng project: Problem set #3 posted 31 May 2015, to be submtted around 15 June 2015 Darj Grnberg The purpose of ths problem set s to replace
More informationSolutions to the 71st William Lowell Putnam Mathematical Competition Saturday, December 4, 2010
Solutons to the 7st Wllam Lowell Putnam Mathematcal Competton Saturday, December 4, 2 Kran Kedlaya and Lenny Ng A The largest such k s n+ 2 n 2. For n even, ths value s acheved by the partton {,n},{2,n
More informationIntroduction to Vapor/Liquid Equilibrium, part 2. Raoult s Law:
CE304, Sprng 2004 Lecture 4 Introducton to Vapor/Lqud Equlbrum, part 2 Raoult s Law: The smplest model that allows us do VLE calculatons s obtaned when we assume that the vapor phase s an deal gas, and
More informationALGEBRA MID-TERM. 1 Suppose I is a principal ideal of the integral domain R. Prove that the R-module I R I has no non-zero torsion elements.
ALGEBRA MID-TERM CLAY SHONKWILER 1 Suppose I s a prncpal deal of the ntegral doman R. Prove that the R-module I R I has no non-zero torson elements. Proof. Note, frst, that f I R I has no non-zero torson
More informationCollege of Computer & Information Science Fall 2009 Northeastern University 20 October 2009
College of Computer & Informaton Scence Fall 2009 Northeastern Unversty 20 October 2009 CS7880: Algorthmc Power Tools Scrbe: Jan Wen and Laura Poplawsk Lecture Outlne: Prmal-dual schema Network Desgn:
More informationAnti-van der Waerden numbers of 3-term arithmetic progressions.
Ant-van der Waerden numbers of 3-term arthmetc progressons. Zhanar Berkkyzy, Alex Schulte, and Mchael Young Aprl 24, 2016 Abstract The ant-van der Waerden number, denoted by aw([n], k), s the smallest
More informationn α j x j = 0 j=1 has a nontrivial solution. Here A is the n k matrix whose jth column is the vector for all t j=0
MODULE 2 Topcs: Lnear ndependence, bass and dmenson We have seen that f n a set of vectors one vector s a lnear combnaton of the remanng vectors n the set then the span of the set s unchanged f that vector
More informationALGEBRA HW 7 CLAY SHONKWILER
ALGEBRA HW 7 CLAY SHONKWILER 1 Whch of the followng rngs R are dscrete valuaton rngs? For those that are, fnd the fracton feld K = frac R, the resdue feld k = R/m (where m) s the maxmal deal), and a unformzer
More informationSection 8.3 Polar Form of Complex Numbers
80 Chapter 8 Secton 8 Polar Form of Complex Numbers From prevous classes, you may have encountered magnary numbers the square roots of negatve numbers and, more generally, complex numbers whch are the
More information8.6 The Complex Number System
8.6 The Complex Number System Earler n the chapter, we mentoned that we cannot have a negatve under a square root, snce the square of any postve or negatve number s always postve. In ths secton we want
More informationFINITELY-GENERATED MODULES OVER A PRINCIPAL IDEAL DOMAIN
FINITELY-GENERTED MODULES OVER PRINCIPL IDEL DOMIN EMMNUEL KOWLSKI Throughout ths note, s a prncpal deal doman. We recall the classfcaton theorem: Theorem 1. Let M be a fntely-generated -module. (1) There
More information3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X
Statstcs 1: Probablty Theory II 37 3 EPECTATION OF SEVERAL RANDOM VARIABLES As n Probablty Theory I, the nterest n most stuatons les not on the actual dstrbuton of a random vector, but rather on a number
More informationAffine transformations and convexity
Affne transformatons and convexty The purpose of ths document s to prove some basc propertes of affne transformatons nvolvng convex sets. Here are a few onlne references for background nformaton: http://math.ucr.edu/
More informationk(k 1)(k 2)(p 2) 6(p d.
BLOCK-TRANSITIVE 3-DESIGNS WITH AFFINE AUTOMORPHISM GROUP Greg Gamble Let X = (Z p d where p s an odd prme and d N, and let B X, B = k. Then t was shown by Praeger that the set B = {B g g AGL d (p} s the
More informationwhere a is any ideal of R. Lemma 5.4. Let R be a ring. Then X = Spec R is a topological space Moreover the open sets
5. Schemes To defne schemes, just as wth algebrac varetes, the dea s to frst defne what an affne scheme s, and then realse an arbtrary scheme, as somethng whch s locally an affne scheme. The defnton of
More informationSL n (F ) Equals its Own Derived Group
Internatonal Journal of Algebra, Vol. 2, 2008, no. 12, 585-594 SL n (F ) Equals ts Own Derved Group Jorge Macel BMCC-The Cty Unversty of New York, CUNY 199 Chambers street, New York, NY 10007, USA macel@cms.nyu.edu
More informationFinding Primitive Roots Pseudo-Deterministically
Electronc Colloquum on Computatonal Complexty, Report No 207 (205) Fndng Prmtve Roots Pseudo-Determnstcally Ofer Grossman December 22, 205 Abstract Pseudo-determnstc algorthms are randomzed search algorthms
More informationDifference Equations
Dfference Equatons c Jan Vrbk 1 Bascs Suppose a sequence of numbers, say a 0,a 1,a,a 3,... s defned by a certan general relatonshp between, say, three consecutve values of the sequence, e.g. a + +3a +1
More informationChristian Aebi Collège Calvin, Geneva, Switzerland
#A7 INTEGERS 12 (2012) A PROPERTY OF TWIN PRIMES Chrstan Aeb Collège Calvn, Geneva, Swtzerland chrstan.aeb@edu.ge.ch Grant Carns Department of Mathematcs, La Trobe Unversty, Melbourne, Australa G.Carns@latrobe.edu.au
More informationinv lve a journal of mathematics 2008 Vol. 1, No. 1 Divisibility of class numbers of imaginary quadratic function fields
nv lve a journal of mathematcs Dvsblty of class numbers of magnary quadratc functon felds Adam Merberg mathematcal scences publshers 2008 Vol. 1, No. 1 INVOLVE 1:1(2008) Dvsblty of class numbers of magnary
More information12 MATH 101A: ALGEBRA I, PART C: MULTILINEAR ALGEBRA. 4. Tensor product
12 MATH 101A: ALGEBRA I, PART C: MULTILINEAR ALGEBRA Here s an outlne of what I dd: (1) categorcal defnton (2) constructon (3) lst of basc propertes (4) dstrbutve property (5) rght exactness (6) localzaton
More informationInternational Mathematical Olympiad. Preliminary Selection Contest 2012 Hong Kong. Outline of Solutions
Internatonal Mathematcal Olympad Prelmnary Selecton ontest Hong Kong Outlne of Solutons nswers: 7 4 7 4 6 5 9 6 99 7 6 6 9 5544 49 5 7 4 6765 5 6 6 7 6 944 9 Solutons: Snce n s a two-dgt number, we have
More informationWeek 2. This week, we covered operations on sets and cardinality.
Week 2 Ths week, we covered operatons on sets and cardnalty. Defnton 0.1 (Correspondence). A correspondence between two sets A and B s a set S contaned n A B = {(a, b) a A, b B}. A correspondence from
More information(2mn, m 2 n 2, m 2 + n 2 )
MATH 16T Homewk Solutons 1. Recall that a natural number n N s a perfect square f n = m f some m N. a) Let n = p α even f = 1,,..., k. be the prme factzaton of some n. Prove that n s a perfect square f
More informationNP-Completeness : Proofs
NP-Completeness : Proofs Proof Methods A method to show a decson problem Π NP-complete s as follows. (1) Show Π NP. (2) Choose an NP-complete problem Π. (3) Show Π Π. A method to show an optmzaton problem
More informationTHERE ARE NO POINTS OF ORDER 11 ON ELLIPTIC CURVES OVER Q.
THERE ARE NO POINTS OF ORDER 11 ON ELLIPTIC CURVES OVER Q. IAN KIMING We shall prove the followng result from [2]: Theorem 1. (Bllng-Mahler, 1940, cf. [2]) An ellptc curve defned over Q does not have a
More informationCOMPLEX NUMBERS AND QUADRATIC EQUATIONS
COMPLEX NUMBERS AND QUADRATIC EQUATIONS INTRODUCTION We know that x 0 for all x R e the square of a real number (whether postve, negatve or ero) s non-negatve Hence the equatons x, x, x + 7 0 etc are not
More informationExercises. 18 Algorithms
18 Algorthms Exercses 0.1. In each of the followng stuatons, ndcate whether f = O(g), or f = Ω(g), or both (n whch case f = Θ(g)). f(n) g(n) (a) n 100 n 200 (b) n 1/2 n 2/3 (c) 100n + log n n + (log n)
More informationMin Cut, Fast Cut, Polynomial Identities
Randomzed Algorthms, Summer 016 Mn Cut, Fast Cut, Polynomal Identtes Instructor: Thomas Kesselhem and Kurt Mehlhorn 1 Mn Cuts n Graphs Lecture (5 pages) Throughout ths secton, G = (V, E) s a mult-graph.
More informationRemarks on the Properties of a Quasi-Fibonacci-like Polynomial Sequence
Remarks on the Propertes of a Quas-Fbonacc-lke Polynomal Sequence Brce Merwne LIU Brooklyn Ilan Wenschelbaum Wesleyan Unversty Abstract Consder the Quas-Fbonacc-lke Polynomal Sequence gven by F 0 = 1,
More informationBallot Paths Avoiding Depth Zero Patterns
Ballot Paths Avodng Depth Zero Patterns Henrch Nederhausen and Shaun Sullvan Florda Atlantc Unversty, Boca Raton, Florda nederha@fauedu, ssull21@fauedu 1 Introducton In a paper by Sapounaks, Tasoulas,
More informationarxiv: v6 [math.nt] 23 Aug 2016
A NOTE ON ODD PERFECT NUMBERS JOSE ARNALDO B. DRIS AND FLORIAN LUCA arxv:03.437v6 [math.nt] 23 Aug 206 Abstract. In ths note, we show that f N s an odd perfect number and q α s some prme power exactly
More informationPolynomial PSet Solutions
Polynomal PSet Solutons Note: Problems A, A2, B2, B8, C2, D2, E3, and E6 were done n class. (A) Values and Roots. Rearrange to get (x + )P (x) x = 0 for x = 0,,..., n. Snce ths equaton has roots x = 0,,...,
More informationLecture 5 Decoding Binary BCH Codes
Lecture 5 Decodng Bnary BCH Codes In ths class, we wll ntroduce dfferent methods for decodng BCH codes 51 Decodng the [15, 7, 5] 2 -BCH Code Consder the [15, 7, 5] 2 -code C we ntroduced n the last lecture
More informationIDEAL FACTORIZATION. Theorem 1.2. For elements α and β in a commutative ring, α β as elements if and only if (α) (β) as ideals.
IDEAL FACTORIZATION KEITH CONRAD 1. Introducton We wll prove here the fundamental theorem of deal theory n number felds: every nonzero proper deal n the ntegers of a number feld admts unque factorzaton
More informationprinceton univ. F 17 cos 521: Advanced Algorithm Design Lecture 7: LP Duality Lecturer: Matt Weinberg
prnceton unv. F 17 cos 521: Advanced Algorthm Desgn Lecture 7: LP Dualty Lecturer: Matt Wenberg Scrbe: LP Dualty s an extremely useful tool for analyzng structural propertes of lnear programs. Whle there
More information5 The Rational Canonical Form
5 The Ratonal Canoncal Form Here p s a monc rreducble factor of the mnmum polynomal m T and s not necessarly of degree one Let F p denote the feld constructed earler n the course, consstng of all matrces
More informationMath 217 Fall 2013 Homework 2 Solutions
Math 17 Fall 013 Homework Solutons Due Thursday Sept. 6, 013 5pm Ths homework conssts of 6 problems of 5 ponts each. The total s 30. You need to fully justfy your answer prove that your functon ndeed has
More informationChapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems
Numercal Analyss by Dr. Anta Pal Assstant Professor Department of Mathematcs Natonal Insttute of Technology Durgapur Durgapur-713209 emal: anta.bue@gmal.com 1 . Chapter 5 Soluton of System of Lnear Equatons
More informationInner Product. Euclidean Space. Orthonormal Basis. Orthogonal
Inner Product Defnton 1 () A Eucldean space s a fnte-dmensonal vector space over the reals R, wth an nner product,. Defnton 2 (Inner Product) An nner product, on a real vector space X s a symmetrc, blnear,
More informationErrors for Linear Systems
Errors for Lnear Systems When we solve a lnear system Ax b we often do not know A and b exactly, but have only approxmatons  and ˆb avalable. Then the best thng we can do s to solve ˆx ˆb exactly whch
More informationSome basic inequalities. Definition. Let V be a vector space over the complex numbers. An inner product is given by a function, V V C
Some basc nequaltes Defnton. Let V be a vector space over the complex numbers. An nner product s gven by a functon, V V C (x, y) x, y satsfyng the followng propertes (for all x V, y V and c C) (1) x +
More informationBeyond Zudilin s Conjectured q-analog of Schmidt s problem
Beyond Zudln s Conectured q-analog of Schmdt s problem Thotsaporn Ae Thanatpanonda thotsaporn@gmalcom Mathematcs Subect Classfcaton: 11B65 33B99 Abstract Usng the methodology of (rgorous expermental mathematcs
More informationProblem Set 9 Solutions
Desgn and Analyss of Algorthms May 4, 2015 Massachusetts Insttute of Technology 6.046J/18.410J Profs. Erk Demane, Srn Devadas, and Nancy Lynch Problem Set 9 Solutons Problem Set 9 Solutons Ths problem
More informationLinear, affine, and convex sets and hulls In the sequel, unless otherwise specified, X will denote a real vector space.
Lnear, affne, and convex sets and hulls In the sequel, unless otherwse specfed, X wll denote a real vector space. Lnes and segments. Gven two ponts x, y X, we defne xy = {x + t(y x) : t R} = {(1 t)x +
More informationLinear Approximation with Regularization and Moving Least Squares
Lnear Approxmaton wth Regularzaton and Movng Least Squares Igor Grešovn May 007 Revson 4.6 (Revson : March 004). 5 4 3 0.5 3 3.5 4 Contents: Lnear Fttng...4. Weghted Least Squares n Functon Approxmaton...
More informationThe internal structure of natural numbers and one method for the definition of large prime numbers
The nternal structure of natural numbers and one method for the defnton of large prme numbers Emmanul Manousos APM Insttute for the Advancement of Physcs and Mathematcs 3 Poulou str. 53 Athens Greece Abstract
More informationDirichlet s Theorem In Arithmetic Progressions
Drchlet s Theorem In Arthmetc Progressons Parsa Kavkan Hang Wang The Unversty of Adelade February 26, 205 Abstract The am of ths paper s to ntroduce and prove Drchlet s theorem n arthmetc progressons,
More informationUnit 5: Quadratic Equations & Functions
Date Perod Unt 5: Quadratc Equatons & Functons DAY TOPIC 1 Modelng Data wth Quadratc Functons Factorng Quadratc Epressons 3 Solvng Quadratc Equatons 4 Comple Numbers Smplfcaton, Addton/Subtracton & Multplcaton
More informationCSCE 790S Background Results
CSCE 790S Background Results Stephen A. Fenner September 8, 011 Abstract These results are background to the course CSCE 790S/CSCE 790B, Quantum Computaton and Informaton (Sprng 007 and Fall 011). Each
More informationIntroduction to Algorithms
Introducton to Algorthms 6.046J/8.40J Lecture 7 Prof. Potr Indyk Data Structures Role of data structures: Encapsulate data Support certan operatons (e.g., INSERT, DELETE, SEARCH) Our focus: effcency of
More informationVapnik-Chervonenkis theory
Vapnk-Chervonenks theory Rs Kondor June 13, 2008 For the purposes of ths lecture, we restrct ourselves to the bnary supervsed batch learnng settng. We assume that we have an nput space X, and an unknown
More informationA combinatorial problem associated with nonograms
A combnatoral problem assocated wth nonograms Jessca Benton Ron Snow Nolan Wallach March 21, 2005 1 Introducton. Ths work was motvated by a queston posed by the second named author to the frst named author
More informationEconomics 101. Lecture 4 - Equilibrium and Efficiency
Economcs 0 Lecture 4 - Equlbrum and Effcency Intro As dscussed n the prevous lecture, we wll now move from an envronment where we looed at consumers mang decsons n solaton to analyzng economes full of
More information1 Generating functions, continued
Generatng functons, contnued. Generatng functons and parttons We can make use of generatng functons to answer some questons a bt more restrctve than we ve done so far: Queston : Fnd a generatng functon
More informationwhere a is any ideal of R. Lemma Let R be a ring. Then X = Spec R is a topological space. Moreover the open sets
11. Schemes To defne schemes, just as wth algebrac varetes, the dea s to frst defne what an affne scheme s, and then realse an arbtrary scheme, as somethng whch s locally an affne scheme. The defnton of
More informationMath1110 (Spring 2009) Prelim 3 - Solutions
Math 1110 (Sprng 2009) Solutons to Prelm 3 (04/21/2009) 1 Queston 1. (16 ponts) Short answer. Math1110 (Sprng 2009) Prelm 3 - Solutons x a 1 (a) (4 ponts) Please evaluate lm, where a and b are postve numbers.
More informationModelli Clamfim Equazione del Calore Lezione ottobre 2014
CLAMFIM Bologna Modell 1 @ Clamfm Equazone del Calore Lezone 17 15 ottobre 2014 professor Danele Rtell danele.rtell@unbo.t 1/24? Convoluton The convoluton of two functons g(t) and f(t) s the functon (g
More information2.3 Nilpotent endomorphisms
s a block dagonal matrx, wth A Mat dm U (C) In fact, we can assume that B = B 1 B k, wth B an ordered bass of U, and that A = [f U ] B, where f U : U U s the restrcton of f to U 40 23 Nlpotent endomorphsms
More informationREDUCTION MODULO p. We will prove the reduction modulo p theorem in the general form as given by exercise 4.12, p. 143, of [1].
REDUCTION MODULO p. IAN KIMING We wll prove the reducton modulo p theorem n the general form as gven by exercse 4.12, p. 143, of [1]. We consder an ellptc curve E defned over Q and gven by a Weerstraß
More informationA summation on Bernoulli numbers
Journal of Number Theory 111 (005 37 391 www.elsever.com/locate/jnt A summaton on Bernoull numbers Kwang-Wu Chen Department of Mathematcs and Computer Scence Educaton, Tape Muncpal Teachers College, No.
More informationModule 9. Lecture 6. Duality in Assignment Problems
Module 9 1 Lecture 6 Dualty n Assgnment Problems In ths lecture we attempt to answer few other mportant questons posed n earler lecture for (AP) and see how some of them can be explaned through the concept
More informationPHYS 705: Classical Mechanics. Calculus of Variations II
1 PHYS 705: Classcal Mechancs Calculus of Varatons II 2 Calculus of Varatons: Generalzaton (no constrant yet) Suppose now that F depends on several dependent varables : We need to fnd such that has a statonary
More informationIntegrals and Invariants of Euler-Lagrange Equations
Lecture 16 Integrals and Invarants of Euler-Lagrange Equatons ME 256 at the Indan Insttute of Scence, Bengaluru Varatonal Methods and Structural Optmzaton G. K. Ananthasuresh Professor, Mechancal Engneerng,
More informationON A DETERMINATION OF THE INITIAL FUNCTIONS FROM THE OBSERVED VALUES OF THE BOUNDARY FUNCTIONS FOR THE SECOND-ORDER HYPERBOLIC EQUATION
Advanced Mathematcal Models & Applcatons Vol.3, No.3, 2018, pp.215-222 ON A DETERMINATION OF THE INITIAL FUNCTIONS FROM THE OBSERVED VALUES OF THE BOUNDARY FUNCTIONS FOR THE SECOND-ORDER HYPERBOLIC EUATION
More informationBernoulli Numbers and Polynomials
Bernoull Numbers and Polynomals T. Muthukumar tmk@tk.ac.n 17 Jun 2014 The sum of frst n natural numbers 1, 2, 3,..., n s n n(n + 1 S 1 (n := m = = n2 2 2 + n 2. Ths formula can be derved by notng that
More informationThe Multiple Classical Linear Regression Model (CLRM): Specification and Assumptions. 1. Introduction
ECONOMICS 5* -- NOTE (Summary) ECON 5* -- NOTE The Multple Classcal Lnear Regresson Model (CLRM): Specfcaton and Assumptons. Introducton CLRM stands for the Classcal Lnear Regresson Model. The CLRM s also
More informationComplete subgraphs in multipartite graphs
Complete subgraphs n multpartte graphs FLORIAN PFENDER Unverstät Rostock, Insttut für Mathematk D-18057 Rostock, Germany Floran.Pfender@un-rostock.de Abstract Turán s Theorem states that every graph G
More informationThe Fundamental Theorem of Algebra. Objective To use the Fundamental Theorem of Algebra to solve polynomial equations with complex solutions
5-6 The Fundamental Theorem of Algebra Content Standards N.CN.7 Solve quadratc equatons wth real coeffcents that have comple solutons. N.CN.8 Etend polnomal denttes to the comple numbers. Also N.CN.9,
More informationSociété de Calcul Mathématique SA
Socété de Calcul Mathématque SA Outls d'ade à la décson Tools for decson help Probablstc Studes: Normalzng the Hstograms Bernard Beauzamy December, 202 I. General constructon of the hstogram Any probablstc
More informationGroup Theory Worksheet
Jonathan Loss Group Theory Worsheet Goals: To ntroduce the student to the bascs of group theory. To provde a hstorcal framewor n whch to learn. To understand the usefulness of Cayley tables. To specfcally
More informationNOTES ON SIMPLIFICATION OF MATRICES
NOTES ON SIMPLIFICATION OF MATRICES JONATHAN LUK These notes dscuss how to smplfy an (n n) matrx In partcular, we expand on some of the materal from the textbook (wth some repetton) Part of the exposton
More informationPhysics 5153 Classical Mechanics. Principle of Virtual Work-1
P. Guterrez 1 Introducton Physcs 5153 Classcal Mechancs Prncple of Vrtual Work The frst varatonal prncple we encounter n mechancs s the prncple of vrtual work. It establshes the equlbrum condton of a mechancal
More informationPolynomials. 1 More properties of polynomials
Polynomals 1 More propertes of polynomals Recall that, for R a commutatve rng wth unty (as wth all rngs n ths course unless otherwse noted), we defne R[x] to be the set of expressons n =0 a x, where a
More informationFirst Year Examination Department of Statistics, University of Florida
Frst Year Examnaton Department of Statstcs, Unversty of Florda May 7, 010, 8:00 am - 1:00 noon Instructons: 1. You have four hours to answer questons n ths examnaton.. You must show your work to receve
More information332600_08_1.qxp 4/17/08 11:29 AM Page 481
336_8_.qxp 4/7/8 :9 AM Page 48 8 Complex Vector Spaces 8. Complex Numbers 8. Conjugates and Dvson of Complex Numbers 8.3 Polar Form and DeMovre s Theorem 8.4 Complex Vector Spaces and Inner Products 8.5
More information1 Generating functions, continued
Generatng functons, contnued. Exponental generatng functons and set-parttons At ths pont, we ve come up wth good generatng-functon dscussons based on 3 of the 4 rows of our twelvefold way. Wll our nteger-partton
More information