Let a=b be positive real numbers and m,n be positive integers. An m+n-gon P has the property that m sides have length a and n sides have length b. Further suppose that P can be inscribed in a circle of radius a+b. Compute the number of ordered pairs (m,n), with m,n≤100, for which such a polygon P exists for some distinct values of a and b.
A number or a short expression. Fractions can be typed as 3/2, and spacing doesn't matter.
Solution
Letting x=a+ba, we have to solve marcsin2x+narcsin21−x=π This is convex in x, so if it is to have a solution, we must find that the LHS exceeds π at one of the endpoints. Thus max(m,n)≥7. If min(m,n)≤5 we can find a solution by by the intermediate value theorem. Also if min(m,n)≥7 then marcsin2x+narcsin21−x≥14arcsin(1/4)>π The inequality arcsin(1/4)>14π can be verified by noting that sin14π<14π<143.5=41 The final case is when min(m,n)=6. We claim that this doesn't actually work. If we assume that n=6, we may compute the derivative at 0 to be 2m−6⋅31=2m−48>0 so no solution exists.
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.
Source: Omni-MATH,
licensed Apache-2.0.
Statement reproduced verbatim; metadata (topic, difficulty) added by this project.