For positive integers n,m define f(n,m) as follows. Write a list of 2001 numbers ai, where a1=m, and ak+1 is the residue of ak2 modn (for k=1,2,...,2000). Then put f(n,m)=a1−a2+a3−a4+a5−...+a2001. For which n≥5 can we find m such that 2≤m≤n/2 and f(m,n)>0? number theoryNumber theoretic functionsresidue