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 TheOneYouWant, Tawan, skys, Adventure10, Mango247
Let the nervous waiting commence!
No talking about about how to solve the problems.
I've done ~4, and fully locked down 2.
How is everyone else doing?
No talking about about how to solve the problems.
I've done ~4, and fully locked down 2.
How is everyone else doing?
This post has been edited 1 time. Last edited by xPythagoras, Feb 15, 2016, 10:10 PM
Reason: No one seemed to like the other 'rules'
Reason: No one seemed to like the other 'rules'
skills
