Sum of cubes: Old proofs suggest new q analogues

Similar documents
Sum of cubes: Old proofs suggest new q analogues

Abstract. 1. Introduction This note is a supplement to part I ([4]). Let. F x (1.1) x n (1.2) Then the moments L x are the Catalan numbers

Simple proofs of Bressoud s and Schur s polynomial versions of the. Rogers-Ramanujan identities. Johann Cigler

q-lucas polynomials and associated Rogers-Ramanujan type identities

An enumeration of flags in finite vector spaces

0,1,1, 2,3,5,8,13, 21,

q-fibonacci polynomials and q-catalan numbers Johann Cigler [ ] (4) I don t know who has observed this well-known fact for the first time.

The picture in figure 1.1 helps us to see that the area represents the distance traveled. Figure 1: Area represents distance travelled

Math 155 (Lecture 3)

Hankel determinants of some polynomial sequences. Johann Cigler

Bertrand s Postulate

Automated Proofs for Some Stirling Number Identities

Sequences, Mathematical Induction, and Recursion. CSE 2353 Discrete Computational Structures Spring 2018

The r-generalized Fibonacci Numbers and Polynomial Coefficients

Homework 9. (n + 1)! = 1 1

SEQUENCES AND SERIES

NICK DUFRESNE. 1 1 p(x). To determine some formulas for the generating function of the Schröder numbers, r(x) = a(x) =

A GENERALIZATION OF THE SYMMETRY BETWEEN COMPLETE AND ELEMENTARY SYMMETRIC FUNCTIONS. Mircea Merca

Sequences of Definite Integrals, Factorials and Double Factorials

Chapter 7 COMBINATIONS AND PERMUTATIONS. where we have the specific formula for the binomial coefficients:

with an even sum and for k 1mod4 1, 2,, n with an odd sum. ,, n of Pascal s triangle count the subsets of 1, 2,, n

Bijective Proofs of Gould s and Rothe s Identities

q-chebyshev polynomials

A q-analogue of some binomial coefficient identities of Y. Sun

PUTNAM TRAINING INEQUALITIES

Largest families without an r-fork

Pell and Lucas primes

Some p-adic congruences for p q -Catalan numbers

Polynomial Generalizations and Combinatorial Interpretations for Sequences Including the Fibonacci and Pell Numbers

EVALUATION OF SUMS INVOLVING PRODUCTS OF GAUSSIAN q-binomial COEFFICIENTS WITH APPLICATIONS

THE ASYMPTOTIC COMPLEXITY OF MATRIX REDUCTION OVER FINITE FIELDS

Problem 4: Evaluate ( k ) by negating (actually un-negating) its upper index. Binomial coefficient

A symmetrical Eulerian identity

UNIVERSITY OF NORTHERN COLORADO MATHEMATICS CONTEST. First Round For all Colorado Students Grades 7-12 November 3, 2007

The log-behavior of n p(n) and n p(n)/n

Week 5-6: The Binomial Coefficients

Fibonacci polynomials, generalized Stirling numbers, and Bernoulli, Genocchi and tangent numbers

Recurrence Relations

CALCULATION OF FIBONACCI VECTORS

Solutions to Homework 1

Sigma notation. 2.1 Introduction

Some identities involving Fibonacci, Lucas polynomials and their applications

GENERALIZED HARMONIC NUMBER IDENTITIES AND A RELATED MATRIX REPRESENTATION

Enumerative & Asymptotic Combinatorics

SOME NEW IDENTITIES INVOLVING π,

Some remarks for codes and lattices over imaginary quadratic

In number theory we will generally be working with integers, though occasionally fractions and irrationals will come into play.

A 2nTH ORDER LINEAR DIFFERENCE EQUATION

4.1 SIGMA NOTATION AND RIEMANN SUMS

arxiv: v1 [math.nt] 28 Apr 2014

18th Bay Area Mathematical Olympiad. Problems and Solutions. February 23, 2016

Some Hankel determinants with nice evaluations. Johann Cigler Talk at the occasion of Peter Paule s 60 th birthday

Homework 3. = k 1. Let S be a set of n elements, and let a, b, c be distinct elements of S. The number of k-subsets of S is

Ma 530 Introduction to Power Series

Proof of Fermat s Last Theorem by Algebra Identities and Linear Algebra

