Skip to main content

Tetrahedral number









Tetrahedral number


From Wikipedia, the free encyclopedia

Jump to navigation
Jump to search



A pyramid with side length 5 contains 35 spheres. Each layer represents one of the first five triangular numbers.






A tetrahedral number, or triangular pyramidal number, is a figurate number that represents a pyramid with a triangular base and three sides, called a tetrahedron. The n-th tetrahedral number, Tn{displaystyle T_{n}}T_{n}, is the sum of the first n triangular numbers, that is, Tn=∑k=⁡1nk(k+1)2{displaystyle T_{n}=sum _{kmathop {=} 1}^{n}{frac {k(k+1)}{2}}}{displaystyle T_{n}=sum _{kmathop {=} 1}^{n}{frac {k(k+1)}{2}}}


The tetrahedral numbers are:



1, 4, 10, 20, 35, 56, 84, 120, 165, 220, … (sequence A000292 in the OEIS)



Contents






  • 1 Formula


    • 1.1 Proofs of Tn=n(n+1)(n+2)6{displaystyle T_{n}={n(n+1)(n+2) over 6}}{displaystyle T_{n}={n(n+1)(n+2) over 6}}


    • 1.2 Proof 1


    • 1.3 Proof 2




  • 2 Geometric interpretation


  • 3 Properties


  • 4 Popular culture


  • 5 See also


  • 6 References


  • 7 External links





Formula[edit]




Derivation of tetrahedral numbers from a left-justified Pascal's triangle


The formula for the n-th tetrahedral number is represented by the 3rd rising factorial of n divided by the factorial of 3:


Tn=n(n+1)(n+2)6=n3¯3!{displaystyle T_{n}={n(n+1)(n+2) over 6}={n^{overline {3}} over 3!}}T_{n}={n(n+1)(n+2) over 6}={n^{overline {3}} over 3!}

The tetrahedral numbers can also be represented as binomial coefficients:


Tn=(n+23).{displaystyle T_{n}={n+2 choose 3}.}T_{n}={n+2 choose 3}.

Tetrahedral numbers can therefore be found in the fourth position either from left or right in Pascal's triangle.



Proofs of Tn=n(n+1)(n+2)6{displaystyle T_{n}={n(n+1)(n+2) over 6}}{displaystyle T_{n}={n(n+1)(n+2) over 6}}[edit]



Proof 1[edit]


This proof uses the fact that the n-th triangular number is given by


Trin=n(n+1)2.{displaystyle {mathit {Tri}}_{n}={n(n+1) over 2}.}{displaystyle {mathit {Tri}}_{n}={n(n+1) over 2}.}

It proceeds by induction.



Base case

T1=1=1⋅2⋅36.{displaystyle T_{1}=1={1cdot 2cdot 3 over 6}.}{displaystyle T_{1}=1={1cdot 2cdot 3 over 6}.}


Inductive step












Tn+1{displaystyle T_{n+1}}{displaystyle T_{n+1}}

=Tn+Trin+1=n(n+1)(n+2)6+(n+1)(n+2)2{displaystyle =T_{n}+{mathit {Tri}}_{n+1}={n(n+1)(n+2) over 6}+{(n+1)(n+2) over 2}}{displaystyle =T_{n}+{mathit {Tri}}_{n+1}={n(n+1)(n+2) over 6}+{(n+1)(n+2) over 2}}


=(n+1)(n+2)(n+3)6.{displaystyle ={(n+1)(n+2)(n+3) over 6}.}{displaystyle ={(n+1)(n+2)(n+3) over 6}.}


Proof 2[edit]


Use Gosper's algorithm



Geometric interpretation[edit]


Tetrahedral numbers can be modelled by stacking spheres. For example, the fifth tetrahedral number (T5 = 35) can be modelled with 35 billiard balls and the standard triangular billiards ball frame that holds 15 balls in place. Then 10 more balls are stacked on top of those, then another 6, then another three and one ball at the top completes the tetrahedron.


When order-n tetrahedra built from Tn spheres are used as a unit, it can be shown that a space tiling with such units can achieve a densest sphere packing as long as n ≤ 4.[1][dubious ]



Properties[edit]




  • Tn + Tn-1 = 12 + 22 + 32 ... + n2


  • A. J. Meyl proved in 1878 that only three tetrahedral numbers are also perfect squares, namely:


    T1 = 1² = 1


    T2 = 2² = 4


    T48 = 140² = 19600.




  • Sir Frederick Pollock conjectured that every number is the sum of at most 5 tetrahedral numbers: see Pollock tetrahedral numbers conjecture.

  • The only tetrahedral number that is also a square pyramidal number is 1 (Beukers, 1988), and the only tetrahedral number that is also a perfect cube is 1.

  • The infinite sum of tetrahedral numbers' reciprocals is 3/2, which can be derived using telescoping series:
     ∑n=1∞6n(n+1)(n+2)=32.{displaystyle ! sum _{n=1}^{infty }{frac {6}{n(n+1)(n+2)}}={frac {3}{2}}.}! sum _{n=1}^{infty }{frac {6}{n(n+1)(n+2)}}={frac {3}{2}}.


  • The parity of tetrahedral numbers follows the repeating pattern odd-even-even-even.

  • An observation of tetrahedral numbers:

    T5 = T4 + T3 + T2 + T1


  • Numbers that are both triangular and tetrahedral must satisfy the binomial coefficient equation:
    Trn=(n+12)=(m+23)=Tem.{displaystyle Tr_{n}={n+1 choose 2}={m+2 choose 3}=Te_{m}.}Tr_{n}={n+1 choose 2}={m+2 choose 3}=Te_{m}.


  • The only numbers that are both Tetrahedral and Triangular numbers are (sequence A027568 in the OEIS):


    Te1 = Tr1 = 1


    Te3 = Tr4 = 10


    Te8 = Tr15 = 120


    Te20 = Tr55 = 1540


    Te34 = Tr119 = 7140





