Chapter PENTAGONAL NUMBERS
|
|
- Winifred Cole
- 5 years ago
- Views:
Transcription
1 Chapter PENTAGONAL NUMBERS Part of this work contained in this chapter has resulted in the following publication: Gopalan, M.A. and Jayakumar, P. "On pentagonal numbers", International Journal Acta Ciencia Indica, 31M(3) (2005) MR
2 Chapter III PENTAGONAL NUMBERS The theory of numbers has been called the Queen of Mathematics because of its rich varieties of fascinating problems. Many numbers exhibit fascinating properties, they form sequences, they form patterns and so on. A pentagonal number is a figurate number that extends the concept of triangular and square numbers to the pentagon, but, unlike the first two, the patterns involved in the construction of pentagonal numbers are not rotationally symmetrical. The «" pentagonal number p^is the number of distinct dots in a pattern of dots consisting of the outlines of regular pentagons whose sides contain 1 to n dots, overlaid so that they share one vertex. For instance, the third one is formed from outlines comprising 1, 5 and 10 dots, but the 1, and 3 of the 5, coincide with 3 of the 10 - leaving 12 distinct dots, 10 in the form of a pentagon, and 2 inside... p is given by the formula: Pn = n(3n-v) for n>l. The first few pentagonal numbers are: 1,5, 12,22,35,...
3 42 The generating function for the pentagonal numbers is ^^^^^ (1-x)^ = x + 5x^ + l2x'+22xu Every pentagonal number is j^of a triangular number. There are conjectured to be exactly 210 positive integers that can not be represented using three pentagonal numbers, namely 4, 8, 9, 16, 19, 20, 21, 26, 30, 31, 33, 38, 42, 43, 50, 54,..., 20250, There six positive integers that can not be expressed using four pentagonal numbers: 9, 21, 31, 43, 55 and 89. All positive integers can be expressed using five pentagonal numbers. Letting x, be the set of numbers relatively prime to 6, the generalized pentagonal number is given by(x?-l)/24. Also, letting y, be the subset of thex, for which x, s 5 (mod 6) the usual pentagonal numbers are given by(^j; -l)/24. Generalized pentagonal numbers are obtained from the formula given above, but with n taking values in the sequence 0, 1,-1,2, -2,3,-3,4,-4... producing the sequence: 0, 1, 2, 5, 7, 12, 15, 22, 26, 35, 40, 51, 57, 70, 77, 92, 100, 117,126, 145, 155, 176, 187, 210, 222, 247, 260, 287, 301, 330, 345,376, 392,425, Generalized pentagonal numbers are important to Euler's theory of partitions, as expressed in his pentagonal number theorem.
4 43 The number of dots inside the outermost pentagon of a pattern forming a pentagonal number is itself a generalized pentagonal number. Pentagonal numbers should not be confused with centered pentagonal numbers. Tests for pentagonal numbers One can test whether a positive integer x is a pentagonal number by computing «=-V24x + l If n is an integer, then x is the n* pentagonal number. If n is not an integer, then x is not pentagonal. In this chapter, explicit formulas for the ranks of pentagonal numbers which are simultaneously equal to hexagonal, heptagonal and octagonal numbers in turn presented, and determines pairs of pentagonal numbers whose ratios are non-square integers. A few interesting relations among pentagonal numbers are also presented [26]. First prove the follovnng theorems relating to explicit formula for pentagonal numbers. are
5 Equality of the pentagonal numbers with the hexagonal numbers Theorem 3.1 Explicit formula for the ranks of pentagonal numbers which are simultaneously equal to hexagonal numbers are given by 44 m = ^ 3 [(l + V3)2n+3 + (l_73)2n+3 + 2n+2]^ k= -L 2ri<l^{(l + V3)2n+3_. (l_73)2n+3+ ^3 2n+2]. v3 Proof It is well known that the pentagonal and hexagonal numbers are given by P,n= Om-\),...(3.1) Hk=k(2k-1),...(3.2) where m and k are the corresponding ranks. The identity P = Hi^, leads to the equation {?,m-\)^k{2k-\). Multiplying both sides by 24, we get 36w'-12w = 3(16A:'-8A:). By writing complete squares, we get (6AW-1)^-1 = 3[(4A:-1)'-1]. IfwetakeY=6m-l',...(3.3) X=4k-1,...(3.4) then we get Y2_3X2 = -2,...(3.5) which is the famous Pell's equeition. If y^ + V3xp is the fundamental solution of Y^ -3X^ = 1,
6 45 then the sequence of solutions can be obtained by y +Sx ^{y, +^x,r\n = 0, 1, 2... = (2 + V3r',n = 0, 1, (3.6) Further, we have yn -V3x =(2-/3)"^', n= 0, 1, (3.7) Adding and subtracting the above equations ( ), we get y =^[(2 + V3)"^' +(2-Sr'], -(3.8) x =^[(2 + V3)"^' -(2-V3r^]....(3.9) The general solutions of the equation (3.5) are given by ^.=^oyn+yox =y +x,...(3.10) Y =Y,+DX,x ^y +3x....(3.11) Using the equations (3.8), (3.9) in (3.10), (3.11), we get r.=i[(2.73r(vj.l)-(2-v3r(v3-l)] = ik^/3+1)'" -(73-1)"-],...(3.12) X =-^[(2 + V3r(V3+l) + (2-V3r(V3-1)] 2V3 1 (V3+l)"^^ ^ (^^-1)^"" ^\n+\ 2V3 2"^' 2 =!-^[(V3+ir*'+(V3-l)^'"']...(3.13) 2"^'V3 In view of (3.3) and (3.4), the ranks of pentagonal and hexagonal numbers are given by
7 46 m = -^3[Q + VS)'"^' + (1 --v^)'"^' + 2""'], A; =-^2"^'[(1 + V3)'""'-(1 - VS)'""'+ V32""']. The values of ranks m and k will be in integers only when n = 4(r-l), r=l, 2, 3... Some examples are presented in the table 3.1. s. No Values of n m k Table 3.1 Pentagonal number Hexagonal number Hk Equality of the pentagonal numbers with the heptagonal numbers Theorem 3.2 Explicit formula for the ranks of pentagonal numbers which are simultaneously equal to heptagonal are given by m = ^[(4 + Vl5)"(21 + 5A/l5)-(4-Vr5)"(21-5Vr5) + 2Vl5], 12V15 k = W[(4 + Vl5)" (25 + 7Vl5) - (4 - Vl5)" (25-7Vl5) ], I2V15 where r = 4(r-l), r =1,2,3...
8 Proof It is well known that the pentagonal and numbers are given by 47 heptagonal P =~(3m-\),...(3.14) H,=^(5k-3),...(3.15) where m and k are the corresponding ranks. The identity P = H^',leads to the equation in Jc (3w-l) = -(5w-3) 2 2?,m^ -m = 5k^ -3k. By writing complete squares, we get 3[{m--Y - ] = 5[(A:- )' - ]. ^ [(6m-l)'-l] = --[(10A:-3)'-9] [(6m-l)' -l] = 12[(10A:-3)' -9]. 5[(6w-l)^-]] = 3[(10yt-3)'-9]. Ifwe take X= 10k-1,...(3.16) Y = 6m-1,...(3.17) then we get 5(7'-l) = 3(X'-9). 57'-5 = 3Z'-27. 3X'-5F'=22....(3.18)
9 By introducing the linear transformations X=u+5t,...(3.19) Y=u+3t,...(3.20) the equation (3.18) leads to the equation 3(u + 5ty-5(u + 3ty= (u' +I0ut + 25t')-5(u' +6ut + 9t') = 22. 3M' + 30ut + ISe - 5u' - 30ut - 45/' = 22. Simplifying we get -2M'+30?'=22. Dividing by 2, we get -w'+lsr' =11. (or) u^ -I5t^ =-11,...(3.21) which is the famous Pell's equation. by The general solutions of the above equation (3.21) are given tn =toun+ UoTn = Un + 2Tn, Un =UoUn + DioTn = 2Un + l5tn, where MO +-4l5to =2 + vt5 is the fundamental solution of (3.21) and UQ + -JlSTg = 4 + ^ T5 is the fundamental solution of the Pellian u^-l5t^=l....(3.22) The infinite number of solutions of (3.22) can be obtained by i7 +vr57;=(f/o+vr5ror^'=(4+vi5)",...(3.23) Further, we have where n = 1, 2... U -VTST; =(U, -Vl57;r' =(4-Vl5)",...(3.24) where n = 1, 2...
10 49 Adding and subtracting the above two equations ( ), we get U =i[(4 + VT5)'' +(4-Vi5)^],...(3.25) ^«=T^[(4+ 715)"-(4-^15)"]....(3.26) 2-vl5 Using (3.25), (3.26) in the general solutions of (3.21), we get u =±[(4 + Vl5)"(2 + ^/l5)-(4-vl5)"(2-^/i5)],...(3.27) t = ^=:^[(4 + VT5)"(2 + ^5)-(4-ViI)"(Vr5-2)]....(3.28) In view of (3.16), (3.17), (3.19) and (3.20), the ranks of pentagonal and heptagonal numbers are given by m = --^[(4 + Vl5)"(21 + 5Vl5)--(4-Vr5)"(21-5Vl5) + 2Vl5], 12-\/15 k = ^[(4 + Vl5)" (25 + 7V[5) - (4 - Vl5)" (25 - vvls) + 6^15]. I2V15 The values of ranks m and k will be in integers only when n = 4(r-l), where r = 1,2,3... s. Some examples are presented in the table 3.2. Table 3.2 No Values of n m k Pentagonal number Pm Hexagonal number Hk
11 Equality of the pentagonal numbers with the numbers 50 octagonal Theorem 3.3 Explicit formula for the ranks of pentagonal numbers which are simultaneously equal to octagonal numbers are given by m = {(3 + 2 V2)""' (1 + 2 V2') + (3-2 V2)""' (1-2 V2) + 2} k = ^^{(3 + 2V2)"*'(2V2 + l) + (3-2V2)""'(2V2-l)+4V2}. Proof It is well known that the pentagonal and octagonal numbers are given by Pm=-{3m-l),...(3.29) Ok = k(3k-2)...(3.30) where mi and k are the corresponding ranks. The identity Pm = Ok, leads to the equation (3m-l)=k(3k-2). Multiplying both sides by 24, we get 36m^ -I2m = 24{3k^-2k) ^2{36k'^-2Ak) By writing complete squares, we get {6m-\y -\ = 2[{6r-lY -A]. lfwetakey = 6m-1,...(3.31) X = 6r-2,...(3.32) then we get 7^ -1 = 2X^ - 8
12 51 Y^-2X^=-7,...(3.33) which is the famous Pell's equation. The general solutions of the equation (3.33) are given by Xn = -Xoyn + YoXn = 2y + x^, Y = Yoy + lxax =y + 4x, where Yo + is the fundamental solution of (3.33), >'o + V2xo = 3 + 2V2 is the fundamental solution of the Pellian 72 _ 2^2=1....(3.34) The infinite number of solutions of (3.34) can be obtained by y +^x =(3 + 2^y^\n=0,l,2,...(3.35) Further, we have yr, -V2x =(3-2.j2)"'-\n=0,l,2, (3.36) Adding and subtracting the above two equations (3.35) and (3.36), we get ;; =-[(3 + 2^2)"^' +(3-2/2r'],...(3.37) x = J_[(3 + 2V2r'-(3-2V2r*]....(3.38) 2V2 Using (3.37), (3.3.8) in the general solutions of (3.33), we get Y =-t(3 + 2V2r' +(3-2V2r']+ -^[(3 + 2V2)"^' -(3-2V2r'] = l[(3 + 2V2r\l + 2V2) + (3-2V2r'(l-2V2)],...(3.39) X =i[(3 + 2V2r +(3-2V2r']+-^[(3 + 2V2)"^' -(3-2V2r'] = J_[(3 + 2V2r'(2V2+l) + (3-2V2r'(2V2-l)]...(3.40} 2V2
13 52 In view of (3.31) and (3.32), the ranks of the pentagonal and octagonal numbers are given by 6w -1 = i[(3 + 2V2)""' (1 + 2V:>') + (3-2^2)"^' (1-2V2)] 6m =~[(3 + 2V2)"^' (1 + 2V2) + (3-2V2)"^' (1-2V2)]+1 Hence m = [(3 + 2V2)"*' (1 + 2V2) + (3-2V2)"^' (1-2V2) + 2] 6r-2 = -^[(3 + 2^y^\l42 +1)+<3-2^2)"^' (2^2-1)] 2V2 6r =-^[(3 + 2V2)""'(2V2 +1) + (3-2V2)""'(2V2-1)] + 2 2v2 Hence r = ^[(3 + 2V2)"^'(2V2+l) + (3-2V2)"^'(2V2-1) + 4V2] 12v2 s. No The values of ranks m and r will be in integers only when n = 4r-3, r =1, 2, 3,... Values of n Some examples are presented in the table 3.3. m r Table 3.3 Pentagonal number Pm Octagonal number Or (15 digits) (21 digits) (15 digits) P (21 digits)
14 Also obtain the following observations. Observation 53 Pairs of pentagonal numbers whose ratios are non-square integers Proof If P^ and Pf. are denoting pentagonal numbers, then the identity P =ap^, where a >1, a square-free number, leads to the equation -i3m-l) = a-(3k-l). 3m^ - m ^ a{3k^ - k). By writing complete squares, we get (6m-l)^-l = a[(6fe-l)^-l]. IfwetakeX = 6K-l,...(3.41) then we get Y = 6m-1,...(3.42) Y^ =ax^-(a-l)^ax^~n,wheren = a-\....(3.43) Y'-aX'=-N...(3.44) The general solutions of the equation (3.44) are given by Y^=Yoy + axox,where Yo+^faX^ is the fundamental solution of (3.44), yo+^faxo is the fundamental solution of the Pellian Y'-aX'=\....(3.45)
15 54 The infinite number of solutions of (3.45) are given by y +4^x =(>'o+^ov«r',«= 0,1,2...(3.46) Further we have, y -^x ^{y^-x^4^y\n = 0,1,2...(3.47) Adding and subtracting the above equations (3.46) and (3.47) we get yn =-[{yo+4alxqy^^+{yo-4axqy^'^],...(3.48) x«= j=[{yo +^[axqy^'^-{yo -Vaxo)"^']....(3.49) zvoc Using (3.48), (3.49) in the general solutions of (3.44), we get x =^[(yo +4^x,r' +{yo -V^^o)""'] +^[0o +4^x,r' -{y, ~4^x,r'] ^ 2^ a = -^[(yo+^x,y^\x ^ + Y,) + {y, -4^x,r\X,4^-Y,)] zvor Yn = vt(^o +4^xx'+{yo -^<r']...(3.50) +^[u+v^xor' -u -V^xor'] = -[{yo + 4ax,y'\Xo4a + Yo) + {y.-^xoy*\yo-xo4a)\...(3.51) In view of (3.41) and (3.42), the ranks of the pentagonal numbers are obtained as m= [iyo +Vaxb)'"'(ZoVa+ro) + 0;o -Vaxo)'"'(K -Xo4d)+2\,...(3.52) k = -^[{y^+4^xx\x,4^ + Y,^ + {y,-4^x,r\x,^-y,)+2^], 12Va where n = 0,1, (3.53)
16 Some particular cases 55 When a = 2, the equation (3.44) leads to the Pell's equation Y2-2X2 = -1. In view of (3.52) and (3.53), the ranks of the pentagonal numbers are given by m = j-[(3 + 2V2)"-'Hl + V2) f (3 -l^l)"^^(1 - V2) +1], ^ =-^[( )""^'(1 + V2) + (3-2V2)"+VV2-1) + 2V2]. The values of ranks m and k will be in integers only when n = 4r+1, r = 0, 1, 2,3... s. No Some examples are presented in the table 3.4. Values of n m^ k Table 3.4 Pentagonal number Pentagonal number Pk When a = 3, the equation (3.44) leads to the Pell's equation Y2-3X2 = -2. In view of (3.52) and (3.53), the ranks of the pentagonal numbers are given by - [(2 + V3 r+^s + 3 V3) + (2 - V3 r+1 (5-3 V3) + 2], m- 12 k = - ^ f(2 + Sf^ (5 + 3A/3) + (2 - V3)"^^ (3 V3-5) + 2^31. 12V3 ^
17 56 The values of ranks m and k will be in integers only when n = 6r+ l,r = 0, 1,2... Some examples are presented in the table 3.5. Table 3.5 s. No Values ofn m k Pentagonal number Pm Pentagonal number Pk When a = 5, the equation (3.44) leads to the Pell's equation Y2 _ 5X2 = -4. In view of (3.52) and (3.53), the ranks of the pentagonal numbers are obtained by! = [(9 + 4 V5)"'' (1 + S) + (9-4 V5 )"^' (1 - Vs) + 2], m- 12' k = y [(9 + 4A/5)"+^ (1 + VS) + (9-4VS )"+^ (VS -1) + 2^5 ]. The values of ranks m and k will be in integers only when n = (4r+ l),r = 0, 1,2... s. No. Some examples are presented in the table 3.6. Values ofn m k Table 3.6 Pentagonal number Pm Pentagonal number Pk
18 Observations A few interesting relations among pentagonal numbers 57 It presents below a few interesting relations among pentagonal numbers. Pm and Ts are denoting the pentagonal and the triangular numbers. First derives the recurrence relation of pentagonal numbers which satisfy the following recurrence relations. Recurrence relations 3.1 m+1 m~i m Proof By the definition of the pentagonal number, Z'. =f(3/«-l)....(3.54) Thus?,_,=-^^[3(m-l)-l] = i!!izl2[3w_4],...(3.55) = (!!L±l)[3; + 3-l] 2 From the equation (3.55), we get _ (w +1) [3m+ 2]...(3.56) 2 m{3m-\) (3m-V) 3 -(m-1) «I 3 3 " = P -3W (3.57)
19 From the equation (3.56), we get 58 m(3m-l) 1 ^,,3 2 2 ^ 2 D = P + m + m = P +3m + l...(3.58) Adding the equations (3.57), (3.58), we get P,r+P -,=P.-3m P +3m + \ = 2P +3 thatis,p +?, _, -2P, =3....(3.59) This is the recurrence relation for the pentagonal numbers. Example 3.1 If we take m = 2, then T^ =l,the first pentagonal number, Tj =5, the second pentagonal number, T^ =12, the third pentagonal number. Thus P,,+P _,-2P = (5) = = 3. Hence the equation (3.59) is satisfied. Identity 3.1 The sum of the pentagonal numbers can be expressed as the polynomial in s. S 1 that is, y]p = s^(s + V) = st^,where T^ is the s"' triangular number. Proof The m"" pentagonal number is given by Hence X^.=i;[v(3«^-^)]
20 59 1 ' -^ m=l m=l - Ir3^(5 + 1)(25 + 1) ^(5 + 1) ~ ^ = -5(5 + l)[25fl-l] 4 2 sis + D = 5[-^^ -^ = sts, where T^ is the s"" triangular number. Identity 3.2 Rencc±P =s'^^^st,. m=1 -^ The sum of squares of the pentagonal numbers can be expressed as the polynomial in s. That is, ^P '=^^^^^(27/+18^r^-135-2). m=l 60 triangular number. Proof = ^(27.y^+18^^-13^-2), where T, is the s"" 30 The m"" pentagonal number is given by Hence P '=[ (3^-1)]^ =-[m\3m-iy]. = -[w'(9m'-6w + l)]. 4
21 = m m + m m=\ ^ m=l ^ m=\ ^ m=l 4 ' ^' ^' 2^ 4 ^ 4 6 = -5(5 + l)[-(65' +95' +5-l)-3s(5 + l) + -(25 + l)] = '^^'^^^^[54^^ + Sb' + 9^ ' ^ + 5]. 120 ^ ^ _ ^(^ + l)rc^ 3, o^ 2 [54;y'+365'-26^-4]. 120 = [27^^+185^-13^-2]. 30 -* Thus, ZP.'=^^^^^(27/+18/-135-2), 60 = (275^+185^-135-2). 30 Identity 3.3 The sum of cubes of the pentagonal numbers can be expressed as the polynomial in s. That is tpj = ^^^il^[1355'+1805"-1175'-1285' ].»-=' 280 ^' [I355'+180/-1175'-1285' ], where 7^ is the 140 5"' triangular number.
22 61 Proof The w"" pentagonal number is given by Hence pj=^(2m-iy. O = (27w' +9m-27m^ -1). 8 ^ = -(27m^ +9m^ -21m^ -m^) 8 Thus ±Pj^U21±m'-21±m^+9±m'-±m']. m=l O m=l m=i m=l m=l ^^ y(.y + l)(6^^+15/+6.y^-6.y^-^ + l) ^^(^ + 1)^(2^^+2^-1) y(5 +1)(65^ +9s^+s-l) ^^ (^ +1)^ ^ = ^^^^[90(65^ +I5s'+ 6s' -6s' -s + l)-3l5s(s + l)i2s' +2s-l) 1120 " +42(6s' +9/ +5-l)-355(5+l)]. _4s + l) [540^^ ^ ' - 512^' ] ^ ^4S + 1)L^^^5 ^jgq^4 _jj^^3 _i285^ ]. 280 ^ [1355'+1805^-1175'-1285' ] where Ts is the s" 140 triangular number.
23 62 Hence tpj = ^^^^^[1355^+ 1805^-117/-128^'+ 58^ "= 280 ^ th Ts IS the s -^' [135/+1805^-1175'-1285'+58^+ 12], where 140 triangular number. Identity 3.4 Pm = a square + (m -1) ^ triangular number. Proof The m' pentagonal number is given by m Pm= {3>m-\). 2 3m m m m = m = m H (m-~l)= a square +(m- V)"" triangular number. It has seen that the explicit formulas for the ranks of pentagonal numbers ' which are simultaneously equal to hexagonal, heptagonal and octagonal numbers. One may search for such hexagonal, heptagonal and octagonal numbers. Further, it has observed that there exist pairs of pentagonal numbers whose ratios are non-square integers. One may search for such numbers whose ratios are non-square integers.
Chapter II TRIANGULAR NUMBERS
Chapter II TRIANGULAR NUMBERS Part of this work contained in this chapter has resulted in the following publications: Gopalan, M.A. and Jayakuar, P. "Note on triangular nubers in arithetic progression",
More informationOn Weird and Pseudoperfect
mathematics of computation, volume 28, number 126, april 1974, pages 617-623 On Weird and Pseudoperfect Numbers By S. J. Benkoski and P. Krdö.s Abstract. If n is a positive integer and
More informationExhibit 2-9/30/15 Invoice Filing Page 1841 of Page 3660 Docket No
xhibit 2-9/3/15 Invie Filing Pge 1841 f Pge 366 Dket. 44498 F u v 7? u ' 1 L ffi s xs L. s 91 S'.e q ; t w W yn S. s t = p '1 F? 5! 4 ` p V -', {} f6 3 j v > ; gl. li -. " F LL tfi = g us J 3 y 4 @" V)
More informationLetting be a field, e.g., of the real numbers, the complex numbers, the rational numbers, the rational functions W(s) of a complex variable s, etc.
1 Polynomial Matrices 1.1 Polynomials Letting be a field, e.g., of the real numbers, the complex numbers, the rational numbers, the rational functions W(s) of a complex variable s, etc., n ws ( ) as a
More informationPUTNAM PROBLEMS SEQUENCES, SERIES AND RECURRENCES. Notes
PUTNAM PROBLEMS SEQUENCES, SERIES AND RECURRENCES Notes. x n+ = ax n has the general solution x n = x a n. 2. x n+ = x n + b has the general solution x n = x + (n )b. 3. x n+ = ax n + b (with a ) can be
More informationZhi-Wei Sun Department of Mathematics, Nanjing University Nanjing , People s Republic of China
J. Number Theory 16(016), 190 11. A RESULT SIMILAR TO LAGRANGE S THEOREM Zhi-Wei Sun Department of Mathematics, Nanjing University Nanjing 10093, People s Republic of China zwsun@nju.edu.cn http://math.nju.edu.cn/
More informationM E M P H I S, T E N N., S A T U E D A Y, OCTOBER 8, 1870.
5 L V 8 5 x - L : L Q ) L - \ \ Q Q - V 84 z < L L 4 Y z ( (
More informationFLORENTIN SMARANDACHE Numeralogy (I) or Properties of Numbers
FLORENTIN SMARANDACHE Numeralogy (I) or Properties of Numbers In Florentin Smarandache: Collected Papers, vol. II. Chisinau (Moldova): Universitatea de Stat din Moldova, 1997. NUMEROLOGY (I) or Properties
More informationChapter V DIVISOR GRAPHS
i J ' Chapter V DIVISOR GRAPHS Divisor graphs 173 CHAPTER V DIVISOR GRAPHS 5.1 Introduction In this chapter we introduce the concept of a divisor graph. Adivisor graph 0(8) of a finite subset S of Zis
More informationYALE UNIVERSITY DEPARTMENT OF COMPUTER SCIENCE
fa it) On the Jacobi Polynomials PA ' Gregory Matviyenko Research Report YALETJ/DCS/RR-1076 June 13, 1995 DTI,* QUALITY DEFECTED 3 YALE UNIVERSITY DEPARTMENT OF COMPUTER SCIENCE & k.-. *,«.
More informationx 9 or x > 10 Name: Class: Date: 1 How many natural numbers are between 1.5 and 4.5 on the number line?
1 How many natural numbers are between 1.5 and 4.5 on the number line? 2 How many composite numbers are between 7 and 13 on the number line? 3 How many prime numbers are between 7 and 20 on the number
More informationPartition Numbers. Kevin Y.X. Wang. September 5, School of Mathematics and Statistics The University of Sydney
Partition Numbers Kevin Y.X. Wang School of Mathematics and Statistics The University of Sydney September 5, 2017 Outline 1 Introduction 2 Generating function of partition numbers 3 Jacobi s Triple Product
More informationGenerating Functions
Semester 1, 2004 Generating functions Another means of organising enumeration. Two examples we have seen already. Example 1. Binomial coefficients. Let X = {1, 2,..., n} c k = # k-element subsets of X
More informationDiscrete Mathematics. Spring 2017
Discrete Mathematics Spring 2017 Previous Lecture Principle of Mathematical Induction Mathematical Induction: rule of inference Mathematical Induction: Conjecturing and Proving Climbing an Infinite Ladder
More information176 5 t h Fl oo r. 337 P o ly me r Ma te ri al s
A g la di ou s F. L. 462 E l ec tr on ic D ev el op me nt A i ng er A.W.S. 371 C. A. M. A l ex an de r 236 A d mi ni st ra ti on R. H. (M rs ) A n dr ew s P. V. 326 O p ti ca l Tr an sm is si on A p ps
More informationMATH 4400 SOLUTIONS TO SOME EXERCISES. 1. Chapter 1
MATH 4400 SOLUTIONS TO SOME EXERCISES 1.1.3. If a b and b c show that a c. 1. Chapter 1 Solution: a b means that b = na and b c that c = mb. Substituting b = na gives c = (mn)a, that is, a c. 1.2.1. Find
More informationRECENT RESULTS ON LINEAR RECURRENCE SEQUENCES
RECENT RESULTS ON LINEAR RECURRENCE SEQUENCES Jan-Hendrik Evertse (Leiden) General Mathematics Colloquium, Delft May 19, 2005 1 INTRODUCTION A linear recurrence sequence U = {u n } n=0 (in C) is a sequence
More informationFinding largest small polygons using symbolic computations
Finding largest small polygons using symbolic computations by Dragutin Svrtan Faculty of Science, Department of Mathematics, Bijenička 30 10000 Zagreb, Croatia, dsvrtan@math.hr Abstract A small polygon
More informationChapter y. 8. n cd (x y) 14. (2a b) 15. (a) 3(x 2y) = 3x 3(2y) = 3x 6y. 16. (a)
Chapter 6 Chapter 6 opener A. B. C. D. 6 E. 5 F. 8 G. H. I. J.. 7. 8 5. 6 6. 7. y 8. n 9. w z. 5cd.. xy z 5r s t. (x y). (a b) 5. (a) (x y) = x (y) = x 6y x 6y = x (y) = (x y) 6. (a) a (5 a+ b) = a (5
More informationFind two positive factors of 24 whose sum is 10. Make an organized list.
9.5 Study Guide For use with pages 582 589 GOAL Factor trinomials of the form x 2 1 bx 1 c. EXAMPLE 1 Factor when b and c are positive Factor x 2 1 10x 1 24. Find two positive factors of 24 whose sum is
More informationMath 0320 Final Exam Review
Math 0320 Final Exam Review SHORT ANSWER. Write the word or phrase that best completes each statement or answers the question. Factor out the GCF using the Distributive Property. 1) 6x 3 + 9x 1) Objective:
More information7.3 Singular points and the method of Frobenius
284 CHAPTER 7. POWER SERIES METHODS 7.3 Singular points and the method of Frobenius Note: or.5 lectures, 8.4 and 8.5 in [EP], 5.4 5.7 in [BD] While behaviour of ODEs at singular points is more complicated,
More information2016 EF Exam Texas A&M High School Students Contest Solutions October 22, 2016
6 EF Exam Texas A&M High School Students Contest Solutions October, 6. Assume that p and q are real numbers such that the polynomial x + is divisible by x + px + q. Find q. p Answer Solution (without knowledge
More informationANALOGUES OF THE TRIPLE PRODUCT IDENTITY, LEBESGUE S IDENTITY AND EULER S PENTAGONAL NUMBER THEOREM
q-hypergeometric PROOFS OF POLYNOMIAL ANALOGUES OF THE TRIPLE PRODUCT IDENTITY, LEBESGUE S IDENTITY AND EULER S PENTAGONAL NUMBER THEOREM S OLE WARNAAR Abstract We present alternative, q-hypergeometric
More informationbe a formal power series with h 0 = 1, v(h^) = \ and v(h n ) > 1 for n > 1. Define a n by
THE POWER OF 2 DIVIDING THE COEFFICIENTS OF CERTAIN POWER SERIES F. T. Howard Wake Forest University, Box 7388 Reynolda Station, Winston-Salem, NC 27109 (Submitted August 1999-Final Revision January 2000)
More informationT h e C S E T I P r o j e c t
T h e P r o j e c t T H E P R O J E C T T A B L E O F C O N T E N T S A r t i c l e P a g e C o m p r e h e n s i v e A s s es s m e n t o f t h e U F O / E T I P h e n o m e n o n M a y 1 9 9 1 1 E T
More informationArithmetic Operations. The real numbers have the following properties: In particular, putting a 1 in the Distributive Law, we get
MCA AP Calculus AB Summer Assignment The following packet is a review of many of the skills needed as we begin the study of Calculus. There two major sections to this review. Pages 2-9 are review examples
More informationADVANCED COMMUTATIVE ALGEBRA: PROBLEM SETS
ADVANCED COMMUTATIVE ALGEBRA: PROBLEM SETS UZI VISHNE The 11 problem sets below were composed by Michael Schein, according to his course. Take into account that we are covering slightly different material.
More informationON A CUBIC CONGRUENCE IN THREE VARIABLES. IP
ON A CUBIC CONGRUENCE IN THREE VARIABLES. IP L. J. MORDELL Let p be a prime and let fix, y, z) be a cubic polynomial whose coefficients are integers not all = 0 (mod p), and so are elements of the Galois
More information023011,-. #$(*+ ) #'( & #$%!" #( ) : : 0& )# +,-.) *!" : %&') #!" (35#4!" & 1 23 0(1 5+,6 78 9( ) 1&( 0(1 # 23 4 # *+,-.#() )! "#$%& '( 8 71H1H 25E- F+%GC& '( DC 5# ;1? @910 AB() %:) 9( M#
More informationOn Tornheim's double series
ACTA ARITHMETICA LXXV.2 (1996) On Tornheim's double series JAMES G. HUARD (Buffalo, N.Y.), KENNETH S. WILLIAMS (Ottawa, Ont.) and ZHANG NAN-YUE (Beijing) 1. Introduction. We call the double infinite series
More informationarxiv: v1 [math.gm] 6 Oct 2014
Prime number generation and factor elimination Vineet Kumar arxiv:1411.3356v1 [math.gm] 6 Oct 2014 Abstract. We have presented a multivariate polynomial function termed as factor elimination function,by
More informationMULTI-RESTRAINED STIRLING NUMBERS
MULTI-RESTRAINED STIRLING NUMBERS JI YOUNG CHOI DEPARTMENT OF MATHEMATICS SHIPPENSBURG UNIVERSITY SHIPPENSBURG, PA 17257, U.S.A. Abstract. Given positive integers n, k, and m, the (n, k)-th m- restrained
More informationUNCLASSIFIED Reptoduced. if ike ARMED SERVICES TECHNICAL INFORMATION AGENCY ARLINGTON HALL STATION ARLINGTON 12, VIRGINIA UNCLASSIFIED
. UNCLASSIFIED. 273207 Reptoduced if ike ARMED SERVICES TECHNICAL INFORMATION AGENCY ARLINGTON HALL STATION ARLINGTON 12, VIRGINIA UNCLASSIFIED NOTICE: When government or other drawings, specifications
More informationWeek 15-16: Combinatorial Design
Week 15-16: Combinatorial Design May 8, 2017 A combinatorial design, or simply a design, is an arrangement of the objects of a set into subsets satisfying certain prescribed properties. The area of combinatorial
More informationC O M P L E X FACTORIZATIONS O F T H E F I B O N A C C I AND LUCAS NUMBERS
C O M P L E X FACTORIZATIONS O F T H E F I B O N A C C I AND LUCAS NUMBERS Nathan D. Cahill, John R. D'Errico, and John P* Spence Eastman Kodak Company, 343 State Street, Rochester, NY 4650 {natfaan. cahill,
More informationON UNIVERSAL SUMS OF POLYGONAL NUMBERS
Sci. China Math. 58(2015), no. 7, 1367 1396. ON UNIVERSAL SUMS OF POLYGONAL NUMBERS Zhi-Wei SUN Department of Mathematics, Nanjing University Nanjing 210093, People s Republic of China zwsun@nju.edu.cn
More informationKindergarten Grade 1 Grade 2
Kindergarten Grade 1 Grade 2 NK.1 Say the whole number sequence by 1s starting anywhere from 0 to 10 and from 10 to 0. N1.1 Say the number sequence, 0 to 100, by: 1s forward and backward between any two
More informationThe Collatz Problem and Analogues
2 3 47 6 23 Journal of Integer Sequences, Vol. (2008), Article 08.4.7 The Collatz roblem and Analogues Bart Snapp and Matt Tracy Department of Mathematics and Statistics Coastal Carolina University Conway,
More informationMATH 260 Homework 2 solutions. 7. (a) Compute the dimension of the intersection of the following two planes in R 3 : x 2y z 0, 3x 3y z 0.
MATH 6 Homework solutions Problems from Dr Kazdan s collection 7 (a) Compute the dimension of the intersection of the following two planes in R 3 : x y z, 3x 3y z (b) A map L: R 3 R is defined by the matrix
More informationQuadratic Diophantine Equations x 2 Dy 2 = c n
Irish Math. Soc. Bulletin 58 2006, 55 68 55 Quadratic Diophantine Equations x 2 Dy 2 c n RICHARD A. MOLLIN Abstract. We consider the Diophantine equation x 2 Dy 2 c n for non-square positive integers D
More informationMath 61CM - Solutions to homework 2
Math 61CM - Solutions to homework 2 Cédric De Groote October 5 th, 2018 Problem 1: Let V be the vector space of polynomials of degree at most 5, with coefficients in a field F Let U be the subspace of
More informationDIHEDRAL GROUPS II KEITH CONRAD
DIHEDRAL GROUPS II KEITH CONRAD We will characterize dihedral groups in terms of generators and relations, and describe the subgroups of D n, including the normal subgroups. We will also introduce an infinite
More informationON THE LINEAR DIFFERENCE EQUATION WHOSE SOLUTIONS ARE THE PRODUCTS OF SOLUTIONS OF TWO GIVEN LINEAR DIFFERENCE EQUATIONS
ON THE LINEAR DIFFERENCE EQUATION WHOSE SOLUTIONS ARE THE PRODUCTS OF SOLUTIONS OF TWO GIVEN LINEAR DIFFERENCE EQUATIONS MURRAY S. KLAMK1N Scientific Laboratory, Ford Motor Company, Dearborn, Michigan
More informationMv3" L7-- Art L 31. am rt. ao - M rr. a cn. art O' N. t00. to o( C7 c O. Ort. n ' C ( a ( W 0. z D0) Ln rni 90 O H N rt 0. to0) O mx rt N. W n.
S = TG _. -. t s e- ' F F J l T L L " m - F+ m G T. G m ( ( F+ v ( _ = ). i i vi vi t g d d --( ( ( t t ( - : m ET 7 ' m : ( 7 c t+ ) c - 7 7de 7( ( d;:', ` m G - L Lm ) 7 ` 7 [ t d `< ( ) ( m ( ) c. (
More informationMath 319 Problem Set #2 Solution 14 February 2002
Math 39 Problem Set # Solution 4 February 00. (.3, problem 8) Let n be a positive integer, and let r be the integer obtained by removing the last digit from n and then subtracting two times the digit ust
More information8. Dirichlet s Theorem and Farey Fractions
8 Dirichlet s Theorem and Farey Fractions We are concerned here with the approximation of real numbers by rational numbers, generalizations of this concept and various applications to problems in number
More information= (w 0 + w x t Up^t 9 ' 1 )-. A. "0
5hk MINIMUM PERIODS MODULO n FOR BERNOULLI NUMBERS [Dec. for some nonzero integer U. Finally, u 0 = u p, and u n \u 0 for n = 0, 1,.... VK.00^'. By Lemma 7 and the fact that {u n } is a kth order recurrent
More informationODD REPDIGITS TO SMALL BASES ARE NOT PERFECT
#A34 INTEGERS 1 (01) ODD REPDIGITS TO SMALL BASES ARE NOT PERFECT Kevin A. Broughan Department of Mathematics, University of Waikato, Hamilton 316, New Zealand kab@waikato.ac.nz Qizhi Zhou Department of
More informationELECTRICAL NETWORK THEORY AND RECURRENCE IN DISCRETE RANDOM WALKS
ELECTRICAL NETWORK THEORY AND RECURRENCE IN DISCRETE RANDOM WALKS DANIEL STRAUS Abstract This paper investigates recurrence in one dimensional random walks After proving recurrence, an alternate approach
More informationAddition sequences and numerical evaluation of modular forms
Addition sequences and numerical evaluation of modular forms Fredrik Johansson (INRIA Bordeaux) Joint work with Andreas Enge (INRIA Bordeaux) William Hart (TU Kaiserslautern) DK Statusseminar in Strobl,
More informationConditional Simulation of Random Fields by Successive Residuals 1
Mathematical Geology, Vol 34, No 5, July 2002 ( C 2002) Conditional Simulation of Random Fields by Successive Residuals 1 J A Vargas-Guzmán 2,3 and R Dimitrakopoulos 2 This paper presents a new approach
More informationRegular Sequences. Eric Rowland. School of Computer Science University of Waterloo, Ontario, Canada. September 5 & 8, 2011
Regular Sequences Eric Rowland School of Computer Science University of Waterloo, Ontario, Canada September 5 & 8, 2011 Eric Rowland (University of Waterloo) Regular Sequences September 5 & 8, 2011 1 /
More informationFull file at
INSTRUCTOR S SOLUTIONS MANUAL to accompany ELEMENTARY NUMBER THEORY AND ITS APPLICATIONS FIFTH EDITION Bart Goddard Kenneth H. Rosen AT&T Labs This work is protected by United States copyright laws and
More informationAN UPPER BOUND FOR THE SUM EStf+i f(n)
proceedings of the american mathematical society Volume 114, Number 1, January 1992 AN UPPER BOUND FOR THE SUM EStf+i f(n) FOR A CERTAIN CLASS OF FUNCTIONS / EDWARD DOBROWOLSKJ AND KENNETH S. WILLIAMS
More informationProofs Not Based On POMI
s Not Based On POMI James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University February 1, 018 Outline Non POMI Based s Some Contradiction s Triangle
More informationSequences and Summations
COMP 182 Algorithmic Thinking Sequences and Summations Luay Nakhleh Computer Science Rice University Chapter 2, Section 4 Reading Material Sequences A sequence is a function from a subset of the set of
More informationDefinition: A sequence is a function from a subset of the integers (usually either the set
Math 3336 Section 2.4 Sequences and Summations Sequences Geometric Progression Arithmetic Progression Recurrence Relation Fibonacci Sequence Summations Definition: A sequence is a function from a subset
More informationConstruction of latin squares of prime order
Construction of latin squares of prime order Theorem. If p is prime, then there exist p 1 MOLS of order p. Construction: The elements in the latin square will be the elements of Z p, the integers modulo
More informationMath Tool: Dot Paper. Reproducible page, for classroom use only Triumph Learning, LLC
Math Tool: Dot Paper A Reproducible page, for classroom use only. 0 Triumph Learning, LLC CC_Mth_G_TM_PDF.indd /0/ : PM Math Tool: Coordinate Grid y 7 0 9 7 0 9 7 0 7 9 0 7 9 0 7 x Reproducible page, for
More informationPUTNAM TRAINING EASY PUTNAM PROBLEMS
PUTNAM TRAINING EASY PUTNAM PROBLEMS (Last updated: September 24, 2018) Remark. This is a list of exercises on Easy Putnam Problems Miguel A. Lerma Exercises 1. 2017-A1. Let S be the smallest set of positive
More informationAutomorphism Groups Definition. An automorphism of a group G is an isomorphism G G. The set of automorphisms of G is denoted Aut G.
Automorphism Groups 9-9-2012 Definition. An automorphism of a group G is an isomorphism G G. The set of automorphisms of G is denoted Aut G. Example. The identity map id : G G is an automorphism. Example.
More information2 BAMO 2015 Problems and Solutions February 26, 2015
17TH AY AREA MATHEMATIAL OLYMPIAD PROLEMS AND SOLUTIONS A: There are 7 boxes arranged in a row and numbered 1 through 7. You have a stack of 2015 cards, which you place one by one in the boxes. The first
More informationELEMENTARY PROBLEMS AND SOLUTIONS. Edited by Stanley Rabinowitz
Edited by Stanley Rabinowitz IMPORTANT NOTICE: There is a new editor of this department and a new address for all submissions. Please send all material for ELEMENTARY PROBLEMS AND SOLUTIONS to DR. STANLEY
More informationAlpha Sequences & Series MAΘ National Convention 2018
. B. The series adds even numbers as the series progresses, defined as each term a n = a n- +2(n-). Therefore, the next term is 43+2(8-) = 57. 2. A. If we take the given series and find the differences
More informationCongruences of Restricted Partition Functions
Rose-Hulman Institute of Technology Rose-Hulman Scholar Mathematical Sciences Technical Reports (MSTR) Mathematics 6-2002 Congruences of Restricted Partition Functions Matthew Culek Amanda Knecht Advisors:
More informationEdge-N eighbor-integrity of Trees. Department of Mathematics Northeastern University Boston, MA 02115, USA
Australasian Journal of Combinato'rics 10( 1994). 00.163-174 Edge-N eighbor-integrity of Trees Margaret B. Cozzens* t & Shu-Shih Y. Wu Department of Mathematics Northeastern University Boston, MA 02115,
More informationO Notation (Big Oh) We want to give an upper bound on the amount of time it takes to solve a problem.
O Notation (Big Oh) We want to give an upper bound on the amount of time it takes to solve a problem. defn: v(n) = O(f(n)) constants c and n 0 such that v(n) c f(n) whenever n > n 0 Termed complexity:
More informationPUTNAM TRAINING NUMBER THEORY. Exercises 1. Show that the sum of two consecutive primes is never twice a prime.
PUTNAM TRAINING NUMBER THEORY (Last updated: December 11, 2017) Remark. This is a list of exercises on Number Theory. Miguel A. Lerma Exercises 1. Show that the sum of two consecutive primes is never twice
More informationThe Corrected Trial Solution in the Method of Undetermined Coefficients
Definition of Related Atoms The Basic Trial Solution Method Symbols Superposition Annihilator Polynomial for f(x) Annihilator Equation for f(x) The Corrected Trial Solution in the Method of Undetermined
More informationMathematical Induction
Mathematical Induction MAT30 Discrete Mathematics Fall 018 MAT30 (Discrete Math) Mathematical Induction Fall 018 1 / 19 Outline 1 Mathematical Induction Strong Mathematical Induction MAT30 (Discrete Math)
More informationWhat can you prove by induction?
MEI CONFERENCE 013 What can you prove by induction? Martyn Parker M.J.Parker@keele.ac.uk Contents Contents iii 1 Splitting Coins.................................................. 1 Convex Polygons................................................
More informationELEMENTS OF NUMBER THEORY
ELEMENTS OF NUMBER THEORY Examination corner 1 one mark question in part A 1 - two mark question in part B 1 five mark OR 3mark+2 mark question in part C 1 two or four mark question in part E concepts
More informationIntroduction to Number Theory
INTRODUCTION Definition: Natural Numbers, Integers Natural numbers: N={0,1,, }. Integers: Z={0,±1,±, }. Definition: Divisor If a Z can be writeen as a=bc where b, c Z, then we say a is divisible by b or,
More informationExercises Exercises. 2. Determine whether each of these integers is prime. a) 21. b) 29. c) 71. d) 97. e) 111. f) 143. a) 19. b) 27. c) 93.
Exercises Exercises 1. Determine whether each of these integers is prime. a) 21 b) 29 c) 71 d) 97 e) 111 f) 143 2. Determine whether each of these integers is prime. a) 19 b) 27 c) 93 d) 101 e) 107 f)
More informationAND THEIR APPLICATIONS. MALVINA BAICA Marshall University, Huntington WV (Submitted June 1982) INTRODUCTION. * («).= E (-!
n-dimensional FIBONACCI NUMBERS AND THEIR APPLICATIONS MALVINA BAICA Marshall University, Huntington WV 25701 (Submitted June 1982) INTRODUCTION In one of his papers [3] Bernstein investigated the Fin)
More informationPower Series Solutions We use power series to solve second order differential equations
Objectives Power Series Solutions We use power series to solve second order differential equations We use power series expansions to find solutions to second order, linear, variable coefficient equations
More informationPartition Congruences in the Spirit of Ramanujan
Partition Congruences in the Spirit of Ramanujan Yezhou Wang School of Mathematical Sciences University of Electronic Science and Technology of China yzwang@uestc.edu.cn Monash Discrete Mathematics Research
More informationHere, logx denotes the natural logarithm of x. Mrsky [7], and later Cheo and Yien [2], proved that iz;.(»)=^io 8 "0(i).
Curtis Cooper f Robert E* Kennedy, and Milo Renberg Dept. of Mathematics, Central Missouri State University, Warrensburg, MO 64093-5045 (Submitted January 1997-Final Revision June 1997) 0. INTRODUCTION
More informationA PROPERTY OF CERTAIN SQUARES
I! A PROPERTY OF CERTAIN SQUARES TR95-00 JOHN H. HALTON University of North Carolina Chapel Hill, NC Department of Computer Science CB #375, Sitterson Hall UNC-Chapel Hill Chapel Hill, NC 7599-375 UNC
More informationA L A BA M A L A W R E V IE W
A L A BA M A L A W R E V IE W Volume 52 Fall 2000 Number 1 B E F O R E D I S A B I L I T Y C I V I L R I G HT S : C I V I L W A R P E N S I O N S A N D TH E P O L I T I C S O F D I S A B I L I T Y I N
More informationHIGHER-ORDER DIFFERENCES AND HIGHER-ORDER PARTIAL SUMS OF EULER S PARTITION FUNCTION
ISSN 2066-6594 Ann Acad Rom Sci Ser Math Appl Vol 10, No 1/2018 HIGHER-ORDER DIFFERENCES AND HIGHER-ORDER PARTIAL SUMS OF EULER S PARTITION FUNCTION Mircea Merca Dedicated to Professor Mihail Megan on
More informationPrime Numbers and Irrational Numbers
Chapter 4 Prime Numbers and Irrational Numbers Abstract The question of the existence of prime numbers in intervals is treated using the approximation of cardinal of the primes π(x) given by Lagrange.
More informationColloq. Math. 145(2016), no. 1, ON SOME UNIVERSAL SUMS OF GENERALIZED POLYGONAL NUMBERS. 1. Introduction. x(x 1) (1.1) p m (x) = (m 2) + x.
Colloq. Math. 145(016), no. 1, 149-155. ON SOME UNIVERSAL SUMS OF GENERALIZED POLYGONAL NUMBERS FAN GE AND ZHI-WEI SUN Abstract. For m = 3, 4,... those p m (x) = (m )x(x 1)/ + x with x Z are called generalized
More informationENHANCING THE CONCEPTUAL UNDERSTANDING OF SEQUENCES AND SERIES WITH TECHNOLOGY. Jay L. Schiffman. Rowan University. 201 Mullica Hill Road
ENHANCING THE CONCEPTUAL UNDERSTANDING OF SEQUENCES AND SERIES WITH TECHNOLOGY Jay L. Schiffman Rowan University 20 Mullica Hill Road Glassboro, NJ 08028-70 schiffman@rowan.edu Abstract: The TI-89 and
More informationNamed numbres. Ngày 25 tháng 11 năm () Named numbres Ngày 25 tháng 11 năm / 7
Named numbres Ngày 25 tháng 11 năm 2011 () Named numbres Ngày 25 tháng 11 năm 2011 1 / 7 Fibonacci, Catalan, Stirling, Euler, Bernoulli Many sequences are famous. 1 1, 2, 3, 4,... the integers. () Named
More informationTHE I Establiifrad June, 1893
89 : 8 Y Y 2 96 6 - - : - 2 q - 26 6 - - q 2 2 2 4 6 4«4 ' V () 8 () 6 64-4 '2" () 6 ( ) * 'V ( 4 ) 94-4 q ( / ) K ( x- 6% j 9*V 2'%" 222 27 q - - K 79-29 - K x 2 2 j - -% K 4% 2% 6% ' K - 2 47 x - - j
More informationcongruences Shanghai, July 2013 Simple proofs of Ramanujan s partition congruences Michael D. Hirschhorn
s s m.hirschhorn@unsw.edu.au Let p(n) be the number of s of n. For example, p(4) = 5, since we can write 4 = 4 = 3+1 = 2+2 = 2+1+1 = 1+1+1+1 and there are 5 such representations. It was known to Euler
More informationSolutions to the Olympiad Maclaurin Paper
s to the Olympiad Maclaurin Paper M1. The positive integer N has five digits. The six-digit integer Pis formed by appending the digit 2 to the front of N. The six-digit integer Q is formed by appending
More informationarxiv: v1 [math.nt] 20 Mar 2017
On certain ratios regarding integer numbers which are both triangulars and squares arxiv:1703.06701v1 [math.nt] 0 Mar 017 Fabio Roman Abstract We investigate integer numbers which possess at the same time
More informationExercise 2.2. Find (with proof) all rational points on the curve y = 2 x.
Exercise 2.2. Find (with proof) all rational points on the curve y = 2 x. Exercise 2.4: Prove that for any integer n 0, e n is not a rational number. Exercise 2.5: Prove that the only rational point on
More informationPolynomial expansions in the Borel region
Polynomial expansions in the Borel region By J. T. HURT and L. R. FORD, Rice Institute, Houston, Texas. (Received 22nd August, 1936. Read 6th November, 1936.) This paper deals with certain expansions of
More informationUSING SHANKS BABY-STEP GIANT-STEP METHOD TO SOLVE THE GENERALIZED PELL EQUATION x 2 Dy 2 = N. Copyright 2009 by John P. Robertson. 1.
USING SHANKS BABY-STEP GIANT-STEP METHOD TO SOLVE THE GENERALIZED PELL EQUATION x 2 Dy 2 = N Abstract. For D > 0 not a square, and N 0, the continued fraction algorithm can be used to solve the generalized
More informationThe Birch & Swinnerton-Dyer conjecture. Karl Rubin MSRI, January
The Birch & Swinnerton-Dyer conjecture Karl Rubin MSRI, January 18 2006 Outline Statement of the conjectures Definitions Results Methods Birch & Swinnerton-Dyer conjecture Suppose that A is an abelian
More informationSeries Solutions. 8.1 Taylor Polynomials
8 Series Solutions 8.1 Taylor Polynomials Polynomial functions, as we have seen, are well behaved. They are continuous everywhere, and have continuous derivatives of all orders everywhere. It also turns
More informationRANDOM FIBONACCI-TYPE SEQUENCES
R. DAWSON, G. GABOR, R. NOWAKOWSKI, D, WIENS Dalhousie University, Halifax, Nova Scotia (Submitted December 1983) 1, INTRODUCTION In t h i s p a p e r, we s h a l l study s e v e r a l random v a r i a
More informationENJOY ALL OF YOUR SWEET MOMENTS NATURALLY
ENJOY ALL OF YOUR SWEET MOMENTS NATURALLY I T R Fily S U Wi Av I T R Mkr f Sr I T R L L All-Nrl Sr N Yrk, NY (Mr 202) Crl Pki Cr., kr f Sr I T R Svi I T R v x ll-rl I T R fily f r il Av I T R, 00% ri v
More informationOn the Equivalence of OKID and Time Series Identification for Markov-Parameter Estimation
On the Equivalence of OKID and Time Series Identification for Markov-Parameter Estimation P V Albuquerque, M Holzel, and D S Bernstein April 5, 2009 Abstract We show the equivalence of Observer/Kalman
More informationCool theorems proved by undergraduates
Cool theorems proved by undergraduates Ken Ono Emory University Child s play... Child s play... Thanks to the, Child s play... Thanks to the, undergrads and I play by... Child s play... Thanks to the,
More information= 1 2x. x 2 a ) 0 (mod p n ), (x 2 + 2a + a2. x a ) 2
8. p-adic numbers 8.1. Motivation: Solving x 2 a (mod p n ). Take an odd prime p, and ( an) integer a coprime to p. Then, as we know, x 2 a (mod p) has a solution x Z iff = 1. In this case we can suppose
More information