DC Field | Value | Language |
---|---|---|
dc.contributor.author | Stević, Stevo | en |
dc.date.accessioned | 2020-05-01T20:13:38Z | - |
dc.date.available | 2020-05-01T20:13:38Z | - |
dc.date.issued | 2008-08-01 | en |
dc.identifier.issn | 0893-9659 | en |
dc.identifier.uri | http://researchrepository.mi.sanu.ac.rs/handle/123456789/1616 | - |
dc.description.abstract | This work studies the boundedness and global attractivity for the positive solutions of the difference equation xn + 1 = max {c, frac(underover(x, n, p), underover(x, n - 1, p))}, n ∈ N0, with p, c ∈ (0, ∞). It is shown that: (a) there exist unbounded solutions whenever p ≥ 4, (b) all positive solutions are bounded when p ∈ (0, 4), (c) every positive solution is eventually equal to 1 when p ∈ (0, 4) and c ≥ 1, (d) all positive solutions converge to 1 whenever p, c ∈ (0, 1). | en |
dc.publisher | Elsevier | - |
dc.relation.ispartof | Applied Mathematics Letters | en |
dc.subject | Boundedness | Difference equation | Global attractivity | Max type difference equations | en |
dc.title | On the recursive sequence xn + 1 = max {c, frac(xnp, xn - 1p)} | en |
dc.type | Article | en |
dc.identifier.doi | 10.1016/j.aml.2007.08.008 | en |
dc.identifier.scopus | 2-s2.0-45249106152 | en |
dc.contributor.affiliation | Mathematical Institute of the Serbian Academy of Sciences and Arts | - |
dc.relation.firstpage | 791 | en |
dc.relation.lastpage | 796 | en |
dc.relation.issue | 8 | en |
dc.relation.volume | 21 | en |
dc.description.rank | M22 | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
item.openairetype | Article | - |
item.cerifentitytype | Publications | - |
item.fulltext | No Fulltext | - |
item.grantfulltext | none | - |
crisitem.author.orcid | 0000-0002-7202-9764 | - |
SCOPUSTM
Citations
105
checked on Nov 23, 2024
Page view(s)
17
checked on Nov 24, 2024
Google ScholarTM
Check
Altmetric
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.