1.

Find the number of functions from to the integers such

that , and for all and
in

Solution:
Because and can differ by at most for , if
decreases times, then This implies
that can decrease at most time.

Now we case on the value of .

CASE 1: . In this case, note that for all . Let , , and
denote the number of times this difference is , , and respectively. Then we have the system of
equations and . Subtracting the first equation from the second
yields , so , , , or . These yield
respectively, so the number of possibilities in this case is

CASE 2: . We split this up into two smaller subscases.

 SUBCASE 1: for .
 Note that thecondition
condition implies
that , and so it must be that
and This means
that and are uniquely determined, and in particular
that . As a result, we have three more values of to
compute, and we want to arrage them in such a way that the total increase is . It turns out
that there are only two ways to do this: either two differences of and one difference of or
one difference of and two differences of . Either way, the he number of ways to arrange these

differences is , so there are possibilities for each ; this yields a total

of possible functions in this subcase.
 SUBCASE 2: or . In these cases, note that only
and respectively are uniquely determined, but after that point we can apply a similar
approach as above. In particular, the only solutions to
and are and , so

we get tuples

(where here the comes from WLOG'ing the former possibility).

Hence the number of possible functions is .