Displaying 61 – 80 of 173

Showing per page

The Josephus problem

Lorenz Halbeisen, Norbert Hungerbühler (1997)

Journal de théorie des nombres de Bordeaux

We give explicit non-recursive formulas to compute the Josephus-numbers j ( n , 2 , i ) and j ( n , 3 , i ) and explicit upper and lower bounds for j ( n , k , i ) (where k 4 ) which differ by 2 k - 2 (for k = 4 the bounds are even better). Furthermore we present a new fast algorithm to calculate j ( n , k , i ) which is based upon the mentioned bounds.

The k-Fibonacci matrix and the Pascal matrix

Sergio Falcon (2011)

Open Mathematics

We define the k-Fibonacci matrix as an extension of the classical Fibonacci matrix and relationed with the k-Fibonacci numbers. Then we give two factorizations of the Pascal matrix involving the k-Fibonacci matrix and two new matrices, L and R. As a consequence we find some combinatorial formulas involving the k-Fibonacci numbers.

Currently displaying 61 – 80 of 173