Results 21 to 30 of about 123 (113)
Generalized Tribonacci Function and Tribonacci Numbers
International Journal of Recent Technology and Engineering (IJRTE), 2020 In the language of mathematics, sequence is considered to be list of numbers arranged in a particular way. A lot of sequences have been minutely studied till date. One of the most conspicuous among them is Fibonacci sequence. It is the sequence, which can be found by adding two previous terms, where the initial conditions are 0 and 1.
openaire +1 more source
Tribonacci and Tribonacci-Lucas numbers via the determinants of special matrices
Applied Mathematical Sciences, 2014 In this paper, by using determinants of special matrices, it has been mainly obtained Tribonacci and Tribonacci-Lucas numbers. © 2014 Nazmiye Yilmaz and Necati Taskara.
Yilmaz N., Taskara N.
openaire +1 more source
On Repdigits as Sums of Fibonacci and Tribonacci Numbers [PDF]
Symmetry, 2020 In this paper, we use Baker’s theory for nonzero linear forms in logarithms of algebraic numbers and a Baker-Davenport reduction procedure to find all repdigits (i.e., numbers with only one distinct digit in its decimal expansion, thus they can be seen as the easiest case of palindromic numbers, which are a ”symmetrical” type of numbers) that can be ...
openaire +1 more source
The Generalized Tribonacci Numbers with Negative Subscripts
Integers, 2014 See the abstract in the attached pdf.
Kantaphon Kuhapatanakul +1 more
openaire +4 more sources
Quadratic Approximation of Generalized Tribonacci Sequences
Discussiones Mathematicae - General Algebra and Applications, 2018 In this paper, we give quadratic approximation of generalized Tribonacci sequence {Vn}n≥0 defined by Vn = rVn−1 + sV n−2 + tV n−3 (n ≥ 3) and use this result to give the matrix form of the n-th power of a companion matrix of {Vn}n≥0. Then we re-prove the
Cerda-Morales Gamaliel
doaj +1 more source
On Third‐Order Linear Recurrent Functions
Discrete Dynamics in Nature and Society, Volume 2019, Issue 1, 2019., 2019 A function ψ:R→R is said to be a Tribonacci function with period p if ψ(x + 3p) = ψ(x + 2p) + ψ(x + p) + ψ(x), for all x∈R. In this paper, we present some properties on the Tribonacci functions with period p. We show that if ψ is a Tribonacci function with period p, then limx→∞(ψ(x + p)/ψ(x)) = β, where β is the root of the equation x3 − x2 − x − 1 = 0
Kodjo Essonana Magnani +1 more
wiley +1 more source
Explicit Form of the Inverse Matrices of Tribonacci Circulant Type Matrices
Abstract and Applied Analysis, Volume 2015, Issue 1, 2015., 2015 It is a hot topic that circulant type matrices are applied to networks engineering. The determinants and inverses of Tribonacci circulant type matrices are discussed in the paper. Firstly, Tribonacci circulant type matrices are defined. In addition, we show the invertibility of Tribonacci circulant matrix and present the determinant and the inverse ...
Li Liu, Zhaolin Jiang, Zidong Wang
wiley +1 more source
Minimal weight expansions in Pisot bases
Journal of Mathematical Cryptology, 2008 For applications to cryptography, it is important to represent numbers with a small number of non-zero digits (Hamming weight) or with small absolute sum of digits.
Frougny Christiane, Steiner Wolfgang
doaj +1 more source
A note on generalized hybrid Tribonacci numbers
Discussiones Mathematicae - General Algebra and Applications, 2020 In this paper, we introduce the generalized hybrid Tribonacci numbers. These numbers can be considered as a generalization of the generalized complex Tribonacci, generalized hyperbolic Tribonacci and generalized dual Tribonacci numbers. We also obtain some identities for these numbers.
openaire +3 more sources
Total Graph Interpretation of the Numbers of the Fibonacci Type
Journal of Applied Mathematics, Volume 2015, Issue 1, 2015., 2015 We give a total graph interpretation of the numbers of the Fibonacci type. This graph interpretation relates to an edge colouring by monochromatic paths in graphs. We will show that it works for almost all numbers of the Fibonacci type. Moreover, we give the lower bound and the upper bound for the number of all (A1, 2A1)‐edge colourings in trees.
Urszula Bednarz +3 more
wiley +1 more source