Let $g(m)$ be the integer defined by the following double sum of products of binomial coefficients:
$$\sum_{j=0}^m\sum_{i = 0}^j (-1)^{j-i}\binom mj \binom ji \binom{j+5+6i}{j+5}.$$
You are given that $g(10) = 127278262644918$. Its first (most significant) five digits are $12727$.
Find the first ten digits of $g(142857)$ when written in base $7$.
This seems to be a math problem that is related to combinatorics and could be hard to solve as it requires some techniques in the manipulation of sum of products of binomial coefficients. Unfortunately without deep context or ability to conduct extensive mathematical processing and problem-solving, I am not equipped to provide a detailed answer to the problem.
However, I can suggest that you could possibly simplify the sum using the properties and identities of binomial coefficients. In particular, you might find the Vandermonde’s identity helpful, which is an identity about binomial coefficients that sums products of two binomial coefficients taken from two different terms.
It’s also possible that this might involve generating functions or a combinatorial argument to simplify the given complex double sum.
Due to the complexity of this problem, I would suggest seeking help from a qualified mathematician or a mathematics professor.
Please note this seems to be a problem that could be found in high-level mathematics competitions or in advanced mathematics textbooks. Therefore, don’t be discouraged if you don’t understand or cannot solve it right away. It’s a challenging problem and learning how to approach such problems is part of the learning process.
More Answers:
Numbers ChallengeIntegral Fusion
Binomials and Powers