m is an integer satisfying m≥2024 , p is the smallest prime factor of m , for an arithmetic sequence {an} of positive numbers with the common difference m satisfying : for any integer 1≤i≤2p , there doesn’t exist an integer x,y≤max{a1,m} such that ai=xy Try to proof that there exists a positive real number c such that for any 1≤i≤j≤n , gcd(ai,aj)=c×gcd(i,j) arithmetic sequencenumber theorygreatest common divisor