Certain Diophantine equations involving balancing and Lucas-balancing numbers
|
|
- Easter White
- 5 years ago
- Views:
Transcription
1 ACTA ET COMMENTATIONES UNIVERSITATIS TARTUENSIS DE MATHEMATICA Volume 0, Number, December 016 Available online at Certain Diophantine equations involving balancing and Lucas-balancing numbers Prasanta Kumar Ray Abstract. It is well known that if x is a balancing number, then the positive square root of 8x + 1 is a Lucas-balancing number. Thus, the totality of balancing number x and Lucas-balancing number y are seen to be the positive integral solutions of the Diophantine equation 8x + 1 = y. In this article, we consider some Diophantine equations involving balancing and Lucas-balancing numbers and study their solutions. 1. Introduction The concept of balancing numbers came into existence after the paper [] by Behera and Panda wherein, they defined a balancing number n as a solution of the Diophantine equation 1++ +(n 1) = (n+1)+(n+)+ + (n + r), calling r the balancers corresponding to n. They also proved that, x is a balancing number if and only if 8x + 1 is a perfect square. In a subsequent paper [7], Panda studied several fascinating properties of balancing numbers calling the positive square root of 8x + 1, a Lucas-balancing number for each balancing number x. In [7], Panda observed that the Lucasbalancing numbers are associated with balancing numbers in the way Lucas numbers are attached to Fibonacci numbers. Thus, all balancing numbers x and corresponding Lucas-balancing numbers y are positive integer solutions of the Diophantine equation 8x + 1 = y. Though the relationship between balancing and Lucas-balancing numbers is non-linear, like Fibonacci and Lucas numbers, they share the same linear recurrence x n+1 = 6x n x n 1, while initial values of balancing numbers are x 0 = 0, x 1 = 1 and for Lucasbalancing numbers x 0 = 1, x 1 = 3. Demirtürk and Keskin [3] studied certain Diophantine equations relating to Fibonacci and Lucas numbers. Recently, Received June 18, Mathematics Subject Classification. 11B39; 11B83. Key words and phrases. Balancing numbers; Lucas-balancing numbers; Diophantine equations
2 166 PRASANTA KUMAR RAY Keskin and Karaatli [4] have developed some interesting properties for balancing numbers and square triangular numbers. Alvarado et al. [1], Liptai [5, 6], and Szalay [0] studied certain Diophantine equations relating to balancing numbers. The objective of this paper is to study some Diophantine equations involving balancing and Lucas-balancing numbers. The solutions are obtained in terms of these numbers.. Preliminaries In this section, we present some definitions and identities on balancing and Lucas-balancing numbers which we need in the sequel. As usual, we denote the n th balancing and Lucas-balancing numbers by and C n, respectively. It is well known from [7] that C n = 8B n + 1. The sequences { } and {C n } satisfy the recurrence relations +1 = 6 1, B 0 = 0, B 1 = 1; C n+1 = 6C n C n 1, C 0 = 1, C 1 = 3. The balancing numbers and Lucas balancing numbers can also be defined for negative indices by modifying their recurrences as 1 = 6 +1 ; C n 1 = 6C n C n+1, and calculating backwards. It is easy to see that B 1 = 1. Because B 0 = 0, we can check easily that all negatively subscripted balancing numbers are negative and that B n =. By a similar argument, it is easy to verify that C n = C n. Binet s formulas for balancing and Lucas-balancing numbers are, respectively, = αn 1 αn αn and C n = αn where α 1 = 1 +, α = 1, which are units of the ring Z( ). The totality of units of Z( ) is given by U = {α n 1, α n, α n 1, α n } : n Z}. The set U can be partitioned into two subsets U 1 and U such that U 1 = {u U : uu = 1} and U = {u U : uu = 1}. Since α 1 = α and α 1 α = 1, it follows that U 1 = {α n 1, α n, α n 1, α n : n Z}, U = {α n+1 1, α n+1, α n+1 1, α n+1 : n Z}. We also write λ 1 = α 1 = 3 + 8, λ = α = 3 8 and therefore, we have λ 1 λ = 1. Thus, the set U 1 can be written as U 1 = {λ n 1, λ n, λ n 1, λ n : n Z}.,
3 DIOPHANTINE EQUATIONS INVOLVING BALANCING NUMBERS 167 We also need the following identities (see [9]) while establishing certain identities and solving some Diophantine equations in the subsequent section. The first identity is B n = Using the recurrence relation +1 = 6 1, the identity reduces to B n B n 1 = 1, which we may call as Cassini s formula for balancing numbers. Similar identities for Lucas-balancing numbers are C n = C n 1 C n+1 8, C n 6C n C n+1 + C n 1 = 8. The idea of naming the identity as Cassini s formula comes from the literature, where this formula for Fibonacci numbers F n 1 F n+1 F n = ( 1) n or, equivalently, F n F n F n+1 F n 1 = ( 1) n 1 is available. Some other important identities are found in [8, 9]: +1 1 = C n, C n+1 C n 1 = 16, B m+n = B m C n + C m, B m n = B m C n C m, C m+n = C m C n + 8B m, C m n = C m C n 8B m, C m+n = B m+1 C n C n 1 B m. 3. Some identities involving balancing and Lucas-balancing numbers There are several known identities involving balancing, cobalancing and Lucas-balancing numbers. The interested readers are referred to [7] [19]. In this section, we only present some new identities involving balancing and Lucas-balancing numbers. The following two theorems are about nonlinear identities on balancing and Lucas-balancing numbers. Theorem 3.1. For any three integers k, m and n, C m+n + 16B k n C m+n B m+k = 8B m+k + C k n. Proof. By virtue of the identities B m±n = B m C n ± C m and C m±n = C m C n ± 8B m, we obtain [ ] [ ] [ ] Cn 8 Cm Cm+n =. B k C k B m B m+k
4 168 PRASANTA KUMAR RAY Since C n B k 8 = C n k which never vanishes, we have C k [ ] Cm = B m [ Cn 8 B k This implies that ] 1 [ ] Cm+n = 1 C k B m+k C n k [ ] [ ] Ck 8 Cm+n. B k C n B m+k C m = C kc m+n 8 B m+k C n k Since C m 8B m = 1, we have and B m = C nb m+k 8B k C m+n C n k. [ ] Ck C m+n 8 B [ ] m+k Cn B m+k 8B k C m+n 8 = 1, C n k from which the identity follows. C n k Theorem 3.. If k, m and n are three integers such that k n, then C m+n + C m+k + 8B k n = C k nc m+n C m+k. Proof. By virtue of the identities B m±n = B m C n ± C m and C m±n = C m C n ± 8B m, we obtain [ ] [ ] [ ] Cn 8 Cm Cm+n =. C k 8B k B m B m+k Since C n 8 C k 8B k = 8 k, and because k n, this determinant is nonvanishing. Therefore, we have [ ] [ Cm Cn 8B = n B m C k which implies that ] 1 [ ] Cm+n = 1 8B k B m+k k [ 8Bk 8 C k ] [ ] Cm+n, C n B m+k C m = B kc m+n C m+k 8 k Since C m 8B m = 1, we have and B m = C nc m+k C k C m+n 8 k. [ ] Bk C m+n C [ ] m+k Cn C m+k C k C m+n 8 = 1, 8 k and the required identity follows. 8 k Using the matrix multiplication [ ] 1 [ ] [ ] Bn C n Cm Bm+n =, B k C k B m B m+k it is easy to prove the following theorem.
5 DIOPHANTINE EQUATIONS INVOLVING BALANCING NUMBERS 169 Theorem 3.3. If k, m and n are three integers such that k n, then B m+n + B m+k B k n = C k nb m+n B m+k. 4. Some Diophantine equations involving balancing and Lucas-balancing numbers The identities of Section 3 induce the following three Diophantine equations: x + 16 xy 8y = C n, (4.1) x C n xy + y + C n = 1, (4.) x C n xy + y = B n. (4.3) Before the study of these equations, we present the Diophantine equation x 6xy + y = 1 (4.4) resulting out of Casini s formula for balancing numbers. The following theorem shows that all solutions of (4.4) are consecutive pairs of balancing numbers only. Theorem 4.1. All solutions of the Diophantine equation (4.4) are consecutive pairs of balancing numbers only. Proof. After factorization, the Diophantine equation (4.4) takes the form (λ 1 x y)(λ x y) = 1, where λ 1 = 3 + 8, λ = 3 8. This suggests that (λ 1 x y) and (λ x y) are units of Z( ), conjugate to each other, and are members of U 1. Thus for some integer n, we have the following four cases. Case 1 : (λ 1 x y) = λ n 1 and (λ x y) = λ n, Case : (λ 1 x y) = λ n and (λ x y) = λ n 1, Case 3 : (λ 1 x y) = λ n 1 and (λ x y) = λ n, Case 4 : (λ 1 x y) = λ n and (λ x y) = λ n 1. Solving the equation for Case 1, using Cramer s rule, we find λn 1 λ n 1 x = λ 1 = λn 1 λn λ 1 λ n 1 λ λ n =, y = λ 1 λ 1 λ 1 = λn 1 1 λ n 1 = 1. λ 1 λ 1 λ λ
6 170 PRASANTA KUMAR RAY The solution in Case is λn λ n 1 1 λ 1 λ n λ x = λ λ n 1 1 = = B n, y = 1 λ 1 = +1 = B (n+1). 1 λ Finally, the solutions in Case 3 and Case 4 are, respectively, x = B n, y = B (n 1) and x =, y = +1. Thus, in all cases, the solutions of the Diophantine equation (4.4) are consecutive pairs of balancing numbers only. Using Theorem 4.1, we can find solutions of a Diophantine equation derived from the identity of Theorem 3.1. Theorem 4.. All solutions of the Diophantine equation (4.1) are (x, y) = (C m n, B m ), ( C m+n, B m ), ( C m n, B m ), (C m+n, B m ) (4.5) for m, n Z. Proof. The equation (4.1) can be rewritten as λ (x + 8 y) = C n(8y + 1), implying that 8y +1 is a perfect square. Hence, y is a balancing number. So, we may take y = ±B m (y = B m is equivalent to y = B m ), 8y + 1 = C m. When y = B m, we have x = 8B m ± C m C n or x = 8B m ± C m C n and therefore, x = ±C m C n 8B m, i.e. x = C m n or C m+n. When y = B m, we have x = C m n or C m+n. Thus, the totality of solutions of (4.1) is given by (4.5) for m, n Z. Theorem 4.3. All solutions of the Diophantine equation (4.) are given by (x, y) = ( C m n, C m ), ( C m+n, C m ), (C m+n, C m ), (C m n, C m ) (4.6) for m, n Z. Proof. The equation (4.) can be rewritten as (x + C n y) = (C n 1)(y 1) = 8B n(y 1), implying that 8(y 1) is a perfect square. Thus, y is odd and hence y 1 8 is a perfect square. Since y 1 and y+1 are consecutive integers, it follows that y 1 8 is a square triangular number. That is, it is the square of a balancing number, say y 1 = Bm 8
7 DIOPHANTINE EQUATIONS INVOLVING BALANCING NUMBERS 171 and hence y = 8Bm + 1 for some m, so that y = ±C m. Consequently, (x + C n y) = 8Bn(y 1) is equivalent to x + C m C n = ±8B m if y = C m, and x C m C n = ±8B m if y = C m. Thus, the totality of solutions of (4.) is given by (4.6) for m, n Z. In the following theorem, we consider the Diophantine equation (4.3) which may be considered as a generalization of the Diophantine equation discussed in Theorem 4.1. Theorem 4.4. All solutions of the Diophantine equation (4.3) are given by (x, y) = (B m n, B m ), ( B m+n, B m ), ( B m n, B m ), (C m+n, B m ) (4.7) for m, n Z. Proof. The equation (4.3) can be rewritten as (x + C n y) = (C n 1)(y 1) = B n(8y + 1), which suggests that 8y + 1 is a perfect square. Thus, y = ±B m (as usual y = B m is equivalent to y = B m ) and hence 8y + 1 = Cm. Now x can be obtained from x + C y = ±C m and therefore, the totality of solutions is given by (4.7) for m, n Z. In the remaining theorems, we present some Diophantine equations where the proofs require certain divisibility properties of balancing and Lucasbalancing numbers. Theorem 4.5. The solutions of the Diophantine equation are given by (x, y) = ( B(k+1)n x + C n xy + y = 1 (4.8), B ) nk, ( B(k 1)n Proof. The equation (4.8) can be rewritten as, B ) nk (x + C n y) = (C n 1)(y 1) = 8B ny + 1, (m, n Z). (4.9) which suggests that y is a balancing number. Letting y = B m, we have y = Bm, and since y is an integer, it follows that divides B m. Hence by Theorem.8 in [7] (see also [4]), n divides m. Thus, m = nk for some integer k and y = k. Further, (x + C n y) = 8B ny + 1 = 8B nk + 1 = C nk, and hence x + C n y = ±C nk. It follows that, x = C nk ± C nk = B (k+1)n, B (k 1)n.
8 17 PRASANTA KUMAR RAY Thus, the totality of solutions of (4.8) is given by (4.9). The following theorem that resembles Theorem 4. deals with a Diophantine equation whose proof requires conditions under which a Lucas-balancing numbers divides balancing and Lucas-balancing numbers. Theorem 4.6. The solutions of the Diophantine equation x + 16 xy 8y = 1 are given by ( C(k+1)n (x, y) =, B ) ( (k+1)n Ckn,, B ) (k+1)n (m, n Z). (4.10) C n C n C n Proof. The equation x + 16 xy 8y = 1 can be rewritten as (x + 8 y) = 8C ny + 1, implying that 8Cny + 1 is a perfect square and C n y is a balancing number, say C n y = B m, hence C n divides B m. It is easy to see that this is possible if and only if m is an even multiple of n, and hence m = kn for some integer k. Thus, y = B kn C n. Further, (x + 8 y) = 8B kn + 1 = C kn, and hence x = 8 y ± C kn = 8B kn ± C kn. C n Therefore, the totality of solutions is given by (4.10). Lastly, we present a theorem which is a variant of Theorems 3.1 and 4.5. Theorem 4.7. The solutions of the Diophantine equation are given by x C n xy + y = 8B n (4.11) (x, y) = (C m n, C m ), (C m+n, C m ), ( C m+n, C m ), ( C m n, C m ) (4.1) for m, n Z. Proof. The equation (4.11) can be rewritten as (x C n y) = 8Bn(y 1), which suggests that 8(y 1) is a perfect square. Hence y is odd and 8(y 1) = 64 1 y 1 y + 1. Since y 1 and y+1 are consecutive integers, it follows that 1 y 1 y+1 is a square triangular number and hence is equal to the square of a balancing number (see []), say, 1 y 1 y + 1 = Bm for some m and we have 8(y 1) = 64Bm. Thus, y = 8Bm + 1 = Cm implying that y = ±C m, and the equation (x C n y) = 8Bn(y 1) is
9 DIOPHANTINE EQUATIONS INVOLVING BALANCING NUMBERS 173 reduced to (x C n y) = 64BmB n. Therefore, x C n y = ±8B m and the solutions of the equation (4.11) are given by (4.1) for m, n Z. References [1] S. Alvarado, A. Dujella, and F. Luca, On a conjecture regarding balancing with powers of Fibonacci numbers, Integers 1 (01), [] A. Behera and G. K. Panda, On the square roots of triangular numbers, Fibonacci Quart. 37 (1999), [3] B. Demirtürk and R. Keskin, Integer solutions of some Diophantine equations via Fibonacci and Lucas numbers, J. Integer Seq. 1(009), Article , 14 pp. [4] R. Keskin and O. Karaatli, Some new properties of balancing numbers and square triangular numbers, J. Integer Seq. 15 (01) Article 1.1.4, 13 pp. [5] K. Liptai, Fibonacci balancing numbers, Fibonacci Quart. 4 (004), [6] K. Liptai, Lucas balancing numbers, Acta Math. Univ. Ostrav. 14 (006), [7] G. K. Panda, Some fascinating properties of balancing numbers, in: Proceeding of the Eleventh International Conference on Fibonacci Numbers and their Applications, Congr. Numer. 194 (009), [8] G. K. Panda and P. K. Ray, Cobalancing numbers and cobalancers, Int. J. Math. Math. Sci. 8 (005), [9] G. K. Panda and P. K. Ray, Some links of balancing and cobalancing numbers with Pell and associated Pell numbers, Bull. Inst. Math. Acad. Sin. (N.S.). 6 (011), [10] G. K. Panda and S. S. Rout, Gap balancing numbers, Fibonacci Quart. 51 (013), [11] B. K. Patel and P. K. Ray, The period, rank and order of the sequence of balancing numbers modulo m, Math. Rep. (Bucur.) 18 (016), [1] P. K. Ray, Application of Chybeshev polynomials in factorization of balancing and Lucas-balancing numbers, Bol. Soc. Parana. Mat. 30 (01), [13] P. K. Ray, Certain matrices associated with balancing and Lucas-balancing numbers, Matematika 8 (01), 15. [14] P. K. Ray, Curious congruences for balancing numbers, Int. J. Contemp. Math. Sci. 7 (01), [15] P. K. Ray, Factorization of negatively subscripted balancing and Lucas-balancing numbers, Bol. Soc. Parana. Mat. 31 (013), [16] P. K. Ray, New identitities for the common factors of balancing and Lucas-balancing numbers, Int. J. Pure Appl. Math. 85 (013), [17] P. K. Ray, Some congruences for balancing and Lucas-balancing numbers and their applications, Integers 14 (014), Paper No. A8, 8 pp. [18] P. K. Ray, Balancing and Lucas-balancing sums by matrix methods, Math. Rep. (Bucur.) 17 (016), [19] P. K. Ray and B. K. Patel,Uniform distribution of the sequence of balancing numbers modulo m, Unif. Distrib. Theory 11 (016), [0] L. Szalay, On the resolution of simultaneous Pell equations, Ann. Math. Inform. 34 (007), Veer Surendra Sai University of Technology, Odisha, Burla , India address: rayprasanta008@gmail.com
NEW IDENTITIES FOR THE COMMON FACTORS OF BALANCING AND LUCAS-BALANCING NUMBERS
International Journal of Pure and Applied Mathematics Volume 85 No. 3 013, 487-494 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu doi: http://dx.doi.org/10.173/ijpam.v85i3.5
More informationBalancing sequences of matrices with application to algebra of balancing numbers
Notes on Number Theory and Discrete Mathematics ISSN 1310 5132 Vol 20 2014 No 1 49 58 Balancing sequences of matrices with application to algebra of balancing numbers Prasanta Kumar Ray International Institute
More informationRECIPROCAL SUMS OF SEQUENCES INVOLVING BALANCING AND LUCAS-BALANCING NUMBERS
RECIPROCAL SUMS OF SEQUENCES INVOLVING BALANCING AND LUCAS-BALANCING NUMBERS GOPAL KRISHNA PANDA, TAKAO KOMATSU and RAVI KUMAR DAVALA Communicated by Alexandru Zaharescu Many authors studied bounds for
More informationOn arithmetic functions of balancing and Lucas-balancing numbers
MATHEMATICAL COMMUNICATIONS 77 Math. Commun. 24(2019), 77 1 On arithmetic functions of balancing and Lucas-balancing numbers Utkal Keshari Dutta and Prasanta Kumar Ray Department of Mathematics, Sambalpur
More informationA trigonometry approach to balancing numbers and their related sequences. Prasanta Kumar Ray 1
ISSN: 2317-0840 A trigonometry approach to balancing numbers and their related sequences Prasanta Kumar Ray 1 1 Veer Surendra Sai University of Technology Burla India Abstract: The balancing numbers satisfy
More informationINCOMPLETE BALANCING AND LUCAS-BALANCING NUMBERS
INCOMPLETE BALANCING AND LUCAS-BALANCING NUMBERS BIJAN KUMAR PATEL, NURETTIN IRMAK and PRASANTA KUMAR RAY Communicated by Alexandru Zaharescu The aim of this article is to establish some combinatorial
More informationP. K. Ray, K. Parida GENERALIZATION OF CASSINI FORMULAS FOR BALANCING AND LUCAS-BALANCING NUMBERS
Математичнi Студiї. Т.42, 1 Matematychni Studii. V.42, No.1 УДК 511.217 P. K. Ray, K. Parida GENERALIZATION OF CASSINI FORMULAS FOR BALANCING AND LUCAS-BALANCING NUMBERS P. K. Ray, K. Parida. Generalization
More informationBalancing And Lucas-balancing Numbers With Real Indices
Balancing And Lucas-balancing Numbers With Real Indices A thesis submitted by SEPHALI TANTY Roll No. 413MA2076 for the partial fulfilment for the award of the degree Master Of Science Under the supervision
More informationARITHMETIC PROGRESSION OF SQUARES AND SOLVABILITY OF THE DIOPHANTINE EQUATION 8x = y 2
International Conference in Number Theory and Applications 01 Department of Mathematics, Faculty of Science, Kasetsart University Speaker: G. K. Panda 1 ARITHMETIC PROGRESSION OF SQUARES AND SOLVABILITY
More informationPELLANS SEQUENCE AND ITS DIOPHANTINE TRIPLES. Nurettin Irmak and Murat Alp
PUBLICATIONS DE L INSTITUT MATHÉMATIQUE Nouvelle série, tome 100114 016, 59 69 DOI: 10.98/PIM161459I PELLANS SEQUENCE AND ITS DIOPHANTINE TRIPLES Nurettin Irmak and Murat Alp Abstract. We introduce a novel
More informationGENERALIZED LUCAS NUMBERS OF THE FORM 5kx 2 AND 7kx 2
Bull. Korean Math. Soc. 52 (2015), No. 5, pp. 1467 1480 http://dx.doi.org/10.4134/bkms.2015.52.5.1467 GENERALIZED LUCAS NUMBERS OF THE FORM 5kx 2 AND 7kx 2 Olcay Karaatlı and Ref ik Kesk in Abstract. Generalized
More informationBALANCING NUMBERS : SOME IDENTITIES KABERI PARIDA. Master of Science in Mathematics. Dr. GOPAL KRISHNA PANDA
BALANCING NUMBERS : SOME IDENTITIES A report submitted by KABERI PARIDA Roll No: 1MA073 for the partial fulfilment for the award of the degree of Master of Science in Mathematics under the supervision
More informationON GENERALIZED BALANCING SEQUENCES
ON GENERALIZED BALANCING SEQUENCES ATTILA BÉRCZES, KÁLMÁN LIPTAI, AND ISTVÁN PINK Abstract. Let R i = R(A, B, R 0, R 1 ) be a second order linear recurrence sequence. In the present paper we prove that
More informationOn the Diophantine equation k
On the Diophantine equation k j=1 jfp j = Fq n arxiv:1705.06066v1 [math.nt] 17 May 017 Gökhan Soydan 1, László Németh, László Szalay 3 Abstract Let F n denote the n th term of the Fibonacci sequence. Inthis
More informationGENERALIZED FIBONACCI AND LUCAS NUMBERS OF THE FORM wx 2 AND wx 2 1
Bull. Korean Math. Soc. 51 (2014), No. 4, pp. 1041 1054 http://dx.doi.org/10.4134/bkms.2014.51.4.1041 GENERALIZED FIBONACCI AND LUCAS NUMBERS OF THE FORM wx 2 AND wx 2 1 Ref ik Kesk in Abstract. Let P
More information#A2 INTEGERS 12A (2012): John Selfridge Memorial Issue ON A CONJECTURE REGARDING BALANCING WITH POWERS OF FIBONACCI NUMBERS
#A2 INTEGERS 2A (202): John Selfridge Memorial Issue ON A CONJECTURE REGARDING BALANCING WITH POWERS OF FIBONACCI NUMBERS Saúl Díaz Alvarado Facultad de Ciencias, Universidad Autónoma del Estado de México,
More informationOn repdigits as product of consecutive Lucas numbers
Notes on Number Theory and Discrete Mathematics Print ISSN 1310 5132, Online ISSN 2367 8275 Vol. 24, 2018, No. 3, 5 102 DOI: 10.7546/nntdm.2018.24.3.5-102 On repdigits as product of consecutive Lucas numbers
More informationDiophantine triples in a Lucas-Lehmer sequence
Annales Mathematicae et Informaticae 49 (01) pp. 5 100 doi: 10.33039/ami.01.0.001 http://ami.uni-eszterhazy.hu Diophantine triples in a Lucas-Lehmer sequence Krisztián Gueth Lorand Eötvös University Savaria
More informationApplication of Balancing Numbers in Effectively Solving Generalized Pell s Equation
International Journal of Scientific and Innovative Mathematical Research (IJSIMR) Volume 2, Issue 2, February 2014, PP 156-164 ISSN 2347-307X (Print) & ISSN 2347-3142 (Online) www.arcjournals.org Application
More informationarxiv: v2 [math.nt] 29 Jul 2017
Fibonacci and Lucas Numbers Associated with Brocard-Ramanujan Equation arxiv:1509.07898v2 [math.nt] 29 Jul 2017 Prapanpong Pongsriiam Department of Mathematics, Faculty of Science Silpakorn University
More informationOn Some Combinations of Non-Consecutive Terms of a Recurrence Sequence
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 21 (2018), Article 18.3.5 On Some Combinations of Non-Consecutive Terms of a Recurrence Sequence Eva Trojovská Department of Mathematics Faculty of Science
More informationON `-TH ORDER GAP BALANCING NUMBERS
#A56 INTEGERS 18 (018) ON `-TH ORDER GAP BALANCING NUMBERS S. S. Rout Institute of Mathematics and Applications, Bhubaneswar, Odisha, India lbs.sudhansu@gmail.com; sudhansu@iomaorissa.ac.in R. Thangadurai
More informationSome Generalizations and Properties of Balancing Numbers
Some Generalizations and Properties of Balancing Numbers Sudhansu Sekhar Rout Department of Mathematics National Institute of Technology Rourkela Rourkela, Odisha, 769 008, India SOME GENERALIZATIONS AND
More informationFIBONACCI DIOPHANTINE TRIPLES. Florian Luca and László Szalay Universidad Nacional Autonoma de México, Mexico and University of West Hungary, Hungary
GLASNIK MATEMATIČKI Vol. 436300, 53 64 FIBONACCI DIOPHANTINE TRIPLES Florian Luca and László Szalay Universidad Nacional Autonoma de México, Mexico and University of West Hungary, Hungary Abstract. In
More informationLinks Between Sums Over Paths in Bernoulli s Triangles and the Fibonacci Numbers
Links Between Sums Over Paths in Bernoulli s Triangles and the Fibonacci Numbers arxiv:1611.09181v1 [math.co] 28 Nov 2016 Denis Neiter and Amsha Proag Ecole Polytechnique Route de Saclay 91128 Palaiseau
More informationIn memoriam Péter Kiss
Kálmán Liptai Eszterházy Károly Collage, Leányka út 4, 3300 Eger, Hungary e-mail: liptaik@gemini.ektf.hu (Submitted March 2002-Final Revision October 2003) In memoriam Péter Kiss ABSTRACT A positive integer
More informationarxiv: v1 [math.co] 11 Aug 2015
arxiv:1508.02762v1 [math.co] 11 Aug 2015 A Family of the Zeckendorf Theorem Related Identities Ivica Martinjak Faculty of Science, University of Zagreb Bijenička cesta 32, HR-10000 Zagreb, Croatia Abstract
More informationSome Variants of the Balancing Sequence
Some Variants of the Balancing Sequence Thesis submitted to National Institute of Technology Rourkela in partial fulfilment of the requirements of the degree of Doctor of philosophy in Mathematics by Akshaya
More informationMATH 433 Applied Algebra Lecture 4: Modular arithmetic (continued). Linear congruences.
MATH 433 Applied Algebra Lecture 4: Modular arithmetic (continued). Linear congruences. Congruences Let n be a postive integer. The integers a and b are called congruent modulo n if they have the same
More informationFibonacci Diophantine Triples
Fibonacci Diophantine Triples Florian Luca Instituto de Matemáticas Universidad Nacional Autonoma de México C.P. 58180, Morelia, Michoacán, México fluca@matmor.unam.mx László Szalay Institute of Mathematics
More informationOn the Shifted Product of Binary Recurrences
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 13 (2010), rticle 10.6.1 On the Shifted Product of Binary Recurrences Omar Khadir epartment of Mathematics University of Hassan II Mohammedia, Morocco
More informationTHE EULER FUNCTION OF FIBONACCI AND LUCAS NUMBERS AND FACTORIALS
Annales Univ. Sci. Budapest., Sect. Comp. 41 (2013) 119 124 THE EULER FUNCTION OF FIBONACCI AND LUCAS NUMBERS AND FACTORIALS Florian Luca (Morelia, Mexico) Pantelimon Stănică (Monterey, USA) Dedicated
More informationGeneralized Fibonacci numbers of the form 2 a + 3 b + 5 c
Generalized Fibonacci numbers of the form 2 a + 3 b + 5 c Diego Marques 1 Departamento de Matemática, Universidade de Brasília, Brasília, 70910-900, Brazil Abstract For k 2, the k-generalized Fibonacci
More informationTHE PROBLEM OF DIOPHANTUS FOR INTEGERS OF. Zrinka Franušić and Ivan Soldo
THE PROBLEM OF DIOPHANTUS FOR INTEGERS OF Q( ) Zrinka Franušić and Ivan Soldo Abstract. We solve the problem of Diophantus for integers of the quadratic field Q( ) by finding a D()-quadruple in Z[( + )/]
More informationEven perfect numbers among generalized Fibonacci sequences
Even perfect numbers among generalized Fibonacci sequences Diego Marques 1, Vinicius Vieira 2 Departamento de Matemática, Universidade de Brasília, Brasília, 70910-900, Brazil Abstract A positive integer
More informationON A FIBONACCI-LIKE SEQUENCE ASSOCIATED WITH K-LUCAS SEQUENCE. A. A. Wani, V. H. Badshah, S. Halici, P. Catarino
Acta Universitatis Apulensis ISSN: 158-539 http://www.uab.ro/auajournal/ No. 53/018 pp. 41-54 doi: 10.17114/j.aua.018.53.04 ON A FIBONACCI-LIKE SEQUENCE ASSOCIATED WITH K-LUCAS SEQUENCE A. A. Wani, V.
More informationDiophantine quadruples and Fibonacci numbers
Diophantine quadruples and Fibonacci numbers Andrej Dujella Department of Mathematics, University of Zagreb, Croatia Abstract A Diophantine m-tuple is a set of m positive integers with the property that
More information1. Introduction. Let P and Q be non-zero relatively prime integers, α and β (α > β) be the zeros of x 2 P x + Q, and, for n 0, let
C O L L O Q U I U M M A T H E M A T I C U M VOL. 78 1998 NO. 1 SQUARES IN LUCAS SEQUENCES HAVING AN EVEN FIRST PARAMETER BY PAULO R I B E N B O I M (KINGSTON, ONTARIO) AND WAYNE L. M c D A N I E L (ST.
More informationDISTRIBUTION OF FIBONACCI AND LUCAS NUMBERS MODULO 3 k
DISTRIBUTION OF FIBONACCI AND LUCAS NUMBERS MODULO 3 k RALF BUNDSCHUH AND PETER BUNDSCHUH Dedicated to Peter Shiue on the occasion of his 70th birthday Abstract. Let F 0 = 0,F 1 = 1, and F n = F n 1 +F
More informationMATH 324 Summer 2011 Elementary Number Theory. Notes on Mathematical Induction. Recall the following axiom for the set of integers.
MATH 4 Summer 011 Elementary Number Theory Notes on Mathematical Induction Principle of Mathematical Induction Recall the following axiom for the set of integers. Well-Ordering Axiom for the Integers If
More informationFlorian Luca Instituto de Matemáticas, Universidad Nacional Autonoma de México, C.P , Morelia, Michoacán, México
Florian Luca Instituto de Matemáticas, Universidad Nacional Autonoma de México, C.P. 8180, Morelia, Michoacán, México e-mail: fluca@matmor.unam.mx Laszlo Szalay Department of Mathematics and Statistics,
More informationA Recursive Relation for Weighted Motzkin Sequences
1 3 47 6 3 11 Journal of Integer Sequences, Vol. 8 (005), Article 05.1.6 A Recursive Relation for Weighted Motzkin Sequences Wen-jin Woan Department of Mathematics Howard University Washington, D.C. 0059
More informationABSTRACT 1. INTRODUCTION
THE FIBONACCI NUMBER OF GENERALIZED PETERSEN GRAPHS Stephan G. Wagner Department of Mathematics, Graz University of Technology, Steyrergasse 30, A-8010 Graz, Austria e-mail: wagner@finanz.math.tu-graz.ac.at
More informationMath 324 Summer 2012 Elementary Number Theory Notes on Mathematical Induction
Math 4 Summer 01 Elementary Number Theory Notes on Mathematical Induction Principle of Mathematical Induction Recall the following axiom for the set of integers. Well-Ordering Axiom for the Integers If
More informationarxiv: v1 [math.nt] 2 Oct 2015
PELL NUMBERS WITH LEHMER PROPERTY arxiv:1510.00638v1 [math.nt] 2 Oct 2015 BERNADETTE FAYE FLORIAN LUCA Abstract. In this paper, we prove that there is no number with the Lehmer property in the sequence
More informationMATH 4400 SOLUTIONS TO SOME EXERCISES. 1. Chapter 1
MATH 4400 SOLUTIONS TO SOME EXERCISES 1.1.3. If a b and b c show that a c. 1. Chapter 1 Solution: a b means that b = na and b c that c = mb. Substituting b = na gives c = (mn)a, that is, a c. 1.2.1. Find
More informationTHE PROBLEM OF DIOPHANTUS FOR INTEGERS OF Q( 3) Zrinka Franušić and Ivan Soldo
RAD HAZU. MATEMATIČKE ZNANOSTI Vol. 8 = 59 (04): 5-5 THE PROBLEM OF DIOPHANTUS FOR INTEGERS OF Q( ) Zrinka Franušić and Ivan Soldo Abstract. We solve the problem of Diophantus for integers of the quadratic
More informationON QUADRAPELL NUMBERS AND QUADRAPELL POLYNOMIALS
Hacettepe Journal of Mathematics and Statistics Volume 8() (009), 65 75 ON QUADRAPELL NUMBERS AND QUADRAPELL POLYNOMIALS Dursun Tascı Received 09:0 :009 : Accepted 04 :05 :009 Abstract In this paper we
More informationON THE POSSIBLE QUANTITIES OF FIBONACCI NUMBERS THAT OCCUR IN SOME TYPES OF INTERVALS
Acta Math. Univ. Comenianae Vol. LXXXVII, 2 (2018), pp. 291 299 291 ON THE POSSIBLE QUANTITIES OF FIBONACCI NUMBERS THAT OCCUR IN SOME TYPES OF INTERVALS B. FARHI Abstract. In this paper, we show that
More informationCullen Numbers in Binary Recurrent Sequences
Cullen Numbers in Binary Recurrent Sequences Florian Luca 1 and Pantelimon Stănică 2 1 IMATE-UNAM, Ap. Postal 61-3 (Xangari), CP 58 089 Morelia, Michoacán, Mexico; e-mail: fluca@matmor.unam.mx 2 Auburn
More informationBilinear generating relations for a family of q-polynomials and generalized basic hypergeometric functions
ACTA ET COMMENTATIONES UNIVERSITATIS TARTUENSIS DE MATHEMATICA Volume 16, Number 2, 2012 Available online at www.math.ut.ee/acta/ Bilinear generating relations for a family of -polynomials and generalized
More informationCALCULATING EXACT CYCLE LENGTHS IN THE GENERALIZED FIBONACCI SEQUENCE MODULO p
CALCULATING EXACT CYCLE LENGTHS IN THE GENERALIZED FIBONACCI SEQUENCE MODULO p DOMINIC VELLA AND ALFRED VELLA. Introduction The cycles that occur in the Fibonacci sequence {F n } n=0 when it is reduced
More informationOn the indecomposability of polynomials
On the indecomposability of polynomials Andrej Dujella, Ivica Gusić and Robert F. Tichy Abstract Applying a combinatorial lemma a new sufficient condition for the indecomposability of integer polynomials
More informationNumber Theory Marathon. Mario Ynocente Castro, National University of Engineering, Peru
Number Theory Marathon Mario Ynocente Castro, National University of Engineering, Peru 1 2 Chapter 1 Problems 1. (IMO 1975) Let f(n) denote the sum of the digits of n. Find f(f(f(4444 4444 ))). 2. Prove
More informationarxiv: v1 [math.ca] 14 Oct 2015
On the uniform convergence of double sine series K. Duzinkiewicz and B. Szal 2 arxiv:50.06273v [math.ca] 4 Oct 205 University of Zielona Góra Faculty of Mathematics, Computer Science and Econometrics 65-56
More informationSome congruences concerning second order linear recurrences
Acta Academiae Paedagogicae Agriensis, Sectio Mathematicae,. (1997) pp. 9 33 Some congruences concerning second order linear recurrences JAMES P. JONES PÉTER KISS Abstract. Let U n V n (n=0,1,,...) be
More information#A5 INTEGERS 17 (2017) THE 2-ADIC ORDER OF SOME GENERALIZED FIBONACCI NUMBERS
#A5 INTEGERS 7 (207) THE 2-ADIC ORDER OF SOME GENERALIZED FIBONACCI NUMBERS Tamás Lengyel Mathematics Department, Occidental College, Los Angeles, California lengyel@oxy.edu Diego Marques Departamento
More information4 Linear Recurrence Relations & the Fibonacci Sequence
4 Linear Recurrence Relations & the Fibonacci Sequence Recall the classic example of the Fibonacci sequence (F n ) n=1 the relations: F n+ = F n+1 + F n F 1 = F = 1 = (1, 1,, 3, 5, 8, 13, 1,...), defined
More informationMATH CSE20 Homework 5 Due Monday November 4
MATH CSE20 Homework 5 Due Monday November 4 Assigned reading: NT Section 1 (1) Prove the statement if true, otherwise find a counterexample. (a) For all natural numbers x and y, x + y is odd if one of
More informationOn the Hadamard Product of Fibonacci Q n matrix and Fibonacci Q n matrix
Int J Contemp Math Sciences, Vol, 006, no 6, 753-76 On the Hadamard Product of Fibonacci Q n matrix and Fibonacci Q n matrix Ayşe NALLI Department of Mathematics, Selcuk University 4070, Campus-Konya,
More informationNewton, Fermat, and Exactly Realizable Sequences
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 8 (2005), Article 05.1.2 Newton, Fermat, and Exactly Realizable Sequences Bau-Sen Du Institute of Mathematics Academia Sinica Taipei 115 TAIWAN mabsdu@sinica.edu.tw
More informationALTERNATING SUMS OF FIBONACCI PRODUCTS
ALTERNATING SUMS OF FIBONACCI PRODUCTS ZVONKO ČERIN Abstract. We consider alternating sums of squares of odd even terms of the Fibonacci sequence alternating sums of their products. These alternating sums
More informationCONGRUENCES FOR BERNOULLI - LUCAS SUMS
CONGRUENCES FOR BERNOULLI - LUCAS SUMS PAUL THOMAS YOUNG Abstract. We give strong congruences for sums of the form N BnVn+1 where Bn denotes the Bernoulli number and V n denotes a Lucas sequence of the
More informationFIFTH ROOTS OF FIBONACCI FRACTIONS. Christopher P. French Grinnell College, Grinnell, IA (Submitted June 2004-Final Revision September 2004)
Christopher P. French Grinnell College, Grinnell, IA 0112 (Submitted June 2004-Final Revision September 2004) ABSTRACT We prove that when n is odd, the continued fraction expansion of Fn+ begins with a
More informationTHE PROBLEM OF DIOPHANTUS AND DAVENPORT FOR GAUSSIAN INTEGERS. Andrej Dujella, Zagreb, Croatia
THE PROBLEM OF DIOPHANTUS AND DAVENPORT FOR GAUSSIAN INTEGERS Andrej Dujella, Zagreb, Croatia Abstract: A set of Gaussian integers is said to have the property D(z) if the product of its any two distinct
More informationk-jacobsthal and k-jacobsthal Lucas Matrix Sequences
International Mathematical Forum, Vol 11, 016, no 3, 145-154 HIKARI Ltd, wwwm-hikaricom http://dxdoiorg/101988/imf0165119 k-jacobsthal and k-jacobsthal Lucas Matrix Sequences S Uygun 1 and H Eldogan Department
More informationSome Generalized Fibonomial Sums related with the Gaussian q Binomial sums
Bull. Math. Soc. Sci. Math. Roumanie Tome 55(103 No. 1, 01, 51 61 Some Generalized Fibonomial Sums related with the Gaussian q Binomial sums by Emrah Kilic, Iler Aus and Hideyui Ohtsua Abstract In this
More informationABSTRACT. In this note, we find all the solutions of the Diophantine equation x k = y n, 1, y 1, k N, n INTRODUCTION
Florian Luca Instituto de Matemáticas UNAM, Campus Morelia Apartado Postal 27-3 (Xangari), C.P. 58089, Morelia, Michoacán, Mexico e-mail: fluca@matmor.unam.mx Alain Togbé Mathematics Department, Purdue
More informationTHE EULER FUNCTION OF FIBONACCI AND LUCAS NUMBERS AND FACTORIALS
Annales Univ. Sci. Budapest., Sect. Comp. 40 (2013) nn nnn THE EULER FUNCTION OF FIBONACCI AND LUCAS NUMBERS AND FACTORIALS Florian Luca (Morelia, Mexico) Pantelimon Stănică (Monterey, USA) Dedicated to
More informationNew infinite families of congruences modulo 8 for partitions with even parts distinct
New infinite families of congruences modulo for partitions with even parts distinct Ernest X.W. Xia Department of Mathematics Jiangsu University Zhenjiang, Jiangsu 212013, P. R. China ernestxwxia@13.com
More informationFibonacci and Lucas numbers via the determinants of tridiagonal matrix
Notes on Number Theory and Discrete Mathematics Print ISSN 30 532, Online ISSN 2367 8275 Vol 24, 208, No, 03 08 DOI: 07546/nntdm2082403-08 Fibonacci and Lucas numbers via the determinants of tridiagonal
More informationIntroduction to Lucas Sequences
A talk given at Liaoning Normal Univ. (Dec. 14, 017) Introduction to Lucas Sequences Zhi-Wei Sun Nanjing University Nanjing 10093, P. R. China zwsun@nju.edu.cn http://math.nju.edu.cn/ zwsun Dec. 14, 017
More informationOn Some Identities and Generating Functions
Int. Journal of Math. Analysis, Vol. 7, 2013, no. 38, 1877-1884 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ijma.2013.35131 On Some Identities and Generating Functions for k- Pell Numbers Paula
More informationSome congruences for Andrews Paule s broken 2-diamond partitions
Discrete Mathematics 308 (2008) 5735 5741 www.elsevier.com/locate/disc Some congruences for Andrews Paule s broken 2-diamond partitions Song Heng Chan Division of Mathematical Sciences, School of Physical
More informationOn products of quartic polynomials over consecutive indices which are perfect squares
Notes on Number Theory and Discrete Mathematics Print ISSN 1310 513, Online ISSN 367 875 Vol. 4, 018, No. 3, 56 61 DOI: 10.7546/nntdm.018.4.3.56-61 On products of quartic polynomials over consecutive indices
More informationDIOPHANTINE QUADRUPLES IN Z[ 2]
An. Şt. Univ. Ovidius Constanţa Vol. 18(1), 2010, 81 98 DIOPHANTINE QUADRUPLES IN Z[ 2] Andrej Dujella, Ivan Soldo Abstract In this paper, we study the existence of Diophantine quadruples with the property
More informationContinued Fractions Expansion of D and Pell Equation x 2 Dy 2 = 1
Mathematica Moravica Vol. 5-2 (20), 9 27 Continued Fractions Expansion of D and Pell Equation x 2 Dy 2 = Ahmet Tekcan Abstract. Let D be a positive non-square integer. In the first section, we give some
More informationPELL NUMBERS WHOSE EULER FUNCTION IS A PELL NUMBER. Bernadette Faye and Florian Luca
PUBLICATIONS DE L INSTITUT MATHÉMATIQUE Nouvelle série tome 05 207 23 245 https://doiorg/02298/pim7523f PELL NUMBERS WHOSE EULER FUNCTION IS A PELL NUMBER Bernadette Faye and Florian Luca Abstract We show
More informationON SUMS AND RECIPROCAL SUM OF GENERALIZED FIBONACCI NUMBERS BISHNU PADA MANDAL. Master of Science in Mathematics
ON SUMS AND RECIPROCAL SUM OF GENERALIZED FIBONACCI NUMBERS A report submitted by BISHNU PADA MANDAL Roll No: 42MA2069 for the partial fulfilment for the award of the degree of Master of Science in Mathematics
More informationPowers of Two as Sums of Two Lucas Numbers
1 3 47 6 3 11 Journal of Integer Sequences, Vol. 17 (014), Article 14.8.3 Powers of Two as Sums of Two Lucas Numbers Jhon J. Bravo Mathematics Department University of Cauca Street 5 No. 4-70 Popayán,
More informationNumber Theory Marathon. Mario Ynocente Castro, National University of Engineering, Peru
Number Theory Marathon Mario Ynocente Castro, National University of Engineering, Peru 1 2 Chapter 1 Problems 1. (IMO 1975) Let f(n) denote the sum of the digits of n. Find f(f(f(4444 4444 ))). 2. Prove
More informationk-pell, k-pell-lucas and Modified k-pell Numbers: Some Identities and Norms of Hankel Matrices
International Journal of Mathematical Analysis Vol. 9, 05, no., 3-37 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/0.988/ijma.05.4370 k-pell, k-pell-lucas and Modified k-pell Numbers: Some Identities
More informationFibonacci numbers of the form p a ± p b
Fibonacci numbers of the form p a ± p b Florian Luca 1 and Pantelimon Stănică 2 1 IMATE, UNAM, Ap. Postal 61-3 (Xangari), CP. 8 089 Morelia, Michoacán, Mexico; e-mail: fluca@matmor.unam.mx 2 Auburn University
More informationCommentationes Mathematicae Universitatis Carolinae
Commentationes Mathematicae Universitatis Carolinae Bogdan Szal Trigonometric approximation by Nörlund type means in L p -norm Commentationes Mathematicae Universitatis Carolinae, Vol. 5 (29), No. 4, 575--589
More informationDIOPHANTINE QUADRUPLES FOR SQUARES OF FIBONACCI AND LUCAS NUMBERS
PORTUGALIAE MATHEMATICA Vol. 52 Fasc. 3 1995 DIOPHANTINE QUADRUPLES FOR SQUARES OF FIBONACCI AND LUCAS NUMBERS Andrej Dujella Abstract: Let n be an integer. A set of positive integers is said to have the
More informationELEMENTARY PROOFS OF PARITY RESULTS FOR 5-REGULAR PARTITIONS
Bull Aust Math Soc 81 (2010), 58 63 doi:101017/s0004972709000525 ELEMENTARY PROOFS OF PARITY RESULTS FOR 5-REGULAR PARTITIONS MICHAEL D HIRSCHHORN and JAMES A SELLERS (Received 11 February 2009) Abstract
More informationarxiv: v1 [math.nt] 19 Dec 2018
ON SECOND ORDER LINEAR SEQUENCES OF COMPOSITE NUMBERS DAN ISMAILESCU 2, ADRIENNE KO 1, CELINE LEE 3, AND JAE YONG PARK 4 arxiv:1812.08041v1 [math.nt] 19 Dec 2018 Abstract. In this paper we present a new
More information(n = 0, 1, 2,... ). (2)
Bull. Austral. Math. Soc. 84(2011), no. 1, 153 158. ON A CURIOUS PROPERTY OF BELL NUMBERS Zhi-Wei Sun and Don Zagier Abstract. In this paper we derive congruences expressing Bell numbers and derangement
More informationarxiv: v2 [math.nt] 23 Sep 2011
ELLIPTIC DIVISIBILITY SEQUENCES, SQUARES AND CUBES arxiv:1101.3839v2 [math.nt] 23 Sep 2011 Abstract. Elliptic divisibility sequences (EDSs) are generalizations of a class of integer divisibility sequences
More informationTHE NUMBER OF DIOPHANTINE QUINTUPLES. Yasutsugu Fujita College of Industrial Technology, Nihon University, Japan
GLASNIK MATEMATIČKI Vol. 45(65)(010), 15 9 THE NUMBER OF DIOPHANTINE QUINTUPLES Yasutsugu Fujita College of Industrial Technology, Nihon University, Japan Abstract. A set a 1,..., a m} of m distinct positive
More informationarxiv: v1 [math.nt] 29 Dec 2017
arxiv:1712.10138v1 [math.nt] 29 Dec 2017 On the Diophantine equation F n F m = 2 a Zafer Şiar a and Refik Keskin b a Bingöl University, Mathematics Department, Bingöl/TURKEY b Sakarya University, Mathematics
More informationarxiv: v2 [math.nt] 4 Jun 2016
ON THE p-adic VALUATION OF STIRLING NUMBERS OF THE FIRST KIND PAOLO LEONETTI AND CARLO SANNA arxiv:605.07424v2 [math.nt] 4 Jun 206 Abstract. For all integers n k, define H(n, k) := /(i i k ), where the
More informationOn some Diophantine equations
Demirtürk Bitim Keskin Journal of Inequalities Applications 013, 013:16 R E S E A R C H Open Access On some Diophantine equations Bahar Demirtürk Bitim * Refik Keskin * Correspondence: demirturk@sakarya.edu.tr
More informationON DIFFERENCES OF TWO SQUARES IN SOME QUADRATIC FIELDS
ON DIFFERENCES OF TWO SQUARES IN SOME QUADRATIC FIELDS ANDREJ DUJELLA AND ZRINKA FRANUŠIĆ Abstract. It this paper, we study the problem of determining the elements in the rings of integers of quadratic
More informationPRODUCTS OF THREE FACTORIALS
PRODUCTS OF THREE FACTORIALS A. DUJELLA, F. NAJMAN, N. SARADHA AND T. N. SHOREY Abstract. We study a question of Erdős and Graham on products of three factorials being a square. 1. Introduction For any
More informationTRIBONACCI DIOPHANTINE QUADRUPLES
GLASNIK MATEMATIČKI Vol. 50(70)(205), 7 24 TRIBONACCI DIOPHANTINE QUADRUPLES Carlos Alexis Gómez Ruiz and Florian Luca Universidad del Valle, Colombia and University of the Witwatersrand, South Africa
More information*!5(/i,*)=t(-i)*-, fty.
ON THE DIVISIBILITY BY 2 OF THE STIRLING NUMBERS OF THE SECOND KIND T* Lengyel Occidental College, 1600 Campus Road., Los Angeles, CA 90041 {Submitted August 1992) 1. INTRODUCTION In this paper we characterize
More informationNecessary and Sufficient Conditions for the Central Norm to Equal 2 h in the Simple Continued Fraction Expansion of 2 h c for Any Odd Non-Square c > 1
Necessary and Sufficient Conditions for the Central Norm to Equal 2 h in the Simple Continued Fraction Expansion of 2 h c for Any Odd Non-Square c > 1 R.A. Mollin Abstract We look at the simple continued
More informationq-counting hypercubes in Lucas cubes
Turkish Journal of Mathematics http:// journals. tubitak. gov. tr/ math/ Research Article Turk J Math (2018) 42: 190 203 c TÜBİTAK doi:10.3906/mat-1605-2 q-counting hypercubes in Lucas cubes Elif SAYGI
More informationPart II. Number Theory. Year
Part II Year 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2017 Paper 3, Section I 1G 70 Explain what is meant by an Euler pseudoprime and a strong pseudoprime. Show that 65 is an Euler
More information