Let p be a prime number greater than 5. Let V be the collection of all positive integers n that can be written in the form n=kp+1 or n=kp−1 (k=1,2,…). A number n∈V is called indecomposable in V if it is impossible to find k,l∈V such that n=kl. Prove that there exists a number N∈V that can be factorized into indecomposable factors in V in more than one way. number theory proposednumber theory