Results 11 to 20 of about 189 (146)
Exact Determinants of Some Special Circulant Matrices Involving Four Kinds of Famous Numbers [PDF]
Circulant matrix family is used for modeling many problems arising in solving various differential equations. The RSFPLR circulant matrices and RSLPFL circulant matrices are two special circulant matrices.
Xiaoyu Jiang, Kicheon Hong
doaj +3 more sources
On Partial Sum of Tribonacci Numbers [PDF]
We study the sumst(k,r)=∑i=0tTki+rofkstep apart Tribonacci numbers for any1≤r≤k. We prove thatst(k,r)satisfies certain Tribonacci rulest(k,r)=akst-1(k,r)+bkst-2(k,r)+st-3(k,r)+λwith integersak,bk,ck, andλ.
Eunmi Choi, Jiin Jo
openaire +4 more sources
Repdigits as Sums of Four Tribonacci Numbers
In this paper, we show that 66666 is the largest repdigit expressible as the sum of four tribonacci numbers. We used Binet’s formula, Baker’s theory, and a reduction method during the proving procedure. We also used the periodic properties of tribonacci number modulo 9 to deal with three individual cases.
Yuetong Zhou +3 more
openaire +2 more sources
Addition and multiplication of beta-expansions in generalized Tribonacci base [PDF]
We study properties of β-numeration systems, where β > 1 is the real root of the polynomial x3 - mx2 - x - 1, m ∈ ℕ, m ≥ 1. We consider arithmetic operations on the set of β-integers, i.e., on the set of numbers whose greedy expansion in base β has no ...
Petr Ambrož +2 more
doaj +4 more sources
A Note on k-Bonacci Random Walks
In this work, the probability of return for random walks on Z, whose increment is given by the k-bonacci sequence, is determined. Additionally, the Hausdorff, packing and box-counting dimensions of the set of these walks that return an infinite number of
Najmeddine Attia +3 more
doaj +2 more sources
On the Characteristic Polynomial of the Generalized k-Distance Tribonacci Sequences
In 2008, I. Włoch introduced a new generalization of Pell numbers. She used special initial conditions so that this sequence describes the total number of special families of subsets of the set of n integers.
Pavel Trojovský
doaj +2 more sources
On perfect numbers close to Tribonacci numbers [PDF]
In [1], Faco and Marques gave the conditions that even perfect numbers belonging to k-generalized Fibonacci numbers. In this paper, we present alternative proof for being even perfect numbers in Tribonacci sequence. Our methods depends on p-adic order of a Tribonacci number. Moreover, we present the perfect numbers with distance 1 to Tribonacci numbers.
Irmak, Nurettin, Acikel, Abdullah
openaire +4 more sources
Minimal weight expansions in Pisot bases
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 +2 more sources
On prime powers in linear recurrence sequences. [PDF]
In this paper we consider the Diophantine equation Un=px where Un is a linear recurrence sequence, p is a prime number, and x is a positive integer.
Odjoumani J, Ziegler V.
europepmc +2 more sources
An extended framework for bihyperbolic generalized Tribonacci numbers [PDF]
The aim of this article is to identify and analyze a new type special number system which is called bihyperbolic generalized Tribonacci numbers (BGTN for short). For this purpose, we give both classical and several new properties such as; recurrence relation, Binet formula, generating function, exponential generating function, summation formulae ...
Nurten Gürses, Zehra İşbilir
openaire +4 more sources

