Counting triangles
Madhusudanan, Sundarraman (2016) Counting triangles. At Right Angles, 5 (3). pp. 2427. ISSN 25821873
Text
 Published Version
Download (147kB) 
Abstract
In this article, I study the problem of counting the number of triangles formed in a triangle if n segments are drawn from one vertex to its opposite side, and h segments are drawn from another vertex to its opposite side. This kind of counting problem is often seen in puzzle collections; e.g.: “Count the number of triangles visible in Figure 1”. Making a manual count for such a problem is tedious; also, it is easy to make an error in the count. We need a more analytic and systematic procedure.
Item Type:  Articles in APF Magazines  

Authors:  Madhusudanan, Sundarraman  
Document Language: 


Uncontrolled Keywords:  Triangles, Counting, Combinations  
Subjects:  Natural Sciences > Mathematics  
Divisions:  Azim Premji University > University Publications > At Right Angles  
Full Text Status:  Public  
URI:  http://publications.azimpremjiuniversity.edu.in/id/eprint/3127  
Publisher URL: 
Actions (login required)
View Item 
CORE (COnnecting REpositories)