Numerical results on some generalized random Fibonacci sequences
نویسندگان
چکیده
منابع مشابه
Some Divisibility Properties of Generalized Fibonacci Sequences
Let c be any square-free integer, p any odd prime such that (c/p) = -1, and n any positive integer. The quantity ./IT, which would ordinarily be defined (mod p) as one of the two solutions of the congruence: x E c (mod p n ) , does not exist. Nevertheless, we may deal with objects of the form a + b/c~(mod p), where a and b are integers, in much the same way that we deal with complex numbers, th...
متن کاملOn Periodic ∞-generalized Fibonacci Sequences
The notion of an∞-generalized Fibonacci sequence has been introduced in [6], and studied in [1], [7], [9]. This class of sequences defined by linear recurrences of infinite order is an extension of the class of ordinary (weighted) r-generalized Fibonacci sequences (r-GFS, for short) with r finite defined by linear recurrences of r order (for example, see [2], [3], [4], [5], [8] etc.) More preci...
متن کاملAlmost-sure Growth Rate of Generalized Random Fibonacci sequences
We study the generalized random Fibonacci sequences defined by their first nonnegative terms and for n ≥ 1, Fn+2 = λFn+1 ± Fn (linear case) and F̃n+2 = |λF̃n+1 ± F̃n| (non-linear case), where each ± sign is independent and either + with probability p or − with probability 1 − p (0 < p ≤ 1). Our main result is that, when λ is of the form λk = 2 cos(π/k) for some integer k ≥ 3, the exponential growt...
متن کاملRandom Fibonacci Sequences
We study the random Fibonacci tree, which is an infinite binary tree with non-negative numbers at each node defined as follows. The root consists of the number 1 with a single child also the number 1. Then we define the tree recursively in the following way: if x is the parent of y, then y has two children, namely |x−y| and x+y. This tree was studied by Benoit Rittaud [?] who proved that any pa...
متن کاملSome Identities for Generalized Fibonacci and Lucas Sequences
In this study, we define a generalization of Lucas sequence {pn}. Then we obtain Binet formula of sequence {pn} . Also, we investigate relationships between generalized Fibonacci and Lucas sequences.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 2010
ISSN: 0898-1221
DOI: 10.1016/j.camwa.2009.08.001