Remarks on the Properties of a Quasi-Fibonacci-like Polynomial Sequence
|
|
- Stanley Griffith
- 6 years ago
- Views:
Transcription
1 Remarks on the Propertes of a Quas-Fbonacc-lke Polynomal Sequence Brce Merwne LIU Brooklyn Ilan Wenschelbaum Wesleyan Unversty Abstract Consder the Quas-Fbonacc-lke Polynomal Sequence gven by F 0 = 1, F 1 = x 1 and for n 2, F n = F n 1 + x 2 F n 2. Denote the maxmum root of F n by g n. In ths artcle, we wll analyze the exstence and nonexstence of g n as well as study the behavor of the sequence {g n }. We wll prove all but one of the roots are rratonal and the sequence of the maxmum odd-ndexed roots are monotoncally ncreasng. 1 Introducton Consder the well-studed Fbonacc Polynomal Sequence, F n = xf n 1 + F n 2, for n 2 wth F 0 = 0, F 1 = 1. Many results are known about ths polynomal sequence. It s known that F n (1 s the n th Fbonacc number. Hogatt and Bcknell [HB also gave an explct form for the zeros of these polynomals. Further work ncludes Molna and Zeleke [MZ generalzng of the ntal condtons and explorng the recurson, F n = x k F n 1 + F n 2, now known as the Fbonacc-lke polynomals. They made a number of dscoveres about the asymptotc behavor of the roots of these polynomals. Ths nspred further work by Brandon Alberts n Alberts studed the Quas- Fbonacc polynomals. These are polynomals defned by the followng recurson: F q n = F q n 1 + x k F q n 2, for n 2 wth F q 0 = 1, F q 1 = x 1, where k = 1. He found a number of nterestng results ncludng the exstence of all roots and convergence of all roots to the same value, namely 2. He found that the roots of the even-ndexed polynomals converged from below and the roots of the odd-ndexed polynomals converged from above. In ths paper, we study a modfed recurson, a Quas-Fbonacc-Lke polynomal sequence, where k = 2. Specfcally, ths recurson s as follows: F q n = F q n 1 + x 2 F q n 2, for n 2 wth F q 0 = 1, F q 1 = x 1. 1
2 We wll explore the exstence and nonexstence of the roots, as well as ther behavor as a sequence. We wll also numercally and computatonally examne the asymptotc behavor of these roots n addton to showng all but one root are rratonal. We denote the maxmum root of F q n as g n, and for the sake of smplcty, we suppress the q superscrpt for the rest of ths paper. 2 Formulas and techncal results The formulas we wll use throughout ths paper are as follows: Lemma 1. F n (x = F 2n (x = [ n F 2n+1 (x = [( n 1 ( 2n x 2 n [( 2n x 2+1 ( n + [ n 1 x 2+1 ( 2n+1 x 2 (1 ( 2n 1 x 2+1 F n (x = (x 1 + λ λ n + (x 1 + λ + λ n λ + λ, where λ ± = 1 ± Remark. Formula (4 s known at the Bnet Form. 1 [( 0 = ( (2 x 2 ( x 2. (4 2 F n (x = (1 + 2x 2 F n 2 (x x 4 F n 4 (x (5 Proof. Formula (1 We proceed by nducton. We begn by showng the base cases. Case 1: n = 1 [( ( ( 1 + (x 1 x 2 Case 2: n = 2 ( 0 (x 1 0 x 0 + = [0 ( (x = x 1 = F 1 (x [( [( 1 = ( ( 1 + ( 2 1 ( 1 (x 1 0 [( 1 ( (x 1 x 0 + x 2 [( 0 ( ( 1 (x 1 x ( 0 (x 1 x = [0 ( (x [1 ( (x 1x = x 2 + x 1 = F 2 (x 2
3 We now show the nductve step. Suppose ths dentty holds for all n < m. Then F m (x = F m 1 (x + x 2 F m 2 (x [( m 2 = ( [( m 3 + x 2 1 [( m 2 = ( [( m j 2 + j 2 j=1 Rendexng and combnng terms we have F m (x = = [ [(m 2 1 [( m ( m 2 2 ( 1 + ( m 1 ( m 2 (x 1 ( m 3 ( 1 + ( m 2 ( m j 2 ( 1 + (x 1 j 1 ( 1 + [( m 2 (x 1 x 2 gvng Formula (1. Formulas (2 and (3 follow drectly from Formula (1. x 2 (x 1 x 2 (x 1 + ( m 2 1 x 2 x 2j. (x 1 Formula (4: Ths s the Bnet Form for ths recurson. We proceed by usng the standard method of obtanng a Bnet Formula. We establsh the followng system of equatons: { c 1 λ c 2 λ 0 = F 0 (x c 1 λ + + c 2 λ = F 1 (x where λ + and λ are the solutons to the equaton λ 2 = λ + x 2. From ths quadratc equaton, we fnd λ + and λ to be as n Formula (4. Solvng the system above, we fnd c 1 = x 1 + λ λ + λ and c 2 = (x 1 + λ + λ + λ. Formula (5: Ths follows from drect manpulaton of the recurson. Indeed we have x 2 F n (x = F n 1 (x + x 2 F n 2 (x = (1 + 2x 2 F n 2 x 2 F n 2 + x 2 F n 3 = (1 + 2x 2 F n 2 x 4 F n 4. Lemma 2. For all x < 0, we have 0 > F n (x > F n+1 (x for all n. 3
4 Proof. When x < 0, F 1 (x = x 1 < 1 = F 0 (x < 0. Furthermore, supposng ths statement holds up to F n 1, we see that snce F n 2 (x < 0, F n (x = F n 1 (x + x 2 F n 2 (x < F n 1 (x. Lemma 3. F n (0 = 1 for all n. Proof. F n (0 wll be the constant term of F n ; accordng to our Formula (1, ths wll be ( n 0 0 = 1 Lemma 4. lm x F 2n+1 (x = for all n. Proof. Frst we show ths s satsfed for ntal values of n. Proceedng by nducton we have the base cases lm F 1 = lm x 1 = x x lm F 3 = lm x 3 2x 2 + x 1 =. x x Suppose we ve shown ths for F 1, F 3,..., F 2n 1. By usng Formula (3, we have lm F 2n+1(x = lm x x n and [ ( 2n ( 1 + 2n (x 1 x 2. Snce the end behavor of a polynomal s determned by the sgn of the coeffcent on the hghest degree, t s suffcent to show that ths coeffcent s postve. Note that ( 2n = 0 when 2n >. However the leadng coeffcent must be nonzero, so 2n. Ths mples n. Examnng the term wth the hghest degree, we see [ ( ( 2n (n 2n (n + (x 1 (n 1 n [ ( ( n n = + (x 1 x 2n n 1 n [ ( n = + x 1 x 2n n 1 ( n = x 2n + x 2n+1 x 2n. n 1 x 2(n Thus the coeffcent of the term wth hghest degree, namely x 2n+1, s postve and therefore lm x F 2n+1 =. Lemma 5. lm x F 2n (x =, for all n. Proof. Lemma 5 can be proven usng smlar methods to Lemma 4. 4
5 3 Exstence and nonexstence of the roots Lemma 6. For any x and any n 1, 0 > F 2n (x F 2n+2 (x. In partcular, F 2n (x has no real roots. Proof. When x 0, ths statement follows drectly from Lemmas 2 and 3. So let x > 0. We now proceed by nducton, startng wth the base cases. Notce that F 2 (x = x 2 + x 1 < 0 and F 2 (x F 4 (x = x 4 2x 3 + 2x 2 = x 2 ((x > 0, so 0 > F 2 (x > F 4 (x for all real values of x. We now show the nductve step. Suppose now that we have shown ths property through F 2n 2. Case 1: x 2. Then From Formula 5, we have 2x 2 F 2n 2 (x x 4 F 2n 2 (x x 4 F 2n 4 (x. F 2n (x = (1 + 2x 2 F 2n 2 (x x 4 F 2n 4 (x F 2n 2 (x. Case 2: x > 2 > 0. Recall c 1 = x 1 + λ λ + λ and c 2 = (x 1 + λ + λ + λ. 0 < x 0 > 4x 4x 2 4x + 1 < 1 + 4x 2 (2x 1 2 < 1 + 4x 2 Takng the prmary root of both sdes provdes, (2x x 2 < 0 c 1 < 0. A smlar proof shows c 2 < 0. Now we wll show 1 λ + x 2 < 0. 2 < x 0 < x < 4x 4 8x x 2 < 4x 4 4x Takng the prmary root of both sdes provdes A smlar proof shows 1 λ x 2 < x x 2 < 0 1 λ + x 2 < 0. 5
6 Snce c 1, c 2, (1 λ + x 2, and (1 λ x 2 are all negatve, from Formula 4 gvng the Bnet form of F n, we have F 2n 2 F 2n = c 1 λ+ 2n 2 + c 2 λ 2n 2 c 1 λ 2n + c 2 λ 2n = c 1 λ+ 2n 2 (1 λ + x 2 + c 2 λ 2n 2 (1 λ x 2 > 0 Thus F 2n 2 > F 2n so that for all x, F 2n (x s negatve and therefore has no real roots. Lemma 7. F 2n+1 has at least one real root. Proof. Notce that the leadng coeffcent of F 2n+1 s postve and F 2n+1 (0 = 1. By the ntermedate value theorem, F 2n+1 has at least one real root. 4 Man Results For the remander of ths paper, let g n denote the maxmum real root of F n. Theorem 1. 1 = g 1 < g 3 < < g 2n+1 for all n. Proof. We proceed by nducton. Startng wth the base cases drect computaton shows 1 = g 1 < g 3. We now show the nducton step. Suppose we have shown ths through g 2n 1. Then snce g 2n 3 s a maxmum root and lm x F 2n 3 (x = +, we note that F 2n 3 (g 2n 1 > 0. So F 2n+1 (g 2n 1 = (1 + 2g 2 2n 1 F 2n 1 (g 2n 1 g 4 2n 1 F 2n 3 (g 2n 1 = g 4 2n 1 F 2n 3 (g 2n 1 < 0. Thus, snce lm x F 2n+1 (x = +, F 2n+1 must have a root g 2n+1 > g 2n 1. Theorem 2. The roots of F 2n+1 are rratonal for n > 0. Proof. If there s some ratonal number r whch s a root of F 2n+1 then, by the Ratonal Root Theorem and Formula 3, [ ( ( 2n n 2n n + n 1 n r = ± [ ( ( 2n 2n = ±( n + 1. Case 1: r = n + 1. By Theorem 1, g 2n+1 > 1. However for all n, we have r 1. So n + 1 cannot be a root. 6
7 Case 2: r = n 1. We have shown ths cannot be a root for n < 62 by drect computaton. Through manpulaton of Formula (3 we have n+1 [ ( ( 2n 2n F 2n+1 (x = + (x 1 x 2. 1 When substtutng r nto the expresson above for x, t s easy to show that only the coeffcent of the last term s negatve. It s gven by ( 2(n 1 2n. Fndng the rato between the orgnal bnomal coeffcents provdes, ( ( 2n 2n = 1 2n Snce the last term s the only negatve term, t s suffcent to show that the thrd to last term s larger. Usng = n 2 wth n 62 gves, ( ( ( ( n + 2 n + 1 n 4n n 1 n 1 n ( ( (n 2(n + 1(n(n 1 4n (n ( ( 2n (n 2 (n 2 n 2 2n 2(n n 2 (n 1 2(n 2 2(n 1 2n where the left hand sde s the thrd to last term n the above summaton. Therefore, g 2n+1 s rratonal for all n > 0. 5 Numercal evdence Our research has also suggested certan other results. One such possblty s that the oddndexed polynomals, F 2n+1, have exactly one real root. As the followng graph shows, the frst few odd-ndexed polynomals have exactly one real root. 7
8 Thus we have constructed the followng lemma and conjecture. Lemma 8. F 2n+1 has no real roots on (, g 2n 1 (g 2n+1,. Proof. Ths s obvous for F 1 (x = x 1. Suppose we have shown t through F 2n 1. When x > g 2n+1, ths follows drectly from maxmalty of g 2n+1. Therefore, let x g 2n 1. Recall that F 2n (x < 0 and note that F 2n 1 (x 0. Then F 2n+1 (x = F 2n (x + x 2 F 2n 1 (x < 0 The prevous lemma does not exclude the possblty of a root exstng on the nterval (g 2n 1, g 2n+1, provdng the followng conjecture formed through observaton. Conjecture 1. F 2n+1 has no real roots on (g 2n 1, g 2n+1. Ths has been confrmed by drect calculaton through F 599, meanng all of these polynomals have exactly one real root. It s our hope that future work may be able to formally prove ths for all odd-ndexed F n. Our work has also led us to beleve the followng conjecture: Conjecture 2. The sequence {g 2n+1 } s unbounded. The roots do not appear to asymptotcally approach any number through g 599, selected roots are shown below. 8
9 n g n Graphcally, we can also see that they do not appear to asymptotcally approach any number. After multple regresson analyses, we can say that t appears to grow slghtly faster than logarthmcally. 6 Acknowledgements We would lke to thank Mchgan State Unversty and the Lyman Brggs College for ther support of our REU, as well as our faculty mentor, Dr. Akllu Zeleke. We would also lke to thank hs graduate assstants, Justn Droba, Ran Satyam and Rchard Shadrach. Project sponsored by the Natonal Securty Agency under Grant Number H Project sponsored by the Natonal Scence Foundaton under Grant Number DMS Specal thanks to Danel Thompson. 9
10 7 References Brandon Alberts, On the Propertes of a Quas-Fbonacc Polynomal Sequence, preprnt, SURIEM 2011 V. E. Hoggatt, Jr. and Marjore Bcknell, Roots of Fbonacc polynomals, Fbonacc Quart., 11(3: , Robert Molna and Akllu Zeleke, Generalzng results on the convergence of the maxmum roots of Fbonacc type polynomals, In Proceedngs of the Forteth Southeastern Internatonal Conference on Combnatorcs, Graph Theory and Computng, volume 195, pages ,
arxiv: v1 [math.co] 12 Sep 2014
arxv:1409.3707v1 [math.co] 12 Sep 2014 On the bnomal sums of Horadam sequence Nazmye Ylmaz and Necat Taskara Department of Mathematcs, Scence Faculty, Selcuk Unversty, 42075, Campus, Konya, Turkey March
More informationBinomial transforms of the modified k-fibonacci-like sequence
Internatonal Journal of Mathematcs and Computer Scence, 14(2019, no. 1, 47 59 M CS Bnomal transforms of the modfed k-fbonacc-lke sequence Youngwoo Kwon Department of mathematcs Korea Unversty Seoul, Republc
More informationMA 323 Geometric Modelling Course Notes: Day 13 Bezier Curves & Bernstein Polynomials
MA 323 Geometrc Modellng Course Notes: Day 13 Bezer Curves & Bernsten Polynomals Davd L. Fnn Over the past few days, we have looked at de Casteljau s algorthm for generatng a polynomal curve, and we have
More informationTHE CHINESE REMAINDER THEOREM. We should thank the Chinese for their wonderful remainder theorem. Glenn Stevens
THE CHINESE REMAINDER THEOREM KEITH CONRAD We should thank the Chnese for ther wonderful remander theorem. Glenn Stevens 1. Introducton The Chnese remander theorem says we can unquely solve any par of
More informationAnti-van der Waerden numbers of 3-term arithmetic progressions.
Ant-van der Waerden numbers of 3-term arthmetc progressons. Zhanar Berkkyzy, Alex Schulte, and Mchael Young Aprl 24, 2016 Abstract The ant-van der Waerden number, denoted by aw([n], k), s the smallest
More informationBezier curves. Michael S. Floater. August 25, These notes provide an introduction to Bezier curves. i=0
Bezer curves Mchael S. Floater August 25, 211 These notes provde an ntroducton to Bezer curves. 1 Bernsten polynomals Recall that a real polynomal of a real varable x R, wth degree n, s a functon of the
More informationDifference Equations
Dfference Equatons c Jan Vrbk 1 Bascs Suppose a sequence of numbers, say a 0,a 1,a,a 3,... s defned by a certan general relatonshp between, say, three consecutve values of the sequence, e.g. a + +3a +1
More informationBézier curves. Michael S. Floater. September 10, These notes provide an introduction to Bézier curves. i=0
Bézer curves Mchael S. Floater September 1, 215 These notes provde an ntroducton to Bézer curves. 1 Bernsten polynomals Recall that a real polynomal of a real varable x R, wth degree n, s a functon of
More informationFoundations of Arithmetic
Foundatons of Arthmetc Notaton We shall denote the sum and product of numbers n the usual notaton as a 2 + a 2 + a 3 + + a = a, a 1 a 2 a 3 a = a The notaton a b means a dvdes b,.e. ac = b where c s an
More informationarxiv: v1 [math.ho] 18 May 2008
Recurrence Formulas for Fbonacc Sums Adlson J. V. Brandão, João L. Martns 2 arxv:0805.2707v [math.ho] 8 May 2008 Abstract. In ths artcle we present a new recurrence formula for a fnte sum nvolvng the Fbonacc
More informationA new Approach for Solving Linear Ordinary Differential Equations
, ISSN 974-57X (Onlne), ISSN 974-5718 (Prnt), Vol. ; Issue No. 1; Year 14, Copyrght 13-14 by CESER PUBLICATIONS A new Approach for Solvng Lnear Ordnary Dfferental Equatons Fawz Abdelwahd Department of
More informationDeterminants Containing Powers of Generalized Fibonacci Numbers
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol 19 (2016), Artcle 1671 Determnants Contanng Powers of Generalzed Fbonacc Numbers Aram Tangboonduangjt and Thotsaporn Thanatpanonda Mahdol Unversty Internatonal
More informationLECTURE 9 CANONICAL CORRELATION ANALYSIS
LECURE 9 CANONICAL CORRELAION ANALYSIS Introducton he concept of canoncal correlaton arses when we want to quantfy the assocatons between two sets of varables. For example, suppose that the frst set of
More informationChristian Aebi Collège Calvin, Geneva, Switzerland
#A7 INTEGERS 12 (2012) A PROPERTY OF TWIN PRIMES Chrstan Aeb Collège Calvn, Geneva, Swtzerland chrstan.aeb@edu.ge.ch Grant Carns Department of Mathematcs, La Trobe Unversty, Melbourne, Australa G.Carns@latrobe.edu.au
More informationand problem sheet 2
-8 and 5-5 problem sheet Solutons to the followng seven exercses and optonal bonus problem are to be submtted through gradescope by :0PM on Wednesday th September 08. There are also some practce problems,
More information1 Matrix representations of canonical matrices
1 Matrx representatons of canoncal matrces 2-d rotaton around the orgn: ( ) cos θ sn θ R 0 = sn θ cos θ 3-d rotaton around the x-axs: R x = 1 0 0 0 cos θ sn θ 0 sn θ cos θ 3-d rotaton around the y-axs:
More informationThe Jacobsthal and Jacobsthal-Lucas Numbers via Square Roots of Matrices
Internatonal Mathematcal Forum, Vol 11, 2016, no 11, 513-520 HIKARI Ltd, wwwm-hkarcom http://dxdoorg/1012988/mf20166442 The Jacobsthal and Jacobsthal-Lucas Numbers va Square Roots of Matrces Saadet Arslan
More informationSection 8.3 Polar Form of Complex Numbers
80 Chapter 8 Secton 8 Polar Form of Complex Numbers From prevous classes, you may have encountered magnary numbers the square roots of negatve numbers and, more generally, complex numbers whch are the
More informationA combinatorial problem associated with nonograms
A combnatoral problem assocated wth nonograms Jessca Benton Ron Snow Nolan Wallach March 21, 2005 1 Introducton. Ths work was motvated by a queston posed by the second named author to the frst named author
More informationREGULAR POSITIVE TERNARY QUADRATIC FORMS. 1. Introduction
REGULAR POSITIVE TERNARY QUADRATIC FORMS BYEONG-KWEON OH Abstract. A postve defnte quadratc form f s sad to be regular f t globally represents all ntegers that are represented by the genus of f. In 997
More informationLectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix
Lectures - Week 4 Matrx norms, Condtonng, Vector Spaces, Lnear Independence, Spannng sets and Bass, Null space and Range of a Matrx Matrx Norms Now we turn to assocatng a number to each matrx. We could
More informationFor now, let us focus on a specific model of neurons. These are simplified from reality but can achieve remarkable results.
Neural Networks : Dervaton compled by Alvn Wan from Professor Jtendra Malk s lecture Ths type of computaton s called deep learnng and s the most popular method for many problems, such as computer vson
More informationBallot Paths Avoiding Depth Zero Patterns
Ballot Paths Avodng Depth Zero Patterns Henrch Nederhausen and Shaun Sullvan Florda Atlantc Unversty, Boca Raton, Florda nederha@fauedu, ssull21@fauedu 1 Introducton In a paper by Sapounaks, Tasoulas,
More informationChapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems
Numercal Analyss by Dr. Anta Pal Assstant Professor Department of Mathematcs Natonal Insttute of Technology Durgapur Durgapur-713209 emal: anta.bue@gmal.com 1 . Chapter 5 Soluton of System of Lnear Equatons
More informationComplex Numbers. x = B B 2 4AC 2A. or x = x = 2 ± 4 4 (1) (5) 2 (1)
Complex Numbers If you have not yet encountered complex numbers, you wll soon do so n the process of solvng quadratc equatons. The general quadratc equaton Ax + Bx + C 0 has solutons x B + B 4AC A For
More informationAn (almost) unbiased estimator for the S-Gini index
An (almost unbased estmator for the S-Gn ndex Thomas Demuynck February 25, 2009 Abstract Ths note provdes an unbased estmator for the absolute S-Gn and an almost unbased estmator for the relatve S-Gn for
More informationBernoulli Numbers and Polynomials
Bernoull Numbers and Polynomals T. Muthukumar tmk@tk.ac.n 17 Jun 2014 The sum of frst n natural numbers 1, 2, 3,..., n s n n(n + 1 S 1 (n := m = = n2 2 2 + n 2. Ths formula can be derved by notng that
More informationMore metrics on cartesian products
More metrcs on cartesan products If (X, d ) are metrc spaces for 1 n, then n Secton II4 of the lecture notes we defned three metrcs on X whose underlyng topologes are the product topology The purpose of
More informationThe Number of Ways to Write n as a Sum of ` Regular Figurate Numbers
Syracuse Unversty SURFACE Syracuse Unversty Honors Program Capstone Projects Syracuse Unversty Honors Program Capstone Projects Sprng 5-1-01 The Number of Ways to Wrte n as a Sum of ` Regular Fgurate Numbers
More informationAppendix for Causal Interaction in Factorial Experiments: Application to Conjoint Analysis
A Appendx for Causal Interacton n Factoral Experments: Applcaton to Conjont Analyss Mathematcal Appendx: Proofs of Theorems A. Lemmas Below, we descrbe all the lemmas, whch are used to prove the man theorems
More informationCOMBINATORIAL IDENTITIES DERIVING FROM THE n-th POWER OF A 2 2 MATRIX
COMBINATORIAL IDENTITIES DERIVING FROM THE n-th POWER OF A MATRIX J Mc Laughln 1 Mathematcs Department Trnty College 300 Summt Street, Hartford, CT 06106-3100 amesmclaughln@trncolledu Receved:, Accepted:,
More informationThe internal structure of natural numbers and one method for the definition of large prime numbers
The nternal structure of natural numbers and one method for the defnton of large prme numbers Emmanul Manousos APM Insttute for the Advancement of Physcs and Mathematcs 3 Poulou str. 53 Athens Greece Abstract
More informationA summation on Bernoulli numbers
Journal of Number Theory 111 (005 37 391 www.elsever.com/locate/jnt A summaton on Bernoull numbers Kwang-Wu Chen Department of Mathematcs and Computer Scence Educaton, Tape Muncpal Teachers College, No.
More informationA FORMULA FOR COMPUTING INTEGER POWERS FOR ONE TYPE OF TRIDIAGONAL MATRIX
Hacettepe Journal of Mathematcs and Statstcs Volume 393 0 35 33 FORMUL FOR COMPUTING INTEGER POWERS FOR ONE TYPE OF TRIDIGONL MTRIX H Kıyak I Gürses F Yılmaz and D Bozkurt Receved :08 :009 : ccepted 5
More information1 GSW Iterative Techniques for y = Ax
1 for y = A I m gong to cheat here. here are a lot of teratve technques that can be used to solve the general case of a set of smultaneous equatons (wrtten n the matr form as y = A), but ths chapter sn
More informationRestricted divisor sums
ACTA ARITHMETICA 02 2002) Restrcted dvsor sums by Kevn A Broughan Hamlton) Introducton There s a body of work n the lterature on varous restrcted sums of the number of dvsors of an nteger functon ncludng
More informationMaximizing the number of nonnegative subsets
Maxmzng the number of nonnegatve subsets Noga Alon Hao Huang December 1, 213 Abstract Gven a set of n real numbers, f the sum of elements of every subset of sze larger than k s negatve, what s the maxmum
More informationThe Two-scale Finite Element Errors Analysis for One Class of Thermoelastic Problem in Periodic Composites
7 Asa-Pacfc Engneerng Technology Conference (APETC 7) ISBN: 978--6595-443- The Two-scale Fnte Element Errors Analyss for One Class of Thermoelastc Problem n Perodc Compostes Xaoun Deng Mngxang Deng ABSTRACT
More informationThe Order Relation and Trace Inequalities for. Hermitian Operators
Internatonal Mathematcal Forum, Vol 3, 08, no, 507-57 HIKARI Ltd, wwwm-hkarcom https://doorg/0988/mf088055 The Order Relaton and Trace Inequaltes for Hermtan Operators Y Huang School of Informaton Scence
More information1 Generating functions, continued
Generatng functons, contnued. Exponental generatng functons and set-parttons At ths pont, we ve come up wth good generatng-functon dscussons based on 3 of the 4 rows of our twelvefold way. Wll our nteger-partton
More informationANSWERS. Problem 1. and the moment generating function (mgf) by. defined for any real t. Use this to show that E( U) var( U)
Econ 413 Exam 13 H ANSWERS Settet er nndelt 9 deloppgaver, A,B,C, som alle anbefales å telle lkt for å gøre det ltt lettere å stå. Svar er gtt . Unfortunately, there s a prntng error n the hnt of
More informationCollege of Computer & Information Science Fall 2009 Northeastern University 20 October 2009
College of Computer & Informaton Scence Fall 2009 Northeastern Unversty 20 October 2009 CS7880: Algorthmc Power Tools Scrbe: Jan Wen and Laura Poplawsk Lecture Outlne: Prmal-dual schema Network Desgn:
More informationThe KMO Method for Solving Non-homogenous, m th Order Differential Equations
The KMO Method for Solvng Non-homogenous, m th Order Dfferental Equatons Davd Krohn Danel Marño-Johnson John Paul Ouyang March 14, 2013 Abstract Ths paper shows a smple tabular procedure for fndng the
More informationOn the size of quotient of two subsets of positive integers.
arxv:1706.04101v1 [math.nt] 13 Jun 2017 On the sze of quotent of two subsets of postve ntegers. Yur Shtenkov Abstract We obtan non-trval lower bound for the set A/A, where A s a subset of the nterval [1,
More informationAsymptotics of the Solution of a Boundary Value. Problem for One-Characteristic Differential. Equation Degenerating into a Parabolic Equation
Nonl. Analyss and Dfferental Equatons, ol., 4, no., 5 - HIKARI Ltd, www.m-har.com http://dx.do.org/.988/nade.4.456 Asymptotcs of the Soluton of a Boundary alue Problem for One-Characterstc Dfferental Equaton
More informationLecture 2: Gram-Schmidt Vectors and the LLL Algorithm
NYU, Fall 2016 Lattces Mn Course Lecture 2: Gram-Schmdt Vectors and the LLL Algorthm Lecturer: Noah Stephens-Davdowtz 2.1 The Shortest Vector Problem In our last lecture, we consdered short solutons to
More informationh-analogue of Fibonacci Numbers
h-analogue of Fbonacc Numbers arxv:090.0038v [math-ph 30 Sep 009 H.B. Benaoum Prnce Mohammad Unversty, Al-Khobar 395, Saud Araba Abstract In ths paper, we ntroduce the h-analogue of Fbonacc numbers for
More informationAPPENDIX A Some Linear Algebra
APPENDIX A Some Lnear Algebra The collecton of m, n matrces A.1 Matrces a 1,1,..., a 1,n A = a m,1,..., a m,n wth real elements a,j s denoted by R m,n. If n = 1 then A s called a column vector. Smlarly,
More informationHidden Markov Models
Hdden Markov Models Namrata Vaswan, Iowa State Unversty Aprl 24, 204 Hdden Markov Model Defntons and Examples Defntons:. A hdden Markov model (HMM) refers to a set of hdden states X 0, X,..., X t,...,
More informationMath1110 (Spring 2009) Prelim 3 - Solutions
Math 1110 (Sprng 2009) Solutons to Prelm 3 (04/21/2009) 1 Queston 1. (16 ponts) Short answer. Math1110 (Sprng 2009) Prelm 3 - Solutons x a 1 (a) (4 ponts) Please evaluate lm, where a and b are postve numbers.
More informationFirst day August 1, Problems and Solutions
FOURTH INTERNATIONAL COMPETITION FOR UNIVERSITY STUDENTS IN MATHEMATICS July 30 August 4, 997, Plovdv, BULGARIA Frst day August, 997 Problems and Solutons Problem. Let {ε n } n= be a sequence of postve
More informationBeyond Zudilin s Conjectured q-analog of Schmidt s problem
Beyond Zudln s Conectured q-analog of Schmdt s problem Thotsaporn Ae Thanatpanonda thotsaporn@gmalcom Mathematcs Subect Classfcaton: 11B65 33B99 Abstract Usng the methodology of (rgorous expermental mathematcs
More informationProblem Solving in Math (Math 43900) Fall 2013
Problem Solvng n Math (Math 43900) Fall 2013 Week four (September 17) solutons Instructor: Davd Galvn 1. Let a and b be two nteger for whch a b s dvsble by 3. Prove that a 3 b 3 s dvsble by 9. Soluton:
More informationWeek3, Chapter 4. Position and Displacement. Motion in Two Dimensions. Instantaneous Velocity. Average Velocity
Week3, Chapter 4 Moton n Two Dmensons Lecture Quz A partcle confned to moton along the x axs moves wth constant acceleraton from x =.0 m to x = 8.0 m durng a 1-s tme nterval. The velocty of the partcle
More information= z 20 z n. (k 20) + 4 z k = 4
Problem Set #7 solutons 7.2.. (a Fnd the coeffcent of z k n (z + z 5 + z 6 + z 7 + 5, k 20. We use the known seres expanson ( n+l ( z l l z n below: (z + z 5 + z 6 + z 7 + 5 (z 5 ( + z + z 2 + z + 5 5
More informationUncertainty in measurements of power and energy on power networks
Uncertanty n measurements of power and energy on power networks E. Manov, N. Kolev Department of Measurement and Instrumentaton, Techncal Unversty Sofa, bul. Klment Ohrdsk No8, bl., 000 Sofa, Bulgara Tel./fax:
More informationErrors for Linear Systems
Errors for Lnear Systems When we solve a lnear system Ax b we often do not know A and b exactly, but have only approxmatons  and ˆb avalable. Then the best thng we can do s to solve ˆx ˆb exactly whch
More informationYong Joon Ryang. 1. Introduction Consider the multicommodity transportation problem with convex quadratic cost function. 1 2 (x x0 ) T Q(x x 0 )
Kangweon-Kyungk Math. Jour. 4 1996), No. 1, pp. 7 16 AN ITERATIVE ROW-ACTION METHOD FOR MULTICOMMODITY TRANSPORTATION PROBLEMS Yong Joon Ryang Abstract. The optmzaton problems wth quadratc constrants often
More informationComplex Numbers Alpha, Round 1 Test #123
Complex Numbers Alpha, Round Test #3. Wrte your 6-dgt ID# n the I.D. NUMBER grd, left-justfed, and bubble. Check that each column has only one number darkened.. In the EXAM NO. grd, wrte the 3-dgt Test
More informationLecture 10 Support Vector Machines II
Lecture 10 Support Vector Machnes II 22 February 2016 Taylor B. Arnold Yale Statstcs STAT 365/665 1/28 Notes: Problem 3 s posted and due ths upcomng Frday There was an early bug n the fake-test data; fxed
More informationCanonical transformations
Canoncal transformatons November 23, 2014 Recall that we have defned a symplectc transformaton to be any lnear transformaton M A B leavng the symplectc form nvarant, Ω AB M A CM B DΩ CD Coordnate transformatons,
More informationU.C. Berkeley CS278: Computational Complexity Professor Luca Trevisan 2/21/2008. Notes for Lecture 8
U.C. Berkeley CS278: Computatonal Complexty Handout N8 Professor Luca Trevsan 2/21/2008 Notes for Lecture 8 1 Undrected Connectvty In the undrected s t connectvty problem (abbrevated ST-UCONN) we are gven
More informationRandić Energy and Randić Estrada Index of a Graph
EUROPEAN JOURNAL OF PURE AND APPLIED MATHEMATICS Vol. 5, No., 202, 88-96 ISSN 307-5543 www.ejpam.com SPECIAL ISSUE FOR THE INTERNATIONAL CONFERENCE ON APPLIED ANALYSIS AND ALGEBRA 29 JUNE -02JULY 20, ISTANBUL
More informationSection 3.6 Complex Zeros
04 Chapter Secton 6 Comple Zeros When fndng the zeros of polynomals, at some pont you're faced wth the problem Whle there are clearly no real numbers that are solutons to ths equaton, leavng thngs there
More informationErratum: A Generalized Path Integral Control Approach to Reinforcement Learning
Journal of Machne Learnng Research 00-9 Submtted /0; Publshed 7/ Erratum: A Generalzed Path Integral Control Approach to Renforcement Learnng Evangelos ATheodorou Jonas Buchl Stefan Schaal Department of
More informationOn the correction of the h-index for career length
1 On the correcton of the h-ndex for career length by L. Egghe Unverstet Hasselt (UHasselt), Campus Depenbeek, Agoralaan, B-3590 Depenbeek, Belgum 1 and Unverstet Antwerpen (UA), IBW, Stadscampus, Venusstraat
More informationUnit 5: Quadratic Equations & Functions
Date Perod Unt 5: Quadratc Equatons & Functons DAY TOPIC 1 Modelng Data wth Quadratc Functons Factorng Quadratc Epressons 3 Solvng Quadratc Equatons 4 Comple Numbers Smplfcaton, Addton/Subtracton & Multplcaton
More informationProblem Set 9 Solutions
Desgn and Analyss of Algorthms May 4, 2015 Massachusetts Insttute of Technology 6.046J/18.410J Profs. Erk Demane, Srn Devadas, and Nancy Lynch Problem Set 9 Solutons Problem Set 9 Solutons Ths problem
More informationStructure and Drive Paul A. Jensen Copyright July 20, 2003
Structure and Drve Paul A. Jensen Copyrght July 20, 2003 A system s made up of several operatons wth flow passng between them. The structure of the system descrbes the flow paths from nputs to outputs.
More informationarxiv: v1 [math.co] 1 Mar 2014
Unon-ntersectng set systems Gyula O.H. Katona and Dánel T. Nagy March 4, 014 arxv:1403.0088v1 [math.co] 1 Mar 014 Abstract Three ntersecton theorems are proved. Frst, we determne the sze of the largest
More informationBOUNDEDNESS OF THE RIESZ TRANSFORM WITH MATRIX A 2 WEIGHTS
BOUNDEDNESS OF THE IESZ TANSFOM WITH MATIX A WEIGHTS Introducton Let L = L ( n, be the functon space wth norm (ˆ f L = f(x C dx d < For a d d matrx valued functon W : wth W (x postve sem-defnte for all
More informationEcon107 Applied Econometrics Topic 3: Classical Model (Studenmund, Chapter 4)
I. Classcal Assumptons Econ7 Appled Econometrcs Topc 3: Classcal Model (Studenmund, Chapter 4) We have defned OLS and studed some algebrac propertes of OLS. In ths topc we wll study statstcal propertes
More informationThe Minimum Universal Cost Flow in an Infeasible Flow Network
Journal of Scences, Islamc Republc of Iran 17(2): 175-180 (2006) Unversty of Tehran, ISSN 1016-1104 http://jscencesutacr The Mnmum Unversal Cost Flow n an Infeasble Flow Network H Saleh Fathabad * M Bagheran
More informationZhi-Wei Sun (Nanjing)
Acta Arth. 1262007, no. 4, 387 398. COMBINATORIAL CONGRUENCES AND STIRLING NUMBERS Zh-We Sun Nanng Abstract. In ths paper we obtan some sophstcated combnatoral congruences nvolvng bnomal coeffcents and
More informationOn the Binomial Interpolated Triangles
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 20 (2017), Artcle 17.7.8 On the Bnomal Interpolated Trangles László Németh Insttute of Mathematcs Unversty of Sopron Bajcsy Zs. u. 4 H9400 Sopron Hungary
More informationFundamental loop-current method using virtual voltage sources technique for special cases
Fundamental loop-current method usng vrtual voltage sources technque for specal cases George E. Chatzaraks, 1 Marna D. Tortorel 1 and Anastasos D. Tzolas 1 Electrcal and Electroncs Engneerng Departments,
More informationThe Ramanujan-Nagell Theorem: Understanding the Proof By Spencer De Chenne
The Ramanujan-Nagell Theorem: Understandng the Proof By Spencer De Chenne 1 Introducton The Ramanujan-Nagell Theorem, frst proposed as a conjecture by Srnvasa Ramanujan n 1943 and later proven by Trygve
More informationCharacterizing the properties of specific binomial coefficients in congruence relations
Eastern Mchgan Unversty DgtalCommons@EMU Master's Theses and Doctoral Dssertatons Master's Theses, and Doctoral Dssertatons, and Graduate Capstone Projects 7-15-2015 Characterzng the propertes of specfc
More informationwhere x =(x 1 ;x 2 ;::: ;x n )[12]. The dynamcs of the Ducc map have been examned for specal cases of n n [7,17,27]. In addton, many nterestng results
A CHARACTERIZATION FOR THE LENGTH OF CYCLES OF THE N - NUMBER DUCCI GAME NEIL J. CALKIN DEPARTMENT OF MATHEMATICAL SCIENCES CLEMSON UNIVERSITY CLEMSON, SC 29634-1907 JOHN G. STEVENS AND DIANA M. THOMAS
More informationTHE ARIMOTO-BLAHUT ALGORITHM FOR COMPUTATION OF CHANNEL CAPACITY. William A. Pearlman. References: S. Arimoto - IEEE Trans. Inform. Thy., Jan.
THE ARIMOTO-BLAHUT ALGORITHM FOR COMPUTATION OF CHANNEL CAPACITY Wllam A. Pearlman 2002 References: S. Armoto - IEEE Trans. Inform. Thy., Jan. 1972 R. Blahut - IEEE Trans. Inform. Thy., July 1972 Recall
More informationLimited Dependent Variables
Lmted Dependent Varables. What f the left-hand sde varable s not a contnuous thng spread from mnus nfnty to plus nfnty? That s, gven a model = f (, β, ε, where a. s bounded below at zero, such as wages
More information3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X
Statstcs 1: Probablty Theory II 37 3 EPECTATION OF SEVERAL RANDOM VARIABLES As n Probablty Theory I, the nterest n most stuatons les not on the actual dstrbuton of a random vector, but rather on a number
More informationNumerical Solution of Ordinary Differential Equations
Numercal Methods (CENG 00) CHAPTER-VI Numercal Soluton of Ordnar Dfferental Equatons 6 Introducton Dfferental equatons are equatons composed of an unknown functon and ts dervatves The followng are examples
More informationHyper-Sums of Powers of Integers and the Akiyama-Tanigawa Matrix
6 Journal of Integer Sequences, Vol 8 (00), Artcle 0 Hyper-Sums of Powers of Integers and the Ayama-Tangawa Matrx Yoshnar Inaba Toba Senor Hgh School Nshujo, Mnam-u Kyoto 60-89 Japan nava@yoto-benejp Abstract
More informationCOMPLEX NUMBERS AND QUADRATIC EQUATIONS
COMPLEX NUMBERS AND QUADRATIC EQUATIONS INTRODUCTION We know that x 0 for all x R e the square of a real number (whether postve, negatve or ero) s non-negatve Hence the equatons x, x, x + 7 0 etc are not
More informationAdditional Codes using Finite Difference Method. 1 HJB Equation for Consumption-Saving Problem Without Uncertainty
Addtonal Codes usng Fnte Dfference Method Benamn Moll 1 HJB Equaton for Consumpton-Savng Problem Wthout Uncertanty Before consderng the case wth stochastc ncome n http://www.prnceton.edu/~moll/ HACTproect/HACT_Numercal_Appendx.pdf,
More informationFormulas for the Determinant
page 224 224 CHAPTER 3 Determnants e t te t e 2t 38 A = e t 2te t e 2t e t te t 2e 2t 39 If 123 A = 345, 456 compute the matrx product A adj(a) What can you conclude about det(a)? For Problems 40 43, use
More informationSelf-complementing permutations of k-uniform hypergraphs
Dscrete Mathematcs Theoretcal Computer Scence DMTCS vol. 11:1, 2009, 117 124 Self-complementng permutatons of k-unform hypergraphs Artur Szymańsk A. Paweł Wojda Faculty of Appled Mathematcs, AGH Unversty
More informationBe true to your work, your word, and your friend.
Chemstry 13 NT Be true to your work, your word, and your frend. Henry Davd Thoreau 1 Chem 13 NT Chemcal Equlbrum Module Usng the Equlbrum Constant Interpretng the Equlbrum Constant Predctng the Drecton
More informationExample: (13320, 22140) =? Solution #1: The divisors of are 1, 2, 3, 4, 5, 6, 9, 10, 12, 15, 18, 20, 27, 30, 36, 41,
The greatest common dvsor of two ntegers a and b (not both zero) s the largest nteger whch s a common factor of both a and b. We denote ths number by gcd(a, b), or smply (a, b) when there s no confuson
More informationOutline. Unit Eight Calculations with Entropy. The Second Law. Second Law Notes. Uses of Entropy. Entropy is a Property.
Unt Eght Calculatons wth Entropy Mechancal Engneerng 370 Thermodynamcs Larry Caretto October 6, 010 Outlne Quz Seven Solutons Second law revew Goals for unt eght Usng entropy to calculate the maxmum work
More informationA property of the elementary symmetric functions
Calcolo manuscrpt No. (wll be nserted by the edtor) A property of the elementary symmetrc functons A. Esnberg, G. Fedele Dp. Elettronca Informatca e Sstemstca, Unverstà degl Stud della Calabra, 87036,
More informationP A = (P P + P )A = P (I P T (P P ))A = P (A P T (P P )A) Hence if we let E = P T (P P A), We have that
Backward Error Analyss for House holder Reectors We want to show that multplcaton by householder reectors s backward stable. In partcular we wsh to show fl(p A) = P (A) = P (A + E where P = I 2vv T s the
More informationGeneral viscosity iterative method for a sequence of quasi-nonexpansive mappings
Avalable onlne at www.tjnsa.com J. Nonlnear Sc. Appl. 9 (2016), 5672 5682 Research Artcle General vscosty teratve method for a sequence of quas-nonexpansve mappngs Cuje Zhang, Ynan Wang College of Scence,
More informationOne-sided finite-difference approximations suitable for use with Richardson extrapolation
Journal of Computatonal Physcs 219 (2006) 13 20 Short note One-sded fnte-dfference approxmatons sutable for use wth Rchardson extrapolaton Kumar Rahul, S.N. Bhattacharyya * Department of Mechancal Engneerng,
More informationON A DETERMINATION OF THE INITIAL FUNCTIONS FROM THE OBSERVED VALUES OF THE BOUNDARY FUNCTIONS FOR THE SECOND-ORDER HYPERBOLIC EQUATION
Advanced Mathematcal Models & Applcatons Vol.3, No.3, 2018, pp.215-222 ON A DETERMINATION OF THE INITIAL FUNCTIONS FROM THE OBSERVED VALUES OF THE BOUNDARY FUNCTIONS FOR THE SECOND-ORDER HYPERBOLIC EUATION
More informationThe Multiple Classical Linear Regression Model (CLRM): Specification and Assumptions. 1. Introduction
ECONOMICS 5* -- NOTE (Summary) ECON 5* -- NOTE The Multple Classcal Lnear Regresson Model (CLRM): Specfcaton and Assumptons. Introducton CLRM stands for the Classcal Lnear Regresson Model. The CLRM s also
More informationELASTIC WAVE PROPAGATION IN A CONTINUOUS MEDIUM
ELASTIC WAVE PROPAGATION IN A CONTINUOUS MEDIUM An elastc wave s a deformaton of the body that travels throughout the body n all drectons. We can examne the deformaton over a perod of tme by fxng our look
More informationIntroductory Cardinality Theory Alan Kaylor Cline
Introductory Cardnalty Theory lan Kaylor Clne lthough by name the theory of set cardnalty may seem to be an offshoot of combnatorcs, the central nterest s actually nfnte sets. Combnatorcs deals wth fnte
More informationSpeeding up Computation of Scalar Multiplication in Elliptic Curve Cryptosystem
H.K. Pathak et. al. / (IJCSE) Internatonal Journal on Computer Scence and Engneerng Speedng up Computaton of Scalar Multplcaton n Ellptc Curve Cryptosystem H. K. Pathak Manju Sangh S.o.S n Computer scence
More information