# Happy birthday to me (part 2)

**Discrete Mathematics**Level pending

Let \(S\) denote the number of ordered \(({n_1}, {n_2},...,{n_{18}})\) \(18\)-ples solutions to an inequation such that:

\(S=\# \{{n_1},{n_2},...,{n_{18}} \in \mathbb{N_{0}} \mid 1997 < {n_1}+{n_2}+...+{n_{18}} < 2015\}\).

If the number of solutions can be expressed as \(S=\displaystyle {\binom {a}{b}}-\binom {b-1}{c}\), find \(\lfloor {x} \rfloor\), where \(x\) is the arithmetic mean of \(a,b\) and \(c\).

**Details and assumptions**

For any \(k\leq{n}\) there are two different binomial coefficients which satisfy

\(\displaystyle {\binom {n}{k}}=p=\binom {n}{n-k}\).

In this problem \(c\) is the smallest possible value;

\(\lfloor{x}\rfloor\) is the value of the greatest integer smaller than or equal to \(x\);

Try my "Happy birthday to me (part 1)" if you liked this one.

**Your answer seems reasonable.**Find out if you're right!

**That seems reasonable.**Find out if you're right!

Already have an account? Log in here.