Yi Wang Department of Applied Mathematics, Dalian University of Technology, Dalian , China (Submitted June 2002)

Size: px
Start display at page:

Download "Yi Wang Department of Applied Mathematics, Dalian University of Technology, Dalian , China (Submitted June 2002)"

Transcription

1 SELF-INVERSE SEQUENCES RELATED TO A BINOMIAL INVERSE PAIR Yi Wang Department of Applied Mathematics, Dalian University of Technology, Dalian , China (Submitted June 2002) 1 INTRODUCTION Pairs of inverse relations are very useful in the study of combinatorial identities [2] One of the classical inversion formulas is the binomial inverse pair: a n = ( 1) b ; b n = ( 1) a (1) =0 We say that a sequence {a n } of complex numbers is self-inverse or invariant if ( 1) a = a n (2) =0 and denote by S + the set of self-inverse sequences We also denote by S the set of sequences {a n } satisfying ( 1) a = a n =0 { } By the definition it is not difficult to verify that {a n } S if and only if a 0 = 0 and an+1 n+1 S + or {na n 1 } S + Recently, Sun [5] studied self-inverse sequences by using their generating functions and gave many interesting examples and results of self-inverse sequences In this paper, we explore self-inverse sequences by means of linear transformations, difference operators and the umbral calculus We obtain various characterizations of self-inverse sequences from these different approaches For S + we show that it is a vector space over the complex field and determine its dimension We also give simpler proofs to certain results of Sun It is worth noting that our results can give rise to many interesting identities Let P = Then the inverse pair (1) can be written as =0 2 LINEAR TRANSFORMATIONS 1 ( ( )) 1 1 O n ( 1) = α = P β ; β = P α, where α = (a 0, a 1, a 2, ) T and β = (b 0, b 1, b 2, ) T are two column vectors Note that the pair in (1) is self-inverse Hence, P is an involutory matrix, ie, P 2 = I, where I is the identity 46

