On a Fermat-Type Diophantine Equation

Size: px
Start display at page:

Download "On a Fermat-Type Diophantine Equation"

Transcription

1 Journal of Number Theory 80, (2000) Artcle ID jnth , avalable onlne at htt: on On a Fermat-Tye Dohantne Equaton Sankar Staraman 1 Deartment of Mathematcs, Howard Unversty, Washngton, DC Communcated by A. Granvlle Receved June 30, 1998 Let >3 be an odd rme and a th root of unty. Let c be an nteger dvsble only by rmes of the form k&1, (k, )=1. Let C () be the egensace of the deal class grou of Q() corresondng to, beng the Techmuller character. Let B 2 denote the 2th Bernoull number. In ths artcle we aly the methods (followng H. S. Vandver (1934, Bull. Amer. Math. Soc., )) whch were used by the author (1994, Ph.D. Thess, Calforna Insttute of Technology) to rove a secal case Fermat's Last theorem, to study the equaton x + y = c z. In artcular, we rove the followng: Assume s rregular, and B &3.Letq be an odd rme such that q#1 (mod), and there s a rme deal Q over q n Q() whose deal class generates C (3), whch s known to be cyclc. If x + y = c z has nontrval nteger solutons, then we show that q % ( c z (x+ y)). We also gve roof of the unsolvablty of the above equaton for regular rmes ( >3), usng the results of H. S. Vandver (1936, Monatsh. Math. Phys. 43, ) Academc Press INTRODUCTION Let be an odd rme. Snce the roof of Fermat's Last Theorem [W, TW],.e., that x + y =z has no nontrval solutons, t has been known that [R, DM] the same technques can be used to rove the unsolvablty of equatons of the form Ax +By =Cz, where A, B, C are constants. But the same s not true for equatons such as x + y = c z, when there are a large number of unrestrcted rme dvsors n the coeffcent c. In ths aer we consder the above equaton when >3 and c s dvsble only by rmes of the form k&1, (k, )=1. Let a th root of unty. Let C be the -Sylow subgrou of the deal class grou of Q(), wth order h.letc + and h + denote the -Sylow subgrou of Q(+&1 ), and ts order, resectvely. The Techmu ller character : Z Z * s gven by (x)#x (mod ), where (x) s a 1 I thank D. Ramakrshnan for suggestng ths roblem and hs encouragement. I also thank L. Washngton for hs valuable comments, and L. Sharo and F. Ramaroson for helful conversatons. I am also grateful to the referee for hs valuable suggestons for mrovng the aer X Coyrght 2000 by Academc Press All rghts of reroducton n any form reserved. 174

2 ON A FERMAT-TYPE DIOPHANTINE EQUATION 175 ( &1)st root of unty, and x # Z. Under the acton of ths character, C decomoses as a drect sum of C () (), where C s the egensace corresondng to. It s known, by a result of Kurhara [Ku] (also ndeendently observed by Greenberg), that C (3) s cyclc. The man results of ths aer are the followng. Theorem 1.2. Let >3 be a regular rme, and c an nteger dvsble only by rmes of the form k&1, (k, )=1. Then x + y = c z has no nontrval nteger solutons. Ths theorem follows easly from the results of [V4]. It can be shown that the theorem s true for certan rregular rmes as well usng the same methods (cf. [Wa, Cha. 9]). In artcular, for such that % h +, 3 % B for all even &3. The followng theorem also concerns rregular rmes, but wthout the assumton that % h +. Note that, n any deal class of Q(), one has an nfnte number of rme deals of degree 1 by the Tchebotarev densty theorem (cf. [C,. 257, Wa,. 333]). So gven an deal class that generates C (3) there are an nfnte number of rme deals of Q() n ths deal class whch le over ratonal rmes congruent to 1 modulo. Theorem 2.1. Assume s rregular, and B &3, and c s as n Theorem 1.2. Let q be an odd rme such that q#1 (mod), and there s a rme deal Q over q n Q() whose deal class generates C (3). If x + y = c z has nontrval solutons x, y, z # Z, then q % ( c z (x+ y)). Remark. As mentoned n [BCEM], there are only two rmes below 4 mllon, namely and , for whch B &3. But the roof of the above theorem can be extended to B &5, B &7,... and so on to many more ndces (exactly how many deends on ), assumng that for each ndex & the corresondng C () and C ( &) are cyclc and trval, resectvely. Our roof of ths result follows, wth many modfcatons, the methods of [S]. In [S] we used a seres of deas of H. S. Vandver [V1, V2] along wth a theorem of M. Kurhara [Ku] and some consequences of the roof of Iwasawa's man conjecture for cyclotomc felds due to B. Mazur and A. Wles [MW] to rove a secal case of the FermatWles theorem. After recallng some notatons and relmnares, we rove some elementary roostons about x + y = c z whch effectvely render the roof of ts unsolvablty amenable to the same methods used (classcally) n the second case of Fermat's last theorem. Indeed, the roof follows easly from the results of Vandver [V4] and t s ncluded for the sake of comleteness.

