mathematics project slides
DESCRIPTION
TRANSCRIPT
![Page 1: Mathematics Project Slides](https://reader036.vdocument.in/reader036/viewer/2022062319/553aca395503463a458b45dc/html5/thumbnails/1.jpg)
Ways to Construct Trianglesin an m×n Array of Dots
Kulawat UdomwongsupNatcha TechachainirunPoompipat Nuenkhaekul
Mentors:
Suwat Sriyotee1, Rungsima Sairattanathongkum1 and Prof. Dinesh G. Sarvate2
1Mahidol Wittayanusorn School and 2Mathematics Department, College of Charleston, Charleston, South Carolina, U.S.A.
![Page 2: Mathematics Project Slides](https://reader036.vdocument.in/reader036/viewer/2022062319/553aca395503463a458b45dc/html5/thumbnails/2.jpg)
Acknowledgement
Prof. Dinesh G. SarvateMathematics Dept., College of Charleston,
Charleston, South Carolina, U.S.A.
Suwat Sriyotee and Rungsima SairattanathongkumMahidol Wittayanusorn School
Salaya, Putthamonthon, Nakhon Pathom, Thailand
![Page 3: Mathematics Project Slides](https://reader036.vdocument.in/reader036/viewer/2022062319/553aca395503463a458b45dc/html5/thumbnails/3.jpg)
Introduction
Background:
The transition from place to place can also be viewed as a journey from one dot to another, while tracks traveled can be represented by lines. When these lines are connected, forming
a closed shape, they make polygons. Shapes created by the connection of three dots with three lines are called triangles.
Significance:
This project is to serve as a foundation for future studies.
![Page 4: Mathematics Project Slides](https://reader036.vdocument.in/reader036/viewer/2022062319/553aca395503463a458b45dc/html5/thumbnails/4.jpg)
Objective
To find the relation leading to the number of triangles obtainable in an m×n array of dots.
![Page 5: Mathematics Project Slides](https://reader036.vdocument.in/reader036/viewer/2022062319/553aca395503463a458b45dc/html5/thumbnails/5.jpg)
Methodology1.) Counting stage
2.) Formularizing stage
2.1) 3×n array of dots
2.2) 4×n array of dots
2.3) 5×n array of dots
1. Note the method to obtain the number of triangles.
2. Break the rows into groups of three.
3. Consider each grouped row for the relation of the number of straight lines.
4. Record the result.
5. Check the relation by substituting values of m and n.
![Page 6: Mathematics Project Slides](https://reader036.vdocument.in/reader036/viewer/2022062319/553aca395503463a458b45dc/html5/thumbnails/6.jpg)
Methodology
1.) Counting stage
1. Draw an array of any size.
5. Record the results.
2. Calculate ways to connect three dots together.
3. Consider any three-dotted connection that does not result in a triangle.
4. Remove the number of non-triangles from the number of ways to connect three dots.
![Page 7: Mathematics Project Slides](https://reader036.vdocument.in/reader036/viewer/2022062319/553aca395503463a458b45dc/html5/thumbnails/7.jpg)
For a 3×5 array of dots
Number of triangles: Number of straight lines with three dots
5
3
Methodology
1.) Counting stage (continued)
![Page 8: Mathematics Project Slides](https://reader036.vdocument.in/reader036/viewer/2022062319/553aca395503463a458b45dc/html5/thumbnails/8.jpg)
For a 3×5 array of dots
Number of triangles:
5
3
Methodology
1.) Counting stage (continued)
![Page 9: Mathematics Project Slides](https://reader036.vdocument.in/reader036/viewer/2022062319/553aca395503463a458b45dc/html5/thumbnails/9.jpg)
For a 3×5 array of dots
Number of triangles:
5
3
Methodology
1.) Counting stage (continued)
![Page 10: Mathematics Project Slides](https://reader036.vdocument.in/reader036/viewer/2022062319/553aca395503463a458b45dc/html5/thumbnails/10.jpg)
For a 3×5 array of dots
Number of triangles:
5
3
Methodology
1.) Counting stage (continued)
![Page 11: Mathematics Project Slides](https://reader036.vdocument.in/reader036/viewer/2022062319/553aca395503463a458b45dc/html5/thumbnails/11.jpg)
For a 3×5 array of dots
Number of triangles:
5
3
Methodology
1.) Counting stage (continued)
![Page 12: Mathematics Project Slides](https://reader036.vdocument.in/reader036/viewer/2022062319/553aca395503463a458b45dc/html5/thumbnails/12.jpg)
For a 3×5 array of dots
Number of triangles:
5
3
Methodology
1.) Counting stage (continued)
![Page 13: Mathematics Project Slides](https://reader036.vdocument.in/reader036/viewer/2022062319/553aca395503463a458b45dc/html5/thumbnails/13.jpg)
For a 3×5 array of dots
Number of triangles:
5
3
Methodology
1.) Counting stage (continued)
![Page 14: Mathematics Project Slides](https://reader036.vdocument.in/reader036/viewer/2022062319/553aca395503463a458b45dc/html5/thumbnails/14.jpg)
For a 3×5 array of dots
Number of triangles: 455 – 43 = 412
5
3
Methodology
1.) Counting stage (continued)
![Page 15: Mathematics Project Slides](https://reader036.vdocument.in/reader036/viewer/2022062319/553aca395503463a458b45dc/html5/thumbnails/15.jpg)
The table shows the number of triangles obtained in an m×n array of dots, where m and n are integers.
nm
2 3 4 5 6 7
2 4 18 48 100 180 294
3 18 76 200 412 738 1,200
4 48 200 516 1,056 1,884 3,052
5 100 412 1,056 2,148 3,820 6,176
6 180 738 1,884 3,820 6,772 10,930
7 294 1,200 3,052 6,176 10,930 17,616
Methodology
1.) Counting stage (continued)
![Page 16: Mathematics Project Slides](https://reader036.vdocument.in/reader036/viewer/2022062319/553aca395503463a458b45dc/html5/thumbnails/16.jpg)
2.1) 3×n array of dots
2.2) 4×n array of dots
2.3) 5×n array of dots
Methodology
2.) Formularizing stage1. Note the method to obtain the number of triangles.
2. Break the rows into groups of three.
3. Consider each grouped row for the relation of the number of straight lines.
4. Record the result.
5. Check the relation by substituting values of m and n.
![Page 17: Mathematics Project Slides](https://reader036.vdocument.in/reader036/viewer/2022062319/553aca395503463a458b45dc/html5/thumbnails/17.jpg)
(1, c1)
(2, c2)
(3, c3)
n
Methodology
2.1) 3×n array of dots
![Page 18: Mathematics Project Slides](https://reader036.vdocument.in/reader036/viewer/2022062319/553aca395503463a458b45dc/html5/thumbnails/18.jpg)
The equation is formed by using slope equality.
Methodology
![Page 19: Mathematics Project Slides](https://reader036.vdocument.in/reader036/viewer/2022062319/553aca395503463a458b45dc/html5/thumbnails/19.jpg)
Substitution into the equation results as follows:
However, the number obtained is only for one-direction inclination. Indeed, there are two-direction inclinations.
If n = 1, the number of diagonals is 0.If n = 2, the number of diagonals is 0.If n = 3, the number of diagonals is 1.
If n = 4, the number of diagonals is 1 + 1.If n = 5, the number of diagonals is 1 + 1 + 2.
If n = 6, the number of diagonals is 1 + 1 + 2 + 2.If n = 7, the number of diagonals is 1 + 1 + 2 + 2 + 3.
· ·· ·· ·
Methodology
Case 1
Case 2
Case 1
Case 2
Case 1
Case 2
Case 1
![Page 20: Mathematics Project Slides](https://reader036.vdocument.in/reader036/viewer/2022062319/553aca395503463a458b45dc/html5/thumbnails/20.jpg)
Relations are obtained from the format:
Multiply the above relation by 2 to get the total number of diagonals, both leaning to the left and right to get:
Methodology
Case 1:
Case 2:
Case 1:
Case 2:
![Page 21: Mathematics Project Slides](https://reader036.vdocument.in/reader036/viewer/2022062319/553aca395503463a458b45dc/html5/thumbnails/21.jpg)
(2, c2)
(3, c3)
(4, c4)
(1, c1)
n
Methodology
2.2) 4×n array of dots
![Page 22: Mathematics Project Slides](https://reader036.vdocument.in/reader036/viewer/2022062319/553aca395503463a458b45dc/html5/thumbnails/22.jpg)
Relations leading to number of diagonals are as follows:
Methodology
2.2) 4×n array of dots (continued)
![Page 23: Mathematics Project Slides](https://reader036.vdocument.in/reader036/viewer/2022062319/553aca395503463a458b45dc/html5/thumbnails/23.jpg)
Methodology
2.3) 5×n array of dots
(3, c2)
(4, c4)
(5, c5)
(2, c2)
(1, c1)
n
![Page 24: Mathematics Project Slides](https://reader036.vdocument.in/reader036/viewer/2022062319/553aca395503463a458b45dc/html5/thumbnails/24.jpg)
Relations are obtained from the format:
Methodology
2.3) 5×n array of dots (continued)
![Page 25: Mathematics Project Slides](https://reader036.vdocument.in/reader036/viewer/2022062319/553aca395503463a458b45dc/html5/thumbnails/25.jpg)
Each term to be taken off consists of two sub-terms. The front term varies depending on the change of m, but the back term always remains
the same.
Methodology
![Page 26: Mathematics Project Slides](https://reader036.vdocument.in/reader036/viewer/2022062319/553aca395503463a458b45dc/html5/thumbnails/26.jpg)
Result: Relation between size of array of dots (m×n) and the number of triangles available in it.
![Page 27: Mathematics Project Slides](https://reader036.vdocument.in/reader036/viewer/2022062319/553aca395503463a458b45dc/html5/thumbnails/27.jpg)
Conclusion
Progress has been made in finding the relation leading to the number of triangles available in
an m×n array of dots.
![Page 28: Mathematics Project Slides](https://reader036.vdocument.in/reader036/viewer/2022062319/553aca395503463a458b45dc/html5/thumbnails/28.jpg)
Thank you.
![Page 29: Mathematics Project Slides](https://reader036.vdocument.in/reader036/viewer/2022062319/553aca395503463a458b45dc/html5/thumbnails/29.jpg)
![Page 30: Mathematics Project Slides](https://reader036.vdocument.in/reader036/viewer/2022062319/553aca395503463a458b45dc/html5/thumbnails/30.jpg)
References
David Burghes, Robert Davison (1992). Sequence and Series: Cranfield University Press.
Dennis W. Stanton, Dennis White (1986). Constructive Combinatorics: Springer.