We say a functional equation () is stable if any function g satisfying the equation () approximatelyis near to true solution of (). Using xed point methods, we investigate approximately higherternary derivations in Banach ternary algebras via the Cauchy functional equationf(1x + 2y + 3z) = 1f(x) + 2f(y) + 3f(z) :

The Fibonacci cube Γn is the subgraph of the n-cube induced by the binary strings that contain no two consecutive 1s. These graphs are applicable as interconnection networks and in theoretical chemistry, and lead to the Fibonacci dimension of a graph. In this paper a survey on Fibonacci cubes is given with an emphasis on their structure, including representations, recursive construction, hamilt...

We formalized some basic properties of the Fibonacci numbers using definitions and lemmas from [7] and [23], e.g. Cassini’s and Catalan’s identities. We also showed the connections between Fibonacci numbers and Pythagorean triples as defined in [31]. The main result of this article is a proof of Carmichael’s Theorem on prime divisors of prime-generated Fibonacci numbers. According to it, if we ...

In this study we define and study the Bivariate Complex Fibonacci and Bivariate Complex Lucas Polynomials. We give generating function, Binet formula, explicit formula and partial derivation of these polynomials. By defining these bivariate polynomials for special cases Fn(x, 1) is the complex Fibonacci polynomials and Fn(1, 1) is the complex Fibonacci numbers. Finally in the last section we gi...

The debatable relationship of functional human hand proportion with the Fibonacci series has remained an obscure scientific enigma short of clinical interest. The main difficulty of proving such a relationship lies in defining what should constitute true functional proportion. In this study, we re-evaluate this unique relationship using hand flexion creases as anatomical surrogates for the...

One says g is a Fibonacci primitive root modulo /?, wherep is a prime, iff g is a primitive root modulo/7 and g = g + 1 (mod p). In [1 ] , [2 ] , and [3] some interesting properties of Fibonacci primitive roots were developed. In this paper, we shall show that a necessary and sufficient condition for a prime/? ^ 5 to have a Fibonacci primitive root is p = 1 or 9 (mod 10) and Alp) = p 1, where/I...

this paper describes an approximating solution, based on lagrange interpolation and spline functions, to treat functional integral equations of fredholm type and volterra type. this method can be extended to functional dierential and integro-dierential equations. for showing eciency of the method we give some numerical examples.

The aim of this paper is to investigate the solution following difference equation zn+1=(pn)−1,n∈N0,N0=N∪0 where pn=a+bzn+czn−1zn with parameters a, b, c and initial values z−1,z0 are nonzero quaternions such that their solutions associated generalized Fibonacci-type numbers. Furthermore, we deal symmetric system equations given by zn+1=(qn)−1,wn+1=(rn)−1,n∈N0 qn=a+bwn+czn−1wn rn=a+bzn+cwn−1zn....