3 176 SANKAR SITARAMAN The roof of the man theorem then uses a modfcaton of the methods used by Vandver [V1], as descrbed n [S2, Cha. 3]. To comlete the roof we need to show that certan generalsed VanderMonde matrces are non-sngular mod. ths s done by establshng a congruence relaton between these determnants and the Bernoull numbers. 0. NOTATIONS AND PRELIMINARIES >3 s a rme, s a rmtve th root of unty, *=1&, and ;=(1&)(1&&1 ). K=Q() s the cyclotomc feld, A=Z[] ts rng of ntegers, and A* the grou of unts n A. G=Gal(KQ), _ s a generator of G and _()=r, where r s a rmtve generator of (ZZ)*. C s the deal class grou of K, h the order of C. C, h s the -Sylow subgrou of C and ts order, resectvely. K + =Q(+&1 )=Maxmal real subfeld of K. A +, C +, h +, and C + are defned smlarly. If I s an deal n A, then [I] s ts deal class n C. The Bernoull numbers B m are defned by t(e t &1)= B m=0 m(t m m!). The generalzed Bernoull numbers B m, j are defned by &1 a=1 ( j (a) xe x (e ( &1) x &1))= B m=0 m, j(xm m!). The Kummer Unt $ s gven by $=- (1&r)(1&&r)(1&)(1&&1 ). The cyclotomc unt E m s defned as E m => &1 k=1 (_&k ($)) rmk. Note. Ths defnton of E m s not standard. For nstance, the E m defned n [R,. 128] s actually the square root of the E m defned above. But all the roertes of E m that we need wll follow easly from those of - E m and vce versa. For a rme deal L{(*) ofa, and : # A, : L, theth ower resdue symbol [:L] s defned by [:L]=a, where a s the unque th root of unty such that : (N(L)&1) #a (mod L), N(L) beng the (absolute) norm of L. [:L] s extended to all deals rme to (*) multlcatvely. Also, we have { : J= \K(:1 )K :1 = J + (:1 ), where J s any deal of A wth (*) % J, and ((K(: 1 )K)J) s the generalzed Frobenus element. 1. PRELIMINARY PROPOSITIONS Throughout ths aer, >3 and c # Z s such that only rmes of the form k&1, (k, )=1 can dvde t. In ths secton we rove some

4 ON A FERMAT-TYPE DIOPHANTINE EQUATION 177 rearatory results about the solutons to the equaton x + y = c z.we could also assume, wthout loss of generalty, that c s not dvsble by the th ower of any nteger. Prooston 1.0. If c s as above, and a rme l dvdes c, then [(l)]{1. Proof. [(l)]=1o 2 (N(l)&1)O 2 (l &1 &1) whch s mossble when l+1 s dvsble by but not 2 as n the case of rmes dvdng c. Prooston 1.1. If X +Y =&; m cz s satsfed wth X, Y, Z # K +, where c s as above, (1&) and (Z) are relatvely rme, & s a real unt, and m(&1)2 then (a) (X, Y)=1 (b) The factors X+Y, 0 &1 of X +Y are all arwse relatvely rme, excet for (1&) whch dvdes all of them. Also, (X+Y, (X +Y )(X+Y))=(1). (c) Let l c, l a rme number. Then l % ((X +Y )(X+Y)). Proof. (a) If (1&) dvdes (X) and (Y) then we can dvde t out of (; m )=(1&) 2m. Suose L{(1&) s a rme deal that dvdes both (X) and (Y). Then L (cz ), whch means (because we assumed c s not dvsble by any th ower) L (Z), contrary to the assumton that X, Y, Z are relatvely rme. The roof of (b) follows easly usng (a) and the fact that % (X +Y )(X+Y) (cf. [Wa,. 168]). (c) Now, let l be a rme dvdng c, of the form k&1 and let L be a rme deal of A that dvdes l. Then l (X +Y )(X+Y) O L (X+Y) for some {0. Snce l#&1 (mod ), the decomoston grou of L s of order two, whch means t s generated by the conjugaton automorhsm. So L s fxed by conjugaton and hence L (X+&1 Y) whch combned wth L (X+Y) gves L (X) and L (Y), a contradcton. Suose x, y, z are relatvely rme ntegers such that x + y = c z. (1.1) Lettng Z=z t (t=v (z)), &= t+1 ; m, m=(t+1)(&1)2 ( &1)2, we can aly Prooston 1.1 to get, (x, y)=1 and wth u, v, t # Z, (u, v)=1, (v, )=1, (u, )=1, x+ y=c t u (1.1a) x + y (x+ y) =v. (1.1b)

5 178 SANKAR SITARAMAN Equaton (1.1b) can be wrtten as &1 =0 \ x+ y 1& + =v. (1.1c) The deals ((x+y)(1&)) n (1.1c) are rme to each other and (*). Thus we have \ x+y 1& + =I, where I an ntegral deal. (1.1d) Remark. Ths reduces the roblem amenable to the classcal methods used n the study of the second case of Fermat's last theorem. In fact, usng the results of Vandver [V4], the equaton x + y = c z can be shown to have no solutons when s regular and >3. The roof s ncluded below for the sake of comleteness, and t s along the lnes of [Wa, Cha. 9]. Moreover, usng those methods we can rove that x + y = c z has no nontrval ntegral solutons f % h + and satsfes assumton II of [Wa, Cha. 9]. In artcular, for such that % h +, 3 % B \ even &3. Theorem 1.2. If >3 s a regular rme, c as defned above, then has no nontrval ntegral solutons. x + y = c z (1.2) Proof. Assume there s a soluton. We wll get a contradcton usng a descent argument as n [V4, Wa, Cha. 9]. Let Z # A + =Z[+&1 ]be such that t has the mnmal number of dstnct rme factors among all solutons of &1 =0 (X+Y)='B; m Z, (1.2b) where X, Y # A +, ' s a real unt, m ( &1)2, and the only rmes dvdng the nteger B are of the form k&1, (k, )=1. If (1.2) has a nontrval soluton, then (1.2b) has a nontrval soluton, by lettng X=x, Y= y, Z=z t (t=v (z)), B=c, '= t+1 ; m, m= (t+1)(&1)2( &1)2 where t s as n (1.1a). From (1.2b), t follows from Prooston 1.1 that for =1,..., &1, \ X+Y 1& + =I, where I an deal of A. (1.2c)

6 ON A FERMAT-TYPE DIOPHANTINE EQUATION 179 and (X+Y)=B(;) t( &1)2 I 0, where I 0 s also an deal of A. (1.2d) The deals I are rme to each other and to (1&) for0(&1). Also we have (Z)=I 0 I 1 }}}I &1. These deals must all be rncal because s a regular rme, and from (1.2d) I 0 n artcular can be seen to be of the form (\ 0 ), \ 0 # A +. So we have X+Y=' 0 ; t( &1)2 B\ 0. (1.2e) Here ' 0 s a real unt and \ 0 s rme to ;. Now, n [Wa, ] t s shown that, gven cyclotomc ntegers X, Y satsfyng (1.2c) and X+Y#0 mod(1&), we have \ X+Y 1& + =' \ for 1 &1, (1.2f ) where the ' are real unts and the \ # A. Note. Under the condtons satsfed for X, Y, Z here, we can also get (1.2f) usng Prooston 1.0. Now, changng to & n the above equaton (and assumng \ =\ &, then multlyng the resultng equaton wth t), we get (X+Y) (X+& Y)=X Y (+& ) XY=; ' 2 (\ \ ). We also have, from (1.2e), X Y 2XY=' 2 0 ;2t( &1)2 B 2 \ 2. 0 Here ; =(1&)(1&& )=2&&&. From these two equatons we get &XY=' 2 (\ \ ) &' 2 0 ;t( &1) B 2 \ 2 0 ; &1. Now f j0 (mod) and j\ (mod ) (ths s why we needed >3) we get another equaton &XY=' 2 j (\ j\ j ) &' 2 0 ;t( &1) B 2 \ 2 0 ;&1 j. From these two equatons we get ' 2 (\ \ ) &' 2 (\ j j\ j ) =' 2 0 ;t( &1) B 2 \ 2 0 (;&1 &; &1 j ). (1.2g) We can wrte ; &1 &; &1 j =$$;, where $$ s a real unt. Then from (1.2g) we get, wth $ a real unt, \ ' 2 ' j+ (\ \ ) +(&\ j \ j ) =$; (t( &1))&1 B 2 (\ 2) 0. (1.2h)

7 180 SANKAR SITARAMAN Now, by alyng (1.2f) for and j we get ' j # ' \\ j \ + mod (1&) &1 because ' =((X+Y)(1&)) \ & #(X+((X+Y)(1&))) \ & # X\ & (mod(1&) &1 ) and smlarly for ' j. Thus ' ' j s congruent to a ratonal nteger mod, and because s regular, ths forces ' ' j to be a th ower (cf. [Wa, Theorem 5.36]). Now let 2 X 1 = \' ' j+ \ \, Y 1 =&(\ j \ j ), and Z 1 =\ 2. 0 Then from (1.2h) we have X 1 +Y 1 =$;(t( &1))&1 B 2 Z 1. (1.2) In ths equaton X 1, Y 1, Z 1 # A +,(t( &1))&1( &1)2, $ s a real unt, and B 2 s dvsble only by rmes of the form k&1, (k, )=1. Moreover, X 1, Y 1, Z 1, and ; are arwse relatvely rme because \, \ j, \ 0, ; are arwse relatvely rme, as shown above (see remarks surroundng Eqs. (1.2d) and (1.2e)). Thus (1.2) s another equaton satsfyng the same condton as (1.2b) but n ths case t has (Z 1 )=(\ 0 ) 2 =I 2 0 whch wll have a smaller number of rme dvsors than Z unless I 1 =}}}=I &1 =(1) whch would force (X+Y)(1&) to be a unt for 1 &1. Ths can be shown to be a contradcton (cf. [Wa,. 173]). Hence Theorem THE MAIN THEOREM Theorem 2.1. Assume s rregular, B &3, and c as n Theorem 1.2. Let q be an odd rme such that q#1 (mod), and _Q over q n Q() whose deal class generates C (3). If x + y = c z has nontrval nteger solutons, then q % ( c z )(x+ y). Proof. Remark: As noted n the Introducton, Tchebotarev densty theorem gves nfntely many rmes q wth the above roertes. We frst need a rooston. Let L be a rme deal of Q[], such that L (x+y1&). Then by Prooston 1.1b, L % (x+ y). So f L les over the ratonal rme l, then l (x + y ) O x + y #0 (mod l) O (&xy) #1 (mod l). From ths we get l#1 (mod). Excet for the last aragrah, the roof of the followng

8 ON A FERMAT-TYPE DIOPHANTINE EQUATION 181 rooston, followng [V2,. 217] s almost dentcal to that of Prooston 3.1 of [S]. It s resented here for comleteness. Recall that when n # Z, n$ s an nteger such that nn$#1 (modl). Prooston 2.0. _: # A such that If Eq. (1.2) s satsfed wth x, y # Z, (x, y)=1, then ( &1)2 \ x+ n$ y + =:. 1&n$ (2.0a) Proof. As shown above, we have \ x+y 1& + =I, where I an ntegral deal, (2.0b) when x, y are as n the statement of ths rooston. Alyng a Stckelberger tye relaton (cf. [L,. 13, Fact. 3]) wth n 1 =n 2 =1, and usng the fact that all rme deals dvdng (x+y1&) are of degree 1 (see remark above), we fnd that the roduct > ( &1)2 _ n$ (I) s rncal Alyng ths to Eq. (2.0b), we get &12 \ x+n$ y 1&n$ + =';, where ' # A s a unt, and ; # A. (2.0c) Alyng _ &1 to (2.0c), we get &1 n=(+1)2\ x+ n$ y 1&n$ + =' (; ). (2.0d) Multlyng (2.0c) and (2.0d), and usng (1.1b), we fnd that the deal (;; )=(v). Hence ;; =Ev, where E # A s a unt. Takng the roduct of (2.0c) and (2.0d) agan, we fnd that '' E =1. (2.0e) But we know, by a basc result, that '= g=, (2.0f) where = # A + =Z[+&1 ] s a real unt and g # Z.

9 182 SANKAR SITARAMAN From (2.0e) and (2.0f) we get = 2 =E &. Snce s odd, we can fnd ntegers a, b such that 2a=1+b, so that = 2a === b =E &a. Hence ==(= &b E &a ), and '= g(= &b E &a ). Lettng :== &b E &a ;, we get ( &1)2 \ x+n$ y 1&n$ + = g:. (2.0g) Let l be a rme number that dvdes c. Then by Prooston 1.1, l (x+ y), but l % (x + y )(x+ y). From ths, we get (x + y )(x+ y)=v # y &1 (mod l) O y#v (mod l), for some v 1 1 # Z. Now alyng the th ower resdue character [( )(l)] to both sdes of (2.0g), we get [g(l)]=1. If g0 (mod), [(l)]=1, whch s mossble for such l by Prooston 1.0. Hence Prooston 2.0. From (2.0a) we have ( &1)2 \ x+ n$ y + =:. 1&n$ Let q, Q be as n the statement of Theorem 2.1. Then we can assume, takng a conjugate f necessary, Q (x+y). (If the deal class of Q generates C (3) (3), then because C s an egensace corresondng to the egenvalue 3 (_) whch s rme to, the conjugate _(Q) wll also be n an deal class that generates C (3).) Then Q % (x+y) for{1. Now for k # [1, 2,..., ( &1)2], &kn$1 (mod), \1n(&1)2. Alyng _ & k to both sdes of (2.0a), we get ( &1)2 \ x+ &kn$ y + =: 1&&kn$ 1. (2.1) Now, (x+y)(1&)#(xe &1 e ) (modq), where we defne e = (1&)(1&), because Q (x+y). So from (2.1) we get ( &1)2 { Q=\ x e &kn$&1 Q +{ e &1 &kn$ = Q = 1 Q= {: =1. (2.2) Fx k 0 =&(&1)2, and let k 1 =&1, k 2 =&2,..., k ( &3)2 =&&32. Then we get ( &1)2 { e &k0n$&1 Q ={ e &1 &k 0n$ Q = ( &1)2 = { e &kn$&1 Q ={ e &k n$ &1, Q = =1,2,..., &3 2. (2.3)