Summer High School 2009 Aaron Bertram

Sums of powers of the natural numbers

EXPANSION FORMULAS FOR APOSTOL TYPE Q-APPELL POLYNOMIALS, AND THEIR SPECIAL CASES

, 4 is the second term U 2

An Elementary and Simple Proof of Fermat s Last Theorem

Unimodality of generalized Gaussian coefficients.

Erratum to: An empirical central limit theorem for intermittent maps

AN ALMOST LINEAR RECURRENCE. Donald E. Knuth Calif. Institute of Technology, Pasadena, Calif.

Factors of sums and alternating sums involving binomial coefficients and powers of integers

Journal of Ramanujan Mathematical Society, Vol. 24, No. 2 (2009)

1. By using truth tables prove that, for all statements P and Q, the statement

MISCELLANEOUS SEQUENCES & SERIES QUESTIONS

MATH 304: MIDTERM EXAM SOLUTIONS

GAMALIEL CERDA-MORALES 1. Blanco Viel 596, Valparaíso, Chile. s: /

SOLUTIONS TO PRISM PROBLEMS Junior Level 2014

SOME TRIBONACCI IDENTITIES

On q-analogs of recursions for the number of involutions and prime order elements in symmetric groups

ON MONOTONICITY OF SOME COMBINATORIAL SEQUENCES

Some q-analogues of Fibonacci, Lucas and Chebyshev polynomials with nice moments

An analog of the arithmetic triangle obtained by replacing the products by the least common multiples

Sequences A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence

Commutativity in Permutation Groups

Summary: Congruences. j=1. 1 Here we use the Mathematica syntax for the function. In Maple worksheets, the function

On Generalized Fibonacci Numbers

Linear chord diagrams with long chords

Axioms of Measure Theory

Random Models. Tusheng Zhang. February 14, 2013

Lecture Overview. 2 Permutations and Combinations. n(n 1) (n (k 1)) = n(n 1) (n k + 1) =

A Simplified Binet Formula for k-generalized Fibonacci Numbers

UNIVERSITY OF CALIFORNIA - SANTA CRUZ DEPARTMENT OF PHYSICS PHYS 116C. Problem Set 4. Benjamin Stahl. November 6, 2014

A generalization of Morley s congruence

Induction: Solutions

On the Jacobsthal-Lucas Numbers by Matrix Method 1

05 - PERMUTATIONS AND COMBINATIONS Page 1 ( Answers at the end of all questions )

Binomial transform of products

Hoggatt and King [lo] defined a complete sequence of natural numbers

a for a 1 1 matrix. a b a b 2 2 matrix: We define det ad bc 3 3 matrix: We define a a a a a a a a a a a a a a a a a a

LINEAR RECURSION RELATIONS - LESSON FOUR SECOND-ORDER LINEAR RECURSION RELATIONS

62. Power series Definition 16. (Power series) Given a sequence {c n }, the series. c n x n = c 0 + c 1 x + c 2 x 2 + c 3 x 3 +

Worksheet on Generating Functions

A Mean Paradox. John Konvalina, Jack Heidel, and Jim Rogers. Department of Mathematics University of Nebraska at Omaha Omaha, NE USA

1 6 = 1 6 = + Factorials and Euler s Gamma function

Areas and Distances. We can easily find areas of certain geometric figures using well-known formulas:

Probability, Expectation Value and Uncertainty

(a) (b) All real numbers. (c) All real numbers. (d) None. to show the. (a) 3. (b) [ 7, 1) (c) ( 7, 1) (d) At x = 7. (a) (b)

Transcription:

Sum of cubes: Old proofs suggest ew aalogues Joha Cigler Faultät für Mathemati, Uiversität Wie ohacigler@uivieacat Abstract We show how old proofs of the sum of cubes suggest ew aalogues 1 Itroductio I [1], [5] ad [7] some aalogues of the well-ow formula 1 1 (1) have bee foud I this ote I propose aother oe which is ispired by a old result of C Wheatstoe [6] He observed that the odd umbers ca be grouped i such a way that the idetities hold, which implies that Sice 11 5 7911 115 17 19 4 1 1 1 1 () 1 ( 1) () we get (1) Idetity (1) ca also be writte as 1 1, (4) because 1 1 (5) 1

