The fencing problem
Member rating: No Rating | Words: | Submitted: Fri Aug 26 2005
On the left is an image preview of every page of this document, and below are the first 150 words with formatting removed:
The Fencing Problem The problem of fencing is to find the land with the largest area and yet having perimeter of land of 1000m. This could consist of many different shapes such as any quadrilaterals and also circles etc. In order to solve this problem, I will need to go through the many various shapes, finding their areas yet containing the perimeter of 1000m. I will first start the problem with the quadrilateral group, which consists of squares, rectangles, rhombuses, parallelograms and trapeziums etc. First with the square I will find the lengths of the sides and find its area. I already know that there can only be one square that has the perimeter of 1000m, because then if the sides were not all even, it would then not be a regular rectangle, otherwise known as a square. 250m x 2x + 2y = perimeter 500 + 500 = 1000 y = area 250...


