Let d(n) denote the number of positive divisors of n. For any given integer a≥3, define a sequence {ai}i=0∞ satisfying [*] a0=a, and
[*] an+1=an+(−1)nd(an) for each integer n≥0. For example, if a=275, the sequence would be 275,281,279,285,277,279,273. Prove that for each positive integer k there exists a positive integer N such that if such a sequence has period 2k and all terms of the sequence are greater than N then all terms of the sequence have the same parity.Proposed by Navid number theorydivisor function