Proof that T(n)=n(n+1)/2 (2024)

We give three proofs here that the n-th Triangular number, 1+2+3+...+n is n(n+1)/2.The first is a visual one involving only the formula for the area of arectangle. This is followed by two proofs using algebra. The first uses "..." notation and the second introduces you to theSigma notation which makes the proof more precise.

A visual proof that 1+2+3+...+n = n(n+1)/2

We can visualize the sum 1+2+3+...+n as a triangle of dots. Numbers which have such a pattern of dots are calledTriangle (or triangular) numbers, written T(n), the sum of the integers from 1 to n :
n123456
T(n) as a sum11+21+2+31+2+3+41..51..6
T(n) as a triangle

Proof that T(n)=n(n+1)/2 (1)

Proof that T(n)=n(n+1)/2 (2)
Proof that T(n)=n(n+1)/2 (3)Proof that T(n)=n(n+1)/2 (4)
Proof that T(n)=n(n+1)/2 (5)
Proof that T(n)=n(n+1)/2 (6)Proof that T(n)=n(n+1)/2 (7)
Proof that T(n)=n(n+1)/2 (8)Proof that T(n)=n(n+1)/2 (9)Proof that T(n)=n(n+1)/2 (10)
Proof that T(n)=n(n+1)/2 (11)
Proof that T(n)=n(n+1)/2 (12)Proof that T(n)=n(n+1)/2 (13)
Proof that T(n)=n(n+1)/2 (14)Proof that T(n)=n(n+1)/2 (15)Proof that T(n)=n(n+1)/2 (16)
Proof that T(n)=n(n+1)/2 (17)Proof that T(n)=n(n+1)/2 (18)Proof that T(n)=n(n+1)/2 (19)Proof that T(n)=n(n+1)/2 (20)
...
T(n)=136101521
For the proof, we will count the number of dots in T(n) but, instead of summing the numbers 1, 2, 3, etc up to nwe will find the total using only one multiplication and one division!

To do this, we will fit two copies of a triangle of dots together, one red and an upside-down copy in green.
E.g. T(4)=1+2+3+4

Proof that T(n)=n(n+1)/2 (21)
Proof that T(n)=n(n+1)/2 (22)Proof that T(n)=n(n+1)/2 (23)
Proof that T(n)=n(n+1)/2 (24)Proof that T(n)=n(n+1)/2 (25)Proof that T(n)=n(n+1)/2 (26)
Proof that T(n)=n(n+1)/2 (27)Proof that T(n)=n(n+1)/2 (28)Proof that T(n)=n(n+1)/2 (29)Proof that T(n)=n(n+1)/2 (30)
+
Proof that T(n)=n(n+1)/2 (31)Proof that T(n)=n(n+1)/2 (32)Proof that T(n)=n(n+1)/2 (33)Proof that T(n)=n(n+1)/2 (34)
Proof that T(n)=n(n+1)/2 (35)Proof that T(n)=n(n+1)/2 (36)Proof that T(n)=n(n+1)/2 (37)
Proof that T(n)=n(n+1)/2 (38)Proof that T(n)=n(n+1)/2 (39)
Proof that T(n)=n(n+1)/2 (40)
=
Proof that T(n)=n(n+1)/2 (41)Proof that T(n)=n(n+1)/2 (42)Proof that T(n)=n(n+1)/2 (43)Proof that T(n)=n(n+1)/2 (44)Proof that T(n)=n(n+1)/2 (45)
Proof that T(n)=n(n+1)/2 (46)Proof that T(n)=n(n+1)/2 (47)Proof that T(n)=n(n+1)/2 (48)Proof that T(n)=n(n+1)/2 (49)Proof that T(n)=n(n+1)/2 (50)
Proof that T(n)=n(n+1)/2 (51)Proof that T(n)=n(n+1)/2 (52)Proof that T(n)=n(n+1)/2 (53)Proof that T(n)=n(n+1)/2 (54)Proof that T(n)=n(n+1)/2 (55)
Proof that T(n)=n(n+1)/2 (56)Proof that T(n)=n(n+1)/2 (57)Proof that T(n)=n(n+1)/2 (58)Proof that T(n)=n(n+1)/2 (59)Proof that T(n)=n(n+1)/2 (60)
    Notice that
  • we get a rectangle which is has the same number of rows (4) but has one extra column (5)
  • so the rectangle is 4 by 5
  • it therefore contains 4x5=20 balls
  • but we took two copies of T(4) to get this
  • so we must have 20/2 = 10 balls in T(4), which we can easily check.

