MathDB
Divisibility related to powers

Source: Canadian Mathematical Olympiad - 1986 - Problem 4.

July 3, 2011
number theory unsolvednumber theory

Problem Statement

For all positive integers nn and kk, define F(n,k)=r=1nr2k1F(n,k) = \sum_{r = 1}^n r^{2k - 1}. Prove that F(n,1)F(n,1) divides F(n,k)F(n,k).