ADVANCED PROBLEMS AND SOLUTIONS. Edited by Florian Luca

Similar documents
ADVANCED PROBLEMS AND SOLUTIONS

<aj + ck) m (bj + dk) n. E E (-D m+n - j - k h)(i) j=0 k=0 \ / \ /

1/(1 -x n ) = \YJ k=0

ADVANCED PROBLEMS AND SOLUTIONS

ADVANCED PROBLEMS AND SOLUTIONS PROBLEMS PROPOSED IN THIS ISSUE

ADVANCED PROBLEMS AND SOLUTIONS

ADVANCED PROBLEMS AND SOLUTIONS

ELEMENTARY PROBLEMS AND SOLUTIONS

DIVISIBILITY PROPERTIES OF GENERALIZED FIBONACCI POLYNOMIALS

ADVANCED PROBLEMS AND SOLUTIONS

ELEMENTARY PROBLEMS AND SOLUTIONS

ADVANCED PROBLEMS AND SOLUTIONS

ON MONOTONICITY OF SOME COMBINATORIAL SEQUENCES

*********************************************************

[ 11 ] z of degree 2 as both degree 2 each. The degree of a polynomial in n variables is the maximum of the degrees of its terms.

1 Last time: similar and diagonalizable matrices

ELEMENTARY PROBLEMS AND SOLUTIONS. Edited by Stanley Rabinowitz

On Generalized Fibonacci Numbers

ELEMENTARY PROBLEMS AND SOLUTIONS

ON SOME DIOPHANTINE EQUATIONS RELATED TO SQUARE TRIANGULAR AND BALANCING NUMBERS

SOME TRIBONACCI IDENTITIES

Some p-adic congruences for p q -Catalan numbers

The 4-Nicol Numbers Having Five Different Prime Divisors

ELEMENTARY PROBLEMS AND SOLUTIONS

CERTAIN GENERAL BINOMIAL-FIBONACCI SUMS

a 2 +b 2 +c 2 ab+bc+ca.

Math 4400/6400 Homework #7 solutions

Send all communications regarding Elementary P r o b l e m s and Solutions to P r o f e s s o r A. P. Hillman, Mathematics Department,

ACO Comprehensive Exam 9 October 2007 Student code A. 1. Graph Theory

Different kinds of Mathematical Induction

On the Jacobsthal-Lucas Numbers by Matrix Method 1

TR/46 OCTOBER THE ZEROS OF PARTIAL SUMS OF A MACLAURIN EXPANSION A. TALBOT

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

