On repdigits as product of consecutive Lucas numbers
| dc.contributor.author | Irmak, Nurettin | |
| dc.contributor.author | Togbe, Alain | |
| dc.date.accessioned | 2024-11-07T13:25:09Z | |
| dc.date.available | 2024-11-07T13:25:09Z | |
| dc.date.issued | 2018 | |
| dc.department | Niğde Ömer Halisdemir Üniversitesi | |
| dc.description.abstract | Let (L-n)(n >= 0 )be the Lucas sequence. D. Marques and A. Togbe [7] showed that if F-n . . . Fn+k-1 is a repdigit with at least two digits, then (k, n) = (1, 10), where (F-n)(>= 0) is the Fibonacci sequence. In this paper, we solve the equation L-n . . . Ln+k-1 = a (10(m) - 1/9) , where 1 <= a <= 9, n, k >= 2 and in are positive integers. | |
| dc.identifier.doi | 10.7546/nntdm.2018.24.3.95-102 | |
| dc.identifier.endpage | 102 | |
| dc.identifier.issn | 1310-5132 | |
| dc.identifier.issn | 2367-8275 | |
| dc.identifier.issue | 3 | |
| dc.identifier.startpage | 95 | |
| dc.identifier.uri | https://doi.org/10.7546/nntdm.2018.24.3.95-102 | |
| dc.identifier.uri | https://hdl.handle.net/11480/14549 | |
| dc.identifier.volume | 24 | |
| dc.identifier.wos | WOS:000448478500012 | |
| dc.identifier.wosquality | N/A | |
| dc.indekslendigikaynak | Web of Science | |
| dc.language.iso | en | |
| dc.publisher | Bulgarian Acad Science | |
| dc.relation.ispartof | Notes on Number Theory and Discrete Mathematics | |
| dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | |
| dc.rights | info:eu-repo/semantics/openAccess | |
| dc.snmz | KA_20241106 | |
| dc.subject | Lucas numbers | |
| dc.subject | Repdigits | |
| dc.title | On repdigits as product of consecutive Lucas numbers | |
| dc.type | Article |