This visual proof applies to any size of triangle number.

Here it is again on T(5):

Proof that T(n)=n(n+1)/2 (61)
Proof that T(n)=n(n+1)/2 (62)Proof that T(n)=n(n+1)/2 (63)
Proof that T(n)=n(n+1)/2 (64)Proof that T(n)=n(n+1)/2 (65)Proof that T(n)=n(n+1)/2 (66)
Proof that T(n)=n(n+1)/2 (67)Proof that T(n)=n(n+1)/2 (68)Proof that T(n)=n(n+1)/2 (69)Proof that T(n)=n(n+1)/2 (70)
Proof that T(n)=n(n+1)/2 (71)Proof that T(n)=n(n+1)/2 (72)Proof that T(n)=n(n+1)/2 (73)Proof that T(n)=n(n+1)/2 (74)Proof that T(n)=n(n+1)/2 (75)
+
Proof that T(n)=n(n+1)/2 (76)Proof that T(n)=n(n+1)/2 (77)Proof that T(n)=n(n+1)/2 (78)Proof that T(n)=n(n+1)/2 (79)Proof that T(n)=n(n+1)/2 (80)
Proof that T(n)=n(n+1)/2 (81)Proof that T(n)=n(n+1)/2 (82)Proof that T(n)=n(n+1)/2 (83)Proof that T(n)=n(n+1)/2 (84)
Proof that T(n)=n(n+1)/2 (85)Proof that T(n)=n(n+1)/2 (86)Proof that T(n)=n(n+1)/2 (87)
Proof that T(n)=n(n+1)/2 (88)Proof that T(n)=n(n+1)/2 (89)
Proof that T(n)=n(n+1)/2 (90)
=
Proof that T(n)=n(n+1)/2 (91)Proof that T(n)=n(n+1)/2 (92)Proof that T(n)=n(n+1)/2 (93)Proof that T(n)=n(n+1)/2 (94)Proof that T(n)=n(n+1)/2 (95)Proof that T(n)=n(n+1)/2 (96)
Proof that T(n)=n(n+1)/2 (97)Proof that T(n)=n(n+1)/2 (98)Proof that T(n)=n(n+1)/2 (99)Proof that T(n)=n(n+1)/2 (100)Proof that T(n)=n(n+1)/2 (101)Proof that T(n)=n(n+1)/2 (102)
Proof that T(n)=n(n+1)/2 (103)Proof that T(n)=n(n+1)/2 (104)Proof that T(n)=n(n+1)/2 (105)Proof that T(n)=n(n+1)/2 (106)Proof that T(n)=n(n+1)/2 (107)Proof that T(n)=n(n+1)/2 (108)
Proof that T(n)=n(n+1)/2 (109)Proof that T(n)=n(n+1)/2 (110)Proof that T(n)=n(n+1)/2 (111)Proof that T(n)=n(n+1)/2 (112)Proof that T(n)=n(n+1)/2 (113)Proof that T(n)=n(n+1)/2 (114)
Proof that T(n)=n(n+1)/2 (115)Proof that T(n)=n(n+1)/2 (116)Proof that T(n)=n(n+1)/2 (117)Proof that T(n)=n(n+1)/2 (118)Proof that T(n)=n(n+1)/2 (119)Proof that T(n)=n(n+1)/2 (120)

