MathDB
classical, but yet hard

Source: Romanian ROM TST 2004, problem 10, created by Calin Popescu

May 3, 2004
inductionalgebra proposedalgebra

Problem Statement

Prove that for all positive integers n,mn,m, with mm odd, the following number is an integer 13mnk=0m(3m3k)(3n1)k. \frac 1{3^mn}\sum^m_{k=0} { 3m \choose 3k } (3n-1)^k.