A symmetric algorithm for hyperharmonic and Fibonacci numbers

نویسندگان

  • Ayhan Dil
  • István Mezö
چکیده

In this work, we introduce a symmetric algorithm obtained by the recurrence relation an = a k n−1+a k−1 n . We point out that this algorithm can be apply to hyperharmonic-, ordinary and incomplete Fibonacciand Lucas numbers. An explicit formulae for hyperharmonic numbers, general generating functions of the Fibonacciand Lucas numbers are obtained. Besides we define ”hyperfibonacci numbers”, ”hyperlucas numbers”. Using these new concepts, some relations between ordinary and incomplete Fibonacciand Lucas numbers are investigated.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Coefficient Bounds for Analytic bi-Bazileviv{c} Functions Related to Shell-like Curves Connected with Fibonacci Numbers

In this paper, we define and investigate a new class of bi-Bazilevic functions related to shell-like curves connected with Fibonacci numbers.  Furthermore, we find estimates of first two coefficients of functions belonging to this class. Also, we give the Fekete-Szegoinequality for this function class.

متن کامل

Some Identities for Fibonacci and Incomplete Fibonacci p-Numbers via the Symmetric Matrix Method

We obtain some new formulas for the Fibonacci and Lucas p-numbers, by using the symmetric infinite matrix method. We also give some results for the Fibonacci and Lucas p-numbers by means of the binomial inverse pairing.

متن کامل

Energy of Graphs, Matroids and Fibonacci Numbers

The energy E(G) of a graph G is the sum of the absolute values of the eigenvalues of G. In this article we consider the problem whether generalized Fibonacci constants $varphi_n$ $(ngeq 2)$ can be the energy of graphs. We show that $varphi_n$ cannot be the energy of graphs. Also we prove that all natural powers of $varphi_{2n}$ cannot be the energy of a matroid.

متن کامل

Symmetric Numerical Semigroups Generated by Fibonacci and Lucas Triples

The symmetric numerical semigroups S (Fa, Fb, Fc) and S (Lk, Lm, Ln) generated by three Fibonacci (Fa, Fb, Fc) and Lucas (Lk, Lm, Ln) numbers are considered. Based on divisibility properties of the Fibonacci and Lucas numbers we establish necessary and sufficient conditions for both semigroups to be symmetric and calculate their Hilbert generating series, Frobenius numbers and genera.

متن کامل

A New Parallel Matrix Multiplication Method Adapted on Fibonacci Hypercube Structure

The objective of this study was to develop a new optimal parallel algorithm for matrix multiplication which could run on a Fibonacci Hypercube structure. Most of the popular algorithms for parallel matrix multiplication can not run on Fibonacci Hypercube structure, therefore giving a method that can be run on all structures especially Fibonacci Hypercube structure is necessary for parallel matr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Applied Mathematics and Computation

دوره 206  شماره 

صفحات  -

تاریخ انتشار 2008