A simple proof without words of (4) has bee give i [4], which I reproduce here: The simplest computatioal proof of (1) uses the trivial idetity gives the telescopig sum 1 which 1 1 1 1 1 1 aalogues 1 1 [ ] [ 1] [ 1] As usual we let [ ] 1 ad 1 [1] [] [ ] 0 1 It is clear that lim 1 ad lim 1 for

KC Garrett ad K Hummel [1] derived a combiatorial proof of the aalogue SO Waraar [5] proposed the idetity [ 1] [ 1] 1, [] 1 (6) 1 1 [ ] [ ] 1 (7) ad G Zhao ad H Feg [7] gave a combiatorial iterpretatio of 1 4( ) 1 1 [ ] 0 1 (8) For a computatioal proof observe that the left-had sums become telescopig by usig the idetities 1 1 1 1 a 1 a 1a 1 1 1 1 1 a 1a 1 a 1a 1 1 for a 0,1, A similar idetity is 1, (9) which follows from 1 1 1 1 1 1 1 1 1 This idetity gives the telescopig sum

1 1 1 1 1 [ ] [ ] 1 1 1 1 1 1 1 1 1 1 1 1 Thus we have obtaied our mai result Theorem 1 1 1 1 [ ] [ ] 1 (10) We ow give two further proofs which geeralize the beautiful proofs which we have setched i the itroductio ad which origially led to this aalogue We start with the followig well-ow (cf []) aalogue of () A telescopig proof uses the fact that [1] [ ] (11) 1 1 1 ( 1) 1 1 1 [ ] 1 [1] But formula (11) has also a ice combiatorial iterpretatio 0, Cosider the suares S i, ad associate with each poit i wi 1 (, ) i The weight of S is i 1 1 i 1 i0 0 w S [ ], S the weight (1) 4

The suare S is the uio of the hoos h 1, 0, 1,1,, 1, 1,, 1,, 0, 1, 1 The weight of the hoo h is 0 1 wh 1 1 The poit,0 will be called the base-poit of the suare As a example cosider the case 6 i matrix otatio 1 5 6 7 8 9 10 4 5 6 7 8 9 4 5 6 7 8 4 5 6 7 4 5 6 4 5 (1) Here we have wh 5 ( 1), wh 4 ( ) [], wh ( ) [5], Secod proof of Theorem 1 We first observe that formulae () have the ice aalogues ad more geerally This follows from the idetity 1 [1] [1 ] [] [5] [] [ ] [7] [9] [11] [] [ ] 1 1 [ ] [ ] (14) 1 1 1 1 1 1 1 1 1 1 1 1 0 0 [ ] [ ] 1 [ ] [ ] Usig (11) we get the desired result 5

1 1 1 1 1 1 [ ] [ ] 1 1 1 1 1 1 1 1 1 1 [1] 1 Third proof of Theorem 1 A combiatorial proof ca also be give alog the lies of the above proof without words For odd the uio R of the hoos h,, h 1 1 1 1 m is the uio of suares of sidelegth whose base poits have weight The weight of these suares is, 0 m 1 1 1 1 1 1 ( 1) 1 1 [ ] 1 [ ] [ ] 1 1 [ ] For the uio R of the hoos h,, h 1 1 1 1 m 1 1 is the uio of 1 suares whose base-poits have weights, 0 m, ad of two rectagles with side legths ad as i the blue regio i the above figure The weight of the uppermost rectagle is rectagle is 1 1 [ ] [ ] 1 [ ] [ ] ad the weight of the leftmost Thus the total weight of this regio is 6

1 1 1 1 1 m [ ] [ ] [ ] [ ] m0 1 1 m 1 4 m0 1 [ ] [ ] 1 1 1 4 1 1 4 1 [ ] [ ] 1 [ ] 1 1 [ ] 4 Thus we get w R 1 ws 1 1 ad thus agai (10) 1 1 1 1 4 Related results Let us ote some related results For ay seuece of positive itegers a () the sums ad 1 ai () i1 [ a( )] a( i) 1 i1 (15) ai () i1 [ a( )] ai ( ) 1 i1 (16) are aalogues of i1 ai () The proofs are obvious because 1 () a() i a i a() i a() i i1 a( 1) i1 1 1 1 1 i 1 i1 ai () [ a ( 1)] ai () 1 1 1 i1 i1 ad 1 1 ai () ai () a( 1) i1 a( 1) i1 1 a( 1) 1 1 a i a a i i1 1 1 1 i1 () [ ( 1)] () By choosig a ( ) we get the followig aalogues of (1): 7

