be a convex pentagon with 
and 
For each point 
in the plane, define 
The least possible value of 
can be expressed as 
where 
and 
are positive integers and 
is not divisible by the square of any prime. Find 
be the set of positive integers. A function 
satisfies the equation ![\[\underbrace{f(f(\ldots f}_{f(n)\text{ times}}(n)\ldots))=\frac{n^2}{f(f(n))}\]](http://latex.artofproblemsolving.com/2/e/7/2e73ff2f75b103e9d6a4004a42e4ed7f4ee64a67.png)
for all positive integers 
.
Y by
I'm nearly in high school now but only average like 75 on AMC 10 sadly. I want to get better so I'm doing like the first 11 questions of previous AMC 10's almost every day because I also did previous years for AMC 8. Is there any specific way to get better scores and understand more difficult problems past AMC 8? I have almost no trouble with AMC 8 problem given enough time (like 23-24 right with enough time).
