Repdigits as Product of Fibonacci and Tribonacci Numbers

dc.rights.license	CC BY	eng
dc.contributor.author	Bednařík, Dušan	cze
dc.contributor.author	Trojovská, Eva	cze
dc.date.accessioned	2025-12-05T09:22:30Z
dc.date.available	2025-12-05T09:22:30Z
dc.date.issued	2020	eng
dc.identifier.issn	2227-7390	eng
dc.identifier.uri	http://hdl.handle.net/20.500.12603/1120
dc.description.abstract	In this paper, we study the problem of the explicit intersection of two sequences. More specifically, we find all repdigits (i.e., numbers with only one repeated digit in its decimal expansion) which can be written as the product of a Fibonacci by a Tribonacci number (both with the same indexes). To work on this problem, our approach is to combine lower bounds from the Baker's theory with reduction methods (based on the theory of continued fractions) due to Dujella and Petho.	eng
dc.format	p. "Article Number: 1720"	eng
dc.language.iso	eng	eng
dc.publisher	MDPI-Molecular diversity preservation international	eng
dc.relation.ispartof	Mathematics, volume 8, issue: 10	eng
dc.subject	k-generalized Fibonacci numbers	eng
dc.subject	linear forms in logarithms	eng
dc.subject	reduction method	eng
dc.title	Repdigits as Product of Fibonacci and Tribonacci Numbers	eng
dc.type	article	eng
dc.identifier.obd	43876907	eng
dc.identifier.doi	10.3390/math8101720	eng
dc.publicationstatus	postprint	eng
dc.peerreviewed	yes	eng
dc.source.url	https://www.mdpi.com/2227-7390/8/10/1720	cze
dc.relation.publisherversion	https://www.mdpi.com/2227-7390/8/10/1720	eng
dc.rights.access	Open Access	eng