نتایج جستجو برای: fibonacci functional equation

تعداد نتایج: 806225  

Journal: :Computers & Graphics 2004
Clifford A. Reiter

The Binet formula gives a natural way for Fibonacci numbers to be viewed as a function of a complex variable. We experimentally study the complex dynamics of the Fibonacci numbers viewed in that manner. Attracting and repelling fixed points are related to the filled Julia set and to regions of escape time images with fascinating behavior. Introduction The Fibonacci numbers are traditionally des...

Journal: :Ars Comb. 2008
Emrah Kilic

In this paper, we give some relations involving the usual Fibonacci and generalized order-k Pell numbers. These relations show that the generalized order-k Pell numbers can be expressed as the summation of the usual Fibonacci numbers. We …nd families of Hessenberg matrices such that the permanents of these matrices are the usual Fibonacci numbers, F2i 1; and their sums. Also extending these mat...

Journal: :Symmetry 2021

Continuous generalizations of the Fibonacci sequence satisfy ODEs that are formal analogues Friedmann equation describing a spatially homogeneous and isotropic cosmology in general relativity. These analogies presented together with their Lagrangian Hamiltonian formulations an invariant sequence.

Journal: :international journal of nonlinear analysis and applications 2015
choonkil park sang og kim jung rye lee dong yun shin

in cite{p}, park introduced the quadratic $rho$-functional inequalitiesbegin{eqnarray}&& |f(x+y)+f(x-y)-2f(x)-2f(y)| && qquad le  left|rholeft(2 fleft(frac{x+y}{2}right) + 2 fleft(frac{x-y}{2}right)- f(x) -  f(y)right)right|,  nonumberend{eqnarray}where $rho$ is a fixed complex number with $|rho|andbegin{eqnarray}&& left|2 fleft(frac{x+y}{2}right) + 2 fleft(frac{x-y}{2}r...

Journal: :bulletin of the iranian mathematical society 2015
l. connell m. levine b. mathes j. sukiennik

we introduce a matricial toeplitz transform and prove that the toeplitz transform of a second order recurrence sequence is another second order recurrence sequence. we investigate the injectivity of this transform and show how this distinguishes the fibonacci sequence among other recurrence sequences. we then obtain new fibonacci identities as an application of our transform.

H. Khodaei M. Kamyar

Moslehian  and Mirmostafaee, investigated the fuzzystability problems for the Cauchy additive functional equation, the Jensen additivefunctional equation and the cubic functional equation in fuzzyBanach spaces. In this paper, we investigate thegeneralized Hyers–-Ulam--Rassias stability of the generalizedadditive functional equation with $n$--variables, in fuzzy Banachspaces. Also, we will show ...

Journal: :Discrete Applied Mathematics 2016
Elif Saygi Ömer Egecioglu

We provide explicit formulas for the maximum number qk(n) of disjoint subgraphs isomorphic to the k-dimensional hypercube in the n-dimensional Fibonacci cube Γn for small k, and prove that the limit of the ratio of such cubes to the number of vertices in Γn is 1 2k for arbitrary k. This settles a conjecture of Gravier, Mollard, Špacapan and Zemljič about the limiting behavior of qk(n).

Journal: :I. J. Network Security 2010
Moon K. Chetry W. B. Vasantha Kandaswamy

Lagged Fibonacci Generators (LFG) are used as a building block of key-stream generator in stream cipher cryptography. In this note, we have used the self-shrinking concept in LFG and given an upper bound 2 n+m 8 for the self-shrinking LFG, where n is the number of stage and m is the word size of the LFG. We have also shown that the bound is attained by all the LFGs of degree n < 28, result supp...

Journal: :Discrete Applied Mathematics 2015
Sylvain Gravier Michel Mollard Simon Spacapan Sara Sabrina Zemljic

The Fibonacci cube of dimension n, denoted as Γn, is the subgraph of n-cube Qn induced by vertices with no consecutive 1’s. We study the maximum number of disjoint subgraphs in Γn isomorphic to Qk, and denote this number by qk(n). We prove several recursive results for qk(n), in particular we prove that qk(n) = qk−1(n − 2) + qk(n − 3). We also prove a closed formula in which qk(n) is given in t...

Journal: :Electronic Notes in Discrete Mathematics 2013
Pietro Codara Ottavio M. D'Antona

We provide a formula for the number of edges of the Hasse diagram of the independent subsets of the hth power of a path ordered by inclusion. For h = 1 such a value is the number of edges of a Fibonacci cube. We show that, in general, the number of edges of the diagram is obtained by convolution of a Fibonacci-like sequence with itself.

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید