If m is a factor of 3 0 , and there are 3 0 0 possible different non-similar triangles in which all of its angles are multiples of m , find m .
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.
I was playing around with the formula m 2 2 7 0 0 for values of m that don't divide 30, but still do divide 180 ( m = 4 , 9 , 1 2 , 1 8 , 2 0 , 3 6 , 4 5 , 6 0 , 9 0 , 1 8 0 ) .
In those cases, the counting of equilateral and isosceles triangles is slightly affected, and m 2 2 7 0 0 = 1 2 1 ( m 1 8 0 ) 2 doesn't come out to be an integer. But it's still within 1 / 3 of the correct integer result, so you can just round its output to the nearest integer.
Problem Loading...
Note Loading...
Set Loading...
Let the three angles in the triangle be a = m x , b = m y , and c = m z for positive integers a , b , c , x , y , z . Then the angle sum is a + b + c = 1 8 0 ° or m x + m y + m z = 1 8 0 ° or x + y + z = m 1 8 0 ° , which is an equation of a plane.
Since a , b , and c are angles in a triangle, we can deduce that 1 ≤ x ≤ m 1 8 0 ° − 2 , 1 ≤ y ≤ m 1 8 0 ° − 2 , and 1 ≤ z ≤ m 1 8 0 ° − 2 , so the number of all integer solutions on the plane within these parameters is
k = 1 ∑ m 1 8 0 − 2 k = 2 1 ( m 1 8 0 ° − 2 ) ( m 1 8 0 ° − 1 ) = m 2 1 6 2 0 0 − m 2 7 0 + 1
However, this amount is too much, as it includes all rotations and reflections of scalene triangles 3 ! = 6 times (possibilities a b c , a c b , b a c , b c a , c a b , and c b a ), and all rotations and reflections of isosceles triangles (that are not equilateral triangles) 2 ! 3 ! = 3 times (possibilities a a b , a b a , and b a a ).
There is 1 possible equilateral triangle.
For isosceles triangles (that are not equilateral triangles), the two congruent angles can be any number from 1 to 2 1 ( m 1 8 0 ° − 2 ) = m 9 0 ° − 1 , minus the 1 equilateral triangle, for m 9 0 ° − 2 possible isosceles triangles (that are not equilateral triangles).
For scalene triangles, we can take the number of all integer solutions and subtract out 3 times the number of isosceles triangles (that are not equilateral triangles) and the 1 equilateral triangle and divide the difference by 6 . This makes a total of 6 1 ( ( m 2 1 6 2 0 0 − m 2 7 0 + 1 ) − 3 ( m 9 0 ° − 2 ) − 1 ) = m 2 2 7 0 0 − m 9 0 + 1 possible scalene triangles.
The total number of possible non-similar triangles is the sum of the possible equilateral, isosceles (that are not equilateral), and scalene triangles, which is 1 + ( m 9 0 − 2 ) + ( m 2 2 7 0 0 − m 9 0 + 1 ) = m 2 2 7 0 0 .
In this problem, m 2 2 7 0 0 = 3 0 0 , which solves to m = 3 .