Two diameters and one radius are drawn in a circle of radius 1, dividing the circle into 5 sectors. The largest possible area of the smallest sector can be expressed as , where are relatively prime positive integers. Compute .
Solution
Let the two diameters split the circle into four sectors of areas , , and , where . Without loss of generality, let . If our radius cuts into a sector of area , the area of the smallest sector will be of the form . Note that . If our radius cuts into a sector of area , then the area of the smallest sector will be of the form . This equals if and it equals if . This implies that the area of the smallest sector is maximized when , and we get an area of .
Want a route through all this instead of an archive? The track
puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.