10 ON A FERMAT-TYPE DIOPHANTINE EQUATION 183 Defne (mod ), nd(:)=a, where [:Q]=a. In ths notaton, we get from (2.3) that ( &1)2 : [nd(e &ko n$&1)&nd(e &k n$&1)&nd(e &ko n$) +nd(e &k n$)]#0 (mod ). (2.4) From [K,. 277], we have the followng relaton between nd(e ) and the nd(e j ), &32 nd(e )# : m=1 \\ 2m r &1+ nd(e 2m) 2m +&&1 2 nd(), where r s as defned n Secton 0. In (2.4), for any k, let &k n$= n, &k 0 n$=a n. Then ( &1)2 : [(nd(e an &1)&nd(e an ))&(nd(e n &1)&nd(e n ))] #0 (mod ). (2.5) Then usng the above relaton, we get ( &1)2 : _ ( &3)2 : _ (a n&1) m=1 #0 (mod ). 2m &a 2m n &(( n &1) 2m & 2m n ) r 2m &1 & nd(e 2m) & Smlfyng, and usng the fact that A t = def ( &1)2 (n$) t #0 (mod ) when t s even, we get &4 : u=1 u odd ( &3)2 \ : \ 2m u + nd(e 2m) r 2m &1 + A u(k u 0 &ku )#0 m=1 (mod ). (2.6) 2mu Lettng vary over 1, 2,..., ( &3)2, we get a system of ( &3)2 equatons n (k u 0 &ku ) whose matrx equaton has only the trval soluton f the followng generalzed ( &1)2_( &1)2 VanderMonde matrx A s nonsngular mod :

