The Rascal Triangle - Mathematical Association of America
... “We have worked out the next few rows.” We produced a piece of paper. “See!” ...
... “We have worked out the next few rows.” We produced a piece of paper. “See!” ...
Section 7 * 2 The Pythagorean theorem & Its converse
... B) A right triangle has a hypotenuse of length 25 and a leg of length 10. Find the length of the other leg. Do the lengths of the sides form a Pythagorean triple? ...
... B) A right triangle has a hypotenuse of length 25 and a leg of length 10. Find the length of the other leg. Do the lengths of the sides form a Pythagorean triple? ...
Embedded Figures Answer Key
... 6. All are triangular numbers. For the up triangles the numbers will be 21, 15, 10, 6, 3, and 1. The down triangles will be 15 of size 1, 6 of size 2, and 1 of size 3. The pattern is found by counting down every other triangular number starting with the number found in the second column of the first ...
... 6. All are triangular numbers. For the up triangles the numbers will be 21, 15, 10, 6, 3, and 1. The down triangles will be 15 of size 1, 6 of size 2, and 1 of size 3. The pattern is found by counting down every other triangular number starting with the number found in the second column of the first ...
as a file
... The play is a comedy Star Wars spoof, but is packed full of curriculum based problems and information. The same basic story works for all three levels but we have sections of maths that swap in and out. For Key Stage 1 we start off by looking at measuring things and using the right unit of measureme ...
... The play is a comedy Star Wars spoof, but is packed full of curriculum based problems and information. The same basic story works for all three levels but we have sections of maths that swap in and out. For Key Stage 1 we start off by looking at measuring things and using the right unit of measureme ...
Weber problem
In geometry, the Weber problem, named after Alfred Weber, is one of the most famous problems in location theory. It requires finding a point in the plane that minimizes the sum of the transportation costs from this point to n destination points, where different destination points are associated with different costs per unit distance.The Weber problem generalizes the geometric median, which assumes transportation costs per unit distance are the same for all destination points, and the problem of computing the Fermat point, the geometric median of three points. For this reason it is sometimes called the Fermat–Weber problem, although the same name has also been used for the unweighted geometric median problem. The Weber problem is in turn generalized by the attraction–repulsion problem, which allows some of the costs to be negative, so that greater distance from some points is better.