Let nn be a given integer >2> 2, and let VnV_n be the set of integers 1+kn1 + kn, where k=1,2,…k = 1, 2, \ldots. A number m∈Vnm \in V_n is called indecomposable in VnV_n if there do not exist numbers p,q∈Vnp, q \in V_n such that pq=mpq = m. Prove that there exists a number r∈Vnr \in V_n that can be expressed as the product of elements indecomposable in VnV_n in more than one way. (Products which differ only in the order of their factors will be considered the same.)