It can even be a negative.
Follow Mike Diver on Thatter.
By Lemma 2.3, one can see that the length of a negative semicycle is at most 3, and a positive semicycle is at most 2. On the basis of the strictly oscillatory character of the solution, we see that, for some integer p ≥ 0, one of the following 32 cases must occur: case 1: x p < 1, x p+1< 1; case 2: x p > 1, x p+1< 1; case 3: x p < 1, x p+1> 1; case 4: x p > 1, x p+1> 1. case 1 cannot occur.
For simplicity, for some nonnegative integer we denote by the terms of a positive semicycle of the length three, and by a negative semicycle with semicycle length of two, then a positive semicycle and a negative semicycle, and so on.
For simplicity, for some nonnegative integer p, we denote by {x p, x p+1}+ the terms of a positive semicycle of length two, followed by {x p+2}-, a negative semicycle with semicycle length one, then a positive semicycle of length two and a negative semicycle of length one, and so on.
A negative semicycle of the solution of (2.1) consists of a "string" of terms, all less than the equilibrium point, with and such that (4.2).
A negative semicycle of a solution { x n } n = - 1 ∞ of Equation (1.1) consists of a string of terms {x r, x r+1,..., x m }, all less than the equilibrium x ̄, with r ≥ -1 and m ≤ ∞ such that e i t h e r r = - 1 o r r > - 1 a n d x r - 1 ≥ x ̄. and e i t h e r m = ∞ o r m < ∞ a n d x m + 1 ≥ x ̄.
"This was a negative result".
It was a negative approach.