Theorem 1 [ ] (17) 1 ad i 1 1 i [ ] (18) 1 From the recurrece relatios for the biomial coefficiets we get the well-ow formulae ad 1 1 1 1 1 1 1 1 1 1 (19) 1 ( 1)( ) 1 1 (0) For 1 it is well ow that these sums ca be used to compute 6 6 we get 1 For example from 1 1 1 1 ( 1) 1 6 6 4 4 Ufortuately i geeral the sums 1 [ ] do t have a simple expressio 1 1 For example from [ ] [] [] [] [] [ ] we get 1 1 [ ] [] [] [] [] [ ] 1 5 ( 1) 1 4 1 Now 8

( 1) ( 1) ( 1) ( 1) 1 ( 1) [ ] [ ] 1 [ ] 1 1 1 1 1 1 1 [ 1] [ ] 1 1 1 1 1 1 (1 )(1 ) [][] 1 Thus we get 1 1 1 1 1 1 5 [ ] [] [] [] [] 1 4 1 (1) This formula caot be simplified A curious geeralizatio of () is due to P Luthy [] He observed that ad more geerally 1 1 5 57911 5 19 1 5 7 9 1 5 5 () 1 1 1 () 1 1 1 1 ( ) 1 To see this observe that Similar results also hold for the aalogues of () 1 for 1 For 1 1 1 1 (4) 1 1 1 1 1 1 1 1 1 1 1 0 0 1 1 1 1 1 1 1 1 1 (1 ) 9

C Wheatstoe[6] also proved some other curious idetities Eg 1 0 ( 1 ) A aalogue is For 1 1 1 [][ ][ ] (5) 0 1 1 1 1 1 0 0 0 1 1 1 1 (1 )[ ] [ ] 1 (1 ) A similar idetity is m m 1 (6) 0 1 The left-had side is 1 1 1 1 1 [ ] m1 1 1 1 1 1 m (m 1) (m1) 0 0 Let us fially give a aalogue of C Wheatstoe s observatio that ad therefore 1 1 (7) 1 1 1 1 0 (8) 10

Theorem 1 1 1 1 1 1 1 [ ] (9) ad therefore 1 1 1 1 1 1 1 (0) 1 0 1 1 1 Proof Observe that (cf []) This is the special case m 0 of (6) 1 [ ] 0 (1) Therefore the left-had side of (9) becomes a ( 1) 1 a ( ) 1 a( 1) 1 a( 1) a( 1) a( ) a( ) 1 a( ) 1 1 1 1 a( 1) a( ) (1 )(1 ) a( 1) 1 a( 1) a( 1) a( ) a( ) 1 a( ) a( 1) a( ) a( 1) a( ) 1 1 1 1 1 1 1 1 if we let a ( ) This gives )(1 ) (1 )(1 ) (1 1 1 1 1 1 1 1 1 1 1 (1 )(1 ) (1 )(1 ) 1 [ ] ad therefore 1 1 1 1 1 1 1 1 0 1, which by (1) implies (0) 11

Refereces [1] K C Garrett ad K Hummel, A combiatorial proof of the sum of -cubes, Electro J Comb 11 (004), #R9 [] P Luthy, Odd sums of cosecutive odds, http://corellmathwordpresscom/008/0/15/odd-sums-of-cosecutive-odds/ [] M Schlosser, -Aalogues of the sums of cosecutive itegers, suares, cubes, uarts ad uits, Electro J Comb 11 (004), #R71 [4] B R Sears, Problem collectio, http://userstrueastlica/~brsears/math/oldprobhtm#s [5] S O Waraar, O the -aalogue of the sum of cubes, Electro J Comb 11 (004), #N1 [6] C Wheatstoe, O the formatio of powers from arithmetical progressios, Proc Royal Soc Lodo 7 (1854), 145-151 [7] G Zhao ad H Feg, A ew aalogue of the sum of cubes, Discrete Math 07 (007), 861-865 1