Repdigits as products of consecutive Padovan or Perrin numbers

From MaRDI portal
Publication:2048946





The search of repdigits in many subsequences of natural numbers has been done since few decades. Further, in the last decade, complete solutions of many Diophantine equations have been investigated involving the repdigits and terms of recurrence sequences. This current study also deals with similar type of investigation with Padovan and Perrrin sequences. In particular, repdigits which can be represented as the product of consecutive terms of Padovan and Perrin numbers have been explored, which is an extension to the earlier studies done with the binary recurrence sequences such as Fibonacci, Lucas and balancing numbers. The method of proof involves the linear forms in logarithms and some results from the theory of continued fractions, which is generally used to handle such type of Diophantine equation.





Describes a project that uses

Uses Software






This page was built for publication: Repdigits as products of consecutive Padovan or Perrin numbers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2048946)