On the Recursive Sequence xn+1=xn?(k+1)1+xnxn?1…xn?k
| dc.contributor.author | Şimşek, Dağıstan | |
| dc.contributor.author | Abdullayev, Fahreddin G. | |
| dc.date.accessioned | 2020-03-26T20:11:48Z | |
| dc.date.available | 2020-03-26T20:11:48Z | |
| dc.date.issued | 2018 | |
| dc.department | Selçuk Üniversitesi, Mühendislik Fakültesi, Endüstri Mühendisliği Bölümü | en_US |
| dc.description.abstract | A solution of the following difference equation is investigated: xn+1 = xn?(k+1) 1 +xnxn?1...xn?k , n = 0,1,2,... where x?(k+1),x?k,...,x?1,x0 ? (0,?) and k = 0,1,2,... . | en_US |
| dc.identifier.citation | Şimşek, D., Abdullayev, F. G. (2018 ). On the Recursive Sequence xn+1=xn−(k+1)1+xnxn−1…xn−k. Journal of Mathematical Sciences, 234, (1), 73-81. | |
| dc.identifier.doi | 10.1007/s10958-018-3982-y | en_US |
| dc.identifier.endpage | 81 | en_US |
| dc.identifier.issn | 1072-3374 | en_US |
| dc.identifier.issue | 1 | en_US |
| dc.identifier.scopusquality | Q3 | en_US |
| dc.identifier.startpage | 73 | en_US |
| dc.identifier.uri | https://dx.doi.org/10.1007/s10958-018-3982-y | |
| dc.identifier.uri | https://hdl.handle.net/20.500.12395/37222 | |
| dc.identifier.volume | 234 | en_US |
| dc.indekslendigikaynak | Scopus | en_US |
| dc.language.iso | en | en_US |
| dc.publisher | Springer New York LLC | en_US |
| dc.relation.ispartof | Journal of Mathematical Sciences | en_US |
| dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | en_US |
| dc.rights | info:eu-repo/semantics/closedAccess | en_US |
| dc.selcuk | 20240510_oaig | en_US |
| dc.subject | Difference equation | en_US |
| dc.subject | Solution of period k + 2 | en_US |
| dc.title | On the Recursive Sequence xn+1=xn?(k+1)1+xnxn?1…xn?k | en_US |
| dc.type | Article | en_US |
Dosyalar
Orijinal paket
1 - 1 / 1
Küçük Resim Yok
- İsim:
- Full Text Access.pdf
- Boyut:
- 191.72 KB
- Biçim:
- Adobe Portable Document Format
- Açıklama:
- Full Text Access
