Papers
Topics
Authors
Recent
Search
2000 character limit reached

A monotonicity property for generalized Fibonacci sequences

Published 25 Oct 2014 in math.CO | (1410.6943v1)

Abstract: Given k>1, let a_n be the sequence defined by the recurrence a_n=c_1a_{n-1}+c_2a_{n-2}+...+c_ka_{n-k} for n>=k, with initial values a_0=a_1=...=a_{k-2}=0 and a_{k-1}= 1. We show under a couple of assumptions concerning the constants c_i that the ratio of the n-th root of a_n to the (n-1)-st root of a_{n-1} is strictly decreasing for all n>=N, for some N depending on the sequence, and has limit 1. In particular, this holds in the cases when all of the c_i are unity or when all of the c_i are zero except for the first and last, which are unity. Furthermore, when k=3 or k=4, it is shown that one may take N to be an integer less than 12 in each of these cases.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.