11 184 SANKAR SITARAMAN }}} }}} \ &1 A= }}} \ &1 3. b b b.. b 1 2 &4 3 &4 }}} \ &1 &4 Let the determnant of A=2. Then 2=\1 where. 1=} }}} }}} 2 & }}} 3 &4 1}.. b b b.. b b 1 \ &1 \ &1 3 \ &1 5 }}} \ &1 &4 Let B be the non-sngular (mod ) VanderMonde matrx gven by }}} B=_ }}} 2 &4 2 & }}} 3 &4 3 &2. b b b.. b b \ &1 \ &1 3 \ &1 5 }}} \ &1 &4 \ &1 &2 If det(b) sb, then 1=(x ( &1)2 )b where [x 1, x 2,..., x ( &1)2 ] s the soluton of the matrx equaton &. B[x 1, x 2,..., x ( &1)2 ] t =[1, 1, 1,..., 1] t (Cramer's rule). But B[x 1, x 2,..., x ( &1)2 ] t =[1, 1, 1,..., 1] t O ( &1)2 k=1 x k n 2k&1 =1, for, 2,..., ( &1)2 O ( &1)2 k=1 x k n 2k =n, for, 2,..., ( &1)2 O ( &1)2 k=1 x k ( ( &1)2 n 2k )= ( &1)2 n. Snce ( &1)2 n 2k #0 (mod ) for k<(&1)2, we get x ( &1)2 # ( +1)4 (mod). Thus 1 has to be nonzero mod and hence 2 s also nonzero mod.

12 ON A FERMAT-TYPE DIOPHANTINE EQUATION 185 Thus the system of Eq. (2.6) has only trval solutons. Consderng the leadng term only, we get ( &3) A &4 nd(e &3 ) #0 (mod ), (2.7) r &3 &1 where A &4 = ( &1)2 (n$) &4 as defned earler. We have the followng relaton between A j 's and the Bernoull numbers B (cf. [V3,. 114]): ( &1)2 : n &1 # 1&2 2 &1 B (mod ), 2, (&1) %. (2.8) Remark. The above congruence s also a consequence of Vorono's congruences (cf, for nstance, [R.. 108, 5B]). Let =4. From (2.8) we have (1&2 4 ) B #A &4.4 (mod ). Combnng (2.7) and (2.8), we get ( &3) nd(e &3 ) r &3 &1 B 4 1& #0 (mod ). Snce s rregular, certanly >5, and we get ( &3) nd(e &3 ) (r &3 &1)#0 (mod). Hence nd(e &3 )#0 (mod),.e., [E &3 Q]=1. Now we need the followng results from [S]: Lemma 2.2 [S]. of K. K(E 1 &3 ) s a nontrval, unramfed, abelan extenson Corollary. For any rncal deal (:) of K, [E &3 (:)]=1. Lemma 2.4 [He,. 434]. Let k # [5,..., l&2], and P k be any deal rme to (*) whose class belongs to C (k). Then [E &3P k ]=1. Snce [Q] generates C (3) by assumton, we can use Lemma 2.4 and the corollary of Lemma 2.2 to show that (E &3 ) 1 generates a trval extenson of Q[]. Ths wll contradct Lemma 2.2. Ths concludes the roof of the man theorem. Some Remarks. (1) By usng the other terms from (2.6), we get nd(e &t )#0 (mod) fort=5, and deendng on, some other t>3 as

13 186 SANKAR SITARAMAN well. So for nstance, f we assume that C (5) s cyclc and C ( &5) =0, then the above theorem can be roved wth C (5) n the lace of C (3). (2) Denotng by 1 j the determnant of the matrx obtaned by relacng the jth column of the VanderMonde matrx B by [1,1,...,1] t, (so 1=1 ( &1)2 ), we get 1 j #(x j ) b, where x j and b are as defned before. But t s easy to see that x j # ( &1)2 n &2j. So we get 1&2&2j+1 x j # 2 &2j ( &2j+1) B &2j+1 (mod ) from (2.8) above. Thus, f 2 t 1(mod), then B t #0 ff 1 ( +1&t)2 #0 (mod ), where t=2,4,...,&3. REFERENCES [BCEM] J. Buhler, R. Crandall, R. Ernvall, and T. Metsankyla, Irregular rmes and cyclotomc nvarants to four mllon, Math. Com. 61 (1993), [C] H. Cohn, A Classcal Invtaton to Algebrac Numbers and Class Felds,'' Srnger-Verlag, New YorkBerln, [DM] H. Darmon and L. Merel, Wndng quotents and some varants of Fermat's Last Theorem, rernt. [He] J. Herbrand, Sur les classes des cors crculares, J. Math. Phys. 11 (1932), [K] E. E. Kummer, U ber de Erganzungsa tze zu den allgemenen Rezrozta tsgesetzen, J. Math. 44 (1852), [Ku] M. Kurhara, Some remarks on conjectures about cyclotomc felds and K-grous of Z, Comosto Math. 81 (1992), [L] S. Lang, Cyclotomc Felds, I and II,'' Srnger-Verlag, New YorkBerln, [MW] B. Mazur and A. Wles, Class felds of abelan extensons of Q, Invent. Math. 76 (1984), [R] P. Rbenbom, Thrteen Lectures on Fermat's Last Theorem,'' Srnger-Verlag, New YorkBerln, [R] K. Rbet, On the equaton a +2 : b +c =0, Acta Arth. 79 (1997), 716. [S] S. Staraman, Vandver revsted, J. Number Theory 57 (1996), [S2] S. Staraman, Ph.D. Thess,'' Calforna Insttute of Technology, [V1] H. S. Vandver, Fermat's last theorem and the second factor n the cyclotomc class number, Bull. Amer. Math. Soc. (1934), [V2] H. S. Vandver, A roerty of cyclotomc ntegers and ts relaton to the Fermat's last theorem, Ann. of Math. 26 (1925), [V3] H. S. Vandver, On ower characters of sngular ntegers n a roerly rregular cyclotomc feld, Trans. Amer. Math. Soc. 32 (1930), [V4] H. S. Vandver, On trnomal Dohantne equatons connected wth the Fermat relaton, Monatsh. Math. Phys. 43 (1936), [Wa] L. Washngton, Introducton to Cyclotomc Felds,'' 2nd ed., Srnger-Verlag, New YorkBerln, [W] A. Wles, Modular elltc curves and Fermat's last theorem, Ann. of Math. 141 (1995), [TW] R. Taylor and A. Wles, Ann. of Math. 141 (1995),

Some congruences related to harmonic numbers and the terms of the second order sequences

Some 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

Solutions for Tutorial 1

Solutions for Tutorial 1 Toc 1: Sem-drect roducts Solutons for Tutoral 1 1. Show that the tetrahedral grou s somorhc to the sem-drect roduct of the Klen four grou and a cyclc grou of order three: T = K 4 (Z/3Z). 2. Show further

More information

PARTIAL QUOTIENTS AND DISTRIBUTION OF SEQUENCES. Department of Mathematics University of California Riverside, CA

PARTIAL QUOTIENTS AND DISTRIBUTION OF SEQUENCES. Department of Mathematics University of California Riverside, CA PARTIAL QUOTIETS AD DISTRIBUTIO OF SEQUECES 1 Me-Chu Chang Deartment of Mathematcs Unversty of Calforna Rversde, CA 92521 mcc@math.ucr.edu Abstract. In ths aer we establsh average bounds on the artal quotents

More information

SMARANDACHE-GALOIS FIELDS

SMARANDACHE-GALOIS FIELDS SMARANDACHE-GALOIS FIELDS W. B. Vasantha Kandasamy Deartment of Mathematcs Indan Insttute of Technology, Madras Chenna - 600 036, Inda. E-mal: vasantak@md3.vsnl.net.n Abstract: In ths aer we study the

More information

FACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP

FACTORIZATION 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 information

Smarandache-Zero Divisors in Group Rings

Smarandache-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 information

REDUCTION 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. 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 information

APPENDIX A Some Linear Algebra

APPENDIX 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 information

Bernoulli Numbers and Polynomials

Bernoulli 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 information

DISCRIMINANTS AND RAMIFIED PRIMES. 1. Introduction A prime number p is said to be ramified in a number field K if the prime ideal factorization

DISCRIMINANTS AND RAMIFIED PRIMES. 1. Introduction A prime number p is said to be ramified in a number field K if the prime ideal factorization DISCRIMINANTS AND RAMIFIED PRIMES KEITH CONRAD 1. Introducton A prme number p s sad to be ramfed n a number feld K f the prme deal factorzaton (1.1) (p) = po K = p e 1 1 peg g has some e greater than 1.

More information

arxiv: v1 [math.co] 1 Mar 2014

arxiv: 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 information

THE CHINESE REMAINDER THEOREM. We should thank the Chinese for their wonderful remainder theorem. Glenn Stevens

THE 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 information

Algorithms for factoring

Algorithms for factoring CSA E0 235: Crytograhy Arl 9,2015 Instructor: Arta Patra Algorthms for factorng Submtted by: Jay Oza, Nranjan Sngh Introducton Factorsaton of large ntegers has been a wdely studed toc manly because of

More information

arxiv: v6 [math.nt] 23 Aug 2016

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 information

SL n (F ) Equals its Own Derived Group

SL 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 information

Math 217 Fall 2013 Homework 2 Solutions

Math 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 information

On the Connectedness of the Solution Set for the Weak Vector Variational Inequality 1

On the Connectedness of the Solution Set for the Weak Vector Variational Inequality 1 Journal of Mathematcal Analyss and Alcatons 260, 15 2001 do:10.1006jmaa.2000.7389, avalable onlne at htt:.dealbrary.com on On the Connectedness of the Soluton Set for the Weak Vector Varatonal Inequalty

More information

18.781: Solution to Practice Questions for Final Exam

18.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 information

On Finite Rank Perturbation of Diagonalizable Operators

On Finite Rank Perturbation of Diagonalizable Operators Functonal Analyss, Approxmaton and Computaton 6 (1) (2014), 49 53 Publshed by Faculty of Scences and Mathematcs, Unversty of Nš, Serba Avalable at: http://wwwpmfnacrs/faac On Fnte Rank Perturbaton of Dagonalzable

More information

Power-sum problem, Bernoulli Numbers and Bernoulli Polynomials.

Power-sum problem, Bernoulli Numbers and Bernoulli Polynomials. Power-sum roblem, Bernoull Numbers and Bernoull Polynomals. Arady M. Alt Defnton 1 Power um Problem Fnd the sum n : 1... n where, n N or, usng sum notaton, n n n closed form. Recurrence for n Exercse Usng

More information

A summation on Bernoulli numbers

A 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 information

Counting Solutions to Discrete Non-Algebraic Equations Modulo Prime Powers

Counting Solutions to Discrete Non-Algebraic Equations Modulo Prime Powers Rose-Hulman Insttute of Technology Rose-Hulman Scholar Mathematcal Scences Techncal Reorts (MSTR) Mathematcs 5-20-2016 Countng Solutons to Dscrete Non-Algebrac Equatons Modulo Prme Powers Abgal Mann Rose-Hulman

More information

Equations associated to Principal Congruence Subgroups of Level Ten or less, or Twelve

Equations associated to Principal Congruence Subgroups of Level Ten or less, or Twelve Equatons assocated to Prncal Congruence Subgrous of Level Ten or less, or Twelve Takash Nwa Introducton The urose of ths aer s to fnd equatons assocated to gven comact Remann surfaces. Though all comact

More information

a b a In case b 0, a being divisible by b is the same as to say that

a 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 information

Character Degrees of Extensions of PSL 2 (q) and SL 2 (q)

Character Degrees of Extensions of PSL 2 (q) and SL 2 (q) Character Degrees of Extensons of PSL (q) and SL (q) Donald L. Whte Department of Mathematcal Scences Kent State Unversty, Kent, Oho 444 E-mal: whte@math.kent.edu July 7, 01 Abstract Denote by S the projectve

More information

THERE ARE NO POINTS OF ORDER 11 ON ELLIPTIC CURVES OVER Q.

THERE 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 information

Kuroda s class number relation

Kuroda s class number relation ACTA ARITMETICA XXXV (1979) Kurodas class number relaton by C. D. WALTER (Dubln) Kurodas class number relaton [5] may be derved easly from that of Brauer [2] by elmnatng a certan module of unts, but the

More information

5 The Rational Canonical Form

5 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 information

NECESSARY AND SUFFICIENT CONDITIONS FOR ALMOST REGULARITY OF UNIFORM BIRKHOFF INTERPOLATION SCHEMES. by Nicolae Crainic

NECESSARY AND SUFFICIENT CONDITIONS FOR ALMOST REGULARITY OF UNIFORM BIRKHOFF INTERPOLATION SCHEMES. by Nicolae Crainic NECESSARY AND SUFFICIENT CONDITIONS FOR ALMOST REGULARITY OF UNIFORM BIRKHOFF INTERPOLATION SCHEMES by Ncolae Cranc Abstract: In ths artcle usng a combnaton of the necessary and suffcent condtons for the

More information

The Ramanujan-Nagell Theorem: Understanding the Proof By Spencer De Chenne

The 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 information

An application of generalized Tsalli s-havrda-charvat entropy in coding theory through a generalization of Kraft inequality

An application of generalized Tsalli s-havrda-charvat entropy in coding theory through a generalization of Kraft inequality Internatonal Journal of Statstcs and Aled Mathematcs 206; (4): 0-05 ISS: 2456-452 Maths 206; (4): 0-05 206 Stats & Maths wwwmathsjournalcom Receved: 0-09-206 Acceted: 02-0-206 Maharsh Markendeshwar Unversty,

More information

On the Nilpotent Length of Polycyclic Groups

On the Nilpotent Length of Polycyclic Groups JOURNAL OF ALGEBRA 203, 125133 1998 ARTICLE NO. JA977321 On the Nlpotent Length of Polycyclc Groups Gerard Endmon* C.M.I., Unerste de Proence, UMR-CNRS 6632, 39, rue F. Jolot-Cure, 13453 Marselle Cedex

More information

Affine transformations and convexity

Affine 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 information

First day August 1, Problems and Solutions

First 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 information

Linear Algebra and its Applications

Linear 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 information

Randić Energy and Randić Estrada Index of a Graph

Randić 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 information

Polynomials. 1 More properties of polynomials

Polynomials. 1 More properties of polynomials Polynomals 1 More propertes of polynomals Recall that, for R a commutatve rng wth unty (as wth all rngs n ths course unless otherwse noted), we defne R[x] to be the set of expressons n =0 a x, where a

More information

February 14, TiCC TR Generalized Residue Codes and their Idempotent Generators. Bulgarian Academy of Sciences, Bulgaria and

February 14, TiCC TR Generalized Residue Codes and their Idempotent Generators. Bulgarian Academy of Sciences, Bulgaria and Tlurg centre for Creatve Comutng P.O. Bo 90153 Tlurg Unversty 5000 LE Tlurg, The Netherlands htt://www.uvt.nl/tcc Emal: tcc@uvt.nl Coyrght S.M. Dodunekov, A. Bolov and A.J. van Zanten 2011. Feruary 14,

More information

Math 261 Exercise sheet 2

Math 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 information

Lectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix

Lectures - 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 information

J. Number Theory 130(2010), no. 4, SOME CURIOUS CONGRUENCES MODULO PRIMES

J. 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 information

Foundations of Arithmetic

Foundations 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 information

n α 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

n α 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 information

Christian Aebi Collège Calvin, Geneva, Switzerland

Christian 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 information

DIFFERENTIAL FORMS BRIAN OSSERMAN

DIFFERENTIAL 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 information

Dr. Shalabh Department of Mathematics and Statistics Indian Institute of Technology Kanpur

Dr. Shalabh Department of Mathematics and Statistics Indian Institute of Technology Kanpur Analyss of Varance and Desgn of Exerments-I MODULE III LECTURE - 2 EXPERIMENTAL DESIGN MODELS Dr. Shalabh Deartment of Mathematcs and Statstcs Indan Insttute of Technology Kanur 2 We consder the models

More information

On New Selection Procedures for Unequal Probability Sampling

On New Selection Procedures for Unequal Probability Sampling Int. J. Oen Problems Comt. Math., Vol. 4, o. 1, March 011 ISS 1998-66; Coyrght ICSRS Publcaton, 011 www.-csrs.org On ew Selecton Procedures for Unequal Probablty Samlng Muhammad Qaser Shahbaz, Saman Shahbaz

More information

2.3 Nilpotent endomorphisms

2.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 information

Pre-Talbot ANSS. Michael Andrews Department of Mathematics MIT. April 2, 2013

Pre-Talbot ANSS. Michael Andrews Department of Mathematics MIT. April 2, 2013 Pre-Talbot ANSS Mchael Andrews Deartment of Mathematcs MIT Arl 2, 203 The mage of J We have an unbased ma SO = colm n SO(n) colm n Ω n S n = QS 0 mang nto the -comonent of QS 0. The ma nduced by SO QS

More information

The Jacobsthal and Jacobsthal-Lucas Numbers via Square Roots of Matrices

The Jacobsthal and Jacobsthal-Lucas Numbers via Square Roots of Matrices Internatonal Mathematcal Forum, Vol 11, 2016, no 11, 513-520 HIKARI Ltd, wwwm-hkarcom http://dxdoorg/1012988/mf20166442 The Jacobsthal and Jacobsthal-Lucas Numbers va Square Roots of Matrces Saadet Arslan

More information

Non-Ideality Through Fugacity and Activity

Non-Ideality Through Fugacity and Activity Non-Idealty Through Fugacty and Actvty S. Patel Deartment of Chemstry and Bochemstry, Unversty of Delaware, Newark, Delaware 19716, USA Corresondng author. E-mal: saatel@udel.edu 1 I. FUGACITY In ths dscusson,

More information

Hyper-Sums of Powers of Integers and the Akiyama-Tanigawa Matrix

Hyper-Sums of Powers of Integers and the Akiyama-Tanigawa Matrix 6 Journal of Integer Sequences, Vol 8 (00), Artcle 0 Hyper-Sums of Powers of Integers and the Ayama-Tangawa Matrx Yoshnar Inaba Toba Senor Hgh School Nshujo, Mnam-u Kyoto 60-89 Japan nava@yoto-benejp Abstract

More information

Errors for Linear Systems

Errors 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

The Order Relation and Trace Inequalities for. Hermitian Operators

The 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 information

Supplementary Material for Spectral Clustering based on the graph p-laplacian

Supplementary Material for Spectral Clustering based on the graph p-laplacian Sulementary Materal for Sectral Clusterng based on the grah -Lalacan Thomas Bühler and Matthas Hen Saarland Unversty, Saarbrücken, Germany {tb,hen}@csun-sbde May 009 Corrected verson, June 00 Abstract

More information

Short running title: A generating function approach A GENERATING FUNCTION APPROACH TO COUNTING THEOREMS FOR SQUARE-FREE POLYNOMIALS AND MAXIMAL TORI

Short 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 information

A FORMULA FOR COMPUTING INTEGER POWERS FOR ONE TYPE OF TRIDIAGONAL MATRIX

A FORMULA FOR COMPUTING INTEGER POWERS FOR ONE TYPE OF TRIDIAGONAL MATRIX Hacettepe Journal of Mathematcs and Statstcs Volume 393 0 35 33 FORMUL FOR COMPUTING INTEGER POWERS FOR ONE TYPE OF TRIDIGONL MTRIX H Kıyak I Gürses F Yılmaz and D Bozkurt Receved :08 :009 : ccepted 5

More information

Problem Solving in Math (Math 43900) Fall 2013

Problem 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 information

On a Theorem of J. A. Green

On a Theorem of J. A. Green JOUNL OF LEB 209, 708712 1998 TICLE NO J987552 On a Theorem of J reen Kench Yamauch Department of Mathematcs, Facult of Educaton, Chba Unerst, Yaocho, Chba 263-8522, Japan E-mal: amauch@mathechba-uacjp

More information

P.P. PROPERTIES OF GROUP RINGS. Libo Zan and Jianlong Chen

P.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 information

Taylor series coefficients of the HP-polynomial as an invariant for links in the solid torus

Taylor series coefficients of the HP-polynomial as an invariant for links in the solid torus Al. Math. Inf. c. 7, No. 1, 23-28 (213) 23 Aled Mathematcs & Informaton cences An Internatonal Journal c 213 NP Natural cences Publshng Cor. aylor seres coeffcents of the HP-olynomal as an nvarant for

More information

Finding Primitive Roots Pseudo-Deterministically

Finding 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 information

COMPLEX NUMBERS AND QUADRATIC EQUATIONS

COMPLEX 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 information

Ali Omer Alattass Department of Mathematics, Faculty of Science, Hadramout University of science and Technology, P. O. Box 50663, Mukalla, Yemen

Ali Omer Alattass Department of Mathematics, Faculty of Science, Hadramout University of science and Technology, P. O. Box 50663, Mukalla, Yemen Journal of athematcs and Statstcs 7 (): 4448, 0 ISSN 5493644 00 Scence Publcatons odules n σ[] wth Chan Condtons on Small Submodules Al Omer Alattass Department of athematcs, Faculty of Scence, Hadramout

More information

inv lve a journal of mathematics 2008 Vol. 1, No. 1 Divisibility of class numbers of imaginary quadratic function fields

inv 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 information

Volume 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].

