is a triangle, where the angle bisectors of 
and 
intersect at point 
.
and 
lie on sides 
and 
,
passes through point 
.
,
and 
are equal to 
,
and 
,
,
and using the integer 
to arrive at a contradiction.
be positive integers (not necessarily different), such that for any 
,
and 
.
.
denote the set of positive integers. A function 
is said to be bonza if![\[
f(a)~~\text{divides}~~b^a-f(b)^{f(a)}
\]](http://latex.artofproblemsolving.com/7/b/b/7bb6b2b4fcde900ee6f7ef90b906525d61312796.png)
for all positive integers 
and 
.
such that 
for all bonza functions 
and all positive integers 
.
Y by
Can someone help me with this problem? Let 
. We call a distribution the act of distributing the integers from 
to
represented by tokens to players 
to 
so that they all have the same number of tokens in their urns.
We say that
beats 
when, when and each draw a token from their urn, has a strictly greater chance of drawing a larger number than . We then denote 
. A distribution is said to be chicken-fox-viper when 
What is 
, the number of chicken-fox-viper distributions?
. We call a distribution the act of distributing the integers from 
to
represented by tokens to players 
to 
so that they all have the same number of tokens in their urns.We say that
beats 
when, when and each draw a token from their urn, has a strictly greater chance of drawing a larger number than . We then denote 
. A distribution is said to be chicken-fox-viper when 
What is 
, the number of chicken-fox-viper distributions?
?
,
are the draws of players 
and 
.
,
.
would satisfy 
with equal probability 
,
.
has numbers 
,
and player 
has 
"