BINOMIAL PREDICTORS. + 2 j 1. Then n + 1 = The row of the binomial coefficients { ( n

Week 5-6: The Binomial Coefficients

(A sequence also can be thought of as the list of function values attained for a function f :ℵ X, where f (n) = x n for n 1.) x 1 x N +k x N +4 x 3

ON THE LEHMER CONSTANT OF FINITE CYCLIC GROUPS

SOME FIBONACCI AND LUCAS IDENTITIES. L. CARLITZ Dyke University, Durham, North Carolina and H. H. FERNS Victoria, B. C, Canada

A FIBONACCI MATRIX AND THE PERMANENT FUNCTION

x x x Using a second Taylor polynomial with remainder, find the best constant C so that for x 0,

ELEMENTARY PROBLEMS AND SOLUTIONS Edited by A. P. HILLMAN University of New Mexico, Albuquerque, New Mexico

It is often useful to approximate complicated functions using simpler ones. We consider the task of approximating a function by a polynomial.

Bertrand s Postulate

COMPLEX FACTORIZATIONS OF THE GENERALIZED FIBONACCI SEQUENCES {q n } Sang Pyo Jun

Math 155 (Lecture 3)

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

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

Math 2112 Solutions Assignment 5

University of Manitoba, Mathletics 2009

Sequences and Limits

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 3 9/11/2013. Large deviations Theory. Cramér s Theorem

ELEMENTARY PROBLEMS AND SOLUTIONS

SOME DOUBLE BINOMIAL SUMS RELATED WITH THE FIBONACCI, PELL AND GENERALIZED ORDER-k FIBONACCI NUMBERS

Fibonacci numbers and orthogonal polynomials

Maximal sets of integers not containing k + 1 pairwise coprimes and having divisors from a specified set of primes

PROBLEM SET 5 SOLUTIONS 126 = , 37 = , 15 = , 7 = 7 1.

k-generalized FIBONACCI NUMBERS CLOSE TO THE FORM 2 a + 3 b + 5 c 1. Introduction

A LIMITED ARITHMETIC ON SIMPLE CONTINUED FRACTIONS - II 1. INTRODUCTION

n=1 a n is the sequence (s n ) n 1 n=1 a n converges to s. We write a n = s, n=1 n=1 a n

On Divisibility concerning Binomial Coefficients

Math 104: Homework 2 solutions

Seunghee Ye Ma 8: Week 5 Oct 28

SOLUTIONS TO EXAM 3. Solution: Note that this defines two convergent geometric series with respective radii r 1 = 2/5 < 1 and r 2 = 1/5 < 1.

CALCULATION OF FIBONACCI VECTORS

COMPUTING SUMS AND THE AVERAGE VALUE OF THE DIVISOR FUNCTION (x 1) + x = n = n.

ELEMENTARY PROBLEMS AND SOLUTIONS

University of Colorado Denver Dept. Math. & Stat. Sciences Applied Analysis Preliminary Exam 13 January 2012, 10:00 am 2:00 pm. Good luck!

arxiv: v1 [math.co] 3 Feb 2013

ON SOME GAUSSIAN PELL AND PELL-LUCAS NUMBERS

(i) ^ ( ^ ) 5 *, <±i) 21- ( ^ I J ^ - l,

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

Exam 2 CMSC 203 Fall 2009 Name SOLUTION KEY Show All Work! 1. (16 points) Circle T if the corresponding statement is True or F if it is False.

SOLVED EXAMPLES

An Asymptotic Expansion for the Number of Permutations with a Certain Number of Inversions

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

Matrix representations of Fibonacci-like sequences

ELEMENTARY PROBLEMS AND SOLUTIONS

Mathematics Extension 1

On a Smarandache problem concerning the prime gaps

FLOOR AND ROOF FUNCTION ANALOGS OF THE BELL NUMBERS. H. W. Gould Department of Mathematics, West Virginia University, Morgantown, WV 26506, USA

The Structure of Z p when p is Prime

A 2nTH ORDER LINEAR DIFFERENCE EQUATION

CHAPTER 1 SEQUENCES AND INFINITE SERIES

Ma 530 Infinite Series I

Pell and Lucas primes

It is always the case that unions, intersections, complements, and set differences are preserved by the inverse image of a function.

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

ELEMENTARY PROBLEMS AND SOLUTIONS Edited by A.P. HILLMAN University of Santa Clara, Santa Clara, California

The log-concavity and log-convexity properties associated to hyperpell and hyperpell-lucas sequences

REVIEW 1, MATH n=1 is convergent. (b) Determine whether a n is convergent.

Regent College Maths Department. Further Pure 1. Proof by Induction

MA131 - Analysis 1. Workbook 9 Series III

PLEASE MARK YOUR ANSWERS WITH AN X, not a circle! 1. (a) (b) (c) (d) (e) 3. (a) (b) (c) (d) (e) 5. (a) (b) (c) (d) (e) 7. (a) (b) (c) (d) (e)

Some identities involving Fibonacci, Lucas polynomials and their applications

MATH 112: HOMEWORK 6 SOLUTIONS. Problem 1: Rudin, Chapter 3, Problem s k < s k < 2 + s k+1

ADVANCED PROBLEMS AND SOLUTIONS

Arkansas Tech University MATH 2924: Calculus II Dr. Marcel B. Finan

Sequence A sequence is a function whose domain of definition is the set of natural numbers.

HOMEWORK #10 SOLUTIONS

GENERATING IDENTITIES FOR FIBONACCI AND LUCAS TRIPLES

Transcription:

Edited by Floria Luca Please sed all commuicatios cocerig ADVANCED PROBLEMS AND SOLU- TIONS to FLORIAN LUCA, IMATE, UNAM, AP. POSTAL 6-3 (XANGARI), CP 58 089, MORELIA, MICHOACAN, MEXICO, or by e-mail at fluca@matmor.uam.mx as files of the type tex, dvi, ps, doc, html, pdf, etc. This departmet especially welcomes problems believed to be ew or extedig old results. Proposers should submit solutios or other iformatio that will assist the editor. To facilitate their cosideratio, all solutios set by regular mail should be submitted o separate siged sheets withi two moths after publicatio of the problems. PROBLEMS PROPOSED IN THIS ISSUE H-635 Proposed by Jayatibhai M. Patel, Ahmedabad, Idia For ay positive iteger, prove that F F + F +2 F +2 F F + F + F +2 F = 2(F 3 + F+), 3 ad that the same holds with the Fiboacci umbers replaced by the correspodig Lucas umbers. H-636 Proposed by Charles K. Coo, Sumter, SC Evaluate the determiat of the matrix F 2 + L 2 P 2 R 2 2(L P F R ) 2(F P + L R ) 2(F R + L P ) F 2 L 2 + P 2 R 2 2(P R F L ) 2(L R F P ) 2(F L + P R ) F 2 L 2 P 2 + R 2 where F, L, P ad R are the Fiboacci, Lucas, Pell ad Pell-Lucas umbers, respectively. H-637 Proposed by Ovidiu Furdui, Kalamazoo, MI Prove that 2 + F 2 2 F 2 2 +, 2 + ad 2 F2+ 2 + 2 + 2 F2+2 2 + are the sides of a triagle whose circumradius is /2 for all 0. 9

H-638 Proposed by José Luis Díaz-Barrero, Barceloa, Spai Let be a positive iteger. Prove that 4 + 2 F + log ( + F + /F ) < F + + 3F +2. SOLUTIONS A idetity for Lucas polyomials H-62 Proposed by Mario Catalai, Torio, Italy (Vol. 43, o., February 2005) Let L (x, y) be the bivariate Lucas polyomials, defied by L (x, y) = xl (x, y) + yl 2 (x, y), L 0 (x, y) = 2, L (x, y) = x. Assume x 2 + 4y 0. Prove the followig idetity ( ) + ( y) x (+) L + (x, y) = x. Solutio by the proposer Cosider the polyomials L (, y). The roots of the characteristic equatio, α α(, y) ad β β(, y), are such that α + β =, αβ = y. Idetity.78 i [2] says that ( ) + [( x) + x + x + ( x) ] =. I the left had side, write x = α to get ( ) + (β + α + α + β ) = ( ) + ( y) L + (, y). () I [], it is proved that L (x, y) = (iγ) L (iγx, γ 2 y), where i 2 = ad γ is a complex umber. Tae γ = ix. The L (x, y) = x L (, y x 2 ), 92

that is L (x, y) = x L (, y ) x 2. (2) I the right had side of formula () replace y by y/x 2 ad the use formula (2) to get ( ) + ( y ) x (+ ) x 2 L + (x, y) =, which reduces easily to the desired idetity. [] M. Catalai. Geeralized Bivariate Fiboacci Polyomials, http://frot.math.ucdavis.edu/math.co/02366. [2] H. W. Gould. Combiatorial Idetities, Morgatow, W. Va., 972. Also solved by Paul S. Brucma ad G. C. Greubel. Lucas Sequeces ad Sophie Germai Primes H-622 Proposed by Lawrece Somer, The Catholic Uiversity of America, Washigto, DC (Vol. 43, o. 2, May 2005) Let u(a, b) be the Lucas sequece defied by u 0 = 0, u = ad u +2 = au + bu ad havig discrimiat D(a, b) = a 2 4b, where a ad b are itegers. Let ω() deote the umber of distict prime divisors of. Let c > be a fixed positive iteger. Show that there exist 2 ω(c) distict Lucas sequeces u(a, c 2 ) such that 2p + u p (a, c 2 ) for every Sophie Germai prime p such that 2p + D(a, c 2 ), where (a, c) = ad ad(a, c 2 ) 0. Recall that p is a Sophie Germai prime if both p ad 2p + are primes. Combied solutio by the proposer ad the editor It follows, by the Biet formula, that u ( a, c 2 ) = ( ) + u (a, c 2 ). Thus, we ca assume without loss of geerality that a > 0. It suffices to fid 2 ω(c) positive itegers a coprime to c such that 2p + u p (a, c 2 ) for all Sophie Germai primes p such that 2p + cd(a, c 2 ). By a theorem of D. H. Lehmer (see [, pg. 44]), if u(a, b) is a Lucas sequece ad q is a odd prime such that q D ad (b/q) =, the q u (q (D/q))/2, where (b/q) ad (D/q) are Legedre symbols. Thus, if D(a, c 2 ) = a 2 4c 2 is equal to a ozero square m 2, the 2p + u p (a, c 2 ) for all Sophie Germai primes p such that 2p + cd(a, c 2 ). Cosequetly, it suffices to show that there exist 2 ω(c) positive itegers a coprime to c such that for some positive iteger m. a 2 4c 2 = a 2 (2c) 2 = m 2 () 93

Rewritig () as (a m)(a + m) = (2c) 2 = 4c 2, ad recallig that m ad c are coprime, we see that if we write α for the exact order at which 2 divides 4c 2, the there exist two coprime odd divisors d ad d 2 of c 2 whose product is c 2 /2 α 2 such that a m = 2 α d ad a + m = 2d 2. Note that α is eve ad that c = 2 α/2 c, where c is odd. It is clear that there are precisely 2 ω(c ) possibilities for a odd divisor d of c 2 such that c 2 /d = d 2 is coprime to d. Further, for each such divisor d, we ca put a m = mi{2 α d, 2d 2 } ad a + m = max{2 α d, d 2 }, whose solutio is a = 2 α 2 d + d 2 ad m = 2 α 2 d d 2. Note that we do have m > 0 sice m = 0 implies α = 2, d = d 2 =, therefore c =, which is ot allowed. We ow ote that half of the values of a obtaied i this way are distict for distict divisors d of c if c is odd, ad all of them are distict if c is eve. Ideed, if two such a s are equal, the by () ad the fact that m > 0, we get that the correspodig m s are also equal. Thus, the pair of umbers a m ad a + m are the same. Whe c is odd the d is oe of (a m)/2 ad (a + m)/2. Whe c is eve, the exactly oe of a m ad a + m is a multiple of 2 α ad d is the correspodig cofactor. Sice ω(c ) = ω(c) if c is eve ad ω(c ) = ω(c) if c > is odd, the required coclusio ow follows. [] D. H. Lehmer. A Exteded Theory of Lucas Fuctios, A. of Math. 3 (930) : 49 448. Also solved by Paul S. Brucma. A Large Product H-623 Proposed by José Luis Díaz-Barrero, Barceloa, Spai (Vol. 43, o. 2, May 2005) Let be a positive iteger. Prove that 2 (2 ) F 2 ( F2 F 2 ) F2 F2. Solutio by H.-J. Seiffert, Berli, Germay It is ow (see equatio (3.32) i []), that F F + F F +2 = ( ) +. Also, we have that F F +2 = (F + F )(F + + F ) = F+ 2 F 2. Now, it is easily verified that F 2 = (( + )F F + )F + (F F )F + ( ). Summig over =, 2,..., 2, ad otig the telescopig o the right had side gives 2 F 2 = (2F 2 F 2 )F 2. () 94

From equatio (I 3 ) i Hoggatt s list, we ow that S := 2 F 2 = F 2 F 2. (2) Subtractig () from the 2-times (2) yields T := (2 )F 2 = F2. 2 (3) 2 The atural logarithm l is cocave o the iterval (0, + ). Hece, by Jese s iequality, 2 F 2 l(2 ) S l(t /S ). Usig (2) ad (3), after simplifyig ad upo expoetiatio, oe obtais the desired iequality. [] A. F. Horadam & Bro. J. M. Maho. Pell ad Pell-Lucas Polyomials, The Fiboacci Quarterly 23. (985) : 7 20. Also solved by Said Amghibech, Paul S. Brucma, Ovidiu Furdui ad the proposer. Limits of Itegrals H-624 Proposed by Ovidiu Furdui, Wester Michiga Uiversity, Kalamazoo, MI (Vol. 43, o. 2, May 2005) Prove that + t F + t F lim 0 + t L dt = ad lim + t L dt = 0. Solutio by Said Amghibech, St. Foy, Caada For t [0, ], we have + tf + t L + tf ; 95

thus, 0 + t F + t L dt 0 ( + t F )dt = + + F, so + t F lim 0 + t L dt =. For t [, ], we have 0 + tf + t L t L + t L F. Thus, 0 + t F + t L dt ( t L + t L F ) dt = L + L F, which gives + t F lim + t L dt = 0 Also solved by Paul S. Brucma, H.-J. Seiffert ad the proposer. Correctio: I H-663 (volume 43.4) the A + B = C should have bee A = B + C. 96