Volume 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 information

Formulas for the Determinant

Formulas 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 information

28 Finitely Generated Abelian Groups

28 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 information

Complete subgraphs in multipartite graphs

Complete 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 information

Chapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems

Chapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems Numercal Analyss by Dr. Anta Pal Assstant Professor Department of Mathematcs Natonal Insttute of Technology Durgapur Durgapur-713209 emal: anta.bue@gmal.com 1 . Chapter 5 Soluton of System of Lnear Equatons

More information

A New Refinement of Jacobi Method for Solution of Linear System Equations AX=b

A New Refinement of Jacobi Method for Solution of Linear System Equations AX=b Int J Contemp Math Scences, Vol 3, 28, no 17, 819-827 A New Refnement of Jacob Method for Soluton of Lnear System Equatons AX=b F Naem Dafchah Department of Mathematcs, Faculty of Scences Unversty of Gulan,

More information

Determinants Containing Powers of Generalized Fibonacci Numbers

Determinants 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 information

Lecture 5 Decoding Binary BCH Codes

Lecture 5 Decoding Binary BCH Codes Lecture 5 Decodng Bnary BCH Codes In ths class, we wll ntroduce dfferent methods for decodng BCH codes 51 Decodng the [15, 7, 5] 2 -BCH Code Consder the [15, 7, 5] 2 -code C we ntroduced n the last lecture

