Slowly Varying Solutions of the Difference Equation Xn+1 = f(Xn,. . ., Xn-k) + g(n, Xn, Xn-1,. . ., Xn-k)

DC Field	Value	Language
dc.contributor.author	Karakostas, George	en
dc.contributor.author	Stević, Stevo	en
dc.date.accessioned	2020-05-01T20:13:48Z	-
dc.date.available	2020-05-01T20:13:48Z	-
dc.date.issued	2004-01-01	en
dc.identifier.issn	10236198	en
dc.identifier.uri	http://researchrepository.mi.sanu.ac.rs/handle/123456789/1711	-
dc.description.abstract	We provide conditions which guarantee that all bounded solutions of the difference equation Xn+1 = f(xn, . . ., xn-k) + g(n, xn, xn-1, . . ., xn-k) are slowly varying in the sense that lim(xn+1 - xn) = 0.	en
dc.publisher	Taylor & Francis	-
dc.relation.ispartof	Journal of Difference Equations and Applications	en
dc.subject	Difference equation \| Full solution \| Relatively prime integers \| Slowly varying	en
dc.title	Slowly Varying Solutions of the Difference Equation Xn+1 = f(Xn,. . ., Xn-k) + g(n, Xn, Xn-1,. . ., Xn-k)	en
dc.type	Article	en
dc.identifier.doi	10.1080/10236190310001625271	en
dc.identifier.scopus	2-s2.0-1842459387	en
dc.relation.firstpage	249	en
dc.relation.lastpage	255	en
dc.relation.issue	3	en
dc.relation.volume	10	en
dc.description.rank	M22	-
item.openairetype	Article	-
item.openairecristype	http://purl.org/coar/resource_type/c_18cf	-
item.cerifentitytype	Publications	-
item.grantfulltext	none	-
item.fulltext	No Fulltext	-
crisitem.author.orcid	0000-0002-7202-9764	-

8

checked on Apr 22, 2024

28

checked on Apr 23, 2024

Check