Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 5

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
Wyszukiwano:
w słowach kluczowych:  recursive sequence
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
1
Content available remote On the dynamics of the recursive sequence ...[wzór]
EN
In this paper, we investigate the global behavior of the difference equation ...[wzór] where β is a positive parameter and α, γ are non-negative parameters and non-negative initial conditions.
2
Content available remote On the solutions of the recursive sequence xx+1 = ...[wzór]
EN
In this paper we study the solutions of the difference equation x + ...[wzór] for n = 0,1,2, ... where a, x-(2k+1), x-(2k), x-(2k-1), ..., x0 are the real numbers such that x0x-(k+1) ≠ a, x-1x-(k+2) ≠ a, x-2x-(k+3) ≠ a. ..., x-kx-(2k+1) ≠ a and k is a natural number.
3
Content available remote On the solution of the recursive sequence
EN
We obtain in this paper the solution of the following recursive sequence where the initial conditions x-2, x-1are arbitrary non zero real numbers.
4
Content available remote On the solution of recursive sequence of order two
EN
We obtain in this paper the solution of the following difference equation (formula), n= 0, 1,... where the initial conditions x-1, x0 are arbitrary real numbers.
5
Content available remote On the recursive sequence Xn+1=alfa+Xn-k:f(Xn,....Xn-k+1)
EN
The boundedness, global attractivity, oscillatory and asymptotic periodicity of the nonnegative solutions of the difference equation of the form Xn+l=alfa+Xn-k:f(Xn,....Xn-k+1, n=0, 1, ..... is investigated, where alfa > 0, k is an element of N and f : [0,infinity)- (0,infinity)k is a continuous function nondecreasing in each variable.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.