AoPS Academy
[/quote]
, do not answer with "
is a solution" only. Either you post any kind of proof or at least something unexpected (like "
is the smallest solution). Someone that does not see that is a solution of the above without your post is completely wrong here, this is an IMO-level forum.
be a prime number and 
. Prove that![\[\left| p^m - (p - 2)! \right| > p^2.\]](http://latex.artofproblemsolving.com/2/1/c/21ca8bb6e5727d48b18b7ec3b127029c4c97694f.png)
Proposed by Miloš Milićev
, 
, with 
, 
. Prove that there exists 
such that for every 
![\[
f_n(x) = \frac{x}{1 + nx}, \quad \text{if and only if } f(x) = \frac{x}{1 + x}, \quad \forall x \geq 0.
\]](http://latex.artofproblemsolving.com/0/f/c/0fc36d9264eb7e103128c489aeae521a859c1fd4.png)
(For and , the notation 
represents 
. )
are non-negative real numbers and 
Prove that
and 
take turns playing the following game: There is a pile of 
stones. In his first turn, selects a divisor of and removes this number of stones from the pile. then chooses a divisor of the number of remaining stones, and removes that number of stones from the new pile, and so on. The player who has to remove the last stone loses. Show that one of the two players has a winning strategy and describe the strategy.
denote the 
th Fibonacci number, defined by the recurrence:![\[
F_0 = 0,\quad F_1 = 1,\quad \text{and} \quad F_{n+2} = F_{n+1} + F_n \quad \text{for } n \geq 0.
\]](http://latex.artofproblemsolving.com/1/b/c/1bc4aa38be3c2c64832e25376a923df611807864.png)
For a fixed modulus 
, define the set![\[
S_m = \left\{ (i, j) \in \mathbb{N}^2 : F_i \cdot F_j \equiv 1 \pmod{m} \right\}.
\]](http://latex.artofproblemsolving.com/c/0/4/c04881682fdc91ae0a7a78a807044c3658e0412e.png)
Prove that 
if and only if 
.
such that 
,![\[
f(x^2+f(y))=f(xf(x))+y
\]](http://latex.artofproblemsolving.com/d/e/d/dedd2338779fcc6723077ce586713fb4a68b9931.png)
such that![\[ f(x) + f(y) + 2xy = f(x + y) \]](http://latex.artofproblemsolving.com/e/3/d/e3dfbb279ff146cc0923115fe9d3f8d9e3488e17.png)
for all nonnegative real numbers 
and 
.
(from the set of real numbers to itself) where
for all reals 
and 
be two triangles inscribed in the same circle, centered at 
, and sharing the same orthocenter 
. The Simson lines of the points 
with respect to triangle form a non-degenerate triangle 
. lies on the circle with diameter 
.
lie in this order on the circle and form a convex, non-degenerate hexagon.
and be positive integers posessing the following property: the equation
holds for all positive integers 
. Prove that 
for some integer 
.
.
, which implies that 
(since 
), or c=0,9.
since 
.
work.
, which is a contradiction since 
.
.
whereas 
(this occurs when a,k are both minimal at 1), whence there are no solutions for this case.
, i.e. m|n if n is a multiple of 1000.
?
such that 
the equality hold for 
or 
or any
such that 
.
such that![\[f(x+y)+f(y+z)+f(z+x)\ge 3f(x+2y+3z)\]](http://latex.artofproblemsolving.com/9/8/a/98ab64d17bc7d6bf7533b0874177fc963405c1d8.png)
.
is an integer.
.
obviously has the same first two digits as 
.
.
,
,
.
,
,
.
gives 
,
.