English
Related papers

Related papers: A simplified Binet formula for k-generalized Fibon…

200 papers

The purpose of this paper is to discuss the relationship between prime numbers and sums of Fibonacci numbers. One of our main results says that for every sufficiently large integer $k$ there exists a prime number that can be represented as…

Number Theory · Mathematics 2022-08-17 Michael Drmota , Clemens Müllner , Lukas Spiegelhofer

We derive a general recurrence relation for squares of Fibonacci-like numbers. Various properties are developed, including double binomial summation identites.

General Mathematics · Mathematics 2019-01-09 Kunle Adegoke , Tokunbo Omiyinka

In this paper, closed forms of the summation formulas for generalized Tribonacci numbers are presented. Then, some previous results are recovered as particular cases of the present results. As special cases, we give summation formulas of…

General Mathematics · Mathematics 2019-10-09 Yüksel Soykan

We speculate on the distribution of primes in exponentially growing, linear recurrence sequences $(u_n)_{n\geq 0}$ in the integers. By tweaking a heuristic which is successfully used to predict the number of prime values of polynomials, we…

Number Theory · Mathematics 2024-09-10 Jon Grantham , Andrew Granville

We study growth rates of generalised Fibonacci sequences of a particular structure. These sequences are constructed from choosing two real numbers for the first two terms and always having the next term be either the sum or the difference…

Number Theory · Mathematics 2021-02-22 Kevin Hare , J. C. Saunders

In this paper, we define k-generalized order-k numbers and we obtain a relation between i-th sequences and k-th sequences of k-generalized order-k numbers. We give some determinantal and permanental representations of k-generalized order-k…

Number Theory · Mathematics 2011-11-18 Kenan Kaygisiz , Adem Sahin

One of the most popular and studied recursive series is the Fibonacci sequence. It is challenging to see how Fibonacci numbers can be used to generate other recursive sequences. In our article, we describe some families of integer…

Number Theory · Mathematics 2024-03-25 Kálmán Liptai , László Németh , Tamás Szakács , László Szalay

The article uses an arithmetic-geometric Fibonacci series to find the expected value of trials needed to observe k consecutive successes for the first time in a Bernoulli experiment using a recurrence relation. It is important to note that…

History and Overview · Mathematics 2024-12-03 Priyansh Khare

This note generalizes the Fibonacci primitive roots to the set of integers. An asymptotic formula for counting the number of integers with such primitive root is introduced here.

General Mathematics · Mathematics 2019-01-16 N. A. Carella

In this paper, we introduce the h-analogue of Fibonacci numbers for non-commutative h-plane. For h h'= 1 and h = 0, these are just the usual Fibonacci numbers as it should be. We also derive a collection of identities for these numbers.…

Mathematical Physics · Physics 2009-10-02 H. B. Benaoum

We dedicate this paper to investigate the most generalized form of Fibonacci Sequence, one of the most studied sections of the mathematical literature. One can notice that, we have discussed even a more general form of the conventional one.…

General Mathematics · Mathematics 2015-02-25 Masum Billal

This paper presents new identities expressing the terms of Fibonacci, Lucas, and generalized Fibonacci sequences with multiple indices through powers of Lucas numbers and binomial coefficients. The obtained formulas rely on the application…

Combinatorics · Mathematics 2026-04-24 Nick Vorobtsov

This article present a new, direct and simple formula for constructing Mignotte sequences.

Cryptography and Security · Computer Science 2024-12-23 Marek Putresza

The Fibonacci sequence is a sequence of numbers that has been studied for hundreds of years. In this paper, we introduce the new sequence S_{k,n} with initial conditions S_{k,0} = 2b and S_{k,1} = bk + a, which is generated by the…

Number Theory · Mathematics 2017-05-31 Kyunghwan Song , Youngwoo Kwon

The Fibonacci numbers are a sequence of integers in which every number after the first two, 0 and 1, is the sum of the two preceding numbers. These numbers are well known and algorithms to compute them are so easy that they are often used…

Data Structures and Algorithms · Computer Science 2018-04-16 Ali Dasdan

A new family of generalized Pell numbers was recently introduced and studied by Br\'od \cite{Dorota}. These number possess, as Fibonacci numbers, a Binet formula. Using this, partial sums of arbitrary powers of generalized Pell numbers can…

Number Theory · Mathematics 2020-10-28 Helmut Prodinger

In this paper we prove an extreme value law for a stochastic process obtained by iterating the R\'enyi map $x \mapsto \beta x \pmod 1$, where we assume that $\beta>1$ is an integer. Haiman (2018) derived a recursion formula for the Lebesgue…

Dynamical Systems · Mathematics 2020-12-14 N. B-S. Boer , A. E. Sterk

The Tribonacci sequence is a well-known example of third order recurrence sequence, which belongs to a particular class of recursive sequences. In this article, other generalized Tribonacci sequence is introduced and defined by…

Combinatorics · Mathematics 2018-07-11 Gamaliel Cerda-Morales

It is shown how some of the recent results of de Souza et al. [1] can be generalized to describe Hamiltonians whose eigenvalues are given as k-generalized Fibonacci numbers. Here k is an arbitrary integer and the cases considered by de…

Mathematical Physics · Physics 2007-05-23 Matthias Schork

Spinors are used in physics quite extensively. The goal of this study is also the spinor structure lying in the basis of the quaternion algebra. In this paper, first, we have introduced spinors mathematically. Then, we have defined…

General Mathematics · Mathematics 2025-04-08 Gamaliel Cerda-Morales