Keywords: generalized Fibonacci numbers, Jacobsthal and jacobsthalLucas numbers, Binet’s formula
Applied Mathematics and Physics, 2013 1 (4),
pp 126128.
DOI: 10.12691/amp145
Received August 20, 2013; Revised November 11, 2013; Accepted November 15, 2013
Copyright © 2014 Science and Education Publishing. All Rights Reserved.
1. Introduction
It is wellknown that the Fibonacci sequence is most prominent examples of recursive sequence. The Fibonacci sequence is famous for possessing wonderful and amazing properties. Fibonacci numbers are a popular topic for mathematical enrichment and popularization. The Fibonacci appear in numerous mathematical problems. The Fibonacci numbers are terms of the sequence wherein each term is the sum of the two previous terms, beginning with the values and .
There are a lot of identities of Fibonacci and Lucas numbers described in ^{[6]}. Thongmoon ^{[10]}, defined various identities of Fibonacci and Lucas numbers. Singh, Bhadouria and Sikhwal ^{[9]}, present some generalized identities involving common factors of Fibonacci and Lucas numbers. Gupta and Panwar ^{[1]}, present identities involving common factors of generalized Fibonacci, Jacobsthal and jacobsthalLucas numbers. Panwar, Singh and Gupta ^{[8]}, present Generalized Identities Involving Common factors of generalized Fibonacci, Jacobsthal and jacobsthalLucas numbers. In this paper, we present generalized identities involving common factors of generalized Fibonacci, Jacobsthal and jacobsthalLucas numbers.
2. Preliminaries
Before presenting our main theorems, we will need to introduce some known results and notations.
Generalized Fibonacci sequence ^{[2, 7]} is defined as
 (2.1) 
where are positive integers.
For different values of many sequences can be determined.
If , we get
 (2.2) 
The first few terms of are 2, 0, 4, 4, 12, 20 and so on.
Its Binet forms is defined by
 (2.3) 
The Jacobsthal sequence ^{[3]}, is defined by the recurrence relation
 (2.4) 
Its Binet’s formula is defined by
 (2.5) 
The JacobsthalLucas sequence ^{[3]}, is defined by the recurrence relation
 (2.6) 
Its Binet’s formula is defined by
 (2.7) 
where are the roots of the characteristic equation
3. Main Results
Generalized Fibonacci sequence ^{[2, 7]}, similar to the other second order classical sequences. In this section we present generalized identities involving common factors of generalized Fibonacci, Jacobsthal and JacobsthalLucas numbers. We shall use the Binet’s formula for derivation.
Theorem 1: If is the generalized Fibonacci numbers and is JacobsthalLucas numbers, then,
 (3.1) 
.
Proof:
This completes the proof.
Corollary 1.1: For different values of , (3.1) can be expressed for even and odd numbers:
Corollary 1.2:
 (3.2) 
Following theorems can be solved by Binet’s formulae (2.3), (2.5) and (2.7).
Theorem 2:
 (3.3) 
Corollary 2.1: For different values of , (3.3) can be expressed for even and odd numbers:
Corollary 2.2:
 (3.4) 
Theorem 3:
 (3.5) 
Corollary 3.1: For different values of , (3.5) can be expressed for even and odd numbers:
Corollary 3.2:
 (3.6) 
.
Theorem 4:
 (3.7) 
.
Corollary 4.1: For different values of , (3.7) can be expressed for even and odd numbers:
Corollary 4.2:
 (3.8) 
 (3.9) 
Corollary 5.1: For different values of , (3.9) can be expressed for even and odd numbers:
Corollary 5.2:
 (3.10) 
.
Theorem 6:
 (3.11) 
Corollary 6.1: For different values of , (3.11) can be expressed for even and odd numbers:
Corollary 6.2:
 (3.12) 
Theorem 7
 (3.13) 
Corollary 7.1: For different values of , (3.13) can be expressed for even and odd numbers:
Corollary 7.2:
 (3.14) 
4. Conclusion
In this paper we present generalized identities involving common factors of generalized Fibonacci, Jacobsthal and jacobsthalLucas numbers and related identities consisting even and odd terms. Mainly Binet’s formula employ for the identities. The concept can be executed for generalized second order recursive sequences as well as polynomials..
References
[1]  Gupta, V. K. & Panwar, Y. K., Common factors of generalized Fibonacci, Jacobsthal and JacobsthalLucas numbers, International Journal of Applied Mathematical Research, 1(4), 377382, 2012. 
 In article  CrossRef 

[2]  Gupta, V. K., Panwar, Y. K. & Sikhwal, O., Generalized Fibonacci sequences, Theoretical Mathematics & Applications, 2(2), 115124, 2012. 
 In article  

[3]  Horadam, F., Jacobsthal Representation Numbers, The Fibonacci Quarterly, 34(1), 4054, 1996. 
 In article  

[4]  Hoggatt, V.E. Jr., Fibonacci and Lucas numbers. Houghton – Mifflin Co., Boston, 1969. 
 In article  

[5]  Hoggatt, V.E. Jr., Phillips, J.W. and Leonard, H. Jr., “Twentyfour Master Identities”, The Fibonacci Quarterly, 9(1), 117, 1971. 
 In article  

[6]  Koshy, T., Fibonacci and Lucas Numbers with Applications, John Wiley, New York, 2001. 
 In article  CrossRef 

[7]  Panwar, Y. K., Generalized Fibonacci sequences, LAP, Germany, 2012. 
 In article  

[8]  Panwar, Y. K., Singh, B. & Gupta, V. K., Generalized Identities Involving Common factors of generalized Fibonacci, Jacobsthal and JacobsthalLucas numbers, International Journal of Analysis and Application, 3(1), 5359, 2013. 
 In article  

[9]  Singh, B., Bhadouria, P. & Sikhwal, O., Generalized Identities Involving Common Factors of Fibonacci and Lucas Numbers, International Journal of Algebra, 5(13), 637645, 2011. 
 In article  

[10]  Thongmoon, M., New Identities for the Even and Odd Fibonacci and Lucas Numbers, Int. J. Contemp. Math. Sciences, 4(7), 303308, 2009. 
 In article  
