CATALAN NUMBERS, PRIMES AND TWIN PRIMES
|
|
- Eustacia Darleen Briggs
- 6 years ago
- Views:
Transcription
1 CATALAN NUMBERS, PRIMES AND TWIN PRIMES CHRISTIAN AEBI AND GRANT CAIRNS Abstract. Deser Artkel beabschtgt, enge Bezehungen zwschen Catalan-Zahlen, Prmzahlen und Prmzahlzwllngen darzustellen, ndem nur elementare arthmetsche Begrffe angewendet, glechzetg aber auch vele (hstorsche Bezüge für den an ener weteren Ausführung nteresserten Leser angeboten werden. Das Verhältns zwschen Catalan-Zahlen und Prmzahlen ermöglcht es uns, das Konzept der Catalan-Pseudoprmzahl zu defneren und hre Verbndung mt Weferch-Prmzahlen aufzuwesen. Der zwete Tel enthält Krteren für Prmzahlzwllnge m Zusammenhang mt dem Theorem von Wlson (Clement, dem klenen Theorem von Fermat und Catalan-Zahlen. Der letzte Tel konzentrert sch auf de Untersuchung der zentralen Bnomalkoeffzenten n verschedenen Fällen, so dass Rückschlüsse über de Ncht-Exstenz der Catalan-Pseudoprmzahlen spezfscher Formen gezogen werden können.. INTRODUCTION. Orgnally Catalan numbers were revealed for the frst tme n a letter from Euler to Goldbach n 75 when countng the number of trangulatons of a convex polygon (for a bref hstory see [6]. Today thay are usually defned by C n = ( n+ n n and can be characterzed recursvely by C n = (n n + C n or C n = C n C 0 + C n C + + C C n + C 0 C n, wth C 0 =. Ther appearances occur n a dazzlng varety of combnatoral settngs where they are used to enumerate all manner of geometrc and algebrac objects (see Rchard Stanley s collecton [9, Chap. 6]; an onlne Addendum s contnuously updated. Qute a lot s known about the dvsblty of the Catalan numbers; see [, 0]. They are obvously closely related to the mddle bnomal numbers and not surprsngly, there s a consderable lterature on ther dvsblty too; see [3, 5, 9, 5, 7, 6]. The am of ths paper s to observe a connecton between Catalan numbers, prmes and twn prmes.. PRIMES. There are few better known or more easly understood problems n pure mathematcs than the queston of rapdly determnng whether a gven nteger s prme [8]. A classc prmalty crteron s Wlson s theorem, whch says (see [4, Ch. ]: Wlson s Theorem. A natural number p s prme f and only f (p! (mod p. Wlson s theorem s a very strkng result, and yet t s qute mpractcal as a prmalty check. The trouble wth Wslon s theorem s that t s more beautful than useful [6]. In some texts, t s used to prove Fermat s lttle theorem, a partcular case of whch s: Theorem. If p s prme, then p (mod p.
2 CHRISTIAN AEBI AND GRANT CAIRNS A fascnatng account of the hstory of proofs of Wlson s and Fermat s theorems s gven n [, Chap. 3]. Although Theorem s a useful basc prmalty test, ts converse s false; for example, 34 (mod 34, but 34 s not prme; such numbers are called pseudoprmes. Some other pseudoprmes are: 56, 645, 05, 387, and 79, just to stop on a famous number. In a smlar ven, we have: Theorem. If p s an odd prme, then ( C (mod p. It seems surprsng that the above connecton doesn t seem to have been prevously explctly observed, especally snce Catalan numbers are the subject of such nterest (sometmes known as Catalan dsease and there have been so many proofs of Wlson s theorem, ncludng proofs by Catalan hmself [, Chap. 3]. We gve two proofs of Theorem. Proof of Theorem. Suppose that p s an odd prme. Modulo p, one has p, for all. Hence (p! (! and so C = p+ (( ( = p + (p!! (( ( p + (. Before gvng the next proof, frst recall the followng elementary facts (part (a was observed by Lebnz [, p. 59], part (b was observed as early as 830 [, p. 67] and appears for example n [, Ex ]: Lemma. If p s prme and 0 < < p, then we have: (a ( p 0 (mod p, (b ( ( (mod p, (c ( + ( p p (mod p, where denotes the multplcatve nverse of modulo p. Proof. Part (a s obvous, but that won t stop us gvng a proof n Secton 4. (b The bnomal theorem gves ( = ( p (. It follows that ( = ( p ( p + ( p + ( (, usng (a. Part (c follows from (b snce p ( p = (. Proof of Theorem. By Lemma (b, ( C = ( p + (. Notce that the above proofs are completely elementary; they don t even use Wlson s theorem. Lke Theorem, Theorem gves a necessary condton for p to be prme, and lke Theorem, ts converse s false; for example, C 953 (mod 5907, but 5907 s not prme (beng equal to We wll call such numbers Catalan pseudoprmes. Comparng Theorems and, notce that although the computaton of the Catalan
3 CATALAN NUMBERS, PRIMES AND TWIN PRIMES 3 numbers s qute nvolved [7], C s consderably smaller than p. Moreover, Catalan pseudoprmes seem to be far less common than standard pseudoprmes. Indeed, searchng for Catalan pseudoprmes wth a computer can be qute dscouragng. A more theoretcal approach conssts n tryng to dentfy Catalan pseudoprmes of a gven form, the smplest of all beng p, where p s prme. In that case the natural queston arses as to whether they would also be standard pseudoprmes. The affrmatve answer here below s even more precse. Proposton. If p s an odd prme, then the followng numbers are equal modulo p : (a C ( p, (b (, (c p, (d p, (e + p ( p, where denotes the nverse of modulo p. Proof. Frst note that f < p and s not a multple of p, then has an nverse modulo p, and p. Thus C p = p + ( p p ( p p = p ( p p p p p p p 3p p p 3p = ( p p p p = ( p p ( = ( p 3 3 ( p p+. p 3 3 p p p p + p So (a=(b. The clam (b=(e can be deduced drectly from [0, Theorem 33]. We supply a proof for completeness. We have ( ( So, expandng n powers of p, ( ( = ( p p p 3 3 = p p 3 p 3 p ( p p ( p p. (mod p. Modulo p, each nverse equals a unque number j wth j < p. Thus one has the followng fact observed by Cauchy [, Chap. III]: ( p = (p = pp 0 (mod p.
4 4 CHRISTIAN AEBI AND GRANT CAIRNS Hence ( ( + p ( p (mod p Thus (b=(e. The equaton (e=(c was apparently proved by Sylvester [8, Chap. 8A]; t follows from [0, Theorem 3], but once agan we supply a proof for completeness. Usng Lemma (c and (, we have modulo p, [( p ( p = ( + p p = j + p j= p ( + p (mod p. p ( ] p Ths gves (e=(c. Fnally, by Theorem, p (mod p, so modulo p, we have p = + xp, for some x {0,,..., p }. Thus Hence (c=(d. p = ( p p = ( + xp p p (mod p. Recall that f p s prme and p modulo p, then p s a Weferch prme; 093 and 35 are the only known Weferch prmes; there are no other Weferch prmes less than [], but at present t s not known whether there are only fntely many Weferch prmes. Weferch showed n 909 that f the Fermat equaton x p + y p = z p had a soluton for an odd prme p not dvdng xyz, then the smallest such p s necessarly a Weferch prme [7]. Notce that the above proposton has the followng corollary: Corollary. If p s prme, then the followng are equvalent: (a p s a Weferch prme, (b p s a pseudoprme, (c p s a Catalan pseudoprme. So = 093 and 37 = 35 are examples of Catalan pseudoprmes. Much more rare than standard pseudoprmes, 5907, 093 and 35 are the only Catalan pseudoprmes we are currently aware of. Remark. Notce that by Theorems and, when p s prme, ( C p (mod p. Proposton gves a stronger verson of ths. Indeed, from Proposton we obtan ( C = ( p + ( p + (p ( p( p (mod p. We remark n passng that an even stronger statement can be deduced from a result of Frank Morley [3]: f p > 3 s prme, then ( C For related nformaton, see [4, Lecture ]. ( p + p (mod p 3.
5 CATALAN NUMBERS, PRIMES AND TWIN PRIMES 5 Remark. As we saw above, Theorem s a trval consequence of Lemma. Although the converse of Theorem s false, the converse of Lemma s true, as was observed by Lebnz [, p. 9]: a natural number p s prme f and only f ( p s dvsble by p for all 0 < < p. Indeed, f n s composte, and q s a prme dvsor of n, then ( n q sn t dvsble by n, as one can see by wrtng n ( n q = (n (n... (n q + q! and notng that snce q dvdes n, q doesn t dvde any of the terms n the numerator. 3. TWIN PRIMES. There s a twn prme verson of Wlson s theorem, known as Clement s theorem [8], that says: Clement s Theorem. The natural numbers p, p + are both prme f and only f 4.(p! + p (mod p(p +. Clement s theorem has been redscovered and generalzed by a number of people [5, 4]. In fact, t was dscovered by Zahlen a few years before Clement [30]. An alternate expresson s gven n [9]. There s an obvous Fermat verson of Clement s theorem, whch we haven t notced n the lterature: Theorem 3. If natural numbers p, p+ are both prme, then p+ 3p+8 (mod p(p+. Proof. Suppose that p, p + are both prme. We are requred to show that p+ 3p + 8 (mod p and p+ 3p + 8 (mod p +. Modulo p, Theorem gves whle modulo p +, Theorem gves as requred. p+ 8 3p + 8 (mod p, p+ 3(p + + = 3p + 8 (mod p +, The converse to Theorem 3 s false. For example, for p = 56, one has p+ 3p + 8 (mod p(p+, but whle 56 s prme, 563 s a pseudoprme. Another example s p = 4369, where p and p + are both pseudoprmes. Nevertheless, n the same way that Fermat s lttle theorem has a generalzaton of the form : p s prme f and only f for every prme q < p, q (mod p, Theorem 3 can also be generalzed to: Theorem 4. Natural numbers p and p + are both prme, f and only f for all prmes q < p, q p+ p(q + q (mod p(p +. Theorem 4 can be establshed n the same way we proved Theorem 3, wth the help of lttle Fermat s extenson. Returnng to Catalan numbers, there s a recent twn-prme crtera that s not entrely unrelated to the Catalan numbers []. In a dfferent drecton, the followng observaton s drectly analogous to Clement s theorem and Theorem 3: Theorem 5. If natural numbers p, p + are both prme, then 8( C 7p + 6 (mod p(p +.
6 6 CHRISTIAN AEBI AND GRANT CAIRNS Proof. Suppose that p, p + are both prme. Modulo p, Theorem gves One has C 8( C 8( C = p+3 C 4p p+ whch completes the proof. 8 7p So, modulo p +, Theorem gves = p + 3 p+ ( C p+ p 4 p + 3 p (mod p. 7p + 6 (mod p +, We don t have a counter-example to the converse of Theorem 5; the only Catalan pseudoprmes we currently know are 5907, and 37, and none of the numbers 5907 ±, ±, 37 ± s prme. Remark 3. Usng Lemma and Remark, t s not dffcult to establsh the followng: the natural numbers p, p + are both prme f and only f ( p ( + + p (mod p(p +, for all 0 < < p. 4. A DOOR AJAR?. The connecton between prmes and Catalan numbers opens the door (however narrowly to possble connectons between prmes and varous combnatoral problems. There are precedents for ths sort of thng. There s a geometrc proof of Fermat s lttle theorem; see [3, Ch. 3.]. Here s one way of seeng t. Consder the possble black-whte colourngs of the vertces of a regular p-gon. There are p such colourngs. The cyclc group Z p acts by rotaton on the polygon and hence on the set of colourngs. There are two colourngs fxed by ths acton (all black and all whte, and for p prme, the Z p -acton s free on the set of the p other colourngs. Thus p 0 (mod p, whch proves Theorem. There are other elementary results that can be establshed n a smlar manner. For example, there are ( p colourngs of the above knd n whch exactly vertces are coloured black. For p prme and 0 < < p, the Z p -acton on these colourngs s obvously free, so ( p 0 (mod p, whch proves Lemma (a. Lemma (a s admttedly trval, beng mmedate from the defnton ( p = p!. (p!! However, the same dea can be used to gve a more nterestng result. Consder the regular mp-gon, where m N. The vertces can be grouped nto p lots of m consecutve vertces, whch one can regard as formng the sdes of a p-gon. Now consder the possble blackwhte colourngs of vertces of the mp-gon. The acton of Z p s once agan free outsde the fxed ponts. The colourngs that are fxed by the acton are just those colourngs that are dentcal on each edge of the p-gon. So one has mmedately: Proposton. If p s prme, then for all m N (a pm 0 (mod p f 0 (mod p, (b ( pm p ( m (mod p for all N. From Proposton we can quckly deduce Lucas Theorem [, Secton XXI]: Lucas Theorem. If p s prme and 0 n, j < p, then ( pm+n p+j ( m ( n j (mod p.
7 CATALAN NUMBERS, PRIMES AND TWIN PRIMES 7 Proof. By Proposton (a we can assume that n > 0. Then for the case j = 0, ( pm+n pm + n ( ( p = pm+n p pm+n p (mod p, p(m + n and the result follows by nducton on n. For j 0, ( pm+n pm + n ( p+j = pm+n n p+j p + j j ( pm+n p+j and agan the requred s obtaned by nducton on n. (mod p, 5. BACK TO THE MIDDLE BINOMIAL COEFFICIENT. For convenence, let us ntroduce the followng notaton: ( γ n := ( n n n, for odd n. Theorem can be rephrased as follows: f p s an odd prme, then γ p (mod p. The equaton (a=(b of Proposton can be rewrtten as follows: f p s an odd prme, then γ p γ p (mod p. One also has: Lemma. (a If p s an odd prme, then γ mp γ m (mod p for all odd m N. (b If p, q are dstnct odd prmes, then γ pq γ p γ q γ p + γ q (mod pq. (c If p s an odd prme, then for all odd n p, γ n 0 and γ n (n γ p n+ (mod p. Proof. (a Argung as n the proof of Lemma (b, one has for all ( ( m = ( mp + ( mp + ( ( mp and so by Proposton, ( ( m ( m + ( m + ( j ( m j, (mod p where j = p. For = m one has p = m p = m. So ( ( m m ( m + ( m + ( m ( m m = ( m ( m m. That s, γ mp γ m (mod p. (b Suppose that p, q are dstnct odd prmes. From part (a, γ pq γ q (mod p. So, as γ p (mod p, we have γ pq γ p γ q (mod p. Smlarly, γ pq γ p γ q (mod q. Thus γ pq γ p γ q (mod pq. Furthermore, snce γ p 0 (mod p and γ q 0 (mod q, one has (γ p (γ q 0 (mod pq, and so γ p γ q γ p + γ q (mod pq, as requred. (c Frst notce that for all odd > Hence ( γ = ( = 4 ( 3 3 ( γ = 4 γ. 3 = 4 ( γ.
8 8 CHRISTIAN AEBI AND GRANT CAIRNS Now we prove (c by nducton on n. For n = t s obvous, so let n >. Usng ( frst and the nducton hypotheses we obtan γ n 4 n n (n 3 γ p n+3 (mod p = 4 n n (n 3 4 p n + p n + γ p n+ = n n p n + p n + (n γ p n+ (n γ p n+ (mod p (usng ( agan Remark 4. It s not true that γ pqr γ p γ q γ r (mod pqr for all dstnct prmes p, q, r. For example, γ 05 γ 3 γ 5 γ 7 (mod 05. Notce that from the defnton, a composte number n s a Catalan pseudoprme f and only f γ n (mod n. Further, one has: Proposton 3. If p, q are dstnct odd prmes, then pq s a Catalan pseudoprme f and only f γ q (mod p and γ p (mod q. Proof. If pq s a Catalan pseudoprme, then γ pq (mod pq. In partcular, γ pq (mod p. So by Lemma (a, γ p γ q (mod p. But as p s prme, γ p (mod p. Hence γ q (mod p. By the same reasonng, γ p (mod q. Conversely, f γ p (mod q and γ p (mod q, then as p, q are dstnct prmes, γ p (mod pq. Smlarly, γ q (mod pq and so by Lemma (b, γ pq (mod pq. The above consderatons enable one to show that f p, q are prme wth p < q and ether p or q p s qute small, then pq s not a Catalan pseudoprme. To gve a trval example of ths, we prove: Corollary. There are no Catalan pseudoprmes of the form p(p +, where p, p + are twn prmes. Proof. If p, p + are prmes, then by Lemma (c, γ p ( γ 3 (mod p +. One has γ 3 = and by Fermat s lttle theorem, ( 4 (mod p +. So γ p 3 (mod p +. If p(p + was a Catalan pseudoprme, then by Proposton 3 we would have γ p (mod p + and thus 3 (mod p +,.e., p + = 9 contradctng the assumpton that p + s prme. We now come to the man result of ths paper, whch enables one to reduce the calculaton of γ n (mod p to the case where n < p. Theorem 6. If p s an odd prme, then for all odd n N, 0 ; n/p odd and n not a multple of p, γ n γ n/p ; n/p odd and n a multple of p, γ n/p +.γ n p n/p ; n/p even. (mod p
9 CATALAN NUMBERS, PRIMES AND TWIN PRIMES 9 Proof. If n/p s odd and n a multple of p, then n has the form mp where m s odd, and Lemma (a gves the requred result. If n/p s odd and n s not a multple of p, then n has the form mp + where m s odd and 0 < < p/. By nducton, mp + ( γ mp+ = 4 mp + ( + γ mp+( 0 and for =, Equaton ( gves: γ mp+ = 4 mp mp + γ mp 0 (mod p. (mod p. If n/p s even, then n has the form mp where m s odd and 0 < < p/. Applyng Equaton ( tmes gves: γ mp = ( 4 mp mp mp 4 mp 3... mp mp + γ mp ( γ mp Hence, snce γ mp γ m (mod p by Lemma (a, we have: (3 γ mp ( Notce that by defnton γ m γ + = ( (! ( = ( (! = ( (mod p. (mod p So, from Equaton 3, γ mp 4 γ + γ m (mod p. Thus, by Lemma (c, γ mp γ p γ m (mod p. That s, γ n γ n/p + γ n p n/p (mod p, as requred. Remark 5. Theorem 6 can be alternatvely deduced from Lucas Theorem. We menton also that the blocks of zeros where q/p s odd and q s not a multple of p, has also been observed for the Catalan numbers []. Usng Theorem 6 and Proposton 3, our calculatons show that there are no Catalan pseudoprmes less than 0 0 of the form pq, where p, q are dstnct prmes. Notce that Theorem 6(a gves a consderable extenson of Corollary. Indeed, f p, q are prme and p < q < p, then by Theorem 6, γ q 0 (mod p and so pq s not a Catalan pseudoprme, by Proposton 3. The frst possble case would therefore seem to be the stuaton where q = p +, but n fact there are no Catalan pseudoprmes of ths form ether: Corollary 3. There are no Catalan pseudoprmes of the form pq, where p, q = p + s a Sophe German par. Proof. Otherwse for q = p +, Theorem 6 gves γ q γ 3 γ (mod p. But Proposton 3 mples γ q (mod p. Hence p = 3 and q = 7. Agan by Proposton 3 we would have γ p (mod q, but γ 3 = (mod 7.
10 0 CHRISTIAN AEBI AND GRANT CAIRNS References. Wllam W. Adams and Larry Joel Goldsten, Introducton to number theory, Prentce-Hall Inc., Englewood Clffs, N.J., 976. MR MR (57 #67. Ronald Alter and K. K. Kubota, Prme and prme power dvsblty of Catalan numbers, J. Combnatoral Theory Ser. A 5 (973, MR MR03550 (48 # George E. Andrews, Number theory, Dover Publcatons Inc., New York, 994, Corrected reprnt of the 97 orgnal [Dover, New York]. MR MR È. T. Avanesov, On a generalzaton of the Lebnz theorem, Fz.-Mat. Sps. B lgar. Akad. Nauk. 8 (4 (965, MR MR (33 # Danel Berend and Jørgen E. Harmse, On some arthmetcal propertes of mddle bnomal coeffcents, Acta Arth. 84 (998, no., 3 4. MR MR6394 (99a:08 6. Guram Bezhanshvl, Hng Leung, Jerry Lodder, Davd Pengelley, and Desh Ranjan, Countng trangulatons of a polygon, Teachng Dscrete Mathematcs va Prmary Hstorcal Sources Webste, projects/, New Mexco State Unversty, downloaded Douglas M. Campbell, The computaton of Catalan numbers, Math. Mag. 57 (984, no. 4, P. A. Clement, Congruences for sets of prmes, Amer. Math. Monthly 56 (949, Joseph B. Dence and Thomas P. Dence, A necessary and suffcent condton for twn prmes, Mssour J. Math. Sc. 7 (995, no. 3, Emerc Deutsch and Bruce E. Sagan, Congruences for Catalan and Motzkn numbers and related sequences, J. Number Theory 7 (006, no., Leonard Eugene Dckson, Hstory of the theory of numbers. Vol. I: Dvsblty and prmalty., Chelsea Publshng Co., New York, Karl Dlcher and Kenneth B. Stolarsky, A Pascal-type trangle characterzng twn prmes, Amer. Math. Monthly (005, no. 8, P. Erdős, On some dvsblty propertes of ( n n, Canad. Math. Bull. 7 (964, Dmtry Fuchs and Serge Tabachnkov, Mathematcal omnbus, Amercan Mathematcal Socety, Provdence, RI, Andrew Granvlle, Zaphod Beeblebrox s bran and the ffty-nnth row of Pascal s trangle, Amer. Math. Monthly 99 (99, no. 4, , Arthmetc propertes of bnomal coeffcents. I. Bnomal coeffcents modulo prme powers, Organc mathematcs (Burnaby, BC, 995, CMS Conf. Proc., vol. 0, Amer. Math. Soc., Provdence, RI, 997, pp , Correcton to: Zaphod Beeblebrox s bran and the ffty-nnth row of Pascal s trangle [Amer. Math. Monthly 99 (99, no. 4, 38 33], Amer. Math. Monthly 04 (997, no. 9, , It s easy to determne whether a gven nteger s prme, Bull. Amer. Math. Soc. (N.S. 4 (005, no., 3 38 (electronc. 9. Andrew Granvlle and Olver Ramaré, Explct bounds on exponental sums and the scarcty of squarefree bnomal coeffcents, Mathematka 43 (996, no., G. H. Hardy and E. M. Wrght, An ntroducton to the theory of numbers, ffth ed., The Clarendon Press Oxford Unversty Press, New York, Joshua Knauer and Jörg Rchsten, The contnung search for Weferch prmes, Math. Comp. 74 (005, no. 5, (electronc.. Edouard Lucas, Theore des Fonctons Numerques Smplement Perodques, Amer. J. Math. (878, 84 40, F. Morley, Note on the congruence 4n ( n (n!/(n!, where n + s a prme, Ann. of Math. 9 (894/95, no. -6, Oysten Ore, Number Theory and Its Hstory, McGraw-Hll Book Company, Inc., New York, Franco Pellegrno, Teorema d Wlson e numer prm gemell, Att Accad. Naz. Lnce Rend. Cl. Sc. Fs. Mat. Natur. (8 35 (963, Constance Red, From zero to nfnty, ffth ed., A K Peters Ltd., Wellesley, MA, Paulo Rbenbom, 3 lectures on Fermat s last theorem, Sprnger-Verlag, New York, 979.
11 CATALAN NUMBERS, PRIMES AND TWIN PRIMES 8., My numbers, my frends, Sprnger-Verlag, New York, Rchard P. Stanley, Enumeratve combnatorcs. Vol., Cambrdge Studes n Advanced Mathematcs, vol. 6, Cambrdge Unversty Press, Cambrdge, Jean Perre Zahlen, Sur un genre nouveau de crtères de prmalté, Eucldes, Madrd 6 (946, no. 64, Collège Calvn, Geneva, Swtzerland E-mal address: chrstan.aeb@edu.ge.ch Department of Mathematcs, La Trobe Unversty, Melbourne, Australa 3086 E-mal address: G.Carns@latrobe.edu.au
CATALAN NUMBERS, PRIMES AND TWIN PRIMES
CATALAN NUMBERS, PRIMES AND TWIN PRIMES CHRISTIAN AEBI AND GRANT CAIRNS. INTRODUCTION. Orgnally Catalan numbers were revealed for the frst tme n a letter from Euler to Goldbach n 75 when countng the number
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 informationFoundations of Arithmetic
Foundatons of Arthmetc Notaton We shall denote the sum and product of numbers n the usual notaton as a 2 + a 2 + a 3 + + a = a, a 1 a 2 a 3 a = a The notaton a b means a dvdes b,.e. ac = b where c s an
More informationTHE CHINESE REMAINDER THEOREM. We should thank the Chinese for their wonderful remainder theorem. Glenn Stevens
THE CHINESE REMAINDER THEOREM KEITH CONRAD We should thank the Chnese for ther wonderful remander theorem. Glenn Stevens 1. Introducton The Chnese remander theorem says we can unquely solve any par of
More 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 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 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 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 informationSmarandache-Zero Divisors in Group Rings
Smarandache-Zero Dvsors n Group Rngs W.B. Vasantha and Moon K. Chetry Department of Mathematcs I.I.T Madras, Chenna The study of zero-dvsors n group rngs had become nterestng problem snce 1940 wth the
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 informationZhi-Wei Sun (Nanjing)
Acta Arth. 1262007, no. 4, 387 398. COMBINATORIAL CONGRUENCES AND STIRLING NUMBERS Zh-We Sun Nanng Abstract. In ths paper we obtan some sophstcated combnatoral congruences nvolvng bnomal coeffcents and
More informationGraph Reconstruction by Permutations
Graph Reconstructon by Permutatons Perre Ille and Wllam Kocay* Insttut de Mathémathques de Lumny CNRS UMR 6206 163 avenue de Lumny, Case 907 13288 Marselle Cedex 9, France e-mal: lle@ml.unv-mrs.fr Computer
More informationSelf-complementing permutations of k-uniform hypergraphs
Dscrete Mathematcs Theoretcal Computer Scence DMTCS vol. 11:1, 2009, 117 124 Self-complementng permutatons of k-unform hypergraphs Artur Szymańsk A. Paweł Wojda Faculty of Appled Mathematcs, AGH Unversty
More 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 informationPerfect Competition and the Nash Bargaining Solution
Perfect Competton and the Nash Barganng Soluton Renhard John Department of Economcs Unversty of Bonn Adenauerallee 24-42 53113 Bonn, Germany emal: rohn@un-bonn.de May 2005 Abstract For a lnear exchange
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 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 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 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 informationExample: (13320, 22140) =? Solution #1: The divisors of are 1, 2, 3, 4, 5, 6, 9, 10, 12, 15, 18, 20, 27, 30, 36, 41,
The greatest common dvsor of two ntegers a and b (not both zero) s the largest nteger whch s a common factor of both a and b. We denote ths number by gcd(a, b), or smply (a, b) when there s no confuson
More 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 informationCaps and Colouring Steiner Triple Systems
Desgns, Codes and Cryptography, 13, 51 55 (1998) c 1998 Kluwer Academc Publshers, Boston. Manufactured n The Netherlands. Caps and Colourng Stener Trple Systems AIDEN BRUEN* Department of Mathematcs, Unversty
More informationMA 323 Geometric Modelling Course Notes: Day 13 Bezier Curves & Bernstein Polynomials
MA 323 Geometrc Modellng Course Notes: Day 13 Bezer Curves & Bernsten Polynomals Davd L. Fnn Over the past few days, we have looked at de Casteljau s algorthm for generatng a polynomal curve, and we have
More informationCharacterizing the properties of specific binomial coefficients in congruence relations
Eastern Mchgan Unversty DgtalCommons@EMU Master's Theses and Doctoral Dssertatons Master's Theses, and Doctoral Dssertatons, and Graduate Capstone Projects 7-15-2015 Characterzng the propertes of specfc
More informationVolume 18 Figure 1. Notation 1. Notation 2. Observation 1. Remark 1. Remark 2. Remark 3. Remark 4. Remark 5. Remark 6. Theorem A [2]. Theorem B [2].
Bulletn of Mathematcal Scences and Applcatons Submtted: 016-04-07 ISSN: 78-9634, Vol. 18, pp 1-10 Revsed: 016-09-08 do:10.1805/www.scpress.com/bmsa.18.1 Accepted: 016-10-13 017 ScPress Ltd., Swtzerland
More informationarxiv: v1 [math.co] 12 Sep 2014
arxv:1409.3707v1 [math.co] 12 Sep 2014 On the bnomal sums of Horadam sequence Nazmye Ylmaz and Necat Taskara Department of Mathematcs, Scence Faculty, Selcuk Unversty, 42075, Campus, Konya, Turkey March
More informationMore metrics on cartesian products
More metrcs on cartesan products If (X, d ) are metrc spaces for 1 n, then n Secton II4 of the lecture notes we defned three metrcs on X whose underlyng topologes are the product topology The purpose of
More informationFormulas for the Determinant
page 224 224 CHAPTER 3 Determnants e t te t e 2t 38 A = e t 2te t e 2t e t te t 2e 2t 39 If 123 A = 345, 456 compute the matrx product A adj(a) What can you conclude about det(a)? For Problems 40 43, use
More informationTHE CHVÁTAL-ERDŐS CONDITION AND 2-FACTORS WITH A SPECIFIED NUMBER OF COMPONENTS
Dscussones Mathematcae Graph Theory 27 (2007) 401 407 THE CHVÁTAL-ERDŐS CONDITION AND 2-FACTORS WITH A SPECIFIED NUMBER OF COMPONENTS Guantao Chen Department of Mathematcs and Statstcs Georga State Unversty,
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 informationOn quasiperfect numbers
Notes on Number Theory and Dscrete Mathematcs Prnt ISSN 1310 5132, Onlne ISSN 2367 8275 Vol. 23, 2017, No. 3, 73 78 On quasperfect numbers V. Sva Rama Prasad 1 and C. Suntha 2 1 Nalla Malla Reddy Engneerng
More informationDONALD M. DAVIS. 1. Main result
v 1 -PERIODIC 2-EXPONENTS OF SU(2 e ) AND SU(2 e + 1) DONALD M. DAVIS Abstract. We determne precsely the largest v 1 -perodc homotopy groups of SU(2 e ) and SU(2 e +1). Ths gves new results about the largest
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 informationTHERE ARE INFINITELY MANY FIBONACCI COMPOSITES WITH PRIME SUBSCRIPTS
Research and Communcatons n Mathematcs and Mathematcal Scences Vol 10, Issue 2, 2018, Pages 123-140 ISSN 2319-6939 Publshed Onlne on November 19, 2018 2018 Jyot Academc Press http://jyotacademcpressorg
More 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 informationarxiv: v1 [math.co] 1 Mar 2014
Unon-ntersectng set systems Gyula O.H. Katona and Dánel T. Nagy March 4, 014 arxv:1403.0088v1 [math.co] 1 Mar 014 Abstract Three ntersecton theorems are proved. Frst, we determne the sze of the largest
More informationOn the irreducibility of a truncated binomial expansion
On the rreducblty of a truncated bnomal expanson by Mchael Flaseta, Angel Kumchev and Dmtr V. Pasechnk 1 Introducton For postve ntegers k and n wth k n 1, defne P n,k (x = =0 ( n x. In the case that k
More informationCOMBINATORIAL IDENTITIES DERIVING FROM THE n-th POWER OF A 2 2 MATRIX
COMBINATORIAL IDENTITIES DERIVING FROM THE n-th POWER OF A MATRIX J Mc Laughln 1 Mathematcs Department Trnty College 300 Summt Street, Hartford, CT 06106-3100 amesmclaughln@trncolledu Receved:, Accepted:,
More informationOn the size of quotient of two subsets of positive integers.
arxv:1706.04101v1 [math.nt] 13 Jun 2017 On the sze of quotent of two subsets of postve ntegers. Yur Shtenkov Abstract We obtan non-trval lower bound for the set A/A, where A s a subset of the nterval [1,
More informationA CHARACTERIZATION OF ADDITIVE DERIVATIONS ON VON NEUMANN ALGEBRAS
Journal of Mathematcal Scences: Advances and Applcatons Volume 25, 2014, Pages 1-12 A CHARACTERIZATION OF ADDITIVE DERIVATIONS ON VON NEUMANN ALGEBRAS JIA JI, WEN ZHANG and XIAOFEI QI Department of Mathematcs
More informationJ. Number Theory 130(2010), no. 4, SOME CURIOUS CONGRUENCES MODULO PRIMES
J. Number Theory 30(200, no. 4, 930 935. SOME CURIOUS CONGRUENCES MODULO PRIMES L-Lu Zhao and Zh-We Sun Department of Mathematcs, Nanjng Unversty Nanjng 20093, People s Republc of Chna zhaollu@gmal.com,
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 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 informationRestricted divisor sums
ACTA ARITHMETICA 02 2002) Restrcted dvsor sums by Kevn A Broughan Hamlton) Introducton There s a body of work n the lterature on varous restrcted sums of the number of dvsors of an nteger functon ncludng
More 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 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 informationThe Order Relation and Trace Inequalities for. Hermitian Operators
Internatonal Mathematcal Forum, Vol 3, 08, no, 507-57 HIKARI Ltd, wwwm-hkarcom https://doorg/0988/mf088055 The Order Relaton and Trace Inequaltes for Hermtan Operators Y Huang School of Informaton Scence
More informationCatalan numbers, primes, and twin primes
Elem. Math. 63 (008 53 64 003-608/08/04053- c Swiss Mathematical Society, 008 Elemente der Mathematik Catalan numbers, primes, and twin primes Christian Aebi and Grant Cairns Christian Aebi studied mathematics
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 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 informationModulo Magic Labeling in Digraphs
Gen. Math. Notes, Vol. 7, No., August, 03, pp. 5- ISSN 9-784; Copyrght ICSRS Publcaton, 03 www.-csrs.org Avalable free onlne at http://www.geman.n Modulo Magc Labelng n Dgraphs L. Shobana and J. Baskar
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 informationDeterminants Containing Powers of Generalized Fibonacci Numbers
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol 19 (2016), Artcle 1671 Determnants Contanng Powers of Generalzed Fbonacc Numbers Aram Tangboonduangjt and Thotsaporn Thanatpanonda Mahdol Unversty Internatonal
More informationChowla s Problem on the Non-Vanishing of Certain Infinite Series and Related Questions
Proc. Int. Conf. Number Theory and Dscrete Geometry No. 4, 2007, pp. 7 79. Chowla s Problem on the Non-Vanshng of Certan Infnte Seres and Related Questons N. Saradha School of Mathematcs, Tata Insttute
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 informationAnother converse of Jensen s inequality
Another converse of Jensen s nequalty Slavko Smc Abstract. We gve the best possble global bounds for a form of dscrete Jensen s nequalty. By some examples ts frutfulness s shown. 1. Introducton Throughout
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 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 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 informationTHE SUMMATION NOTATION Ʃ
Sngle Subscrpt otaton THE SUMMATIO OTATIO Ʃ Most of the calculatons we perform n statstcs are repettve operatons on lsts of numbers. For example, we compute the sum of a set of numbers, or the sum of the
More informationREGULAR POSITIVE TERNARY QUADRATIC FORMS. 1. Introduction
REGULAR POSITIVE TERNARY QUADRATIC FORMS BYEONG-KWEON OH Abstract. A postve defnte quadratc form f s sad to be regular f t globally represents all ntegers that are represented by the genus of f. In 997
More information2 More examples with details
Physcs 129b Lecture 3 Caltech, 01/15/19 2 More examples wth detals 2.3 The permutaton group n = 4 S 4 contans 4! = 24 elements. One s the dentty e. Sx of them are exchange of two objects (, j) ( to j and
More informationMaximizing the number of nonnegative subsets
Maxmzng the number of nonnegatve subsets Noga Alon Hao Huang December 1, 213 Abstract Gven a set of n real numbers, f the sum of elements of every subset of sze larger than k s negatve, what s the maxmum
More 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 informationSome congruences related to harmonic numbers and the terms of the second order sequences
Mathematca Moravca Vol. 0: 06, 3 37 Some congruences related to harmonc numbers the terms of the second order sequences Neşe Ömür Sbel Koaral Abstract. In ths aer, wth hels of some combnatoral denttes,
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 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 informationBOUNDEDNESS OF THE RIESZ TRANSFORM WITH MATRIX A 2 WEIGHTS
BOUNDEDNESS OF THE IESZ TANSFOM WITH MATIX A WEIGHTS Introducton Let L = L ( n, be the functon space wth norm (ˆ f L = f(x C dx d < For a d d matrx valued functon W : wth W (x postve sem-defnte for all
More information28 Finitely Generated Abelian Groups
8 Fntely Generated Abelan Groups In ths last paragraph of Chapter, we determne the structure of fntely generated abelan groups A complete classfcaton of such groups s gven Complete classfcaton theorems
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 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 information1 GSW Iterative Techniques for y = Ax
1 for y = A I m gong to cheat here. here are a lot of teratve technques that can be used to solve the general case of a set of smultaneous equatons (wrtten n the matr form as y = A), but ths chapter sn
More informationOne-sided finite-difference approximations suitable for use with Richardson extrapolation
Journal of Computatonal Physcs 219 (2006) 13 20 Short note One-sded fnte-dfference approxmatons sutable for use wth Rchardson extrapolaton Kumar Rahul, S.N. Bhattacharyya * Department of Mechancal Engneerng,
More informationFREQUENCY DISTRIBUTIONS Page 1 of The idea of a frequency distribution for sets of observations will be introduced,
FREQUENCY DISTRIBUTIONS Page 1 of 6 I. Introducton 1. The dea of a frequency dstrbuton for sets of observatons wll be ntroduced, together wth some of the mechancs for constructng dstrbutons of data. Then
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 informationThe KMO Method for Solving Non-homogenous, m th Order Differential Equations
The KMO Method for Solvng Non-homogenous, m th Order Dfferental Equatons Davd Krohn Danel Marño-Johnson John Paul Ouyang March 14, 2013 Abstract Ths paper shows a smple tabular procedure for fndng the
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 informationarxiv: v1 [math.nt] 12 Sep 2018
ON p-adic VALUATIONS OF COLORED p-ary PARTITIONS arxv:180904628v1 [mathnt] 12 Sep 2018 MACIEJ ULAS AND B LAŻEJ ŻMIJA Abstract Letm N 2 andforgven k N + consderthesequence (A m,k (n n N defned by the power
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 informationIntroductory Cardinality Theory Alan Kaylor Cline
Introductory Cardnalty Theory lan Kaylor Clne lthough by name the theory of set cardnalty may seem to be an offshoot of combnatorcs, the central nterest s actually nfnte sets. Combnatorcs deals wth fnte
More informationLecture 10: May 6, 2013
TTIC/CMSC 31150 Mathematcal Toolkt Sprng 013 Madhur Tulsan Lecture 10: May 6, 013 Scrbe: Wenje Luo In today s lecture, we manly talked about random walk on graphs and ntroduce the concept of graph expander,
More information20. Mon, Oct. 13 What we have done so far corresponds roughly to Chapters 2 & 3 of Lee. Now we turn to Chapter 4. The first idea is connectedness.
20. Mon, Oct. 13 What we have done so far corresponds roughly to Chapters 2 & 3 of Lee. Now we turn to Chapter 4. The frst dea s connectedness. Essentally, we want to say that a space cannot be decomposed
More informationLecture 12: Discrete Laplacian
Lecture 12: Dscrete Laplacan Scrbe: Tanye Lu Our goal s to come up wth a dscrete verson of Laplacan operator for trangulated surfaces, so that we can use t n practce to solve related problems We are mostly
More 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 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 informationON THE NUMBER OF PRIMITIVE PYTHAGOREAN QUINTUPLES
Journal of Algebra, Nuber Theory: Advances and Applcatons Volue 3, Nuber, 05, Pages 3-8 ON THE NUMBER OF PRIMITIVE PYTHAGOREAN QUINTUPLES Feldstrasse 45 CH-8004, Zürch Swtzerland e-al: whurlann@bluewn.ch
More information( N) Chun-Xuan Jiang. P. O. Box 3924, Beijing , P. R. China
ang s functon n ( ) n prme dstrbuton Chun-Xuan ang P O Box 94, Bejng 00854, P R Chna jcxuan@snacom Abstract: We defne that prme equatons f( P,, Pn ),, f ( P, Pn ) (5)are polynomals (wth nteger coeffcents)
More informationOn the Divisibility of Binomial Coefficients
On the Dvsblty of Bnomal Coeffcents Sílva Casacuberta Pug Abstract We analyze an open problem n number theory regardng the dvsblty of bnomal coeffcents. It s conjectured that for every nteger n there exst
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 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 informationShort running title: A generating function approach A GENERATING FUNCTION APPROACH TO COUNTING THEOREMS FOR SQUARE-FREE POLYNOMIALS AND MAXIMAL TORI
Short runnng ttle: A generatng functon approach A GENERATING FUNCTION APPROACH TO COUNTING THEOREMS FOR SQUARE-FREE POLYNOMIALS AND MAXIMAL TORI JASON FULMAN Abstract. A recent paper of Church, Ellenberg,
More informationSUMS PROBLEM COMPETITION, 2001
SUMS PROBLEM COMPETITION, 200 SOLUTIONS Suppose that after n vsts to Aunt Joylene (and therefore also n vsts to Uncle Bruce Lnda has t n ten cent peces and d n dollar cons After a vst to Uncle Bruce she
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 informationRandić Energy and Randić Estrada Index of a Graph
EUROPEAN JOURNAL OF PURE AND APPLIED MATHEMATICS Vol. 5, No., 202, 88-96 ISSN 307-5543 www.ejpam.com SPECIAL ISSUE FOR THE INTERNATIONAL CONFERENCE ON APPLIED ANALYSIS AND ALGEBRA 29 JUNE -02JULY 20, ISTANBUL
More informationEdge Isoperimetric Inequalities
November 7, 2005 Ross M. Rchardson Edge Isopermetrc Inequaltes 1 Four Questons Recall that n the last lecture we looked at the problem of sopermetrc nequaltes n the hypercube, Q n. Our noton of boundary
More informationCase A. P k = Ni ( 2L i k 1 ) + (# big cells) 10d 2 P k.
THE CELLULAR METHOD In ths lecture, we ntroduce the cellular method as an approach to ncdence geometry theorems lke the Szemeréd-Trotter theorem. The method was ntroduced n the paper Combnatoral complexty
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 informationGroup Analysis of Ordinary Differential Equations of the Order n>2
Symmetry n Nonlnear Mathematcal Physcs 997, V., 64 7. Group Analyss of Ordnary Dfferental Equatons of the Order n> L.M. BERKOVICH and S.Y. POPOV Samara State Unversty, 4430, Samara, Russa E-mal: berk@nfo.ssu.samara.ru
More informationOn C 0 multi-contractions having a regular dilation
SUDIA MAHEMAICA 170 (3) (2005) On C 0 mult-contractons havng a regular dlaton by Dan Popovc (mşoara) Abstract. Commutng mult-contractons of class C 0 and havng a regular sometrc dlaton are studed. We prove
More information