Difference between revisions of "Mock AIME 1 2006-2007 Problems/Problem 5"

 
Line 6: Line 6:
  
 
then <math>f(n)=y</math>. If there is no such <math>y</math>, then <math>f(n)=0</math>. If <math>p=11</math>, find the sum: <math>f(1)+f(2)+...+f(p^{2}-1)+f(p^{2})</math>.
 
then <math>f(n)=y</math>. If there is no such <math>y</math>, then <math>f(n)=0</math>. If <math>p=11</math>, find the sum: <math>f(1)+f(2)+...+f(p^{2}-1)+f(p^{2})</math>.
 +
 +
[[Mock AIME 1 2006-2007]]

Revision as of 14:57, 24 July 2006

5. Let $p$ be a prime and $f(n)$ satisfy $0\le f(n) <p$ for all integers $n$. $\lfloor x\rfloor$ is the greatest integer less than or equal to $x$. If for fixed $n$, there exists an integer $0\le y < p$ such that:


$ny-p\left\lfloor \frac{ny}{p}\right\rfloor=1$


then $f(n)=y$. If there is no such $y$, then $f(n)=0$. If $p=11$, find the sum: $f(1)+f(2)+...+f(p^{2}-1)+f(p^{2})$.

Mock AIME 1 2006-2007