Neville Robbins Mathematics Department, San Francisco State University, San Francisco, CA (Submitted August 2002-Final Revision December 2002)

Similar documents
Fibonacci Identities as Binomial Sums

1 Onto functions and bijections Applications to Counting

Bivariate Vieta-Fibonacci and Bivariate Vieta-Lucas Polynomials

means the first term, a2 means the term, etc. Infinite Sequences: follow the same pattern forever.

h-analogue of Fibonacci Numbers

Some identities involving the partial sum of q-binomial coefficients

The k-nacci triangle and applications

MATH 371 Homework assignment 1 August 29, 2013

Exercises for Square-Congruence Modulo n ver 11

arxiv: v4 [math.nt] 14 Aug 2015

Q-analogue of a Linear Transformation Preserving Log-concavity

Mu Sequences/Series Solutions National Convention 2014

Non-uniform Turán-type problems

v 1 -periodic 2-exponents of SU(2 e ) and SU(2 e + 1)

Chapter 9 Jordan Block Matrices

18.413: Error Correcting Codes Lab March 2, Lecture 8

MATH 247/Winter Notes on the adjoint and on normal operators.

#A27 INTEGERS 13 (2013) SOME WEIGHTED SUMS OF PRODUCTS OF LUCAS SEQUENCES

CHAPTER 4 RADICAL EXPRESSIONS

The Primitive Idempotents in

A Primer on Summation Notation George H Olson, Ph. D. Doctoral Program in Educational Leadership Appalachian State University Spring 2010

5 Short Proofs of Simplified Stirling s Approximation

Assignment 5/MATH 247/Winter Due: Friday, February 19 in class (!) (answers will be posted right after class)

Maps on Triangular Matrix Algebras

LINEAR RECURRENT SEQUENCES AND POWERS OF A SQUARE MATRIX

ELEMENTARY PROBLEMS AND SOLUTIONS

Algorithms Theory, Solution for Assignment 2

On quaternions with generalized Fibonacci and Lucas number components

Arithmetic Mean and Geometric Mean

Some results and conjectures about recurrence relations for certain sequences of binomial sums.

The internal structure of natural numbers, one method for the definition of large prime numbers, and a factorization test

Integral Generalized Binomial Coefficients of Multiplicative Functions

The Lucas and Babbage congruences

Part 4b Asymptotic Results for MRR2 using PRESS. Recall that the PRESS statistic is a special type of cross validation procedure (see Allen (1971))

4 Inner Product Spaces

Computations with large numbers

The Mathematical Appendix

COMPUTERISED ALGEBRA USED TO CALCULATE X n COST AND SOME COSTS FROM CONVERSIONS OF P-BASE SYSTEM WITH REFERENCES OF P-ADIC NUMBERS FROM

Factorization of Finite Abelian Groups

On the construction of symmetric nonnegative matrix with prescribed Ritz values

On the Primitive Classes of K * KHALED S. FELALI Department of Mathematical Sciences, Umm Al-Qura University, Makkah Al-Mukarramah, Saudi Arabia

2006 Jamie Trahan, Autar Kaw, Kevin Martin University of South Florida United States of America

ON THE ELEMENTARY SYMMETRIC FUNCTIONS OF A SUM OF MATRICES

arxiv:math/ v1 [math.gm] 8 Dec 2005

About k-perfect numbers

ρ < 1 be five real numbers. The

Application of Generating Functions to the Theory of Success Runs

MAX-MIN AND MIN-MAX VALUES OF VARIOUS MEASURES OF FUZZY DIVERGENCE

A study of the sum three or more consecutive natural numbers

Strong Convergence of Weighted Averaged Approximants of Asymptotically Nonexpansive Mappings in Banach Spaces without Uniform Convexity

Evaluating Polynomials

ANALYSIS ON THE NATURE OF THE BASIC EQUATIONS IN SYNERGETIC INTER-REPRESENTATION NETWORK

Chapter 5 Properties of a Random Sample

. The set of these sums. be a partition of [ ab, ]. Consider the sum f( x) f( x 1)

A BASIS OF THE GROUP OF PRIMITIVE ALMOST PYTHAGOREAN TRIPLES

International Journal of Mathematical Archive-5(8), 2014, Available online through ISSN

X ε ) = 0, or equivalently, lim

Bounds for the Connective Eccentric Index

Can we take the Mysticism Out of the Pearson Coefficient of Linear Correlation?

SPECIAL CONSIDERATIONS FOR VOLUMETRIC Z-TEST FOR PROPORTIONS

