MathDB
A 12

Source:

May 25, 2007
Divisibility Theory

Problem Statement

Let k,m,k,m, and nn be natural numbers such that m+k+1m+k+1 is a prime greater than n+1n+1. Let cs=s(s+1).c_{s}=s(s+1). Prove that the product (cm+1ck)(cm+2ck)(cm+nck)(c_{m+1}-c_{k})(c_{m+2}-c_{k})\cdots (c_{m+n}-c_{k}) is divisible by the product c1c2cnc_{1}c_{2}\cdots c_{n}.