DOCSLIB.ORG

Figurate Numbers

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Figurate Numbers Chapter 25 Figurate numbers 25.1 Triangular numbers 1 The nth triangular number is Tn =1+2+3+ + n = 2 n(n + 1). The first few of these are 1, 3, 6, 10, 15, 21, 28,···36, 45, 55, ... 25.1.1 Palindromic triangular numbers n Tn n Tn n Tn 1 1 109 5995 3185 5073705 2 3 132 8778 3369 5676765 3 6 173 15051 3548 6295926 10 55 363 66066 8382 35133153 11 66 1111 617716 11088 61477416 18 171 1287 828828 18906 178727871 34 595 1593 1269621 57166 1634004361 36 666 1833 1680861 102849 5289009825 77 3003 2662 3544453 111111 6172882716 902 Figurate numbers 25.2 Pentagonal numbers The pentagonal numbers are the sums of the arithmetic progression 1+4+7+ + (3n 2) + ··· − ··· 1 The nth pentagonal number is Pn = n(3n 1). 2 − 25.2.1 Palindromic pentagonal numbers n Pn n Pn n Pn 1 1 101 12521 6010 54177145 2 5 693 720027 26466 1050660501 4 22 2173 7081807 26906 1085885801 26 1001 2229 7451547 31926 1528888251 44 2882 4228 26811862 44059 2911771192 25.3 The polygonal numbers Pk,n More generally, for a fixed k, the k-gonal numbers are the sums of the arithmetic progression 1+(k 1) + (2k 3) + . The nth k-gonal 1 − − ··· number is Pk,n = n((k 2)n (k 4)). 2 − − − 25.4 Which triangular numbers are squares? 903 Exercise 1 + 2 =3, 4+5+6=7+8, 9 + 10 + 11 + 12 =13 + 14 + 15, 16 + 17 + 18 + 19 + 20 =21 + 22 + 23 + 24, . 25.4 Which triangular numbers are squares? Which triangular numbers are squares ? Suppose the k th triangular 1 2 1 − 2 number Tk = 2 k(k+1) is the square of n. n = 2 k(k+1); 4k +4k+1 = 8n2 + 1; (2k + 1)2 8n2 = 1. The smallest positive solution of the Pell 2 2 − equation x 8y = 1 being (3, 1), we have the solutions (ki, ni) of the equation given− by 2ki+1 + 1 = 3(2ki + 1) + 8ni, ni+1 = (2ki + 1) + 3ni, k0 = 1, n0 = 1. This means ki+1 = 3ki + 4ni + 1, ni+1 = 2ki + 3ni + 1, k0 = 1, n0 = 1. The beginning values of k and n are as follows. i 012345 6 7 8 9 10 ... ki 1 8 49 288 1681 9800 57121 332928 1940449 11309768 65918161 ... ni 1 6 35 204 1189 6930 40391 235416 1372105 7997214 46611179 ... Chapter 26 Sums of consecutive squares 26.1 Sum of squares of natural numbers Theorem 26.1. 1 12 + 22 + 32 + + n2 = n(n + 1)(2n + 1). ··· 6 1 Proof. Let Tn =1+2+3 + n = n(n + 1) and ··· 2 2 2 2 2 Sn = 1 + 2 + 3 + + n . ··· 23 = 13 + 3 12 + 3 1 + 1 33 = 23 + 3 · 22 + 3 · 2 + 1 43 = 33 + 3 · 32 + 3 · 3 + 1 . · · . n3 = (n 1)3 + 3(n 1)2 + 3(n 1) + 1 (n + 1)3 = −n3 + 3 −n2 + 3 −n + 1 · · Combining these equations, we have 3 3 (n + 1) = 1 + 3Sn + 3Tn + n. Since Tn is known, we have 1 3 3 1 Sn = (n + 1) n 1 n(n + 1) = n(n + 1)(2n + 1). 3 − − − 2 6 906 Sums of consecutive squares Exercise (1) Find 12 + 32 + 52 + + (2n 1)2. (2) ··· − 32 + 42 =52, 102 + 112 + 122 =132 + 142, 212 + 222 + 232 + 242 =252 + 262 + 272, 362 + 372 + 382 + 392 + 402 =412 + 422 + 432 + 442, . 26.2 Sums of powers of consecutive integers Consider the sum of the k-powers of the first natural numbers: k k k Sk(n) := 1 + 2 + + n . ··· Theorem 26.2 (Bernoulli). Sk(n) is a polynomial in n of degree k + 1 without constant term. It can be obtained recursively as Sk+1(n)= (k + 1)Sk(n)dn + cn, Z where c is determined by the condition that the sum of the coefficients is 1. Examples 1 (1) S2(n)= 6 n(n + 1)(2n + 1). (2) S (n) = 13 + 23 + + n3 = 1 n2(n + 1)2. 3 ··· 4 (3) S (n)= 1 n5 + 1 n4 + 1 n3 1 n. 4 5 2 3 − 30 Exercise Show that 1k + 2k + + nk =(1+2+ + n)p ··· ··· for all integers n if and only if (k,p)=(1, 1) or (3, 2). 1 1Math. Mag. 82:1 (2009) 64, 67. Chapter 27 Counting triangles 27.1 An equilateral triangle cut up into smaller equi- lateral triangles Let T (n) be the number of triangles in an equilateral lattice of order n. Consider this as resulting from a lattice of order n 1 by adding a new base line of length n. There are two new types of triangles− added: (1) Upright ones with bases along the bottom line: since there are n+1 n + 1 points, there are 2 such triangles. (2) Inverted ones with exactly one vertex on the new base line: there are 1+2+ +2+1 such triangles. ··· n 1 terms − n + 1 | T (n{z)= T (n } 1) + +1+2+ +2+1 . − 2 ··· n 1 terms − | {z } 908 Counting triangles For example, 4 T (3) = T (2) + +1+1=5+6+2=13, 2 5 T (4) = T (3) + +1+2+1=13+10+4=27, 2 6 T (5) = T (4) + +1+2+2+1=27+15+6=48. 2 Exercise The palindromic sum 1+2+ +2+1, first increasing steadily by 1 ··· n 1 terms − 2 n εn and then decreasing by 1, is equal to − , where | {z 4 } 1, if n is odd, εn = . (0, if n is even. 2 n + 1 n εn T (n)= T (n 1) + + − − 2 4 2 3n + 2n εn = T (n 1) + − − 4 n 2 3k + 2k εk = − 4 k X=1 1 n(n + 1)(2n +1)+ n(n + 1) n+εn = 2 − 2 4 n(n + 2)(2n + 1) εn = − . 8 Here are some of the beginning values: n 1 2 3 4 5 6 7 8 9 10 11 12 T (n) 1 5 13 27 48 78 118 170 235 315 411 525 ··· ··· Exercise How many parallelograms are there? 27.2 Scalene triangles of sidelengths n 909 ≤ 27.2 Scalene triangles of sidelengths n ≤ How many different triangles can be formed from n straight rods of lengths 1, 2, 3,... n units ? We begin with some small cases. For n = 3, the lengths 1, 2, 3 clearly do not form a triangle. The answer is 0. For n = 4, the only possible triangle has lengths 2, 3, 4. The answer is 1. Note that because of the triangle inequality, 1 cannot be used as the length of a side. If we denote by vn the number of triangles can be formed from n straight rods of lengths 1, 2, 3, ... n units, then, v3 = 0, v4 = 1. More generally, vn+1 = vn+ number of triangles with longest side n + 1 (and the other two sides unequal). Let this latter number be wn. That is, wn is the number of pairs (a, b) with a < b n such that a + b > n + 1. ≤ If we know w3,..., wn 1, then from − v3 =0, v4 =v3 + w3, v5 =v4 + w4, . vn 1 =vn 2 + wn 2, − − − vn =vn 1 + wn 1, − − by addition, we get vn = w3 + w4 + + wn 2 + wn 1. ··· − − These w’s are easier to find. Think of (a, b) as a point in the square of lattice points with positive integer coordinates n. Note that wn is the number of points above the diagonals. This is one≤ quarter of the number of points in the square, less those on the two diagonals. There are 2n or 2n 1 points on the two diagonals, according as n is even or odd. − If we write this number (of points on the two diagonals) as 2n 1+εn, − with εn = 1 or 0 according as n is even or odd, then 1 2 1 2 wn = n (2n 1) εn = (n 1) εn . 4 − − − 4 − − 910 Counting triangles Now, vn = w3 + w4 + + wn 2 + wn 1 ··· − − 1 2 2 2 1 = 2 + 3 + +(n 2) (ε3 + ε4 + + εn 1) 4 ··· − − 4 ··· − 1 1 n 3 = (n 3)(2n2 3n + 4) − . 4 6 − − − ⌊ 2 ⌋ This can also be put into the form 1 (n 3)(n 1)(2n 1) v = − − − . n 4 6 Here are the beginning values: n 3 4 5 6 7 8 9 10 11 12 13 14 ··· vn 0 1 3 7 13 22 34 50 70 95 125 161 ··· 27.2 Scalene triangles of sidelengths n 911 ≤ Exercise (1) In the following diagram, there are n small squares along each row and each column. How many squares of all sizes are there? (2) In the following diagram, there are a small squares along each column and b small squares along each row. Given a b, how many squares of all sizes are there? ≤.
Load more

Recommended publications
  • Triangular Numbers /, 3,6, 10, 15, ", Tn,'" »*"
    TRIANGULAR NUMBERS V.E. HOGGATT, JR., and IVIARJORIE BICKWELL San Jose State University, San Jose, California 9111112 1. INTRODUCTION To Fibonacci is attributed the arithmetic triangle of odd numbers, in which the nth row has n entries, the cen- ter element is n* for even /?, and the row sum is n3. (See Stanley Bezuszka [11].) FIBONACCI'S TRIANGLE SUMS / 1 =:1 3 3 5 8 = 2s 7 9 11 27 = 33 13 15 17 19 64 = 4$ 21 23 25 27 29 125 = 5s We wish to derive some results here concerning the triangular numbers /, 3,6, 10, 15, ", Tn,'" »*". If one o b - serves how they are defined geometrically, 1 3 6 10 • - one easily sees that (1.1) Tn - 1+2+3 + .- +n = n(n±M and (1.2) • Tn+1 = Tn+(n+1) . By noticing that two adjacent arrays form a square, such as 3 + 6 = 9 '.'.?. we are led to 2 (1.3) n = Tn + Tn„7 , which can be verified using (1.1). This also provides an identity for triangular numbers in terms of subscripts which are also triangular numbers, T =T + T (1-4) n Tn Tn-1 • Since every odd number is the difference of two consecutive squares, it is informative to rewrite Fibonacci's tri- angle of odd numbers: 221 222 TRIANGULAR NUMBERS [OCT. FIBONACCI'S TRIANGLE SUMS f^-O2) Tf-T* (2* -I2) (32-22) Ti-Tf (42-32) (52-42) (62-52) Ti-Tl•2 (72-62) (82-72) (9*-82) (Kp-92) Tl-Tl Upon comparing with the first array, it would appear that the difference of the squares of two consecutive tri- angular numbers is a perfect cube.
    [Show full text]
  • Integer Partitions
    12 PETER KOROTEEV Remark. Note that out n! fixed points of T acting on Xn only for single point q we 12 PETER KOROTEEV get a polynomial out of Vq.Othercoefficient functions Vp remain infinite series which we 12shall further ignore. PETER One KOROTEEV can verify by examining (2.25) that in the n limit these Remark. Note that out n! fixed points of T acting on Xn only for single point q we coefficient functions will be suppressed. A choice of fixed point q following!1 the large-n limits get a polynomial out of Vq.Othercoefficient functions Vp remain infinite series which we Remark. Note thatcorresponds out n! fixed to zooming points of intoT aacting certain on asymptoticXn only region for single in which pointa q we a shall further ignore. One can verify by examining (2.25) that in the n | Slimit(1)| these| S(2)| ··· get a polynomial out ofaVSq(n.Othercoe) ,whereS fficientSn is functionsa permutationVp remain corresponding infinite to series the choice!1 which of we fixed point q. shall furthercoe ignore.fficient functions One| can| will verify be suppressed. by2 examining A choice (2.25 of) that fixed in point theqnfollowinglimit the large- thesen limits corresponds to zooming into a certain asymptotic region in which a!1 a coefficient functions will be suppressed. A choice of fixed point q following| theS(1) large-| | nSlimits(2)| ··· aS(n) ,whereS Sn is a permutation corresponding to the choice of fixed point q. q<latexit sha1_base64="gqhkYh7MBm9GaiVNDBxVo5M1bBY=">AAAB8HicbVBNS8NAEN3Ur1q/qh69LBbBU0lEUG9FLx4rWFtsQ9lsJ+3SzSbuTsQS+i+8eFDx6s/x5r9x2+agrQ8GHu/NMDMvSKQw6LrfTmFpeWV1rbhe2tjc2t4p7+7dmTjVHBo8lrFuBcyAFAoaKFBCK9HAokBCMxheTfzmI2gjYnWLowT8iPWVCAVnaKX7DsITBmH2MO6WK27VnYIuEi8nFZKj3i1/dXoxTyNQyCUzpu25CfoZ0yi4hHGpkxpIGB+yPrQtVSwC42fTi8f0yCo9GsbalkI6VX9PZCwyZhQFtjNiODDz3kT8z2unGJ77mVBJiqD4bFGYSooxnbxPe0IDRzmyhHEt7K2UD5hmHG1IJRuCN//yImmcVC+q3s1ppXaZp1EkB+SQHBOPnJEauSZ10iCcKPJMXsmbY5wX5935mLUWnHxmn/yB8/kDhq2RBA==</latexit>
    [Show full text]
  • 1 + 4 + 7 + 10 = 22;... the Nth Pentagonal Number Is Therefore
    CHAPTER 6 1. The pentagonal numbers are 1; 1 + 4 = 5; 1 + 4 + 7 = 12; 1 + 4 + 7 + 10 = 22;... The nth pentagonal number is therefore n 1 2 − n(n 1) 3n n (3i +1) = n + 3 − = − . i 2 ! 2 X=0 Similarly, since the hexagonal numbers are 1; 1+5 = 6; 1+5+9 = 15; 1+5+9+13 = 28;... it follows that the nth hexagonal number is n 1 − n(n 1) (4i +1) = n + 4 − = 2n2 n. i 2 ! − X=0 2. The pyramidal numbers with triangular base are 1; 1+3 = 4; 1+3+6 = 10; 1+3+6+10 = 20; ... Therefore the nth pyramidal number with triangular base is n n k(k + 1) 1 1 n(n + 1)(2n + 1) n(n + 1) = (k2 + k)= + k 2 2 k 2 " 6 2 # X=1 X=1 . n(n + 1) 2n + 1 1 n(n + 1)(n + 2) = + = 2 6 2 6 The pyramidal numbers with square base are 1; 1+4 = 5; 1+4+9 = 14; 1+4+9+16= 30;... Thus the nth pyramidal number with square base is given by the sum of the squares from 1 to n, namely, n(n + 1)(2n + 1) . 6 3. In a harmonic proportion, c : a =(c b):(b a). It follows that ac ab = bc ac or that b(a + c) = 2ac. Thus the sum of− the extremes− multiplied by the mean− equals− twice the product of the extremes. 4. Since 6:3=(5 3) : (6 5), the numbers 3, 5, 6 are in subcontrary proportion.
    [Show full text]
  • PENTAGONAL NUMBERS in the PELL SEQUENCE and DIOPHANTINE EQUATIONS 2X2 = Y2(3Y -1) 2 ± 2 Ve Siva Rama Prasad and B
    PENTAGONAL NUMBERS IN THE PELL SEQUENCE AND DIOPHANTINE EQUATIONS 2x2 = y2(3y -1) 2 ± 2 Ve Siva Rama Prasad and B. Srlnivasa Rao Department of Mathematics, Osmania University, Hyderabad - 500 007 A.P., India (Submitted March 2000-Final Revision August 2000) 1. INTRODUCTION It is well known that a positive integer N is called a pentagonal (generalized pentagonal) number if N = m(3m ~ 1) 12 for some integer m > 0 (for any integer m). Ming Leo [1] has proved that 1 and 5 are the only pentagonal numbers in the Fibonacci sequence {Fn}. Later, he showed (in [2]) that 2, 1, and 7 are the only generalized pentagonal numbers in the Lucas sequence {Ln}. In [3] we have proved that 1 and 7 are the only generalized pentagonal numbers in the associated Pell sequence {Qn} delned by Q0 = Qx = 1 and Qn+2 = 2Qn+l + Q„ for n > 0. (1) In this paper, we consider the Pell sequence {PJ defined by P 0 =0,P 1 = 1, and Pn+2=2Pn+l+Pn for«>0 (2) and prove that P±l, P^, P4, and P6 are the only pentagonal numbers. Also we show that P0, P±1, P2, P^, P4, and P6 are the only generalized pentagonal numbers. Further, we use this to solve the Diophantine equations of the title. 2. PRELIMINARY RESULTS We have the following well-known properties of {Pn} and {Qn}: for all integers m and n, a a + pn = "-P" a n d Q = " P" w herea = 1 + V2 and p = 1-V2, (3) l P_„ = {-\r Pn and Q_„ = (-l)"Qn, (4) a2 = 2P„2+(-iy, (5) 2 2 e3„=a(e„ +6P„ ), (6> ^ + n = 2PmG„-(-l)"Pm_„.
    [Show full text]
  • Figurate Numbers
    Figurate Numbers by George Jelliss June 2008 with additions November 2008 Visualisation of Numbers The visual representation of the number of elements in a set by an array of small counters or other standard tally marks is still seen in the symbols on dominoes or playing cards, and in Roman numerals. The word "calculus" originally meant a small pebble used to calculate. Bear with me while we begin with a few elementary observations. Any number, n greater than 1, can be represented by a linear arrangement of n counters. The cases of 1 or 0 counters can be regarded as trivial or degenerate linear arrangements. The counters that make up a number m can alternatively be grouped in pairs instead of ones, and we find there are two cases, m = 2.n or 2.n + 1 (where the dot denotes multiplication). Numbers of these two forms are of course known as even and odd respectively. An even number is the sum of two equal numbers, n+n = 2.n. An odd number is the sum of two successive numbers 2.n + 1 = n + (n+1). The even and odd numbers alternate. Figure 1. Representation of numbers by rows of counters, and of even and odd numbers by various, mainly symmetric, formations. The right-angled (L-shaped) formation of the odd numbers is known as a gnomon. These do not of course exhaust the possibilities. 1 2 3 4 5 6 7 8 9 n 2 4 6 8 10 12 14 2.n 1 3 5 7 9 11 13 15 2.n + 1 Triples, Quadruples and Other Forms Generalising the divison into even and odd numbers, the counters making up a number can of course also be grouped in threes or fours or indeed any nonzero number k.
    [Show full text]
  • TRIANGULAR REPUNIT—THERE IS but 1 a Repunit Is Any Integer That
    Czechoslovak Mathematical Journal, 60 (135) (2010), 1075–1077 TRIANGULAR REPUNIT—THERE IS BUT 1 John H. Jaroma, Ave Maria (Received June 27, 2009) Abstract. In this paper, we demonstrate that 1 is the only integer that is both triangular and a repunit. Keywords: repunit, triangular number MSC 2010 : 11A99 A repunit is any integer that can be written in decimal notation as a string of 1’s. Examples include 1, 11, 111, 1111, 11111,... Furthermore, if we denote rn to be the nth repunit then it follows that 10n − 1 (1) rn = . 9 Triangular numbers are those integers that can be represented by the number of dots evenly arranged in an equilateral triangle. More specifically, they are the numbers 1, 3, 6, 10, 15,... It follows that the nth triangular number, tn is the sum of the first n consecutive integers beginning with 1. In particular, for n > 1 n(n + 1) (2) tn = . 2 Now, the number 1 is both triangular and a repunit. It is the objective of this note to illustrate that 1 is the only such number. To this end, we state and prove the following lemma. It incorporates a result that [1] asserts had been known by the early Pythagoreans. Appearing in Platonic Questions, Plutarch states that eight times any triangular number plus one is a square. The result is actually necessary and sufficient. We demonstrate it as such here. 1075 Lemma. The integer n is triangular if and only if 8n +1 is a square. Proof. If n = tn, then by (2), n(n + 1) 8 +1=4n2 +4n +1=(2n + 1)2.
    [Show full text]
  • PELL FACTORIANGULAR NUMBERS Florian Luca, Japhet Odjoumani
    PUBLICATIONS DE L’INSTITUT MATHÉMATIQUE Nouvelle série, tome 105(119) (2019), 93–100 DOI: https://doi.org/10.2298/PIM1919093L PELL FACTORIANGULAR NUMBERS Florian Luca, Japhet Odjoumani, and Alain Togbé Abstract. We show that the only Pell numbers which are factoriangular are 2, 5 and 12. 1. Introduction Recall that the Pell numbers Pm m> are given by { } 1 αm βm P = − , for all m > 1, m α β − where α =1+ √2 and β =1 √2. The first few Pell numbers are − 1, 2, 5, 12, 29, 70, 169, 408, 985, 2378, 5741, 13860, 33461, 80782, 195025,... Castillo [3], dubbed a number of the form Ftn = n!+ n(n + 1)/2 for n > 1 a factoriangular number. The first few factoriangular numbers are 2, 5, 12, 34, 135, 741, 5068, 40356, 362925,... Luca and Gómez-Ruiz [8], proved that the only Fibonacci factoriangular numbers are 2, 5 and 34. This settled a conjecture of Castillo from [3]. In this paper, we prove the following related result. Theorem 1.1. The only Pell numbers which are factoriangular are 2, 5 and 12. Our method is similar to the one from [8]. Assuming Pm = Ftn for positive integers m and n, we use a linear forms in p-adic logarithms to find some bounds on m and n. The resulting bounds are large so we run a calculation to reduce the bounds. This computation is highly nontrivial and relates on reducing the diophantine equation Pm = Ftn modulo the primes from a carefully selected finite set of suitable primes. 2010 Mathematics Subject Classification: Primary 11D59, 11D09, 11D7; Secondary 11A55.
    [Show full text]
  • Patterns in Figurate Sequences
    Patterns in Figurate Sequences Concepts • Numerical patterns • Figurate numbers: triangular, square, pentagonal, hexagonal, heptagonal, octagonal, etc. • Closed form representation of a number sequence • Function notation and graphing • Discrete and continuous data Materials • Chips, two-color counters, or other manipulatives for modeling patterns • Student activity sheet “Patterns in Figurate Sequences” • TI-73 EXPLORER or TI-83 Plus/SE Introduction Mathematics has been described as the “science of patterns.” Patterns are everywhere and may appear as geometric patterns or numeric patterns or both. Figurate numbers are examples of patterns that are both geometric and numeric since they relate geometric shapes of polygons to numerical patterns. In this activity you will analyze, extend, and describe patterns involving figurate numbers and make connections between numeric and geometric representations of patterns. PTE: Algebra Page 1 © 2003 Teachers Teaching With Technology Patterns in Figurate Sequences Student Activity Sheet 1. Using chips or other manipulatives, analyze the following pattern and extend the pattern pictorially for two more terms. • • • • • • • • • • 2. Write the sequence of numbers that describes the quantity of dots above. 3. Describe this pattern in another way. 4. Extend and describe the following pattern with pictures, words, and numbers. • • • • • • • • • • • • • • 5. Analyze Table 1. Fill in each of the rows of the table. Table 1: Figurate Numbers Figurate 1st 2nd 3rd 4th 5th 6th 7th 8th nth Number Triangular 1 3 6 10 15 21 28 36 n(n+1)/2 Square 1 4 9 16 25 36 49 64 Pentagonal 1 5 12 22 35 51 70 Hexagonal 1 6 15 28 45 66 Heptagonal 1 7 18 34 55 Octagonal 1 8 21 40 Nonagonal 1 9 24 Decagonal 1 10 Undecagonal 1 ..
    [Show full text]
  • Polygonal Numbers 1
    Polygonal Numbers 1 Polygonal Numbers By Daniela Betancourt and Timothy Park Project for MA 341 Introduction to Number Theory Boston University Summer Term 2009 Instructor: Kalin Kostadinov 2 Daniela Betancourt and Timothy Park Introduction : Polygonal numbers are number representing dots that are arranged into a geometric figure. Starting from a common point and augmenting outwards, the number of dots utilized increases in successive polygons. As the size of the figure increases, the number of dots used to construct it grows in a common pattern. The most common types of polygonal numbers take the form of triangles and squares because of their basic geometry. Figure 1 illustrates examples of the first four polygonal numbers: the triangle, square, pentagon, and hexagon. Figure 1: http://www.trottermath.net/numthry/polynos.html As seen in the diagram, the geometric figures are formed by augmenting arrays of dots. The progression of the polygons is illustrated with its initial point and successive polygons grown outwards. The basis of polygonal numbers is to view all shapes and sizes of polygons as numerical values. History : The concept of polygonal numbers was first defined by the Greek mathematician Hypsicles in the year 170 BC (Heath 126). Diophantus credits Hypsicles as being the author of the polygonal numbers and is said to have came to the conclusion that the nth a-gon is calculated by 1 the formula /2*n*[2 + (n - 1)(a - 2)]. He used this formula to determine the number of elements in the nth term of a polygon with a sides. Polygonal Numbers 3 Before Hypsicles was acclaimed for defining polygonal numbers, there was evidence that previous Greek mathematicians used such figurate numbers to create their own theories.
    [Show full text]
  • Identifying Figurate Number Patterns
    Identifying Figurate Lesson 7-9 Number Patterns DATE TIME SRB 1 Draw the next three rectangular numbers. 58-61 2 a. Complete the list of the first 10 rectangular numbers. 2, 6, 12, 20, 30, 42 56,EM4_MJ2_G4_U07_L09_001A.ai 72, 90, 110 b. How did you get your answers? Sample answer: I kept multiplying the next 2 counting numbers. I knew 42 = 6 ⁎ 7, so to find the next rectangular number, I multiplied 7 ⁎ 8 = 56. 3 a. Continue the following pattern: 2 = 2 2 + 4 = 6 2 + 4 + 6 = 12 2 + 4 + 6 + 8 = 20 2 + 4 + 6 + 8 + 10 = 30 2 + 4 + 6 + 8 + 10 + 12 = 42 b. Describe the pattern. Sample answer: Each rectangular number is the sum of the even numbers in order, starting with 2. c. What pattern do you notice about the number of addends and the rectangular number? The number of addends is the same as the “number” of the rectangular number. For example, 30 is the fifth rectangular number, and it has 5 addends. d. Describe a similar pattern with square numbers. Sample answer: Each square number is the sum of the odd numbers in order, starting with 1. 1 = 1, 1 + 3 = 4, 1 + 3 + 5 = 9, 1 + 3 + 5 + 7 = 16, and so on. 252 4.OA.5, 4.NBT.6, SMP7, SMP8 Identifying Figurate Lesson 7-9 DATE TIME Number Patterns (continued) Try This 4 Triangular numbers are numbers that are the sum of consecutive counting numbers. For example, the triangular number 3 is the sum of 1 + 2, and the triangular number 6 is the sum of 1 + 2 + 3.
    [Show full text]
  • The Mathematical Beauty of Triangular Numbers
    2015 HAWAII UNIVERSITY INTERNATIONAL CONFERENCES S.T.E.A.M. & EDUCATION JUNE 13 - 15, 2015 ALA MOANA HOTEL, HONOLULU, HAWAII S.T.E.A.M & EDUCATION PUBLICATION: ISSN 2333-4916 (CD-ROM) ISSN 2333-4908 (ONLINE) THE MATHEMATICAL BEAUTY OF TRIANGULAR NUMBERS MULATU, LEMMA & ET AL SAVANNAH STATE UNIVERSITY, GEORGIA DEPARTMENT OF MATHEMATICS The Mathematical Beauty Of Triangular Numbers Mulatu Lemma, Jonathan Lambright and Brittany Epps Savannah State University Savannah, GA 31404 USA Hawaii University International Conference Abstract: The triangular numbers are formed by partial sum of the series 1+2+3+4+5+6+7….+n [2]. In other words, triangular numbers are those counting numbers that can be written as Tn = 1+2+3+…+ n. So, T1= 1 T2= 1+2=3 T3= 1+2+3=6 T4= 1+2+3+4=10 T5= 1+2+3+4+5=15 T6= 1+2+3+4+5+6= 21 T7= 1+2+3+4+5+6+7= 28 T8= 1+2+3+4+5+6+7+8= 36 T9=1+2+3+4+5+6+7+8+9=45 T10 =1+2+3+4+5+6+7+8+9+10=55 In this paper we investigate some important properties of triangular numbers. Some important results dealing with the mathematical concept of triangular numbers will be proved. We try our best to give short and readable proofs. Most of the results are supplemented with examples. Key Words: Triangular numbers , Perfect square, Pascal Triangles, and perfect numbers. 1. Introduction : The sequence 1, 3, 6, 10, 15, …, n(n + 1)/2, … shows up in many places of mathematics[1] .
    [Show full text]
  • Euler's Pentagonal Number Theorem
    Euler's Pentagonal Number Theorem Dan Cranston September 28, 2011 Triangular Numbers:1 ; 3; 6; 10; 15; 21; 28; 36; 45; 55; ::: Square Numbers:1 ; 4; 9; 16; 25; 36; 49; 64; 81; 100; ::: Pentagonal Numbers:1 ; 5; 12; 22; 35; 51; 70; 92; 117; 145; ::: Introduction Square Numbers:1 ; 4; 9; 16; 25; 36; 49; 64; 81; 100; ::: Pentagonal Numbers:1 ; 5; 12; 22; 35; 51; 70; 92; 117; 145; ::: Introduction Triangular Numbers:1 ; 3; 6; 10; 15; 21; 28; 36; 45; 55; ::: Pentagonal Numbers:1 ; 5; 12; 22; 35; 51; 70; 92; 117; 145; ::: Introduction Triangular Numbers:1 ; 3; 6; 10; 15; 21; 28; 36; 45; 55; ::: Square Numbers:1 ; 4; 9; 16; 25; 36; 49; 64; 81; 100; ::: Introduction Triangular Numbers:1 ; 3; 6; 10; 15; 21; 28; 36; 45; 55; ::: Square Numbers:1 ; 4; 9; 16; 25; 36; 49; 64; 81; 100; ::: Pentagonal Numbers:1 ; 5; 12; 22; 35; 51; 70; 92; 117; 145; ::: The kth pentagonal number, P(k), is the kth partial sum of the arithmetic sequence an = 1 + 3(n − 1) = 3n − 2. k X 3k2 − k P(k) = (3n − 2) = 2 n=1 I P(8) = 92, P(500) = 374; 750, etc. and P(0) = 0. I Extend domain, so P(−8) = 100, P(−500) = 375; 250, etc. I fP(0); P(1); P(−1); P(2); P(−2); :::g = f0; 1; 2; 5; 7; :::g is an increasing sequence. Generalized Pentagonal Numbers k X 3k2 − k P(k) = (3n − 2) = 2 n=1 I P(8) = 92, P(500) = 374; 750, etc.
    [Show full text]