|
|
| Line 1: |
Line 1: |
| [[File:First six triangular numbers.svg|thumb|The first six triangular numbers]]
| | Whenever looking for the proper hemorrhoid treatment you'll need to consider a few significant factors such as, which one we think you want, when there is a remarkable amount of recovery required, and how long it takes to get results. In this article we will learn the answers to all of these questions, offering you the answer you should find the proper hemorrhoid treatment.<br><br>Aloe Vera Gel is good for reducing your symptoms while you're waiting for a more permanent solution to start working, like the Herbal [http://hemorrhoidtreatmentfix.com/internal-hemorrhoids-treatment how to treat internal hemorrhoids] for example.<br><br>Take a "sitz" bathtub with warm water. Do this 3 or 4 time a day for 15 minutes each time. This treatment is very powerful at reducing pain plus swelling plus is actually effortless to do.<br><br>Step 6 - Try A Suppository. The cheapest thing inside this category is petroleum jelly. Many of the suppositories to be had over the counter are made from the same sort of elements. This means we can benefit from an inexpensive generic brand plus receive the same therapeutic relief.<br><br>This one is something I suggest you begin doing right away, if you're not absolutely. It's the simplest all-natural hemorrhoids cure to begin using, plus it surely will create a difference. Among its other wellness benefits, a diet significant in fiber and with a lot of water intake makes the stool much simpler to pass. By being more gentle on your behind, you will let the hemorrhoids to heal plus avoid future developments. Plus, it's basically free. So in the event you choose 1 all-natural remedy, choose this 1.<br><br>Sitz Bath: This way is regarded as the many normal methods used to relieve sufferers of the pain caused by hemorrhoids. A sitz bathtub is a tub filled with warm water, in the event you want you can add some important oils to the bathtub water. You should soak your rectum to the warm water for at least 15 minutes. Do this three times a day plus it usually greatly minimize the swelling and the pain of your the hemorrhoids.<br><br>Undergoing with these choices might definitely expense you expensive. And for sure not all people will afford to pay such operation. Then there are equally hemorrhoids treatment that is found at home. With these hemorrhoid treatments you can be sure that you'll not invest too much. In most cases, people choose to have natural treatment whilst the hemorrhoid remains on its mild stage. These natural treatments usually assist you in reducing the pain plus swelling. We never have to be concerned as you apply or employ them because they are easy and affordable. |
| | |
| A '''triangular number''' or '''triangle number''' counts the objects that can form an [[equilateral triangle]], as in the diagram on the right. The ''n''th triangle number is the number of dots composing a triangle with {{math|''n''}} dots on a side, and is equal to the sum of the {{math|''n''}} [[natural number]]s from 1 to {{math|''n''}}. The sequence of triangular numbers {{OEIS|id=A000217}}, starting at the [[Empty sum|0th triangular number]], is:
| |
| :0, 1, 3, 6, 10, 15, 21, 28, 36, 45, 55, 66, 78, 91, 105, 120 …
| |
| | |
| The triangle numbers are given by the following explicit formulas:
| |
| :<!-- THE END OF THE NEXT LINE HAS BINOMIAL NOTATION. PLEASE DO NOT CHANGE IF YOU ARE UNFAMILIAR. --><math>
| |
| T_n= \sum_{k=1}^n k = 1+2+3 \dotsb +n = \frac{n(n+1)}{2} = {n+1 \choose 2}</math>
| |
| | |
| where <math>\textstyle {n+1 \choose 2}</math> is a [[binomial coefficient]]. It represents the number of distinct pairs that can be selected from ''n'' + 1 objects, and it is read aloud as "n plus one choose two".
| |
| | |
| The triangular number {{math|T<sub>''n''</sub>}} solves the "handshake problem" of counting the number of handshakes if each person in a room with ''n'' + 1 people shakes hands once with each person. In other words, the solution to the handshake problem of ''n'' people is ''T<sub>n-1</sub>''.<ref>http://www.mathcircles.org/node/835</ref>
| |
| | |
| Triangle numbers are the additive analog of the [[factorial]]s, which are the ''products'' of integers from 1 to n.
| |
| | |
| The number of line segments between closest pairs of dots in the triangle can be represented in terms of the number of dots or with a [[recurrence relation]]:
| |
| | |
| <math> | |
| L_n = 3 T_{n-1}= 3{n \choose 2};~~~L_n = L_{n-1} + 3(n-1), ~L_1 = 0.
| |
| </math> | |
| | |
| In the limit, the ratio between the two numbers, dots and line segments is
| |
| | |
| <math>
| |
| \lim_{n\to\infty} \frac{T_n}{L_n} = \frac{1}{3}
| |
| </math>
| |
| | |
| ==Relations to other figurate numbers==
| |
| Triangular numbers have a wide variety of relations to other [[figurate number]]s.
| |
| | |
| Most simply, the sum of two consecutive triangular numbers is a [[square number]], with the sum being the square of the difference between the two (and thus the difference of the two being the square root of the sum). Algebraically,
| |
| | |
| :<math>T_n + T_{n-1} = \left (\frac{n^2}{2} + \frac{n}{2}\right) + \left(\frac{\left(n-1\right)^2}{2} + \frac{n-1}{2} \right ) = \left (\frac{n^2}{2} + \frac{n}{2}\right) + \left(\frac{n^2}{2} - \frac{n}{2} \right ) = n^2 = (T_n - T_{n-1})^2.</math> | |
| | |
| Alternatively, the same fact can be demonstrated graphically:
| |
| {| cellpadding="7"
| |
| |6 + 10 = 16
| |
| |[[Image:Square number 16 as sum of two triangular numbers.svg]]
| |
| |
| |
| |10 + 15 = 25
| |
| |[[Image:Square number 25 as sum of two triangular numbers.svg]]
| |
| |}
| |
| | |
| There are infinitely many triangular numbers that are also square numbers; e.g., 1, 36. Some of them can be generated by a simple recursive formula:
| |
| | |
| :<math>S_{n+1} = 4S_n \left( 8S_n + 1\right)</math> with <math>S_1 = 1.</math>
| |
| | |
| ''All'' [[square triangular number]]s are found from the recursion
| |
| | |
| :<math>S_n = 34S_{n-1} - S_{n-2} + 2</math> with <math>S_0 = 0</math> and <math>S_1 = 1.</math>
| |
| | |
| Also, the [[Squared triangular number|square of the ''n''th triangular number]] is the same as the sum of the cubes of the integers 1 to ''n''.
| |
| | |
| The sum of the all triangular numbers up to the ''n''th triangular number is the ''n''th [[tetrahedral number]],
| |
| :<math> \frac {n(n+1)(n+2)} {6}.</math>
| |
| | |
| More generally, the difference between the ''n''th ''m''[[polygonal number|-gonal number]] and the ''n''th {{math|(''m'' + 1)}}-gonal number is the {{math|(''n'' − 1)}}th triangular number. For example, the sixth [[heptagonal number]] (81) minus the sixth [[hexagonal number]] (66) equals the fifth triangular number, 15. Every other triangular number is a hexagonal number. Knowing the triangular numbers, one can reckon any [[Centered number|centered polygonal number]]: the ''n''th centered ''k''-gonal number is obtained by the formula
| |
| | |
| :<math>Ck_n = kT_{n-1}+1\ </math>
| |
| | |
| where {{math|''T''}} is a triangular number.
| |
| | |
| The positive difference of two triangular numbers is a [[trapezoidal number]].
| |
| | |
| ==Other properties==
| |
| Triangular numbers correspond to the first-order case of [[Faulhaber's formula]].
| |
| | |
| Every even [[perfect number]] is triangular, given by the formula
| |
| :<math>M_p 2^{p-1} = M_p (M_p + 1)/2 = T_{M_p}</math>
| |
| where ''{{math|M}}''<sub>''{{math|p}}''</sub> is a [[Mersenne prime]]. No odd perfect numbers are known, hence all known perfect numbers are triangular.
| |
| | |
| For example, the third triangular number is (3 × 2 =) 6, the seventh is (7 × 4 =) 28, the 31st is (31 × 16 =) 496, and the 127th is (127 × 64 =) 8128.
| |
| | |
| In [[base 10]], the [[digital root]] of a nonzero triangular number is always 1, 3, 6, or 9. Hence every triangular number is either divisible by three or has a remainder of 1 when divided by nine:
| |
| :0 = 9 × 0
| |
| :1 = 9 × 0 + 1
| |
| :3 = 9 × 0 + 3
| |
| :6 = 9 × 0 + 6
| |
| :10 = 9 × 1 + 1
| |
| :15 = 9 × 1 + 6
| |
| :21 = 9 × 2 + 3
| |
| :28 = 9 × 3 + 1
| |
| :36 = 9 × 4
| |
| :45 = 9 × 5
| |
| :55 = 9 × 6 + 1
| |
| :66 = 9 × 7 + 3
| |
| :78 = 9 × 8 + 6
| |
| :91 = 9 × 10 + 1
| |
| :…
| |
| The digital root pattern for triangular numbers, repeating every nine terms, as shown above, is "1, 3, 6, 1, 6, 3, 1, 9, 9". | |
| | |
| The converse of the statement above is, however, not always true. For example, the digital root of 12, which is not a triangular number, is 3 and divisible by three.
| |
| | |
| If {{math|''x''}} is a triangular number, then {{math|''ax'' + ''b''}} is also a triangular number, given {{math|''a''}} is an odd square and {{math|''b''}} = {{math|(''a'' − 1) / 8}}
| |
| | |
| Note that {{math|''b''}} will always be a triangular number, because {{math|1=8 × T<sub>''n''</sub> + 1 = (2''n'' + 1)<sup>2</sup>}}, which yields all the odd squares are revealed by multiplying a triangular number by 8 and adding 1, and the process for {{math|''b''}} given a is an odd square is the inverse of this operation.
| |
| | |
| The first several pairs of this form (not counting {{math|1''x'' + 0}}) are: {{math|9''x'' + 1}}, {{math|25''x'' + 3}}, {{math|49''x'' + 6}}, {{math|81''x'' + 10}}, {{math|121''x'' + 15}}, {{math|169''x'' + 21}}, … etc. Given {{math|''x''}} is equal to {{math|T<sub>''n''</sub>}}, these formulas yield {{math|T<sub>3''n'' + 1</sub>}}, {{math|T<sub>5''n'' + 2</sub>}}, {{math|T<sub>7''n'' + 3</sub>}}, {{math|T<sub>9''n'' + 4</sub>}}, and so on.
| |
| | |
| The sum of the [[Multiplicative inverse|reciprocals]] of all the nonzero triangular numbers is:
| |
| | |
| :<math> \!\ \sum_{n=1}^{\infty}{1 \over {{n^2 + n} \over 2}} = 2\sum_{n=1}^{\infty}{1 \over {n^2 + n}} = 2 .</math>
| |
| | |
| This can be shown by using the basic sum of a [[telescoping series]]:
| |
| | |
| :<math> \!\ \sum_{n=1}^{\infty}{1 \over {n(n+1)}} = 1 .</math>
| |
| | |
| Two other interesting formulas regarding triangular numbers are:
| |
| | |
| :<math>T_{a+b} = T_a + T_b + ab\ </math>
| |
| | |
| and
| |
| | |
| :<math>T_{ab} = T_aT_b + T_{a-1}T_{b-1},\ </math>
| |
| both of which can easily be established either by looking at dot patterns (see above) or with some simple algebra.
| |
| | |
| In 1796, German mathematician and scientist [[Carl Friedrich Gauss]] discovered that every positive integer is representable as a sum of at most three triangular numbers, writing in his diary his famous words, "[[Eureka (word)|EΥΡHKA!]] num = Δ + Δ + Δ". Note that this theorem does not imply that the triangular numbers are different (as in the case of 20 = 10 + 10), nor that a solution with exactly three nonzero triangular numbers must exist. This is a special case of [[Fermat polygonal number theorem|Fermat's Polygonal Number Theorem]].
| |
| | |
| The largest triangular number of the form {{math|2<sup>''k''</sup> − 1}} is [[4000 (number)#Selected numbers in the range 4001–4999|4095]] (see [[Ramanujan–Nagell equation]]).
| |
| | |
| [[Wacław Sierpiński|Wacław Franciszek Sierpiński]] posed the question as to the existence of four distinct triangular numbers in [[geometric progression]]. It was conjectured by Polish mathematician [[Kazimierz Szymiczek]] to be impossible. This conjecture was proven by Fang and Chen in 2007.<ref>[http://www.emis.de/journals/INTEGERS/papers/h19/h19.pdf Chen, Fang: Triangular numbers in geometric progression]</ref><ref>[http://www.emis.de/journals/INTEGERS/papers/h57/h57.pdf Fang: Nonexistence of a geometric progression that contains four triangular numbers]</ref>
| |
| | |
| == Applications ==
| |
| | |
| A [[fully connected network]] of {{math|''n''}} computing devices requires the presence of {{math|T<sub>''n'' − 1</sub>}} cables or other connections; this is equivalent to the handshake problem mentioned above.
| |
| | |
| In a tournament format that uses a round-robin [[group stage]], the number of matches that need to be played between n teams is equal to the triangular number {{math|T<sub>''n'' − 1</sub>}}. For example, a group stage with 4 teams requires 6 matches, and a group stage with 8 teams requires 28 matches. This is also equivalent to the handshake problem and fully connected network problems.
| |
| | |
| One way of calculating the [[depreciation]] of an asset is the [[Depreciation#Sum-of-years' digits method|sum-of-years' digits method]], which involves finding {{math|T<sub>''n''</sub>}}, where {{math|''n''}} is the length in years of the asset's useful life. Each year, the item loses {{math|(''b'' − ''s'') × {{frac|(n − y)|T<sub>''n''</sub>}}}}, where {{math|''b''}} is the item's beginning value (in units of currency), {{math|''s''}} is its final salvage value, {{math|''n''}} is the total number of years the item is usable, and {{math|''y''}} the current year in the depreciation schedule. Under this method, {{math|''n''}} item with a usable life of 4 years would lose 4/10 of its "losable" value in the first year, 3/10 in the second, 2/10 in the third, and 1/10 in the fourth, accumulating a total depreciation of 10/10 (the whole) of the losable value.
| |
| | |
| ==Triangular roots and tests for triangular numbers==
| |
| By analogy with the [[square root]] of {{mvar|x}}, one can define the (positive) triangular root of {{mvar|x}} as the number ''n'' such that {{math|1=''T''<sub>''n''</sub> = ''x''}}:<ref name="EulerRoots">{{Citation |last=Euler |first=Leonhard |authorlink=Leonhard Euler |last2=Lagrange |first2=Joseph Louis |author2-link=Joseph Louis Lagrange |year=1810 |title=[[Elements of Algebra]] |edition=2nd |volume=1 |publisher=J. Johnson and Co. |pages=332–335}}</ref>
| |
| | |
| :<math>n = \frac{\sqrt{8x+1}-1}{2}.</math>
| |
|
| |
| An integer {{mvar|x}} is triangular if and only if {{math|8''x'' + 1}} is a square. Equivalently, if the positive triangular root {{mvar|n}} of {{mvar|x}} is an integer, then {{mvar|x}} is the {{mvar|n}}th triangular number.<ref name="EulerRoots" />
| |
| | |
| ==Notes==
| |
| {{reflist}}
| |
| | |
| ==External links==
| |
| {{commons category|triangular numbers}}
| |
| * {{springer|title=Arithmetic series|id=p/a013370}}
| |
| * [http://www.cut-the-knot.org/do_you_know/numbers.shtml#square Triangular numbers] at [[cut-the-knot]]
| |
| * [http://www.cut-the-knot.org/do_you_know/triSquare.shtml There exist triangular numbers that are also square] at [[cut-the-knot]]
| |
| * {{MathWorld|urlname=TriangularNumber|title=Triangular Number}}
| |
| * [http://vihart.com/blog/gauss/ Triangular numbers via 12 days of Christmas] by [[Vi Hart]]
| |
| * [http://rhubbarb.wordpress.com/2009/04/23/hypertetrahedral-polytopic-roots/ Hypertetrahedral Polytopic Roots] by Rob Hubbard, including the generalisation to ''triangular cube roots'', some higher dimensions, and some approximate formulae
| |
| | |
| {{Series (mathematics)}}
| |
| {{Classes of natural numbers}}
| |
| | |
| [[Category:Figurate numbers]]
| |
| [[Category:Triangles]]
| |
| [[Category:Integer sequences]]
| |
| [[Category:Proof without words]]
| |
Whenever looking for the proper hemorrhoid treatment you'll need to consider a few significant factors such as, which one we think you want, when there is a remarkable amount of recovery required, and how long it takes to get results. In this article we will learn the answers to all of these questions, offering you the answer you should find the proper hemorrhoid treatment.
Aloe Vera Gel is good for reducing your symptoms while you're waiting for a more permanent solution to start working, like the Herbal how to treat internal hemorrhoids for example.
Take a "sitz" bathtub with warm water. Do this 3 or 4 time a day for 15 minutes each time. This treatment is very powerful at reducing pain plus swelling plus is actually effortless to do.
Step 6 - Try A Suppository. The cheapest thing inside this category is petroleum jelly. Many of the suppositories to be had over the counter are made from the same sort of elements. This means we can benefit from an inexpensive generic brand plus receive the same therapeutic relief.
This one is something I suggest you begin doing right away, if you're not absolutely. It's the simplest all-natural hemorrhoids cure to begin using, plus it surely will create a difference. Among its other wellness benefits, a diet significant in fiber and with a lot of water intake makes the stool much simpler to pass. By being more gentle on your behind, you will let the hemorrhoids to heal plus avoid future developments. Plus, it's basically free. So in the event you choose 1 all-natural remedy, choose this 1.
Sitz Bath: This way is regarded as the many normal methods used to relieve sufferers of the pain caused by hemorrhoids. A sitz bathtub is a tub filled with warm water, in the event you want you can add some important oils to the bathtub water. You should soak your rectum to the warm water for at least 15 minutes. Do this three times a day plus it usually greatly minimize the swelling and the pain of your the hemorrhoids.
Undergoing with these choices might definitely expense you expensive. And for sure not all people will afford to pay such operation. Then there are equally hemorrhoids treatment that is found at home. With these hemorrhoid treatments you can be sure that you'll not invest too much. In most cases, people choose to have natural treatment whilst the hemorrhoid remains on its mild stage. These natural treatments usually assist you in reducing the pain plus swelling. We never have to be concerned as you apply or employ them because they are easy and affordable.