Abstract. This paper studies the behavior of positive solutions of the recursive equationwith y −s , y −s+1 , . . . , y −1 ∈ (0, ∞) and k, m ∈ {1, 2, 3, 4, . . .}, where s = max{k, m}. We prove that if gcd(k, m) = 1, with k odd, then y n tends to 2, exponentially. When combined with a recent result of E.