Art of Problem Solving

1998 USAMO Problems/Problem 6: Difference between revisions

1=2 (talk | contribs)
Created page with "== Problem == == Solution == {{solution}} ==See Also== {{USAMO newbox|year=1998|num-b=5|num-a=Last Question}} Category:Olympiad Geometry Problems"
 
1=2 (talk | contribs)
Line 1: Line 1:
== Problem ==
== Problem ==
Let <math>n \geq 5</math> be an integer. Find the largest integer <math>k</math> (as a function of <math>n</math>) such that there exists a convex <math>n</math>-gon <math>A_{1}A_{2}\dots A_{n}</math> for which exactly <math>k</math> of the quadrilaterals <math>A_{i}A_{i+1}A_{i+2}A_{i+3}</math> have an inscribed circle. (Here <math>A_{n+j} = A_{j}</math>.)


== Solution ==
== Solution ==

Revision as of 08:14, 13 September 2012

Problem

Let $n \geq 5$ be an integer. Find the largest integer $k$ (as a function of $n$) such that there exists a convex $n$-gon $A_{1}A_{2}\dots A_{n}$ for which exactly $k$ of the quadrilaterals $A_{i}A_{i+1}A_{i+2}A_{i+3}$ have an inscribed circle. (Here $A_{n+j} = A_{j}$.)

Solution

This problem needs a solution. If you have a solution for it, please help us out by adding it.

See Also

1998 USAMO (ProblemsResources)
Preceded by
Problem 5
Followed by
Problem Last Question
1 2 3 4 5 6
All USAMO Problems and Solutions