A Study on Generalized Generalized Quasi hyperbolic Kac Moody algebra QHGGH of rank 10

Research Article A New Iterative Method for Common Fixed Points of a Finite Family of Nonexpansive Mappings

hp calculators HP 30S Statistics Averages and Standard Deviations Average and Standard Deviation Practice Finding Averages and Standard Deviations

Ideal multigrades with trigonometric coefficients

A study of the sum of three or more consecutive natural numbers

A unified matrix representation for degree reduction of Bézier curves

Lecture 9: Tolerant Testing

Transforms that are commonly used are separable

PTAS for Bin-Packing

Packing of graphs with small product of sizes

Feature Selection: Part 2. 1 Greedy Algorithms (continued from the last lecture)

Investigating Cellular Automata

MA 524 Homework 6 Solutions

THE PROBABILISTIC STABILITY FOR THE GAMMA FUNCTIONAL EQUATION

Journal of Mathematical Analysis and Applications

Third handout: On the Gini Index

PROJECTION PROBLEM FOR REGULAR POLYGONS

Double Dominating Energy of Some Graphs

Summary of the lecture in Biostatistics

Numerical Analysis Formulae Booklet

= lim. (x 1 x 2... x n ) 1 n. = log. x i. = M, n

Lecture 3 Probability review (cont d)

Beam Warming Second-Order Upwind Method

Likewise, properties of the optimal policy for equipment replacement & maintenance problems can be used to reduce the computation.

Design maintenanceand reliability of engineering systems: a probability based approach

Eulerian numbers revisited : Slices of hypercube

CS286.2 Lecture 4: Dinur s Proof of the PCP Theorem

A Markov Chain Competition Model

Entropy ISSN by MDPI

On Submanifolds of an Almost r-paracontact Riemannian Manifold Endowed with a Quarter Symmetric Metric Connection

ON THE DEFINITION OF KAC-MOODY 2-CATEGORY

ON THE LOGARITHMIC INTEGRAL

Log1 Contest Round 2 Theta Complex Numbers. 4 points each. 5 points each

Solving Constrained Flow-Shop Scheduling. Problems with Three Machines