Popular culture[edit]




Number of gifts of each type and number received each day and their relationship to figurate numbers


Te12 = 364, which is the total number of gifts "my true love sent to me" during the course of all 12 verses of the carol, "The Twelve Days of Christmas".[2] The cumulative total number of gifts after each verse is also Ten for verse n.


The number of possible KeyForge three-house-combinations is also a tetrahedral number, Ten-2 where n is the number of houses.



See also[edit]



  • Centered triangular number

  • Triangular number



References[edit]





  1. ^ [1]


  2. ^ Brent (2006-12-21). "The Twelve Days of Christmas and Tetrahedral Numbers". Mathlesstraveled.com. Retrieved 2017-02-28..mw-parser-output cite.citation{font-style:inherit}.mw-parser-output q{quotes:"""""""'""'"}.mw-parser-output code.cs1-code{color:inherit;background:inherit;border:inherit;padding:inherit}.mw-parser-output .cs1-lock-free a{background:url("//upload.wikimedia.org/wikipedia/commons/thumb/6/65/Lock-green.svg/9px-Lock-green.svg.png")no-repeat;background-position:right .1em center}.mw-parser-output .cs1-lock-limited a,.mw-parser-output .cs1-lock-registration a{background:url("//upload.wikimedia.org/wikipedia/commons/thumb/d/d6/Lock-gray-alt-2.svg/9px-Lock-gray-alt-2.svg.png")no-repeat;background-position:right .1em center}.mw-parser-output .cs1-lock-subscription a{background:url("//upload.wikimedia.org/wikipedia/commons/thumb/a/aa/Lock-red-alt-2.svg/9px-Lock-red-alt-2.svg.png")no-repeat;background-position:right .1em center}.mw-parser-output .cs1-subscription,.mw-parser-output .cs1-registration{color:#555}.mw-parser-output .cs1-subscription span,.mw-parser-output .cs1-registration span{border-bottom:1px dotted;cursor:help}.mw-parser-output .cs1-hidden-error{display:none;font-size:100%}.mw-parser-output .cs1-visible-error{font-size:100%}.mw-parser-output .cs1-subscription,.mw-parser-output .cs1-registration,.mw-parser-output .cs1-format{font-size:95%}.mw-parser-output .cs1-kern-left,.mw-parser-output .cs1-kern-wl-left{padding-left:0.2em}.mw-parser-output .cs1-kern-right,.mw-parser-output .cs1-kern-wl-right{padding-right:0.2em}




External links[edit]



  • Weisstein, Eric W. "Tetrahedral Number". MathWorld.


  • Geometric Proof of the Tetrahedral Number Formula by Jim Delany, The Wolfram Demonstrations Project.











Retrieved from "https://en.wikipedia.org/w/index.php?title=Tetrahedral_number&oldid=867414236"





Navigation menu

























(window.RLQ=window.RLQ||).push(function(){mw.config.set({"wgPageParseReport":{"limitreport":{"cputime":"0.280","walltime":"0.410","ppvisitednodes":{"value":784,"limit":1000000},"ppgeneratednodes":{"value":0,"limit":1500000},"postexpandincludesize":{"value":87475,"limit":2097152},"templateargumentsize":{"value":898,"limit":2097152},"expansiondepth":{"value":11,"limit":40},"expensivefunctioncount":{"value":2,"limit":500},"unstrip-depth":{"value":1,"limit":20},"unstrip-size":{"value":5110,"limit":5000000},"entityaccesscount":{"value":0,"limit":400},"timingprofile":["100.00% 234.195 1 -total"," 36.23% 84.853 1 Template:Reflist"," 32.37% 75.817 2 Template:Cite_web"," 27.01% 63.256 7 Template:Navbox"," 25.58% 59.916 1 Template:Refimprove"," 19.60% 45.894 1 Template:Classes_of_natural_numbers"," 18.37% 43.013 1 Template:Ambox"," 10.81% 25.325 1 Template:Dubious"," 9.29% 21.747 1 Template:Fix"," 4.95% 11.587 1 Template:Delink"]},"scribunto":{"limitreport-timeusage":{"value":"0.105","limit":"10.000"},"limitreport-memusage":{"value":3049995,"limit":52428800}},"cachereport":{"origin":"mw1248","timestamp":"20181129122413","ttl":1900800,"transientcontent":false}}});});{"@context":"https://schema.org","@type":"Article","name":"Tetrahedral number","url":"https://en.wikipedia.org/wiki/Tetrahedral_number","sameAs":"http://www.wikidata.org/entity/Q975166","mainEntity":"http://www.wikidata.org/entity/Q975166","author":{"@type":"Organization","name":"Contributors to Wikimedia projects"},"publisher":{"@type":"Organization","name":"Wikimedia Foundation, Inc.","logo":{"@type":"ImageObject","url":"https://www.wikimedia.org/static/images/wmf-hor-googpub.png"}},"datePublished":"2004-03-06T23:30:01Z","dateModified":"2018-11-05T15:41:54Z","image":"https://upload.wikimedia.org/wikipedia/commons/d/d5/Pyramid_of_35_spheres_animation.gif","headline":"polyhu00e9dral number"}(window.RLQ=window.RLQ||).push(function(){mw.config.set({"wgBackendResponseTime":117,"wgHostname":"mw1269"});});

Popular posts from this blog

Florida Star v. B. J. F.

Error while running script in elastic search , gateway timeout

Adding quotations to stringified JSON object values