More information

Homework Notes Week 7

Homework Notes Week 7 Homework Notes Week 7 Math 4 Sprng 4 #4 (a Complete the proof n example 5 that s an nner product (the Frobenus nner product on M n n (F In the example propertes (a and (d have already been verfed so we

More information

Fixed points of IA-endomorphisms of a free metabelian Lie algebra

Fixed points of IA-endomorphisms of a free metabelian Lie algebra Proc. Indan Acad. Sc. (Math. Sc.) Vol. 121, No. 4, November 2011, pp. 405 416. c Indan Academy of Scences Fxed ponts of IA-endomorphsms of a free metabelan Le algebra NAIME EKICI 1 and DEMET PARLAK SÖNMEZ

More information

The internal structure of natural numbers and one method for the definition of large prime numbers

The 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 information

A CHARACTERIZATION OF ADDITIVE DERIVATIONS ON VON NEUMANN ALGEBRAS

A 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 information

INTEGRAL p-adic HODGE THEORY, TALK 14 (COMPARISON WITH THE DE RHAMWITT COMPLEX)

INTEGRAL p-adic HODGE THEORY, TALK 14 (COMPARISON WITH THE DE RHAMWITT COMPLEX) INTEGRAL -ADIC HODGE THEORY, TALK 4 (COMPARISON WITH THE DE RHAMWITT COMPLEX) JOAQUIN RODRIGUES JACINTO (NOTES BY JAMES NEWTON). Recollectons and statement of theorem Let K be a erfectod eld of characterstc

