Challenge Let's imagine an N-tuple of integers between 0 and M inclusive, and let's call it F. There are (M + 1) ** N possible Fs in total. How many such Fs satisfy all of the following inequalities (index is one-based)? F[n] + F[n+1] <= M for 1 <= n < N F[N] + F[1] <= M Write a program or...