Find the number of isosceles triangles with integer sides when no side exceeds 1994. Include equilateral triangles in your count.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Nice solution. Many people miss the "special" counting for cases 2 x < 1 9 9 4 , which can be hard to visualize.
Another approach is to define the set of points as 1 ≤ x ≤ 1 9 9 4 , 1 ≤ y ≤ 1 9 9 4 , y ≤ 2 x − 1 , and then use Pick's Theorem to count the number of lattice points in the interior + boundary.
Log in to reply
@Calvin Lin sir will you please explain this theorem more ?? It seems to be more interesting. And I didn't know this concept..!
Doesn't this include equilateral triangles as well
Log in to reply
yes,it does sir,but in a way equilateral triangles are isosceles too.
Log in to reply
You are right. I wish it weren't - like to think of triangles as scalene, isosceles or equilateral - mutual exclusivity would be nice :-)
Without equilateral triangles, the answer should be 2980033
Problem Loading...
Note Loading...
Set Loading...
Let the equal sides of the isosceles triangle be x and the third side be y . First restriction: x ≤ 1 9 9 4 ,second restriction: y ≤ 1 9 9 4 . Now,because we have to form a triangle,these conditions need to be fulfilled: x + x > y (triangle inequality), x + y > x , x + y > x . But the second and the third equations are the same,so now we only need to fulfill these two equations: x + x > y , x + y > x . But the second inequality is true as long as y is positive.So,that leaves us us with one equation: 2 x > y . Now,we take x = 1 9 9 4 ⟹ 3 9 8 8 > y . But we know that y ≤ 1 9 9 4 . Thus,there are 1994 values of y which satisfy the conditions.Thus,1994 triangles can be formed.Now,we take x = 1 9 9 3 ⟹ 3 9 8 6 > y . But y ≤ 1 9 9 4 . Thus,again y has 1994 values.As long as 2 x > 1 9 9 4 y will have 1994 values. 2 x > 1 9 9 4 as long as x > 9 9 7 . Thus, values of x from 1 9 9 4 − − 9 9 8 y can take up 1994 values.That is a total of 1 9 9 4 ∗ ( 9 9 7 ) = 1 9 8 8 0 1 8 . Now,let us consider values of x for which 2 x = 1 9 9 4 That value is 9 9 7 ⟹ 1 9 9 4 > y . Thus y can have 1 9 9 3 values.Now,let us consider cases for which 2 x < 1 9 9 4 . The first value of x that satisfies this condition is 9 9 6 .Putting x = 9 9 6 we get that 1 9 9 2 > y . Thus there are 1991 possibilities for y . Calculate the next one and you get that there are 1 9 9 1 possibilities for y . This is a series which will continue till 1 . Thus,total = 1 9 9 3 + 1 9 9 1 + . . . . . . 1 = 2 9 9 7 ∗ 1 9 9 4 = 9 9 4 0 0 9 . Thus,total = 1 9 8 8 0 1 8 + 9 9 4 0 0 9 = 2 9 8 2 0 2 7 .