More information

Caps and Colouring Steiner Triple Systems

Caps 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 information

Perron Vectors of an Irreducible Nonnegative Interval Matrix

Perron Vectors of an Irreducible Nonnegative Interval Matrix Perron Vectors of an Irreducble Nonnegatve Interval Matrx Jr Rohn August 4 2005 Abstract As s well known an rreducble nonnegatve matrx possesses a unquely determned Perron vector. As the man result of

More information

arxiv: v1 [math.ag] 22 Mar 2016

arxiv: v1 [math.ag] 22 Mar 2016 Equatons assocated to the Prncal Congruence Subgrou of Level Eght arxv:60.0668v math.ag] Mar 06 Introducton Takash Nwa For a natural number q, let Γ q be the rncal congruence subgrou of level q of SL(,Z,

More information

Restricted divisor sums

Restricted 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 information

arxiv: v1 [math.co] 12 Sep 2014

arxiv: 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 information

(2mn, m 2 n 2, m 2 + n 2 )

(2mn, m 2 n 2, m 2 + n 2 ) MATH 16T Homewk Solutons 1. Recall that a natural number n N s a perfect square f n = m f some m N. a) Let n = p α even f = 1,,..., k. be the prme factzaton of some n. Prove that n s a perfect square f

More information

On quasiperfect numbers

On 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 information

MATH 241B FUNCTIONAL ANALYSIS - NOTES EXAMPLES OF C ALGEBRAS

MATH 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 information

SPECIAL SUBSETS OF DIFFERENCE SETS WITH PARTICULAR EMPHASIS ON SKEW HADAMARD DIFFERENCE SETS

SPECIAL SUBSETS OF DIFFERENCE SETS WITH PARTICULAR EMPHASIS ON SKEW HADAMARD DIFFERENCE SETS SPECIAL SUBSETS OF DIFFERENCE SETS WITH PARTICULAR EMPHASIS ON SKEW HADAMARD DIFFERENCE SETS ROBERT S. COULTER AND TODD GUTEKUNST Abstract. Ths artcle ntroduces a new approach to studyng dfference sets

More information

Chowla s Problem on the Non-Vanishing of Certain Infinite Series and Related Questions

Chowla 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 information

Eigenvalues of Random Graphs

Eigenvalues of Random Graphs Spectral Graph Theory Lecture 2 Egenvalues of Random Graphs Danel A. Spelman November 4, 202 2. Introducton In ths lecture, we consder a random graph on n vertces n whch each edge s chosen to be n the

More information

CSCE 790S Background Results

CSCE 790S Background Results CSCE 790S Background Results Stephen A. Fenner September 8, 011 Abstract These results are background to the course CSCE 790S/CSCE 790B, Quantum Computaton and Informaton (Sprng 007 and Fall 011). Each

More information

GELFAND-TSETLIN BASIS FOR THE REPRESENTATIONS OF gl n

GELFAND-TSETLIN BASIS FOR THE REPRESENTATIONS OF gl n GELFAND-TSETLIN BASIS FOR THE REPRESENTATIONS OF gl n KANG LU FINITE DIMENSIONAL REPRESENTATIONS OF gl n Let e j,, j =,, n denote the standard bass of the general lnear Le algebra gl n over the feld of

More information

Self-complementing permutations of k-uniform hypergraphs

Self-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 information

Dirichlet s Theorem In Arithmetic Progressions

Dirichlet 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 information

Graph Reconstruction by Permutations

Graph 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 information

763622S ADVANCED QUANTUM MECHANICS Solution Set 1 Spring c n a n. c n 2 = 1.

763622S ADVANCED QUANTUM MECHANICS Solution Set 1 Spring c n a n. c n 2 = 1. 7636S ADVANCED QUANTUM MECHANICS Soluton Set 1 Sprng 013 1 Warm-up Show that the egenvalues of a Hermtan operator  are real and that the egenkets correspondng to dfferent egenvalues are orthogonal (b)

More information

On the partial orthogonality of faithful characters. Gregory M. Constantine 1,2

On the partial orthogonality of faithful characters. Gregory M. Constantine 1,2 On the partal orthogonalty of fathful characters by Gregory M. Constantne 1,2 ABSTRACT For conjugacy classes C and D we obtan an expresson for χ(c) χ(d), where the sum extends only over the fathful rreducble

More information

Euler s Function in Residue Classes

Euler s Function in Residue Classes THE RAMANUJAN JOURNAL 2, 7 20 998 c 998 Kluwer Academc Publshers. Manufactured n The Netherlands. Euler s Functon n Resdue Classes THOMAS DENCE Deartment of Mathematcs, Ashland Unversty, Ashland, OH 44805

More information

Euclidean Systems. Stefan G. Treatman* Communicated by A. Granville. Received November 8, 1996; revised March 6,

Euclidean Systems. Stefan G. Treatman* Communicated by A. Granville. Received November 8, 1996; revised March 6, Journal of Number Theory 73, 7791 (1998) Artcle No. NT9884 Eucldean Systems Stefan G. Treatman* Department of Mathematcs and Computer Scence, Sant Joseph's Unversty, Phladelpha, Pennsylvana 19131 E-mal:

More information

Structure and Drive Paul A. Jensen Copyright July 20, 2003

Structure and Drive Paul A. Jensen Copyright July 20, 2003 Structure and Drve Paul A. Jensen Copyrght July 20, 2003 A system s made up of several operatons wth flow passng between them. The structure of the system descrbes the flow paths from nputs to outputs.

More information

Ballot Paths Avoiding Depth Zero Patterns

Ballot 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 information