•  
  •  
 

Turkish Journal of Mathematics

Author ORCID Identifier

LÁSZLÓ NÉMETH: 0000-0001-9062-9280

LÁSZLÓ SZALAY: 0000-0002-4582-6100

DOI

10.55730/1300-0098.3562

Abstract

We give a method to determine an explicit solution to a system of two inhomogeneous linear recursive sequences of higher order. Our approach can be used efficiently in solving certain combinatorial problems. We finish the paper by considering a tiling problem with black and white dominoes, and we use the method as a demonstration to find the solution.

Keywords

Linear recurrence, vector recurrence, tiling, k -generalized Fibonacci number

First Page

1079

Last Page

1088

Creative Commons License

Creative Commons Attribution 4.0 International License
This work is licensed under a Creative Commons Attribution 4.0 International License.

Share

COinS