A conjecture of De Koninck regarding particular square values of the sum of divisors function
|
|
- Austen Logan
- 5 years ago
- Views:
Transcription
1 Journal of Number Theory ) Contents lsts avalable at ScenceDrect Journal of Number Theory A conecture of De Konnck regardng partcular square values of the sum of dvsors functon Kevn Broughan, Danel Delbourgo, Qzh Zhou Department of Mathematcs, Unversty of Wakato, Prvate Bag 3105, Hamlton, New Zealand artcle nfo abstract Artcle hstory: Receved 8 March 013 Receved n revsed form 5 August 013 Accepted 0 October 013 Avalable onlne 4 December 013 Communcated by Davd Goss MSC: 11A5 11A41 Keywords: Sum of dvsors Squarefree core De Konnck s conecture Compactfcaton We study ntegers n>1 satsfyng the relaton σn) =γn), where σn)andγn) are the sum of dvsors and the product of dstnct prmes dvdng n, respectvely. If the prme dvdng asolutonn s congruent to 3 modulo 8 then t must be greater than 41, and every soluton s dvsble by at least the fourth power of an odd prme. Moreover at least /5 of the exponents a of the prmes dvdng any soluton have the property that a + 1 s a prme power. Lastly we prove that the number of solutons up to x>1satmostx 1/6+ɛ, for any ɛ>0andall x>x ɛ. 013 Elsever Inc. All rghts reserved. 1. Introducton A decade ago, Jean-Mare De Konnck asked for all nteger solutons n to the equaton σn) =γn) 1) * Correspondng author. E-mal addresses: kab@wakato.ac.nz K. Broughan), delbourg@wakato.ac.nz D. Delbourgo), qz49@wakato.ac.nz Q. Zhou) X/$ see front matter 013 Elsever Inc. All rghts reserved.
2 K. Broughan et al. / Journal of Number Theory ) where σn) denotes the sum of all postve dvsors of n, andγn) s the product of the dstnct prme dvsors of n. The only known solutons wth 1 n are n =1and n = 178, and so De Konnck sensbly conectured that there exst no other solutons. It s ncluded n Rchard Guy s compendum [4, Secton B11] as an unsolved problem. In [] a number of restrctons on the form of Eq. 1) were developed: the two solutons n =1andn = 178 are the only ones havng ωn) 4; furthermore, f an nteger n>1 s fourth power free.e. p 4 n for all prmes p), then t was shown that n cannot satsfy De Konnck s equaton. The am of ths work s to present further tems of evdence n support of De Konnck s conecture, and to ndcate the necessary structure of a hypothetcal counter-example. In fact, upon combnng together the results of [] and ths artcle, then any non-trval soluton other than 178 must be even, have one prme dvsor to power 1 and possbly another prme dvsor to a power congruent to 1 modulo 4, whle all other odd prme dvsors should occur only to even powers. Here we shall establsh that f the prme to power 1 s congruent to 3 modulo 8, then t must be no less than 43 Proposton 1). Moreover, we prove that at least one odd prme dvsor must appear wth an exponent no smaller than 4 Theorem 1). Applyng an dea from [3], weshowncorollary that more than /5 of the exponents a appearng n the prme factorzaton of any soluton of Eq. 1) are such that a +1s a prme or a prme power. We then count the number of potental solutons n up to x, n the followng manner: usng results of Pollack and Pomerance [8], and by extendng a method of [,Thm.1], we shall prove n Theorem that the number of solutons n x to Eq. 1) can be at most x 1/6+ɛ, for any ɛ>0 and every x>x ɛ. Fnally, by explotng the propertes of the product compactfcaton of N, weshow there are only fntely many solutons to 1) supported on any gven fnte set of prmes P. Indeed we wll prove a more general result for the equaton σn) α φn) β = θ n μ γn) τ ) where α, β, μ, τ Z wth θ>0 some fxed ratonal, and α + β>μsee Theorem 3). The argument tself has a rather dfferent flavor from that n [5]. Notatons. If p s prme then v p n) s the hghest power of p whch dvdes n, ωn) wll denote the number of dstnct prme dvsors of n, andk s the set of all solutons to σn) =γn). Lastly, the symbols p, q, p,q are reserved exclusvely for odd prmes.. Prelmnary lemmas We begn by recallng some basc structure theory concernng solutons to Eq. 1). The followng two background results were proved n []. Lemma 1. If n>1 belongs to K, then one has a decomposton s n = e p 1 = p a
3 5 K. Broughan et al. / Journal of Number Theory ) where e 1, anda s even for all =3,...,s. Furthermore, ether a s even n whch case p 1 3mod8),ornsteada 1mod4)and p 1 p 1mod4). Lemma. If n>1 s an element of K and does not equal to 178 = , thenn has at least 5 dstnct prme factors, and there exsts a prme ether even or odd) dvdng n to at least a fourth power. The proof of the next result s due Pollack, and can be found n [6]. Lemma 3. If σn)/n = N/D wth gcdn,d) =1, then gven x 1 and d 1: #{n x such that D = d} = x o1) as x. Lastly we wll requre Apéry s soluton to the generalzed Ramanuan Nagel equatons. Lemma 4. See Apéry [1].) The Dophantne equaton x +D = n+, wth gven non-zero nteger D 7, has at most two solutons. In addton: ) f D =3then x, n) {3, 5), 45, 11)}, ) f D has the form m 1 wth m 4, thenx, n) {1,m), m 1, m 1)}. Hence, n both these cases, there are exactly two solutons. 3. Restrctons on prmes dvdng members of K In ths secton, we shall make a prelmnary study of restrctons on the possble values of p 1 and p assocated to elements of K, addtonal to those descrbed n Lemma 1 above. Clearly p cannot be dvsble by any cube, otherwse Eq. 1) s volated. Hence for prme numbers congruent to 3 modulo 8, ths excludes frst 107 and secondly n ncreasng order) 499 from occurrng. We wll henceforth refer to these as bad De Konnck prmes; ndeed there are an nfnte number of prmes p 3 mod 8) such that p + 1 s dvsble by a proper cube. In Proposton 1 below, we shall prove that 3, 11 and 19 are also bad. In the case p 1 p 1mod4)anda = 1, ths same constrant appled to p 1 +1)p +1) excludes for those prmes less than 100, the pars {5, 17}, {5, 53}, {5, 89}, {13, 53}, {13, 97}, {17, 9}, {17, 41}, {17, 53}, {17, 89}, {9, 53}, {9, 89}, {37, 53}, {41, 53}, {41, 89}, {41, 97} called here bad De Konnck pars. LaternCorollary 1, weshow{5, 13} s also bad.
4 K. Broughan et al. / Journal of Number Theory ) Proposton 1. Under the same notatons as Lemma 1, fasolutonn Ksatsfes both ωn) > 4 and p 1 3mod8), then the prme p Proof. Frst suppose that p 1 =3,nwhchcase e+1 1 ) 4 = σp a ) p =4 3. As a drect consequence e+1 1 < 9soe {1, }, andby[, Theorem 3] we can assume a 4. Therefore 3 13 = ) < e+1 1 ) σpa ) p < 3, whch s obvously false, and we conclude that p 1 3. Next f one supposes that p 1 = 11, then e+1 1 ) 1 = σ p a ) =4 11 p, thus 3 e+1 1) < 11 whch mples that 1 e 4. If all of the a were strctly less than 4, then by [, Theorem 3] agan we would have e =4,nwhchcase The latter mples e+1 1 ) p 1 +1) 31 3 = = = σp a ) p =4 11. σp a ) p =11, hence there exsts an wth11 p + p +1;thssmpossblesnce11 1mod3. It follows there s at least one wtha 4, and wthout loss of generalty suppose that t s a say. One therefore obtans an nequalty and consequently, e+1 1 ) p whch s clearly false. Therefore p σpa ) p < 11 3 σ34 ) 3 =11 < 11
5 54 K. Broughan et al. / Journal of Number Theory ) Fnally suppose p 1 = 19. Usng Lemma 1 we can wrte n = e p 1 m = pa, whence e+1 1 ) p 1 +1) = σp a ) p =4p 1. Thus e+1 1) 5F =19 where F s a postve ratonal value strctly greater than 1. As a consequence e+1 1) < 19 /5, mplyng that 1 e 5. Case 1). If e =5then 9 7 5F =19 and t follows that F<19 /315 < If some exponent a 3thenF σp 3 )/p > 3 whch cannot occur, and therefore one may assume that a =forevery {,...m}. Now by studyng the left hand sde, there must exst a prme p whch we wll call p ) that equals 3. Then σp )= = 13 yelds a new prme, denoted p 3,wth σp 3)= =3 61. One thereby obtans a left hand sde wth at least three 3 s n the numerator but at most two 3 s n the denomnator, whle the rght hand sde has none. Ths contradcton shows e<5. Case ). If e =4then 31 5 = σp a ) p =19. Argung as n the prevous case, wthout loss of generalty assume a =for. Examnng the left hand sde, one of the prmes p must equal 31; let us call t p. Then we have σp )= = 3 331, thence the new prme p 3 = 331 gves σp 3) = = , and ultmately p 4 =7wth7 +7+1=3 19. Hence there are at least three 3 s n the numerator and exactly two n the denomnator, wth none occurrng on the rght hand sde. Ths shows e<4. Case 3). If e =3then15 5F =19 mples )< 19, whch s false. Case 4). If e = then we would get < 19, whch agan s false. Case 5). Henceforth we consder the stuaton where e = 1. It follows that 3 5 = σ p a ) =19 p =
6 K. Broughan et al. / Journal of Number Theory ) mplyng 3 n. One can then take p =3,andbyLemma 1) assume that a s even. Suppose frst that a 6. Then σ3 a ) σ3 6 ) = 1093, n whch case =3 σ p a ) 5 σ 3 a ) m =3 whch s false, whence a {, 4}. However f a =,then ) =3 σ p a ) =19 3 σp a ) p =19 3 and there must exst an odd prme dvdng n whch s greater than 3, and whch dvdes n to a power not less than 4. Ths eventualty n turn mples =3 p ) < 19 3 whch agan s mpossble. Hence the only remanng possblty s that a = 4. Because σ19) = 5and σ3 4 )=11, one may then assume p 3 =5andp 4 = 11, whch gves us the equalty σ 1) σ 19 1) σ 3 4) σ 5 a 3 ) σ 11 a 4 ) Cancelng lke terms yelds =5 σp a ) p = a 3 11 a 4 <σ 5 a 3 ) σ 11 a 4 ) whch s false f ether a 3 4ora 4 4; snce both are even, clearly a 3 = a 4 =. Now / Kso there exsts a prme p 5 7 such that p a 5 5 n wth a 5 even. If a 5 4 then one would have 7 +7 ) 5 11 < 5 11 σpa 5 5 ) p < whch s certanly false; thus all prmes other than, 3, 19 whch dvde n must do so exactly to the power. As a consequence m 5, and we can wrte n = p. =5
7 56 K. Broughan et al. / Journal of Number Theory ) Substtutng ths form nto the equaton σn) =γn) and then cancelng, one deduces ) p + p +1 = =5 p Therefore the set of p wth 5 m ncludes {31, 131} and none out of {3, 5, 19}. However σ31 )=3 331, σ131 ) = 1793 and σ1793 )= , hence 3 = 9 dvdes the numerator of the product on the left and does not cancel wth any denomnator. Ths crcumstance s mpossble, as 9 does not dvde the rght hand sde. The above contradcton completes the proof that p Proposton. If p 1 1mod4)and a 5, thenp Proof. Applyng Lemma 1 one knows p 5, and we can wrte e+1 1 ) σpa ) p =3 σp a ) p = 4p 1 p However σ5 5 )/5 = 906/5 σp a )/p n whch case e+1 1) < 4p 1 p 1 +1 < 4p 1; the latter nequalty s only satsfed by prmes p Proposton 3. If n Ks a soluton wth p 1 3mod8)such that n s not dvsble by the fourth power of any odd prme, then p 1 cannot dvde e+1 1. Proof. Usng [, Theorem 3], one can express n = e p 1 p = and moreover e+1 1 4p 1/p 1 +1) < 4p 1. Thus under the assumpton that p 1 e+1 1, ether p 1 = e+1 1or3p 1 = e+1 1. Frst suppose that p 1 = e+1 1. From the proof of [, Theorem 3], one has 1 m 4 = p + p +1 p 0.73 consequently p 1 1) 0.73 p 1. The latter nequalty mples p 1 < 3, whch s false. Alternatvely f 3p 1 = e+1 1, because 9 e+1 1 for any value of e, clearly 3 p 1, so we can nstead set p = 3. Smlarly 13 = p 1,and =3 61 wth 61 p 1. However gvng at least three powers of 3 dvdng the left hand sde of σn) =γn), whch agan yelds a contradcton. The followng three techncal lemmas are key ngredents n the proof of Theorem 1.
8 K. Broughan et al. / Journal of Number Theory ) Lemma 5. If n Ks dvsble by 3, there exsts an odd prme p such that p 4 n. Proof. Assume hypothetcally) n s not dvsble by the fourth power of an odd prme. If p 1 3 mod 8) then usng Lemma 1, wecanwrte e+1 1 ) p 1 +1) p + p +1 ) p m + p m +1 ) =4p 1p p m. By Lemma 1 once more, we know p 1 3 so nstead put p = 3. Consder the system: = 13; 13 5mod8, 13 p 1, 13 = p =3 61; 61 5mod8, 61 p 1, p 4 = = ; 97 1mod8, 97 p 1, p 5 =97. We observe that the left hand sde of the prevous equaton must be dvsble by 3 3 =7 whlst the rght hand sde s only dvsble by 3 = 9, yeldng a contradcton. If p 1 1 mod 4), one has the decomposton e+1 1 ) p 1 +1) p +1) p 3 + p 3 +1 ) p m + p m +1 ) =4p 1p p m. Nether p 1 nor p canbe3,thuswemaytakep 3 =3. If p 1 =13thenp 1 +1= 7, and we set p 4 = 7; therefore =3 19 and =3 17, agan gvng too many 3 s. If nether p 1 nor p s 13, we can choose p 4 = 13 and thereby obtan = If 61 = p 1 or p let s say p 1 = 61), we can wrte n = e 61 p p 3 p m and so p 1 +1 = 31 wth 31 p. Consequently we can choose p 4 = 31, leadng to the equaton σ31 )= =3 331 and agan too many 3 s. Fnally f 61 p 1,p then we stll pck up an addtonal 3, snce Lemma 6. If a soluton n Ks not dvsble by the fourth power of an odd prme and p 1 3mod8),then3 n. Proof. Suppose n Kbut 3 n. In general, f a prme q p + p + 1 then ether q =3, or we must have q 1mod3)sothat3 q + q + 1. Now from the expresson e+1 1 ) p 1 +1) p + p +1 ) p m + p m +1 ) =4p 1p p m we can defne Q := m = p + p + 1). Because 3 n, each prme number p wth 1 m whch appears as a factor of Q does not appear n the form p + p +1; ths means we must have Q p 1. However by Lemma, thentegerq has at least three quadratc factors, gvng rse to a contradcton. Lemma 7. If n Ksatsfes p 1 1mod4)and 3 n, thenn s dvsble by the fourth power of an odd prme.
9 58 K. Broughan et al. / Journal of Number Theory ) Proof. Suppose p 1 p 1 mod 4). Then n the notaton of Lemma 6, t follows that there are two quadratc factors for Q = m = p +p +1) and followng cancelaton) three possble forms for the equaton σn) =γn). We shall treat each of these separately. Case 1): p 3 + p 3 +1=p 1 p 4 + p 4 +1=p e+1 1 ) ) ) p 1 +1 p +1 = p 1 p p 3p 4. Note that p +1 has at least one prme dvsor, and at most three prme dvsors. 1.1) If p +1 has only one prme dvsor then p +1 = p 1 ; under ths scenaro, there are seven possbltes for p ) If p 1+1 = p then e+1 1=p 3p 4, whch s mpossble. 1.1.) If p 1+1 = p 3 then p 3 p 1 + 1; however p 3 p 1 1sop 3 gcdp 1 +1,p 1 1) =, whch s mpossble ) If p 1+1 = p 4 then p 3 + p 3 +1= p +1 = p 4 + p 4 + mplyng both p 3 p 4 +1andp 4 p 3 + 1, whch s clearly false ) If p 1+1 = p 3 p 4 then p 3 p 1 + 1; however p 3 p 1 1 hence p 3 p 1 +1,p 1 1) =, whch s agan false ) If p 1+1 = p p 3 then e+1 1=p 4, whch s mpossble ) If p 1+1 = p p 4 then e+1 1=p 3, whch s mpossble ) If p 1+1 = p p 3 p 4 then p 3 p 1 +1; now p 3 p 1 1thusp 3 gcdp 1 +1,p 1 1) =, whch s false. 1.) If p +1 has two prme dvsors, ether p +1 = p 3;orp 4;orp 3 p ) If p +1 = p 3, then ether p 1+1 = p or p 1+1 = p 4: ) If p 1+1 = p then one has p 4 p 4 +1) = p 3 p 3 + 1), whch mples p 3 p 4 +1andp 4 p 3 + 1; the last two condtons are ncompatble ) If p 1+1 = p 4 then p 4 p 4 +1)=p 3 +1)p 3 1), whch mples that p 4 <p 3 ; further p 3 p 3 +1)=p 4 +1)p 4 1) whch mples p 3 <p 4, mpossble! 1..) If p +1 = p 4, then ether p 1+1 = p or p 1+1 = p 3: 1...1) If p 1+1 = p then p 4 =, whch s false. 1...) If p 1+1 = p 3 then p 3 =, whch s false.
10 K. Broughan et al. / Journal of Number Theory ) ) If p +1 = p 3 p 4, then ether p 1+1 = p or p 1+1 = p 3 p 4 : ) If p 1+1 = p then p 3 p 4 +1andp 4 p 3 + 1, whch s mpossble. p 1..3.) If 1 +1 = p 3 p 4 then p 1 = p, whch s false as they are dstnct prmes. 1.3) If p +1 has three prme dvsors, ether p +1 = p 1 p 3;orp 1 p 3 p 4 ;orp 1 p ) If p +1 = p 1 p 3 then one deduces e+1 1=p 4, whch s false. 1.3.) If p +1 = p 1 p 3 p 4 then p 1+1 = p, whch mples that p 4 p 3 +1andp 3 p 4 +1; the latter condtons are ncompatble ) If p +1 = p 1 p 4 then we fnd e+1 1=p 3, whch s false. Combnng 1.1), 1.), and 1.3) together, clearly Case 1) s mpossble n ts entrety. Case ): p 3 + p 3 +1=p 1 p 4 + p 4 +1=p 1 p e+1 1 ) ) ) p 1 +1 p +1 = p 3p 4. Here p 3 p 4 mod3), p 1+1 p +1 1 mod 3), and there are at least two prme factors n e+1 1 whch beng congruent to 3 modulo 4 cannot nclude p,andbeng congruent to 1 modulo 3 cannot nclude p 3 or p 4 ). It follows that there s at least one prme factor n p 1+1 and p +1 respectvely, whch leaves us only p 1+1 = p 3 or p 1+1 = p 4, and these are both mpossble. Case 3): p 3 + p 3 +1=p 1 p 4 + p 4 +1=p 1 p e+1 1 ) ) ) p 1 +1 p +1 = p p 3p 4. Note that t cannot happen that one of p,p 3,p 4 s the only prme dvsor of p +1. Furthermore e+1 1 must have at least two prme dvsors, and t cannot be a square; n addton e+1 1 p p 1+1 p +1 1mod3)andp 3 p 4 mod3).one therefore deduces p 1 +1 = p e+1 1=p 3 p 4 p +1 = p 3 p 4.
11 60 K. Broughan et al. / Journal of Number Theory ) From these three equatons, we obtan e p 3 = and by the result of Apéry n Lemma 4, ths s clearly an mpossble occurrence. We are now ready to gve the man result of ths secton. Theorem 1. If n Kthen n s dvsble by the fourth power of an odd prme. Proof. Frstly applyng Lemma 5, fn Kand 3 n then p 4 n for some odd prme p. Wthout loss of generalty, we may therefore assume n Kand 3 n. If p 1 1 mod 4) then the result s covered by Lemma 7. Lkewse f p 1 3mod8) then the result s covered by Lemma 6. Fnally the remanng case p 1 7mod8)s already excluded courtesy of Lemma 1. Corollary 1. If {p 1,p } = {5, 13} then a 5. Proof. Assume that a =1.Snceσn) =γn), settng p 3 =3andp 4 = 7 mples e+1 1 ) 3) 7) =3 σ p a ) = p. Usng the dvsblty of n by the fourth power of an odd prme whch mnmally s 3): e+1 1 ) < 1 =5 so e+1 1) < 1, whch s false for e N. Therefore a > 1, n whch case a The exponents for members of K We now study the exponents a occurrng n the decomposton of a De Konnck number. The frst step s to adapt an dea of Chen and Chen [3], n order to relate ωn) wth m =0 da +1), where dx) s defned to be the number of dvsors of an nteger x 1. The second step s to apply the AM/GM nequalty, then further analyse the exponents. Lemma 8. Let a soluton n Kbe represented as the product n = e p 1 m = pa.if we set p 0 =, a 0 = e and a 1 =1, then there are nequaltes ωn) m da +1) 3ωn). =0
12 K. Broughan et al. / Journal of Number Theory ) Proof. One need only derve the upper bound, snce the lower bound follows from 1). Frst consder the case where anda s even, so p s odd. Put w = da +1) 1 and wrte n,1,...,n,w to denote all the postve nteger dvsors of a + 1 other than 1. Let q, be a prmtve prme dvsor of p n, 1)/p 1) for 0 m and 1 w. In partcular, there are dvsbltes p n, 1 q, p 1 1 p 1 pa +1 and f Ωx) counts the number of prme factors of x wth multplcty, then w ω σ p a )) Ω σ p a )). Alternatvely, f = 0 then prmtve dvsors exst except for e +1=6, and n that case w 0 = de +1) 1=3=Ω 6 1 ). Lastly f =1ora =1,thenwehave1=da +1) 1 < Ωp +1)=Ωσp a )). Therefore n all cases da +1) 1 Ωσp a )), hence there s an nequalty m m da +1) ωn) = da +1) 1 ) =0 =0 m =0 Ω σ p a )) ) = Ω σn) = Ω γn) ) =ωn) thereby completng the dervaton of the upper bound. Corollary. If n Kthen n the notaton of Lemma 8, a proporton of more than /5 of the numbers a +1 must be ether prme or prme powers. Proof. Because ωa +1) da +1), usng the arthmetc geometrc mean and Lemma 8: m =0 ωa +1) ) m 1 ωn) =0 ωa +1) 3. ωm) Moreover, takng the logarthm of both sdes, one deduces m ωa +1) =0 ) log 3 ωn). log For an nteger 1, let n := #{: ωa +1)=}. Then the above nequalty becomes ) log 3 n 1 +n +3n 3 + n 1 + n + ) log
13 6 K. Broughan et al. / Journal of Number Theory ) whch mples log 3 ) n + n 3 + ) log 3 ) n + 3 log 3 ) ) log 3 n 3 + log log log log 1 n 1. Rearrangng the n s yelds n 1 + n + log 3 log 1 ) log 3 +1 n 1 log and as the bracketed term equals.41 to two decmal places, we conclude that 5 < 1.41 n 1 n 1 n 1 + n + + n m as requred. 5. Countng the elements n K [1,x] For every real x>0, we wll from now on use the notaton Kx) :=K [1,x]. In [, Theorem 4], t was shown that the sze of the solutons Kx) s asymptotcally bounded by x 1/4+o1) as x tends to nfnty and ths result was tself an mprovement on the work of Pomerance and Pollack [8], whch nstead gave an upper bound of x 1/3+o1) ). In ths secton we wll sharpen the bound stll further, as descrbed drectly below. Theorem. The estmate holds as x. #Kx) x 1/6+o1) Proof. Let n>1benkx), so we may express t as n = A B where gcda, B) =1, wth A squarefree and B squarefull. Explotng Lemma 1, thena {p 1, p 1,p 1 p, p 1 p } and B s dvsble by at least one prme to the fourth power or greater. Under the notaton of Lemma 3, one can wrte N D = σn) n = γn) = γa) n A γb) B = A B/γB) > 1 wth gcda, B/γB) ) = 1. It follows that B/γB) <A, whence B γb) <AB= n x = B γb) x.
14 K. Broughan et al. / Journal of Number Theory ) Now by Lemma 1, we can always decompose B = δ C D where δ {1, 3 }, C s a squarefree nteger, D s a 4-full nteger, and such that δ, C and D are parwse coprme. As a consequence, B γb) = δ γδ) C D γd) = D γd) x. In addton B γb) = δ γδ) D γd) so that B γb) = D γd) or B γb) = D γd). Moreover one knows that D/γD) x above, whch means D/γD) x. Now f two 4-full numbers D 1 and D satsfy D 1 /γd 1 )=D /γd ), then we must also have D 1 /γd 1 ) = D /γd ). Hence the number of choces for D/γD) x wth D/γD) x and D 4-full, s less than or equal to the number of choces for D/γD) x whch s of type x 1 6 +o1). Therefore the number of choces for B/γB) s also x 1 6 +o1), and the proof s completed upon applyng Lemma Applcatons of the product compactfcaton For each prme p, letn p denote the one pont compactfcaton of N; npartcular, each fnte pont n N s tself an open set, and a bass for the neghborhoods of the pont at nfnty, p say, s gven by the open sets U p ɛ) = {p e N: e 1/ɛ} {p } wth ɛ>0. If P ndcates the set of prme numbers, let us wrte ˆN := p P N p for the product of these ndexed spaces, endowed wth the standard product topology. Then ˆN s a compact metrzable space so t s sequentally compact, hence every sequence n ˆN has a convergent subsequence. Remark. We shall call ˆN equpped wth ts topology the product compactfcaton of N. A nce account detalng propertes of the so-called supernatural topology n attackng the odd perfect number problem, s gven by Pollack n [7]. Consder now the more general equaton σn) α φn) β = θ n μ γn) τ 3)
15 64 K. Broughan et al. / Journal of Number Theory ) where α, β, μ, τ Z and θ>0 s a ratonal number. Wrte K = K α,β,μ,τ for the set of solutons K α,β,μ,τ = { n N: σn) α φn) β = θ n μ γn) τ } whch clearly depends on the ntal choce of quntuple α, β, μ, τ, θ). Theorem 3. Let P P denote a fxed fnte set of prmes, and assume that α + β>μ. Then there exst only fntely many n Kwth support n P. Before we gve the demonstraton, we pont out that choosng α =1,β =0,μ =0, τ =andθ = 1 mples there exst only fntely many solutons to De Konnck s equaton 1), supported on any prescrbed fnte set of prmes P. Proof. Gven A, B, M, T Z, defne a multplcatve functon h = h A,B,M,T : N Q >0 by the formula hn) := σn)a φn) B n M γn) T. For every r 1 and at each prme p, one calculates that h p r) = p A B T p 1) B A 1 p r 1) A p r ) A+B M whle h1) = 1. Ths naturally leads us to the defnton ĥ p ) f A + B>M := 0 f A + B<M p A B T p 1) B A f A + B = M, and provdes a unque extenson ĥ : ˆN R { }of the orgnal arthmetc functon h. In fact f A + B = M and T = 0, one can then show ĥ s contnuous on the monod ˆN. Fx a fnte set of prmes L = {l 1,...,l k }, and put N L := { n N: n = l e 1 1 le k k,e 1 }. Key clam. If A + B M then h NL s monotonc ncreasng wth respect to dvsblty. To establsh ths clam suppose that n = n l e wth n N L\{l },andsetm = n l e +1.Thenhm) =hn ) hl e +1 )and h l e ) σl e ) A φl e +1 = l e +1)M γl e +1 ) B ) T
16 K. Broughan et al. / Journal of Number Theory ) e σl +1 ) ) A = σl e ) l B M e l + = l B M 1 l e +1 1 σle )A φl e )B l e M ) A h l e ). γl e )T However e l + l B M 1 l e +1 1 ) A e l + = l B M l l e +1 = l B M snce A + B M. It follows that hl e +1 hm) =h n ) h l e l 1 l e +1 1 l + l 1 l e +1 1 ) >hl e ), n whch case ) >h n ) h l e ) = hn). ) A ) A >l A+B M 1 The proof of the clam then follows by nducton on the number of prmes wth multplcty) whch dvde the quotent of a general par n and m, wthn m. Now let us take A = α, andchooseb,m Z such that μ β<m B α. Suppose there exsts a sequence of elements n K supported on P whch are all dstnct. Under the supernatural topology, there exsts a subsequence N ) 1 and a lmt N o ˆN such that N N o. The element N o s supported on P, otherwse at least one of the N would also not be supported on P. We may therefore wrte N o = A B where suppa) P, suppb) P, and gcda, B) =1wthB squarefree. Furthermore suppa) suppb) =L = {l 1,...,l k }, say. Then there exsts a subsequence N ) 1 of the sequence N ) 1 satsfyng for all 1: ) suppn )=L, ) N properly dvdes N +1,and ) A N. Each N Kand h s monotonc on the monod N, ), hence for all one has 0 <hn 1 ) <hn ) by 3) = θ φn ) B β γn ) T τ N M μ
17 66 K. Broughan et al. / Journal of Number Theory ) = φn ) B β N M μ N B β) M μ) θ k s=1 l s) T τ θ k s=1 l s) T τ whch tends to zero as snce M B>μ β. Ths mmedately yelds a contradcton, and completes the proof of the theorem. 7. Fnal comments In Theorem, we beleve t should be possble to reduce the upper bound to x o1). Moreover extendng the lst of bad De Konnck prmes, for example by fndng addtonal nfnte sets, seems readly achevable. In the fundamental Lemma 1, showng that the exponent e of the power of equals 1 or at least s odd) looks lke a reasonable goal, but we have been unable to prove ths. Lastly, extendng the method of Theorem 3 to nclude subsets of K wth prme support of bounded sze, seems altogether more challengng. References [1] R. Apéry, Sur une équaton dophantenne, C. R. Acad. Sc. Pars Sér. A ) , [] K.A. Broughan, J.M. De Konnck, I. Káta, F. Luca, On ntegers for whch the sum of dvsors s the square of the squarefree core, J. Integer Seq ) 1 1. [3] F.J. Chen, Y.G. Chen, On odd perfect numbers, Bull. Aust. Math. Soc ) [4] R.K. Guy, Unsolved Problems n Number Theory, thrd edton, Sprnger, 004. [5] F. Luca, On numbers n for whch the prme factors of σn) are among the prme factors of n, Results Math ) [6] P. Pollack, The greatest common dvsor of a number and ts sum of dvsors, Mchgan Math. J ) [7] P. Pollack, Fnteness theorems for perfect numbers and ther kn, Amer. Math. Monthly ) [8] P. Pollack, C. Pomerance, Prme-perfect numbers, Integers 1 6) 009)
arxiv: 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 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 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 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 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 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 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 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 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 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 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 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 informationREAL ANALYSIS I HOMEWORK 1
REAL ANALYSIS I HOMEWORK CİHAN BAHRAN The questons are from Tao s text. Exercse 0.0.. If (x α ) α A s a collecton of numbers x α [0, + ] such that x α
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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 informationAppendix B. Criterion of Riemann-Stieltjes Integrability
Appendx B. Crteron of Remann-Steltes Integrablty Ths note s complementary to [R, Ch. 6] and [T, Sec. 3.5]. The man result of ths note s Theorem B.3, whch provdes the necessary and suffcent condtons for
More informationGenericity of Critical Types
Genercty of Crtcal Types Y-Chun Chen Alfredo D Tllo Eduardo Fangold Syang Xong September 2008 Abstract Ely and Pesk 2008 offers an nsghtful characterzaton of crtcal types: a type s crtcal f and only f
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 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 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 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 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 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 informationAppendix for Causal Interaction in Factorial Experiments: Application to Conjoint Analysis
A Appendx for Causal Interacton n Factoral Experments: Applcaton to Conjont Analyss Mathematcal Appendx: Proofs of Theorems A. Lemmas Below, we descrbe all the lemmas, whch are used to prove the man theorems
More informationDIFFERENTIAL FORMS BRIAN OSSERMAN
DIFFERENTIAL FORMS BRIAN OSSERMAN Dfferentals are an mportant topc n algebrac geometry, allowng the use of some classcal geometrc arguments n the context of varetes over any feld. We wll use them to defne
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 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 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 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 informationExercise Solutions to Real Analysis
xercse Solutons to Real Analyss Note: References refer to H. L. Royden, Real Analyss xersze 1. Gven any set A any ɛ > 0, there s an open set O such that A O m O m A + ɛ. Soluton 1. If m A =, then there
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 informationEXPANSIVE MAPPINGS. by W. R. Utz
Volume 3, 978 Pages 6 http://topology.auburn.edu/tp/ EXPANSIVE MAPPINGS by W. R. Utz Topology Proceedngs Web: http://topology.auburn.edu/tp/ Mal: Topology Proceedngs Department of Mathematcs & Statstcs
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 informationSTEINHAUS PROPERTY IN BANACH LATTICES
DEPARTMENT OF MATHEMATICS TECHNICAL REPORT STEINHAUS PROPERTY IN BANACH LATTICES DAMIAN KUBIAK AND DAVID TIDWELL SPRING 2015 No. 2015-1 TENNESSEE TECHNOLOGICAL UNIVERSITY Cookevlle, TN 38505 STEINHAUS
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 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 informationTHE WEIGHTED WEAK TYPE INEQUALITY FOR THE STRONG MAXIMAL FUNCTION
THE WEIGHTED WEAK TYPE INEQUALITY FO THE STONG MAXIMAL FUNCTION THEMIS MITSIS Abstract. We prove the natural Fefferman-Sten weak type nequalty for the strong maxmal functon n the plane, under the assumpton
More informationAssortment Optimization under MNL
Assortment Optmzaton under MNL Haotan Song Aprl 30, 2017 1 Introducton The assortment optmzaton problem ams to fnd the revenue-maxmzng assortment of products to offer when the prces of products are fxed.
More 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 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 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 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 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 informationDiscrete Mathematics
Dscrete Mathematcs 32 (202) 720 728 Contents lsts avalable at ScVerse ScenceDrect Dscrete Mathematcs journal homepage: www.elsever.com/locate/dsc On the symmetrc dgraphs from powers modulo n Guxn Deng
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 informationYong Joon Ryang. 1. Introduction Consider the multicommodity transportation problem with convex quadratic cost function. 1 2 (x x0 ) T Q(x x 0 )
Kangweon-Kyungk Math. Jour. 4 1996), No. 1, pp. 7 16 AN ITERATIVE ROW-ACTION METHOD FOR MULTICOMMODITY TRANSPORTATION PROBLEMS Yong Joon Ryang Abstract. The optmzaton problems wth quadratc constrants often
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 informationA p-adic PERRON-FROBENIUS THEOREM
A p-adic PERRON-FROBENIUS THEOREM ROBERT COSTA AND PATRICK DYNES Advsor: Clayton Petsche Oregon State Unversty Abstract We prove a result for square matrces over the p-adc numbers akn to the Perron-Frobenus
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 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 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 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 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 informationApplied Mathematics Letters
Appled Matheatcs Letters 2 (2) 46 5 Contents lsts avalable at ScenceDrect Appled Matheatcs Letters journal hoepage: wwwelseverco/locate/al Calculaton of coeffcents of a cardnal B-splne Gradr V Mlovanovć
More informationGeneral viscosity iterative method for a sequence of quasi-nonexpansive mappings
Avalable onlne at www.tjnsa.com J. Nonlnear Sc. Appl. 9 (2016), 5672 5682 Research Artcle General vscosty teratve method for a sequence of quas-nonexpansve mappngs Cuje Zhang, Ynan Wang College of Scence,
More informationThe lower and upper bounds on Perron root of nonnegative irreducible matrices
Journal of Computatonal Appled Mathematcs 217 (2008) 259 267 wwwelsevercom/locate/cam The lower upper bounds on Perron root of nonnegatve rreducble matrces Guang-Xn Huang a,, Feng Yn b,keguo a a College
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 informationU.C. Berkeley CS294: Spectral Methods and Expanders Handout 8 Luca Trevisan February 17, 2016
U.C. Berkeley CS94: Spectral Methods and Expanders Handout 8 Luca Trevsan February 7, 06 Lecture 8: Spectral Algorthms Wrap-up In whch we talk about even more generalzatons of Cheeger s nequaltes, and
More 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 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 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 informationA new construction of 3-separable matrices via an improved decoding of Macula s construction
Dscrete Optmzaton 5 008 700 704 Contents lsts avalable at ScenceDrect Dscrete Optmzaton journal homepage: wwwelsevercom/locate/dsopt A new constructon of 3-separable matrces va an mproved decodng of Macula
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 informationLecture 4: Universal Hash Functions/Streaming Cont d
CSE 5: Desgn and Analyss of Algorthms I Sprng 06 Lecture 4: Unversal Hash Functons/Streamng Cont d Lecturer: Shayan Oves Gharan Aprl 6th Scrbe: Jacob Schreber Dsclamer: These notes have not been subjected
More informationSupplement: Proofs and Technical Details for The Solution Path of the Generalized Lasso
Supplement: Proofs and Techncal Detals for The Soluton Path of the Generalzed Lasso Ryan J. Tbshran Jonathan Taylor In ths document we gve supplementary detals to the paper The Soluton Path of the Generalzed
More informationP.P. PROPERTIES OF GROUP RINGS. Libo Zan and Jianlong Chen
Internatonal Electronc Journal of Algebra Volume 3 2008 7-24 P.P. PROPERTIES OF GROUP RINGS Lbo Zan and Janlong Chen Receved: May 2007; Revsed: 24 October 2007 Communcated by John Clark Abstract. A rng
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 informationOn the set of natural numbers
On the set of natural numbers by Jalton C. Ferrera Copyrght 2001 Jalton da Costa Ferrera Introducton The natural numbers have been understood as fnte numbers, ths wor tres to show that the natural numbers
More informationMATH 241B FUNCTIONAL ANALYSIS - NOTES EXAMPLES OF C ALGEBRAS
MATH 241B FUNCTIONAL ANALYSIS - NOTES EXAMPLES OF C ALGEBRAS These are nformal notes whch cover some of the materal whch s not n the course book. The man purpose s to gve a number of nontrval examples
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 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 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 informationGeometry of Müntz Spaces
WDS'12 Proceedngs of Contrbuted Papers, Part I, 31 35, 212. ISBN 978-8-7378-224-5 MATFYZPRESS Geometry of Müntz Spaces P. Petráček Charles Unversty, Faculty of Mathematcs and Physcs, Prague, Czech Republc.
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 informationLinear Algebra and its Applications
Lnear Algebra and ts Applcatons 4 (00) 5 56 Contents lsts avalable at ScenceDrect Lnear Algebra and ts Applcatons journal homepage: wwwelsevercom/locate/laa Notes on Hlbert and Cauchy matrces Mroslav Fedler
More informationEvery planar graph is 4-colourable a proof without computer
Peter Dörre Department of Informatcs and Natural Scences Fachhochschule Südwestfalen (Unversty of Appled Scences) Frauenstuhlweg 31, D-58644 Iserlohn, Germany Emal: doerre(at)fh-swf.de Mathematcs Subject
More informationOnline Appendix. t=1 (p t w)q t. Then the first order condition shows that
Artcle forthcomng to ; manuscrpt no (Please, provde the manuscrpt number!) 1 Onlne Appendx Appendx E: Proofs Proof of Proposton 1 Frst we derve the equlbrum when the manufacturer does not vertcally ntegrate
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 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 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 informationCanonical transformations
Canoncal transformatons November 23, 2014 Recall that we have defned a symplectc transformaton to be any lnear transformaton M A B leavng the symplectc form nvarant, Ω AB M A CM B DΩ CD Coordnate transformatons,
More informationThe Number of Ways to Write n as a Sum of ` Regular Figurate Numbers
Syracuse Unversty SURFACE Syracuse Unversty Honors Program Capstone Projects Syracuse Unversty Honors Program Capstone Projects Sprng 5-1-01 The Number of Ways to Wrte n as a Sum of ` Regular Fgurate Numbers
More informationDiscrete Mathematics
Dscrete Mathematcs 30 (00) 48 488 Contents lsts avalable at ScenceDrect Dscrete Mathematcs journal homepage: www.elsever.com/locate/dsc The number of C 3 -free vertces on 3-partte tournaments Ana Paulna
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 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 information