MathDB
0622 number theory with combinations 6th edition Round 2 p2

Source:

May 3, 2021
number theoryCombinations6th edition

Problem Statement

Let a1,a2,...,an1a_1, a_2, ..., a_{n-1} be n1n - 1 consecutive positive integers in increasing order such that kk (nk){n \choose k} 0\equiv 0 (mod aka_k), for all k{1,2,...,n1}k \in \{1, 2, ... , n - 1\}. Find the possible values of a1a_1.