Results 71 to 80 of about 114 (94)

Melham's conjecture on odd power sums of fibonacci numbers

open access: yes, 2016
Ozeki and Prodinger showed that the odd power sum of the first several consecutive Fibonacci numbers of even order is equal to a polynomial evaluated at a certain Fibonacci number of odd order. We prove that this polynomial and its derivative both vanish
Xie, Matthew H.Y.   +2 more
core  

On The Jacobsthal-Padovan p-Sequences in Groups

open access: yesTopological Algebra and its Applications, 2017
In [5], Deveci defined the Jacobsthal-Padovan p-sequence. In this paper,we extend this sequence to groups. Then we define the Jacobsthal-Padovan p-orbit and we study the Jacobsthal-Padovan p-orbits of the finite groups in detail.
Aküzüm Yesim, Deveci Ömür
doaj   +1 more source

On Diophantine equations involving Lucas sequences

open access: yesOpen Mathematics, 2019
In this paper, we shall study the Diophantine equation un = R(m)P(m)Q(m), where un is a Lucas sequence and R, P and Q are polynomials (under weak assumptions).
Trojovský Pavel
doaj   +1 more source

HIGHER ORDER RECURRENCES FOR ANALYTICAL FUNCTIONS OF TCHEBYSHEFF TYPE

open access: yes, 1999
. Relation of hyperbolons of volume one to generalized Clifford algebras is described in [1b] and there some applications are listed. In this note which is an extension of [8] we use the one parameter subgroups of the group of hyperbolons of volume one ...
A. K. Kwa´sniewski
core  

On The Order Of Convergence Of A Determinantal Family Of Root-Finding Methods

open access: yes, 1997
For each natural number m greater than one, and each natural number k less than or equal to m, there exists a root-finding iteration function, defined as the ratio of two determinants that depend on the first m \Gamma k derivatives of the given function,
Bahman Kalantari
core  

A Fibonacci-like sequence of composite numbers

open access: yes, 1999
In 1964, Ronald Graham proved that there exist relatively prime natural numbers a and b such that the sequence fA n g defined by A n = A n\Gamma1 +A n\Gamma2 (n 2; A 0 = a; A 1 = b) contains no prime numbers, and constructed a 34-digit pair ...
John W. Nicol
core  

On the Diophantine equation $F_n^x+F_{n+1}^x=F_m^y$

Rocky Mountain Journal of Mathematics, 2015
Noriko Hirata-Kohno, Florian Luca
exaly  

On the Generalized Order-$k$ Fibonacci and Lucas Numbers

Rocky Mountain Journal of Mathematics, 2006
Emrah Kilic
exaly  

Theq-Pilbert matrix

International Journal of Computer Mathematics, 2012
Helmut Prodinger
exaly  

An exponential Diophantine equation related to powers of two consecutive Fibonacci numbers

Proceedings of the Japan Academy Series A: Mathematical Sciences, 2011
Florian Luca
exaly  

Home - About - Disclaimer - Privacy