So T(5) is half of a rectangle of dots 5 tall and 6 wide, i.e. half of 30 dots, so T(5)=15.

Try the formula for yourself with this Quiz (click on the button) which opens in a new window. After the Quiz, close its window and try this button again for another Quiz question.

For T(n)=1+2+3+...+n we take two copies and get a rectangle that is n by (n+1).
So there you have it - our visual proof that

T(n)=1 + 2 + 3 + ... + n=n(n + 1)/2

The same proof using algebra!

Here's how a mathematician might write out the above proof using algebra:
T(n)+T(n) = 1 + 2 + 3 + ...+ (n-1) +n
+n + (n-1) + (n-2) +... + 2 + 1 Two copies, one red and the other, reversed, in green
= (1 + n) + (2 + n-1) +(3 + n-2) + ... +(n-1 + 2) +(n + 1) pair off the terms, a red with a green
= (n+1) + (n+1) + (n+1) + ... +(n+1) + (n+1)All the n pair-sums are equal to (n+1)
2 T(n) = n (n+1)
T(n) = n (n+1) / 2

Using the Sigma notation

Some people regard the "..." as too vague and want a more precise alternative. For this reason, in summing a series, the sigma notation is used.Sigma is the name of the greek letter for the English "s", written as Proof that T(n)=n(n+1)/2 (121) (like an M on its side)as a capital letterand Proof that T(n)=n(n+1)/2 (122) (like a small b that's fallen over) in lower case. In this case, the "s" stands for "sum". (A tall curly form of S gives themathematical symbol for integration - another kind of sum).
    Mathematicians use the capital sigma for the sum of a series as follows:
  • a formula describes the ith term of the series being summed. It is written after the sigma;
  • the starting value for i is written below the sigma;
  • the ending value for i is written above the sigma
i=final value(formula for ith term)
Proof that T(n)=n(n+1)/2 (123)
i=starting value

In fact, the formula after the sigma can be written in terms of any variable not just i, for instance k, but then we must indicate whichis the letter that varies in the sum under the sigma.
Often the variable is omitted above the sigma but never omitted below the sigma.
Here are some examples:

The sum 102+112+122, where the numbers added are the square numbers i2:
i=12i2
Proof that T(n)=n(n+1)/2 (124)
i=10
The same sum can also be written in many other ways,
for instance,as the sum of the square numbers (i+9)2where this time i goes from 1 to 3
i=3(i+9)2
Proof that T(n)=n(n+1)/2 (125)
i=1
or as the sum of the square numbers (i+11)2
where this time i goes from -1 to 1 (i.e. i = -1, 0 and 1)
i=1(i+11)2
Proof that T(n)=n(n+1)/2 (126)
i=-1
The sum 1+2+3+..+9 is T(9) or
i=9i
T(9) = Proof that T(n)=n(n+1)/2 (127)
i=1
Here is T(n) which is 1+2+3+...+n, this time omitting the second use of the i above the sigma:
ni = T(n)
Proof that T(n)=n(n+1)/2 (128)
i=1
and this time, we have T(n) but written backwards:
n+ (n-1) + ... 3 + 2 + 1 where the ith term is now n+1–i for i from 1 to n:
i=n(n+1–i)=T(n)
Proof that T(n)=n(n+1)/2 (129)
i=1
Finally, note that if all the terms are independent of the variable, for instanceif there is no i in the formula but the variable below the sigma is i, then all the terms are constant. The number of terms will begiven by the starting and ending values. Here, all the terms are fixed (constant) at 3:
i=73 = 3+3+3+3 = 12
Proof that T(n)=n(n+1)/2 (130)
i=4

Here is the algebraic proof from above but now written using the sigma notation:

T(n)+T(n) =
i=ni
Proof that T(n)=n(n+1)/2 (131)
i=1
+
i=n(n+1–i)
Proof that T(n)=n(n+1)/2 (132)
i=1
Two copies, one red and the other, reversed, in green
2 T(n)=
i=n(i +n+1–i)
Proof that T(n)=n(n+1)/2 (133)
i=1
pair off the terms, a red with a green
2 T(n)=
i=n(n+1)
Proof that T(n)=n(n+1)/2 (134)
i=1
n copies of (n+1):
the i does not appear in the formula so all the terms are the same
2 T(n)=n (n+1)
T(n)= n (n+1) / 2
Back to the Runsums Results page
© 2003 Dr Ron Knott
runsums@ronknott.com
12 February 2003
Proof that T(n)=n(n+1)/2 (2024)

References

Top Articles
60+ Free Perler Bead Patterns and Craft Ideas - Fun Loving Families
The Best Perler Bead Patterns (Get Over 1750+!)
Chs.mywork
Printable Whoville Houses Clipart
Swimgs Yuzzle Wuzzle Yups Wits Sadie Plant Tune 3 Tabs Winnie The Pooh Halloween Bob The Builder Christmas Autumns Cow Dog Pig Tim Cook’s Birthday Buff Work It Out Wombats Pineview Playtime Chronicles Day Of The Dead The Alpha Baa Baa Twinkle
Pixel Speedrun Unblocked 76
Frederick County Craigslist
Jonathon Kinchen Net Worth
Don Wallence Auto Sales Vehicles
FFXIV Immortal Flames Hunting Log Guide
Find All Subdomains
Craigslist Dog Sitter
Music Archives | Hotel Grand Bach - Hotel GrandBach
123 Movies Babylon
Corporate Homepage | Publix Super Markets
Natureza e Qualidade de Produtos - Gestão da Qualidade
Our Facility
Curtains - Cheap Ready Made Curtains - Deconovo UK
Georgia Vehicle Registration Fees Calculator
Illinois VIN Check and Lookup
97226 Zip Code
Hannaford To-Go: Grocery Curbside Pickup
Bennington County Criminal Court Calendar
Red8 Data Entry Job
What Is The Lineup For Nascar Race Today
Naval Academy Baseball Roster
Craigslist Panama City Beach Fl Pets
Kleinerer: in Sinntal | markt.de
Used 2 Seater Go Karts
J&R Cycle Villa Park
Dtlr On 87Th Cottage Grove
Sf Bay Area Craigslist Com
Xfinity Outage Map Lacey Wa
Kstate Qualtrics
Rise Meadville Reviews
Help with your flower delivery - Don's Florist & Gift Inc.
10 Most Ridiculously Expensive Haircuts Of All Time in 2024 - Financesonline.com
Craigs List Stockton
Vivek Flowers Chantilly
Bbc Gahuzamiryango Live
Pepsi Collaboration
The Holdovers Showtimes Near Regal Huebner Oaks
How Many Dogs Can You Have in Idaho | GetJerry.com
Citibank Branch Locations In Orlando Florida
Lamp Repair Kansas City Mo
Tableaux, mobilier et objets d'art
Coffee County Tag Office Douglas Ga
What is a lifetime maximum benefit? | healthinsurance.org
Sitka Alaska Craigslist
Craigslist Sarasota Free Stuff
Call2Recycle Sites At The Home Depot
786 Area Code -Get a Local Phone Number For Miami, Florida
Latest Posts
Article information

Author: Msgr. Refugio Daniel

Last Updated:

Views: 6410

Rating: 4.3 / 5 (54 voted)

Reviews: 85% of readers found this page helpful

Author information

Name: Msgr. Refugio Daniel

Birthday: 1999-09-15

Address: 8416 Beatty Center, Derekfort, VA 72092-0500

Phone: +6838967160603

Job: Mining Executive

Hobby: Woodworking, Knitting, Fishing, Coffee roasting, Kayaking, Horseback riding, Kite flying

Introduction: My name is Msgr. Refugio Daniel, I am a fine, precious, encouraging, calm, glamorous, vivacious, friendly person who loves writing and wants to share my knowledge and understanding with you.