← Complete problem index

PROJECT EULER · #0704

Factors of Two in Binomial Coefficients

Statement only · SolvedOriginal problem ↗

Define g(n,m) to be the largest integer k such that 2k divides (nm). For example, (125)=792=233211, hence g(12,5)=3. Then define F(n)=max{g(n,m):0mn}. F(10)=3 and F(100)=6.

Let S(N) = n=1NF(n). You are given that S(100)=389 and S(107)=203222840.

Find S(1016).

Write-up coming later

The complete problem is available here. An approach, code, and answer will be added later.