2SLS Estimates ECON In this case, begin with the assumption that E[ i

MA/CSSE 473 Day 27. Dynamic programming

02/15/04 INTERESTING FINITE AND INFINITE PRODUCTS FROM SIMPLE ALGEBRAIC IDENTITIES

Multiple Linear Regression Analysis

such that for 1 From the definition of the k-fibonacci numbers, the firsts of them are presented in Table 1. Table 1: First k-fibonacci numbers F 1

13. Dedekind Domains. 13. Dedekind Domains 117

Transcription:

Nevlle Robbs Mathematcs Departmet, Sa Fracsco State Uversty, Sa Fracsco, CA 943 (Submtted August -Fal Revso December ) INTRODUCTION The Lucas tragle s a fte tragular array of atural umbers that s a varat of Pascal s tragle I ths ote, we prove a property of the Lucas tragle that has bee merely stated by pror researchers; we also preset some apparetly ew propertes of the Lucas tragle PASCAL S TRIANGLE We beg by revewg some propertes of the tragular array of atural umbers ow as Pascal s tragle The th row of Pascal s tragle cossts of etres deoted ( ) where ad are tegers such that ad The frst 8 rows of Pascal s tragle are preseted below left-justfed format: 3 3 4 6 4 5 5 6 5 5 6 7 35 35 7 8 8 56 7 56 8 8 The etres ( ) (usually called choose ) are ow as bomal coeffcets The followg propertes of bomal coeffcets are well-ow: ( ) ( )!!( )! () (symmetry) () (3) (4) ( ) (5) 4

odd (6) eve If, the (7) (P ascal s detty) p s prme f ad oly f (8) ( ) p p such that p I addto, there are dettes that l bomal coeffcets to Fboacc umbers, amely: F ; (9) F ; () F () Note that Pascal s tragle could be geerated ductvely usg oly (3) ad (7) The followg deftos are useful determg the hghest power of a gve prme that dvdes a bomal coeffcet Defto : If p s prme ad the teger m, let o p (m) f s the uque teger such that p m, p m Proposto : If a ad b N, the o p (ab) o p (a) o p (b) Proposto : If a, b, ad a/b N, the o p (a/b) o p (a) o p (b) Defto : If p s a prme ad the m, let the represetato of m to the base p be gve by: m r a p where a p, a r Defto 3: Wth p ad m as Defto, let t p (m) deote the sum of the dgts of m to the base p, that s r t p (m) a 43

Proposto 3: If p s prme ad, the (( )) o p t p() t p ( ) t p () p Proposto 4: If m, the ( ) m s eve for all such that m Proposto 5: If m, the ( ) m s odd for all such that m Remars: Propostos ad follow easly from Defto Proposto 3 follows from 4 Theorem 35, p 54 (See also 4, exercses 3-3, p 55-56) Propostos 4 ad 5 follow from Proposto 3 3 THE LUCAS TRIANGLE The Lucas tragle s a fte tragular array of atural umbers whose th row cossts of etres that we wll deote, where ad The symbol may be defed ductvely as follows: ; () If, the (3) The frst eght rows of the Lucas tragle are preseted below, left-justfed format: 3 4 5 5 9 7 6 4 6 9 7 3 5 8 7 5 55 36 3 9 35 77 5 9 49 5 Note that whereas Pascal s tragle s geerated by the coeffcets of (a b), the Lucas tragle s geerated by the coeffcets the expaso of (a b) (a b) Below, we lst some propertes of the Lucas tragle Note that (3), (9), (), (), () are aalogues of (7), (4), (5), (6), (8) respectvely (4) 44 f ad (5)

eve p (6) (7) ( ) f (8) 3( ) (9) ( ) f () 3( ) f () odd p s prme f ad oly f () p such that p Remars: Idetty (4) follows from (), (3), (3), (7), ad ducto o Each of (5), (6), (7), (8) follow from (4); (9) follows from (5) ad (4), whle () follows from (5) ad (5), as we shall demostrate below Idetty () follows from (9) ad (), whle () s Theorem We ote that (5), (8), ad (9) were stated wthout proof I addto, the followg dettes l to Fboacc ad Lucas umbers: L ; (3) F ; (4) F (5) Note that (3), (4), (5) are aalogues of (9), (), () respectvely 45

4 NEW RESULTS We beg by provg detty (3), whch has bee prevously hted dagrammatcally ad stated wthout proof 3 Just as the sums of rsg dagoals Pascal s tragle yeld the Fboacc umbers, so do the rsg sums of dagoals the Lucas tragle yeld the Lucas umbers Theorem : If, the L Proof: (Iducto o ) We ote that L so the statemet holds for, Now ad L 3, L L L by ducto hypothess Therefore, we have L If m, the we have Now (3) mples If m, the we have L m L m L m m m m ( m m m m m m m m m m ) m m m m m m 46

Now (3) mples L m m ( m m m ) m m m The proofs of dettes (4) ad (5) are smlar, ad are therefore omtted Next, we prove detty () Theorem : ( ) f Proof: Ivog (8) ad (5), we have ( ) ( ) ( ) j ( ( ) ( ) ( ) ( ) j j ( )) The ext theorem cocers rsg dagoals the Lucas tragle ad s somewhat remscet of detty (): Theorem 3: If p s a odd prme, the ( ) p o p { f p f Proof: Idettes (7) ad () mply p p ( ) p p < p p(p )! (!)(p )! Sce p by hypothess, t follows that o p (p(p )!) Now { f p o p ((!)(p )!) o p ((p )!) p f < p 47

The cocluso ow follows from Proposto The followg theorem descrbes a row property ejoyed by odd prmes Theorem 4: If p s a odd prme, the for all j such that j p ad for all such p j that j p, we have p Proof: (Iducto o j) Idettes (7) ad () mply p p ( ) p (p )(p )! (!)(p )! Sce p, t follows that p dvdes the umerator, but ot the deomator of the latter fracto Therefore the theorem holds for j Now (3) mples that p j p j p j By the ducto hypothess, each of the summads of the rght member s dvsble by p Therefore the left member s dvsble by p, so we are doe The fal theorem cocers the party of Lucas tragle etres rows such that the row umber s a power of m Theorem 5: s odd for all such that m 5 Proof: It suffces to voe (8) wth m, ad the mae use of Propostos 4 ad REFERENCES Mar Feberg A Lucas Tragle Fboacc Quart 5 (967): 486-49 H W Gould & W E Greg A Lucas Tragle Prmalty Test Dual to That of Ma- Shas Fboacc Quart 3 (985): 66-69 3 Verer E Hoggatt Jr A Applcato of the Lucas Tragle Fboacc Quart 8 (97): 36-364, 47 4 N Robbs Begg Number Theory (993) Wm C Brow Publshers (Dubuque, IA) AMS Classfcato Numbers: B65, B39 48