2 matrix In what follows we identify a vector α = (a 0, a 1, a 2, ) T with the sequence {a n } Then α S + if and only if α is invariant under the linear transformation y = P x, ie, P α = α Thus, S + is precisely the null space of the matrix P I Similarly, we may show that S is the null space of the matrix P + I The following proposition is therefore immediate Proposition 21: Let α, β be two complex vectors (a) If α, β S ±, then aα + bβ S ± for arbitrary complex numbers a and b; (b) if A is a matrix satisfying AP = P A, then α S ± implies that Aα S ± Theorem 22: α S ± if and only if α = (P ± I)v for some vector v In other words, S ± is precisely the column space of the matrix P ± I Proof: Suppose that α S + Then P α = α Putting v = α/2, we have (P + I)v = (P + I)α/2 = (P α + α)/2 = (α + α)/2 = α Conversely, suppose that α = (P + I)v for some v Then P α = P (P + I)v = (P 2 + P )v = (I + P )v = α Thus, α S + The statement for S may be proved similarly Remar 23: The above discussion for the binomial inverse pair is also suitable for general self-inverse pairs: a n = A(n, )b ; b n = A(n)a, where the matrix A = (A(n, )) satisfies A 2 = I An equivalent form of Theorem 22 is the following theorem, which has been observed by Sun [5, Remar 32] Theorem 24: The sequence {a n } S ± if and only if there exists a sequence λ 0, λ 1, λ 2, of complex numbers such that a n = ( 1) λ ± λ n, n = 0, 1, 2, =0 Taing λ n = λ n in Theorem 24 and noting ( 1) λ = (1 λ) n, we obtain =0 Corollary 25: Suppose that λ is a complex number Then {(1 λ) n ± λ n } S ± Remar 26: Let {a n } is a sequence defined by { an+2 = a n+1 + ta n, n 0, a 0 = 2, a 1 = 1 Then, the Binet form of {a n } is a n = (1 λ) n + λ n, where λ is a root of the equation λ 2 λ t = 0 Thus, {a n } S + In particular, we have {L n } S +, where the L n are the Lucas numbers defined by L 0 = 2, L 1 = 1 and L n = L n 1 + L n 2 for n 2 47

3 Similarly, if a sequence {a n } satisfies the recursive relation a n+2 = a n+1 +ta n (n 0) with a 0 = 0, then {a n } S In particular, we have {F n } S, where the F n are the Fibonacci numbers defined by F 0 = 0, F 1 = 1 and F n = F n 1 + F n 2 for n 2 Now let m be a positive integer and P m the m m matrix ( ( 1) ( n )), n, = 0, 1,, m 1 Denote S m ± = {α C m : P m α = ±α} Then S m ± is the column space of the matrices P m ±I Moreover, we have the following result Theorem 27: With the above notation, we have (a) C m = S m + Sm, and (b) dim S m + = m/2 and dim Sm = m/2, where x and x denote the least integer greater than or equal to x and the greatest integer less than or equal to x respectively Proof: (a) Any vector α C m can be written in the form α = β + γ, where β = (P m + I)α/2 and γ = (P m I)α/2 Sm By Theorem 22, β S m + and γ Sm So C m = S m + + Sm On the other hand, it is clear that S m + Sm = {0} Thus, we conclude that C m = S m + Sm (b) For = 0, 1,, m 1, let u be the th column of the matrix O P m + I = ( m 1 1 ) ( m 1 ) 2 ( ) m 1 3 ( 1) m Then, u 0, u 2, u 4, are linearly independent since the position of the first non-zero element of these vectors is different The ran of matrix P m + I is therefore not less than m/2 It follows that dim S m + m/2 from Theorem 22 Similarly, we have dim Sm m/2 However, dim S m + + dim Sm = m by (a) Hence, dim S m + = m/2 and dim Sm = m/2, as claimed Remar 28: From the proof of Theorem 27(b) we see that u 0, u 2, u 4, form a basis of the vector space S + m Similarly we may determine a basis of the vector space S m 3 DIFFERENCE OPERATORS Given a function f : Z C, define a new function f : Z C by f(n) = f(n + 1) f(n) is called the forward difference operator For 1, we may iterate times to obtain the th forward difference operator, f = ( 1 f), 48

4 where 0 is the identity operator It is well-nown (see, eg, [4, p37]) that n f(0) = ( 1) n f() =0 Thus, Theorem 24 can be restated as follows Theorem 31: The sequence {a n } S + if and only if there exists a function f : Z C such that a n = ( 1) n n f(0) + f(n), n = 0, 1, 2, It is also well-nown that if f is a polynomial of degree d, then f(0) = 0 for > d (see, eg, [4, Proposition 142(a)]) Hence, we have Theorem 32: If f is a polynomial of degree d, then there exists an self-inverse sequence {a n } such that a n = f(n) when n > d Example 33: Let d be a positive integer 1 Suppose that f(n) = n d Then n f(0) = n!s(dn) where S(d, n) are the Stirling numbers of the second ind (see, eg, [4, Proposition 142(c)]) Thus, we obtain a self-inverse sequence a n = ( 1) n n!s(d, n) + n d satisfying a n = n d for n > d 2 Suppose that f(n) = ( n d) Then n f(0) = δ nd by induction, where δ nd = 1 if n = d and δ nd = 0 otherwise Thus, we obtain a self-inverse sequence a n = ( 1) n δ nd + ( n d) satisfying a n = ( n d) for n > d Theorem 34: Suppose that {a n } S + Then { a n+ } S + for 0 Proof: We use induction on The case = 0 is trivial Now assume that a n+ S + Then there exists a function f such that It follows that a n+ = ( 1) n n f(0) + f(n), n = 0, 1, 2, +1 a n+(+1) = ( a (n+1)+ ) = [( 1) n+1 n+1 f(0) + f(n + 1)] = ( 1) n+2 n+2 f(0) ( 1) n+1 n+1 f(0) + f(n + 1) = ( 1) n n+1 f(1) + f(n + 1) = ( 1) n n F (0) + F (n), where F (n) = f(n + 1) Hence { +1 a n+(+1) } S + and the proof is complete by induction In the case = 1, Theorem 34 states that {a n } S + yields {a n+2 a n+1 } S +, which is precisely the result of Corollary 31(c) in [5] Remar 35: The discussion for S + in this section is also suitable for S 49

5 4 UMBRAL CALCULUS Many results in combinatorics are often easily read, verified and expanded by means of the umbral method In this section we apply the umbral method to explore self-inverse sequences But here, we do not want to describe the umbral method (for a rigorous description, see [1] or [3]) The basic idea of the umbral method relies on the use of a notation where certain exponents can be interchanged with suffixes For example, (2) can be written symbolically as (1 a) n a n, with the understanding that the expression on the left be expanded in powers of a, and then each term a be replaced by a The symbol a is referred to as an umbra, and the symbol is used to denote symbolic or umbral equivalences, in which we put a a Thus, a sequence {a n } S + if and only if (1 a) n a n for all n Similarly, {a n } S if and only if (1 a) n a n for all n Proposition 41: Let {a n } and {b n } be two sequences of complex numbers (a) Suppose that both {a n } and {b n } are in S + or in S Then, ( 1) a n b = 0 =0 holds for odd n (b) Suppose that {a n } S and {b n } S + Then, (3) holds for even n Thus, Proof: Suppose that both {a n } and {b n } are self-inverse Then, a n (1 a) n, b n (1 b) n (a b) n [(1 a) (1 b)] n (b a) n When n is odd, we have (a b) n 0 Expanding the binomial expression yields (3) Other results may be obtained similarly Corollary 42: Suppose that {a n } S ± Then for odd n, ( 1) a a n = 0 =0 It is easy to see that the sequence {1/2 n } is self-inverse By Proposition 41, if {a n } S +, then ( 1) 2 a n = 0 (4) =0 holds for odd n, and if {a n } S, then (4) holds for even n The converse is also true Theorem 43: Let {a n } be a sequence of complex numbers (a) {a n } S + if and only if (4) holds for odd n (b) {a n } S if and only if (4) holds for even n 50

6 Proof: (a) It suffices to show sufficiency Suppose that (4) holds for odd n Then (a 1/2) n 0 for odd n Thus, (a 1/2) n (1/2 a) n for all n It follows that (1 a) n [1/2 + (1/2 a)] n [1/2 + (a 1/2)] n a n Hence, {a n } S + (b) The proof is similar to that of part (a) Finally, we apply the umbral method to give an elegant proof of the following proposition due to Sun [5, Theorem 41] Proposition 44: Suppose that {f n }, {a n } are two sequences of complex numbers (a) If {a n } S +, then =0 ( n ) ( f ( 1) n ( ) )f s a n = 0 (5) s (b) If {a n } S, then =0 ( n ) ( f + ( 1) n ( ) )f s a n = 0 s Proof: We only prove (a) The proof of (b) is similar Suppose that {a n } S + Then, (f + a) n [f + (1 a)] n [(f + 1) a] n Expanding and noting that (f + 1) ( s) fs, we obtain which yields (5) =0 f a n = ( ) ( ) n ( 1) n f s a n, s =0 Remar 45: We have seen that the Lucas sequence {L n } S + and the Fibonacci sequence {F n } S It is also easy to see that {( 1) n B n } S + where B n are the Bernoulli numbers defined by B 0 = 1, B 1 = 1/2 and n ( n =0 ) B = B n for n > 1 So, the results of this section can produce many identities about these well-nown numbers ACKNOWLEDGMENTS The author thans Professor Zhi-Wei Sun and Professor Zhi-Hong Sun for drawing his attention to self-inverse sequences REFERENCES [1] A P Guinand The Umbral Method: A Survey of Elementary Mnemonic and Manipulative Uses Amer Math Monthly 86 (1979): [2] J Riordan Combinatorial Identities New Yor: John Wiley & Sons, 1968 [3] S Roman The Umbral Calculus San Diego: Academic Press,

7 [4] R P Stanley Enumerative Combinatorics, Vol I Cambridge: Cambridge Univ Press, 1997 [5] Z H Sun Invariant Sequences Under Binomial Transformations The Fibonacci Quarterly 394 (2001): AMS Classification Numbers: 05A19, 05A10, 05A40, 15A04 52

Investigating Geometric and Exponential Polynomials with Euler-Seidel Matrices

Investigating Geometric and Exponential Polynomials with Euler-Seidel Matrices 1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 14 (2011), Article 11.4.6 Investigating Geometric and Exponential Polynomials with Euler-Seidel Matrices Ayhan Dil and Veli Kurt Department of Mathematics

More information

Department of Mathematics, Nanjing University Nanjing , People s Republic of China

Department of Mathematics, Nanjing University Nanjing , People s Republic of China Proc Amer Math Soc 1382010, no 1, 37 46 SOME CONGRUENCES FOR THE SECOND-ORDER CATALAN NUMBERS Li-Lu Zhao, Hao Pan Zhi-Wei Sun Department of Mathematics, Naning University Naning 210093, People s Republic

More information

Linear transformations preserving the strong q-log-convexity of polynomials

Linear transformations preserving the strong q-log-convexity of polynomials Linear transformations preserving the strong q-log-convexity of polynomials Bao-Xuan Zhu School of Mathematics and Statistics Jiangsu Normal University Xuzhou, PR China bxzhu@jsnueducn Hua Sun College

More information

On Arithmetic Properties of Bell Numbers, Delannoy Numbers and Schröder Numbers

On Arithmetic Properties of Bell Numbers, Delannoy Numbers and Schröder Numbers A tal given at the Institute of Mathematics, Academia Sinica (Taiwan (Taipei; July 6, 2011 On Arithmetic Properties of Bell Numbers, Delannoy Numbers and Schröder Numbers Zhi-Wei Sun Nanjing University

More information

A LINEAR BINOMIAL RECURRENCE AND THE BELL NUMBERS AND POLYNOMIALS

A LINEAR BINOMIAL RECURRENCE AND THE BELL NUMBERS AND POLYNOMIALS Applicable Analysis and Discrete Mathematics, 1 (27, 371 385. Available electronically at http://pefmath.etf.bg.ac.yu A LINEAR BINOMIAL RECURRENCE AND THE BELL NUMBERS AND POLYNOMIALS H. W. Gould, Jocelyn

More information

#A29 INTEGERS 11 (2011) THE (EXPONENTIAL) BIPARTITIONAL POLYNOMIALS AND POLYNOMIAL SEQUENCES OF TRINOMIAL TYPE: PART II

#A29 INTEGERS 11 (2011) THE (EXPONENTIAL) BIPARTITIONAL POLYNOMIALS AND POLYNOMIAL SEQUENCES OF TRINOMIAL TYPE: PART II #A29 INTEGERS 11 (2011) THE (EXPONENTIAL) BIPARTITIONAL POLYNOMIALS AND POLYNOMIAL SEQUENCES OF TRINOMIAL TYPE: PART II Hacène Belbachir 1 USTHB, Faculty of Mathematics, El Alia, Bab Ezzouar, Algeria hbelbachir@usthb.dz

More information

Pascal Eigenspaces and Invariant Sequences of the First or Second Kind

Pascal Eigenspaces and Invariant Sequences of the First or Second Kind Pascal Eigenspaces and Invariant Sequences of the First or Second Kind I-Pyo Kim a,, Michael J Tsatsomeros b a Department of Mathematics Education, Daegu University, Gyeongbu, 38453, Republic of Korea

More information

Several Generating Functions for Second-Order Recurrence Sequences

Several Generating Functions for Second-Order Recurrence Sequences 47 6 Journal of Integer Sequences, Vol. 009), Article 09..7 Several Generating Functions for Second-Order Recurrence Sequences István Mező Institute of Mathematics University of Debrecen Hungary imezo@math.lte.hu

More information

Linear Recurrence Relations for Sums of Products of Two Terms

Linear Recurrence Relations for Sums of Products of Two Terms Linear Recurrence Relations for Sums of Products of Two Terms Yan-Ping Mu College of Science, Tianjin University of Technology Tianjin 300384, P.R. China yanping.mu@gmail.com Submitted: Dec 27, 2010; Accepted:

More information

A talk given at the City Univ. of Hong Kong on April 14, ON HILBERT S TENTH PROBLEM AND RELATED TOPICS

A talk given at the City Univ. of Hong Kong on April 14, ON HILBERT S TENTH PROBLEM AND RELATED TOPICS A talk given at the City Univ. of Hong Kong on April 14, 000. ON HILBERT S TENTH PROBLEM AND RELATED TOPICS Zhi-Wei Sun Department of Mathematics Nanjing University Nanjing 10093 People s Republic of China

More information

Some Congruences for the Partial Bell Polynomials

Some Congruences for the Partial Bell Polynomials 3 47 6 3 Journal of Integer Seuences, Vol. 009), Article 09.4. Some Congruences for the Partial Bell Polynomials Miloud Mihoubi University of Science and Technology Houari Boumediene Faculty of Mathematics

More information

ELEMENTARY PROBLEMS AND SOLUTIONS

ELEMENTARY PROBLEMS AND SOLUTIONS ELEMENTARY PROBLEMS AND SOLUTIONS EDITED BY HARRIS KWONG Please submit solutions and problem proposals to Dr. Harris Kwong, Department of Mathematical Sciences, SUNY Fredonia, Fredonia, NY, 4063, or by

More information

SOME RESULTS ON q-analogue OF THE BERNOULLI, EULER AND FIBONACCI MATRICES

SOME RESULTS ON q-analogue OF THE BERNOULLI, EULER AND FIBONACCI MATRICES SOME RESULTS ON -ANALOGUE OF THE BERNOULLI, EULER AND FIBONACCI MATRICES GERALDINE M. INFANTE, JOSÉ L. RAMÍREZ and ADEM ŞAHİN Communicated by Alexandru Zaharescu In this article, we study -analogues of

More information

CONGRUENCES CONCERNING LUCAS SEQUENCES ZHI-HONG SUN

CONGRUENCES CONCERNING LUCAS SEQUENCES ZHI-HONG SUN Int. J. Number Theory 004, no., 79-85. CONGRUENCES CONCERNING LUCAS SEQUENCES ZHI-HONG SUN School of Mathematical Sciences Huaiyin Normal University Huaian, Jiangsu 00, P.R. China zhihongsun@yahoo.com

More information

The Gaussian coefficient revisited

The Gaussian coefficient revisited The Gaussian coefficient revisited Richard EHRENBORG and Margaret A. READDY Abstract We give new -(1+)-analogue of the Gaussian coefficient, also now as the -binomial which, lie the original -binomial

More information

arxiv: v1 [math.co] 20 Aug 2015

arxiv: v1 [math.co] 20 Aug 2015 arxiv:1508.04953v1 [math.co] 20 Aug 2015 On Polynomial Identities for Recursive Sequences Ivica Martinak and Iva Vrsalko Faculty of Science University of Zagreb Bienička cesta 32, HR-10000 Zagreb Croatia

More information

GENERALIZATION OF AN IDENTITY OF ANDREWS

GENERALIZATION OF AN IDENTITY OF ANDREWS GENERALIZATION OF AN IDENTITY OF ANDREWS arxiv:math/060480v1 [math.co 1 Apr 006 Eduardo H. M. Brietze Instituto de Matemática UFRGS Caixa Postal 15080 91509 900 Porto Alegre, RS, Brazil email: brietze@mat.ufrgs.br

More information

SOME LINEAR RECURRENCES WITH CONSTANT COEFFICIENTS

SOME LINEAR RECURRENCES WITH CONSTANT COEFFICIENTS SOME LINEAR RECURRENCES WITH CONSTANT COEFFICIENTS RICHARD J MATHAR Abstract Linear homogeneous s-order recurrences with constant coefficients of the form a(n) d a(n ) + d 2 a(n 2) + + d sa(n s), n n r,

More information

ON SIMILARITIES BETWEEN EXPONENTIAL POLYNOMIALS AND HERMITE POLYNOMIALS

ON SIMILARITIES BETWEEN EXPONENTIAL POLYNOMIALS AND HERMITE POLYNOMIALS Journal of Applied Mathematics and Computational Mechanics 2013, 12(3), 93-104 ON SIMILARITIES BETWEEN EXPONENTIAL POLYNOMIALS AND HERMITE POLYNOMIALS Edyta Hetmaniok, Mariusz Pleszczyński, Damian Słota,

More information

ON A KIND OF GENERALIZED ARITHMETIC-GEOMETRIC PROGRESSION

ON A KIND OF GENERALIZED ARITHMETIC-GEOMETRIC PROGRESSION ON A KIND OF GENERALIZED ARITHMETIC-GEOMETRIC PROGRESSION Leetsch C. Hsu* Dalian University of Technology, Dalian 116024, China (Submitted August 1995) 1. INTRODUCTION Let (t\h) p denote the generalized

More information

MATH 802: ENUMERATIVE COMBINATORICS ASSIGNMENT 2

MATH 802: ENUMERATIVE COMBINATORICS ASSIGNMENT 2 MATH 80: ENUMERATIVE COMBINATORICS ASSIGNMENT KANNAPPAN SAMPATH Facts Recall that, the Stirling number S(, n of the second ind is defined as the number of partitions of a [] into n non-empty blocs. We

More information

Introduction to Lucas Sequences

Introduction 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 information

Explicit formulas for computing Bernoulli numbers of the second kind and Stirling numbers of the first kind

Explicit formulas for computing Bernoulli numbers of the second kind and Stirling numbers of the first kind Filomat 28:2 (24), 39 327 DOI.2298/FIL4239O Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat Explicit formulas for computing Bernoulli

More information

EVALUATION OF A FAMILY OF BINOMIAL DETERMINANTS

EVALUATION OF A FAMILY OF BINOMIAL DETERMINANTS EVALUATION OF A FAMILY OF BINOMIAL DETERMINANTS CHARLES HELOU AND JAMES A SELLERS Abstract Motivated by a recent work about finite sequences where the n-th term is bounded by n, we evaluate some classes

More information

1 Examples of Weak Induction

1 Examples of Weak Induction More About Mathematical Induction Mathematical induction is designed for proving that a statement holds for all nonnegative integers (or integers beyond an initial one). Here are some extra examples of

More information

Representation of doubly infinite matrices as non-commutative Laurent series

Representation of doubly infinite matrices as non-commutative Laurent series Spec. Matrices 217; 5:25 257 Research Article Open Access María Ivonne Arenas-Herrera and Luis Verde-Star* Representation of doubly infinite matrices as non-commutative Laurent series https://doi.org/1.1515/spma-217-18

More information

ON THE SET OF REDUCED φ-partitions OF A POSITIVE INTEGER

ON THE SET OF REDUCED φ-partitions OF A POSITIVE INTEGER ON THE SET OF REDUCED φ-partitions OF A POSITIVE INTEGER Jun Wang Department of Applied Mathematics, Dalian University of Technology, Dalian 116024, P.R. China Xin Wang Department of Applied Mathematics,

More information

The primitive root theorem

The primitive root theorem The primitive root theorem Mar Steinberger First recall that if R is a ring, then a R is a unit if there exists b R with ab = ba = 1. The collection of all units in R is denoted R and forms a group under

More information

A talk given at University of Wisconsin at Madison (April 6, 2006). Zhi-Wei Sun

A talk given at University of Wisconsin at Madison (April 6, 2006). Zhi-Wei Sun A tal given at University of Wisconsin at Madison April 6, 2006. RECENT PROGRESS ON CONGRUENCES INVOLVING BINOMIAL COEFFICIENTS Zhi-Wei Sun Department of Mathematics Nanjing University Nanjing 210093,

More information

Polynomials with palindromic and unimodal coefficients

Polynomials with palindromic and unimodal coefficients Polynomials with palindromic and unimodal coefficients arxiv:60.05629v [math.co] 2 Jan 206 Hua Sun, Yi Wang, Hai-Xia Zhang School of Mathematical Sciences, Dalian University of Technology, Dalian 6024,

More information

Some sophisticated congruences involving Fibonacci numbers

Some sophisticated congruences involving Fibonacci numbers A tal given at the National Center for Theoretical Sciences (Hsinchu, Taiwan; July 20, 2011 and Shanghai Jiaotong University (Nov. 4, 2011 Some sohisticated congruences involving Fibonacci numbers Zhi-Wei

More information

Math 324 Summer 2012 Elementary Number Theory Notes on Mathematical Induction

Math 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 information

A Combinatorial Interpretation of the Numbers 6 (2n)! /n! (n + 2)!

A Combinatorial Interpretation of the Numbers 6 (2n)! /n! (n + 2)! 1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 8 (2005), Article 05.2.3 A Combinatorial Interpretation of the Numbers 6 (2n)! /n! (n + 2)! Ira M. Gessel 1 and Guoce Xin Department of Mathematics Brandeis

More information

POWERS OF A MATRIX AND COMBINATORIAL IDENTITIES

POWERS OF A MATRIX AND COMBINATORIAL IDENTITIES POWERS OF A MATRIX AND COMBINATORIAL IDENTITIES J MC LAUGHLIN AND B SURY Abstract In this article we obtain a general polynomial identity in variables, 2 is an arbitrary positive integer We use this identity

More information

Named numbres. Ngày 25 tháng 11 năm () Named numbres Ngày 25 tháng 11 năm / 7

Named numbres. Ngày 25 tháng 11 năm () Named numbres Ngày 25 tháng 11 năm / 7 Named numbres Ngày 25 tháng 11 năm 2011 () Named numbres Ngày 25 tháng 11 năm 2011 1 / 7 Fibonacci, Catalan, Stirling, Euler, Bernoulli Many sequences are famous. 1 1, 2, 3, 4,... the integers. () Named

More information

A CONGRUENTIAL IDENTITY AND THE 2-ADIC ORDER OF LACUNARY SUMS OF BINOMIAL COEFFICIENTS

A CONGRUENTIAL IDENTITY AND THE 2-ADIC ORDER OF LACUNARY SUMS OF BINOMIAL COEFFICIENTS A CONGRUENTIAL IDENTITY AND THE 2-ADIC ORDER OF LACUNARY SUMS OF BINOMIAL COEFFICIENTS Gregory Tollisen Department of Mathematics, Occidental College, 1600 Campus Road, Los Angeles, USA tollisen@oxy.edu

More information

A Conjectured Combinatorial Interpretation of the Normalized Irreducible Character Values of the Symmetric Group

A Conjectured Combinatorial Interpretation of the Normalized Irreducible Character Values of the Symmetric Group A Conjectured Combinatorial Interpretation of the Normalized Irreducible Character Values of the Symmetric Group Richard P. Stanley Department of Mathematics, Massachusetts Institute of Technology Cambridge,

More information

Sequences of Real Numbers

Sequences of Real Numbers Chapter 8 Sequences of Real Numbers In this chapter, we assume the existence of the ordered field of real numbers, though we do not yet discuss or use the completeness of the real numbers. In the next

More information

arxiv: v1 [cs.it] 12 Jun 2016

arxiv: v1 [cs.it] 12 Jun 2016 New Permutation Trinomials From Niho Exponents over Finite Fields with Even Characteristic arxiv:606.03768v [cs.it] 2 Jun 206 Nian Li and Tor Helleseth Abstract In this paper, a class of permutation trinomials

More information

Applications of Riordan matrix functions to Bernoulli and Euler polynomials

Applications of Riordan matrix functions to Bernoulli and Euler polynomials Illinois Wesleyan University From the SelectedWors of Tian-Xiao He 06 Applications of Riordan matrix functions to Bernoulli and Euler polynomials Tian-Xiao He Available at: https://worsbepresscom/tian_xiao_he/78/

More information

Congruences for central factorial numbers modulo powers of prime

Congruences for central factorial numbers modulo powers of prime DOI 10.1186/s40064-016-2028-5 RESEARCH Open Access Congruences for central factorial numbers modulo powers of prime Haiqing Wang * and Guodong Liu *Correspondence: whqlcf@163.com Department of Mathematics,

More information

ON QUADRAPELL NUMBERS AND QUADRAPELL POLYNOMIALS

ON 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 information

p-regular functions and congruences for Bernoulli and Euler numbers

p-regular functions and congruences for Bernoulli and Euler numbers p-regular functions and congruences for Bernoulli and Euler numbers Zhi-Hong Sun( Huaiyin Normal University Huaian, Jiangsu 223001, PR China http://www.hytc.edu.cn/xsjl/szh Notation: Z the set of integers,

More information

A Note on the 2 F 1 Hypergeometric Function

A Note on the 2 F 1 Hypergeometric Function A Note on the F 1 Hypergeometric Function Armen Bagdasaryan Institution of the Russian Academy of Sciences, V.A. Trapeznikov Institute for Control Sciences 65 Profsoyuznaya, 117997, Moscow, Russia E-mail:

More information

Enumeration Problems for a Linear Congruence Equation

Enumeration Problems for a Linear Congruence Equation Enumeration Problems for a Linear Congruence Equation Wun-Seng Chou Institute of Mathematics Academia Sinica and Department of Mathematical Sciences National Chengchi University Taipei, Taiwan, ROC E-mail:

More information

Partitions, permutations and posets Péter Csikvári

Partitions, permutations and posets Péter Csikvári Partitions, permutations and posets Péter Csivári In this note I only collect those things which are not discussed in R Stanley s Algebraic Combinatorics boo Partitions For the definition of (number) partition,

More information

The generalized order-k Fibonacci Pell sequence by matrix methods

The generalized order-k Fibonacci Pell sequence by matrix methods Journal of Computational and Applied Mathematics 09 (007) 33 45 wwwelseviercom/locate/cam The generalized order- Fibonacci Pell sequence by matrix methods Emrah Kilic Mathematics Department, TOBB University

More information

Appendix to: Generalized Stability of Kronecker Coefficients. John R. Stembridge. 14 August 2014

Appendix to: Generalized Stability of Kronecker Coefficients. John R. Stembridge. 14 August 2014 Appendix to: Generalized Stability of Kronecker Coefficients John R. Stembridge 14 August 2014 Contents A. Line reduction B. Complementation C. On rectangles D. Kronecker coefficients and Gaussian coefficients

More information

A Symbolic Operator Approach to Power Series Transformation-Expansion Formulas

A Symbolic Operator Approach to Power Series Transformation-Expansion Formulas A Symbolic Operator Approach to Power Series Transformation-Expansion Formulas Tian- Xiao He Department of Mathematics and Computer Science Illinois Wesleyan University Bloomington, IL 61702-2900, USA

More information

Counting Peaks and Valleys in a Partition of a Set

Counting Peaks and Valleys in a Partition of a Set 1 47 6 11 Journal of Integer Sequences Vol. 1 010 Article 10.6.8 Counting Peas and Valleys in a Partition of a Set Toufi Mansour Department of Mathematics University of Haifa 1905 Haifa Israel toufi@math.haifa.ac.il

More information

MULTISECTION METHOD AND FURTHER FORMULAE FOR π. De-Yin Zheng

MULTISECTION METHOD AND FURTHER FORMULAE FOR π. De-Yin Zheng Indian J. pure appl. Math., 39(: 37-55, April 008 c Printed in India. MULTISECTION METHOD AND FURTHER FORMULAE FOR π De-Yin Zheng Department of Mathematics, Hangzhou Normal University, Hangzhou 30036,

More information

Two finite forms of Watson s quintuple product identity and matrix inversion

Two finite forms of Watson s quintuple product identity and matrix inversion Two finite forms of Watson s uintuple product identity and matrix inversion X. Ma Department of Mathematics SuZhou University, SuZhou 215006, P.R.China Submitted: Jan 24, 2006; Accepted: May 27, 2006;

More information

The k-fibonacci matrix and the Pascal matrix

The k-fibonacci matrix and the Pascal matrix Cent Eur J Math 9(6 0 403-40 DOI: 0478/s533-0-0089-9 Central European Journal of Mathematics The -Fibonacci matrix and the Pascal matrix Research Article Sergio Falcon Department of Mathematics and Institute

More information

Noncommutative Abel-like identities

Noncommutative Abel-like identities Noncommutative Abel-like identities Darij Grinberg draft, January 15, 2018 Contents 1. Introduction 1 2. The identities 3 3. The proofs 7 3.1. Proofs of Theorems 2.2 and 2.4...................... 7 3.2.

More information

THE p-adic VALUATION OF EULERIAN NUMBERS: TREES AND BERNOULLI NUMBERS

THE p-adic VALUATION OF EULERIAN NUMBERS: TREES AND BERNOULLI NUMBERS THE p-adic VALUATION OF EULERIAN NUMBERS: TREES AND BERNOULLI NUMBERS FRANCIS N. CASTRO, OSCAR E. GONZÁLEZ, AND LUIS A. MEDINA Abstract. In this work we explore the p-adic valuation of Eulerian numbers.

More information

A CRITERION FOR POLYNOMIALS TO BE CONGRUENT TO THE PRODUCT OF LINEAR POLYNOMIALS (mod p) ZHI-HONG SUN

A CRITERION FOR POLYNOMIALS TO BE CONGRUENT TO THE PRODUCT OF LINEAR POLYNOMIALS (mod p) ZHI-HONG SUN A CRITERION FOR POLYNOMIALS TO BE CONGRUENT TO THE PRODUCT OF LINEAR POLYNOMIALS (mod ) ZHI-HONG SUN Deartment of Mathematics, Huaiyin Teachers College, Huaian 223001, Jiangsu, P. R. China e-mail: hyzhsun@ublic.hy.js.cn

More information

Generalized Fibonacci Numbers and Blackwell s Renewal Theorem

Generalized Fibonacci Numbers and Blackwell s Renewal Theorem Generalized Fibonacci Numbers and Blackwell s Renewal Theorem arxiv:1012.5006v1 [math.pr] 22 Dec 2010 Sören Christensen Christian-Albrechts-Universität, Mathematisches Seminar, Kiel, Germany Abstract:

More information

On Certain Sums of Stirling Numbers with Binomial Coefficients

On Certain Sums of Stirling Numbers with Binomial Coefficients 1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 18 (2015, Article 15.9.6 On Certain Sums of Stirling Numbers with Binomial Coefficients H. W. Gould Department of Mathematics West Virginia University

More information

The cycle polynomial of a permutation group

The cycle polynomial of a permutation group The cycle polynomial of a permutation group Peter J. Cameron School of Mathematics and Statistics University of St Andrews North Haugh St Andrews, Fife, U.K. pjc0@st-andrews.ac.uk Jason Semeraro Department

More information

Combinatorial results for certain semigroups of partial isometries of a finite chain

Combinatorial results for certain semigroups of partial isometries of a finite chain AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 58() (014), Pages 65 75 Combinatorial results for certain semigroups of partial isometries of a finite chain F. Al-Kharousi Department of Mathematics and Statistics

More information

arxiv: v1 [math.co] 11 Jul 2015

arxiv: v1 [math.co] 11 Jul 2015 arxiv:50703055v [mathco] Jul 05 Duals of Bernoulli Numbers and Polynomials and Euler Number and Polynomials Tian-Xiao He and Jinze Zheng Department of Mathematics Illinois Wesleyan University Bloomington,

More information

w = X ^ = ^ ^, (i*i < ix

w = X ^ = ^ ^, (i*i < ix A SUMMATION FORMULA FOR POWER SERIES USING EULERIAN FRACTIONS* Xinghua Wang Math. Department, Zhejiang University, Hangzhou 310028, China Leetsch C. Hsu Math. Institute, Dalian University of Technology,

More information

THE p-adic VALUATION OF LUCAS SEQUENCES

THE p-adic VALUATION OF LUCAS SEQUENCES THE p-adic VALUATION OF LUCAS SEQUENCES CARLO SANNA Abstract. Let (u n) n 0 be a nondegenerate Lucas sequence with characteristic polynomial X 2 ax b, for some relatively prime integers a and b. For each

More information

1. Introduction Definition 1.1. Let r 1 be an integer. The r-generalized Fibonacci sequence {G n } is defined as

1. Introduction Definition 1.1. Let r 1 be an integer. The r-generalized Fibonacci sequence {G n } is defined as SOME IDENTITIES FOR r-fibonacci NUMBERS F. T. HOWARD AND CURTIS COOPER Abstract. Let r 1 be an integer. The r-generalized Fibonacci sequence {G n} is defined as 8 >< 0, if 0 n < r 1; G n = 1, if n = r

More information

Fibonacci and Lucas Identities the Golden Way

Fibonacci and Lucas Identities the Golden Way Fibonacci Lucas Identities the Golden Way Kunle Adegoe adegoe00@gmail.com arxiv:1810.12115v1 [math.nt] 25 Oct 2018 Department of Physics Engineering Physics, Obafemi Awolowo University, 220005 Ile-Ife,

More information

The Fibonacci Quarterly 44(2006), no.2, PRIMALITY TESTS FOR NUMBERS OF THE FORM k 2 m ± 1. Zhi-Hong Sun

The Fibonacci Quarterly 44(2006), no.2, PRIMALITY TESTS FOR NUMBERS OF THE FORM k 2 m ± 1. Zhi-Hong Sun The Fibonacci Quarterly 44006, no., 11-130. PRIMALITY TESTS FOR NUMBERS OF THE FORM k m ± 1 Zhi-Hong Sun eartment of Mathematics, Huaiyin Teachers College, Huaian, Jiangsu 3001, P.R. China E-mail: zhsun@hytc.edu.cn

More information

THE LOG-BEHAVIOR OF THE SEQUENCE FOR THE PARTIAL SUM OF A LOG-CONVEX SEQUENCE. 1. Introduction

THE LOG-BEHAVIOR OF THE SEQUENCE FOR THE PARTIAL SUM OF A LOG-CONVEX SEQUENCE. 1. Introduction SARAJEVO JOURNAL OF MATHEMATICS Vol.13 (26), No.2, (2017), 163 178 DOI: 10.5644/SJM.13.2.04 THE LOG-BEHAVIOR OF THE SEQUENCE FOR THE PARTIAL SUM OF A LOG-CONVEX SEQUENCE FENG-ZHEN ZHAO Abstract. In this

More information

Impulse Response Sequences and Construction of Number Sequence Identities

Impulse Response Sequences and Construction of Number Sequence Identities Impulse Response Sequences and Construction of Number Sequence Identities Tian-Xiao He Department of Mathematics Illinois Wesleyan University Bloomington, IL 6170-900, USA Abstract As an extension of Lucas

More information

POWERS OF A MATRIX AND COMBINATORIAL IDENTITIES. J. Mc Laughlin Mathematics Department, Trinity College, 300 Summit Street, Hartford, CT

POWERS OF A MATRIX AND COMBINATORIAL IDENTITIES. J. Mc Laughlin Mathematics Department, Trinity College, 300 Summit Street, Hartford, CT INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 5 (2005), #A13 POWERS OF A MATRIX AND COMBINATORIAL IDENTITIES J Mc Laughlin Mathematics Department, Trinity College, 300 Summit Street, Hartford,

More information

A Symbolic Operator Approach to Power Series Transformation-Expansion Formulas

A Symbolic Operator Approach to Power Series Transformation-Expansion Formulas 1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 11 2008, Article 08.2.7 A Symbolic Operator Approach to Power Series Transformation-Expansion Formulas Tian-Xiao He 1 Department of Mathematics and Computer

More information

FIFTH ROOTS OF FIBONACCI FRACTIONS. Christopher P. French Grinnell College, Grinnell, IA (Submitted June 2004-Final Revision September 2004)

FIFTH 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 information

Fibonacci and Lucas numbers via the determinants of tridiagonal matrix

Fibonacci 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 information

J. Combin. Theory Ser. A 116(2009), no. 8, A NEW EXTENSION OF THE ERDŐS-HEILBRONN CONJECTURE

J. Combin. Theory Ser. A 116(2009), no. 8, A NEW EXTENSION OF THE ERDŐS-HEILBRONN CONJECTURE J. Combin. Theory Ser. A 116(2009), no. 8, 1374 1381. A NEW EXTENSION OF THE ERDŐS-HEILBRONN CONJECTURE Hao Pan and Zhi-Wei Sun Department of Mathematics, Naning University Naning 210093, People s Republic

More information

Parity Theorems for Statistics on Domino Arrangements

Parity Theorems for Statistics on Domino Arrangements Parity Theorems for Statistics on Domino Arrangements Mar A Shattuc Mathematics Department University of Tennessee Knoxville, TN 37996-1300 shattuc@mathutedu Carl G Wagner Mathematics Department University

More information

G. Sburlati GENERALIZED FIBONACCI SEQUENCES AND LINEAR RECURRENCES

G. Sburlati GENERALIZED FIBONACCI SEQUENCES AND LINEAR RECURRENCES Rend. Sem. Mat. Univ. Pol. Torino - Vol. 65, 3 (2007) G. Sburlati GENERALIZED FIBONACCI SEQUENCES AND LINEAR RECURRENCES Abstract. We analyze the existing relations among particular classes of generalized

More information

Sums of Products of Bernoulli Numbers*

Sums of Products of Bernoulli Numbers* journal of number theory 60, 234 (996) article no. 00 Sums of Products of Bernoulli Numbers* Karl Dilcher Department of Mathematics, Statistics, and Computing Science, Dalhousie University, Halifax, Nova

More information

(n = 0, 1, 2,... ). (2)

(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 information

A quasisymmetric function generalization of the chromatic symmetric function

A quasisymmetric function generalization of the chromatic symmetric function A quasisymmetric function generalization of the chromatic symmetric function Brandon Humpert University of Kansas Lawrence, KS bhumpert@math.ku.edu Submitted: May 5, 2010; Accepted: Feb 3, 2011; Published:

More information

Apéry Numbers, Franel Numbers and Binary Quadratic Forms

Apéry Numbers, Franel Numbers and Binary Quadratic Forms A tal given at Tsinghua University (April 12, 2013) and Hong Kong University of Science and Technology (May 2, 2013) Apéry Numbers, Franel Numbers and Binary Quadratic Forms Zhi-Wei Sun Nanjing University

More information

Research Article On Maslanka s Representation for the Riemann Zeta Function

Research Article On Maslanka s Representation for the Riemann Zeta Function International Mathematics and Mathematical Sciences Volume 200, Article ID 7447, 9 pages doi:0.55/200/7447 Research Article On Maslana s Representation for the Riemann Zeta Function Luis Báez-Duarte Departamento

More information

An identity involving the least common multiple of binomial coefficients and its application

An identity involving the least common multiple of binomial coefficients and its application Amer. Math. Monthly, 116 (2009, p. 836-839. An identity involving the least common multiple of binomial coefficients and its application Bair FARHI bair.farhi@gmail.com Abstract In this paper, we prove

More information

CONGRUENCES FOR BERNOULLI - LUCAS SUMS

CONGRUENCES 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 information

F. T. HOWARD AND CURTIS COOPER

F. T. HOWARD AND CURTIS COOPER SOME IDENTITIES FOR r-fibonacci NUMBERS F. T. HOWARD AND CURTIS COOPER Abstract. Let r 1 be an integer. The r-generalized Fibonacci sequence {G n} is defined as 0, if 0 n < r 1; G n = 1, if n = r 1; G

More information

COMBINATORIAL COUNTING

COMBINATORIAL COUNTING COMBINATORIAL COUNTING Our main reference is [1, Section 3] 1 Basic counting: functions and subsets Theorem 11 (Arbitrary mapping Let N be an n-element set (it may also be empty and let M be an m-element

More information

MACMAHON S PARTITION ANALYSIS IX: k-gon PARTITIONS

MACMAHON S PARTITION ANALYSIS IX: k-gon PARTITIONS MACMAHON S PARTITION ANALYSIS IX: -GON PARTITIONS GEORGE E. ANDREWS, PETER PAULE, AND AXEL RIESE Dedicated to George Szeeres on the occasion of his 90th birthday Abstract. MacMahon devoted a significant

More information

RECIPROCAL SUMS OF SEQUENCES INVOLVING BALANCING AND LUCAS-BALANCING NUMBERS

RECIPROCAL 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 information

COMPOSITIONS, PARTITIONS, AND FIBONACCI NUMBERS

COMPOSITIONS, PARTITIONS, AND FIBONACCI NUMBERS COMPOSITIONS PARTITIONS AND FIBONACCI NUMBERS ANDREW V. SILLS Abstract. A bijective proof is given for the following theorem: the number of compositions of n into odd parts equals the number of compositions

More information

Zhi-Wei Sun Department of Mathematics, Nanjing University Nanjing , People s Republic of China

Zhi-Wei Sun Department of Mathematics, Nanjing University Nanjing , People s Republic of China Ramanuan J. 40(2016, no. 3, 511-533. CONGRUENCES INVOLVING g n (x n ( n 2 ( 2 0 x Zhi-Wei Sun Deartment of Mathematics, Naning University Naning 210093, Peole s Reublic of China zwsun@nu.edu.cn htt://math.nu.edu.cn/

More information

A bijective proof of Shapiro s Catalan convolution

A bijective proof of Shapiro s Catalan convolution A bijective proof of Shapiro s Catalan convolution Péter Hajnal Bolyai Institute University of Szeged Szeged, Hungary Gábor V. Nagy {hajnal,ngaba}@math.u-szeged.hu Submitted: Nov 26, 2013; Accepted: May

More information

COMPLEX FACTORIZATION BY CHEBYSEV POLYNOMIALS

COMPLEX FACTORIZATION BY CHEBYSEV POLYNOMIALS LE MATEMATICHE Vol LXXIII 2018 Fasc I, pp 179 189 doi: 104418/201873113 COMPLEX FACTORIZATION BY CHEBYSEV POLYNOMIALS MURAT SAHIN - ELIF TAN - SEMIH YILMAZ Let {a i },{b i } be real numbers for 0 i r 1,

More information

Two-boundary lattice paths and parking functions

Two-boundary lattice paths and parking functions Two-boundary lattice paths and parking functions Joseph PS Kung 1, Xinyu Sun 2, and Catherine Yan 3,4 1 Department of Mathematics, University of North Texas, Denton, TX 76203 2,3 Department of Mathematics

More information

How many units can a commutative ring have?

How many units can a commutative ring have? How many units can a commutative ring have? Sunil K. Chebolu and Keir Locridge Abstract. László Fuchs posed the following problem in 960, which remains open: classify the abelian groups occurring as the

More information

Revisit nonlinear differential equations associated with Bernoulli numbers of the second kind

Revisit nonlinear differential equations associated with Bernoulli numbers of the second kind Global Journal of Pure Applied Mathematics. ISSN 0973-768 Volume 2, Number 2 (206), pp. 893-90 Research India Publications http://www.ripublication.com/gjpam.htm Revisit nonlinear differential equations

More information

PARTITIONS WITH FIXED DIFFERENCES BETWEEN LARGEST AND SMALLEST PARTS

PARTITIONS WITH FIXED DIFFERENCES BETWEEN LARGEST AND SMALLEST PARTS PARTITIONS WITH FIXED DIFFERENCES BETWEEN LARGEST AND SMALLEST PARTS GEORGE E. ANDREWS, MATTHIAS BECK, AND NEVILLE ROBBINS Abstract. We study the number p(n, t) of partitions of n with difference t between

More information

Cullen Numbers in Binary Recurrent Sequences

Cullen 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 information

A RECIPROCAL SUM RELATED TO THE RIEMANN ζ FUNCTION. 1. Introduction. 1 n s, k 2 = n 1. k 3 = 2n(n 1),

A RECIPROCAL SUM RELATED TO THE RIEMANN ζ FUNCTION. 1. Introduction. 1 n s, k 2 = n 1. k 3 = 2n(n 1), Journal of Mathematical Inequalities Volume, Number 07, 09 5 doi:0.753/jmi--0 A RECIPROCAL SUM RELATED TO THE RIEMANN ζ FUNCTION LIN XIN AND LI XIAOXUE Communicated by J. Pečarić Abstract. This paper,

More information

arxiv: v1 [math.nt] 17 Nov 2011

arxiv: v1 [math.nt] 17 Nov 2011 sequences of Generalized Van der Laan and Generalized Perrin Polynomials arxiv:11114065v1 [mathnt] 17 Nov 2011 Kenan Kaygisiz a,, Adem Şahin a a Department of Mathematics, Faculty of Arts and Sciences,

More information

ON POLYNOMIAL IDENTITIES FOR RECURSIVE SEQUENCES

ON POLYNOMIAL IDENTITIES FOR RECURSIVE SEQUENCES Miskolc Mathematical Notes HU e-issn 1787-2413 Vol. 18 (2017), No. 1, pp. 327 336 DOI: 10.18514/MMN.2017.1776 ON POLYNOMIAL IDENTITIES FOR RECURSIVE SEQUENCES I. MARTINJAK AND I. VRSALJKO Received 09 September,

More information

MATH 112 QUADRATIC AND BILINEAR FORMS NOVEMBER 24, Bilinear forms

MATH 112 QUADRATIC AND BILINEAR FORMS NOVEMBER 24, Bilinear forms MATH 112 QUADRATIC AND BILINEAR FORMS NOVEMBER 24,2015 M. J. HOPKINS 1.1. Bilinear forms and matrices. 1. Bilinear forms Definition 1.1. Suppose that F is a field and V is a vector space over F. bilinear

More information

1. INTRODUCTION. n=. A few applications are also presented at the end of the Note. The following Theorem is established in the present Note:

1. INTRODUCTION. n=. A few applications are also presented at the end of the Note. The following Theorem is established in the present Note: CONVOLVING THE m-th POWERS OF THE CONSECUTIVE INTEGERS WITH THE GENERAL FIBONACCI SEQUENCE USING CARLITZ S WEIGHTED STIRLING POLYNOMIALS OF THE SECOND KIND N. Gauthier Department of Physics, The Royal

More information