On Polynomial Recursive Sequences

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Recursive sequences and polynomial congruences

We consider the periodicity of recursive sequences defined by linear homogeneous recurrence relations of arbitrary order, when they are reduced modulo a positive integer m. We show that the period of such a sequence with characteristic polynomial f can be expressed in terms of the order of ω = x + f as a unit in the quotient ring ‫ޚ‬ m [ω] = ‫ޚ‬ m [x]/ f. When m = p is prime, this order can be ...

متن کامل

On the Periodicity of Certain Recursive Sequences

In 2000, Viswanath showed that random Fibonacci sequences grow exponentially and calculated the rate at which they grow assuming the coin flipped was fair. In this paper, we explore the Fibonacci sequences generated by finite, repeating sequences of pluses and minuses. The main results of this paper will be to show the necessary conditions for a sequence to be periodic, as well as to show all t...

متن کامل

Linear Recursive Sequences

A sequence is an infinite list of numbers, like The numbers in the sequence are called its terms. The general form of a sequence is a 1 , a 2 , a 3 ,. .. where a n is the n-th term of the sequence. In the example (1) above, a 1 = 1, a 2 = 2, a 3 = 4, and so on. The notations {a n } or {a n } ∞ n=1 are abbreviations for a 1 , a Occasionally the indexing of the terms will start with something oth...

متن کامل

Block companion Singer cycles, primitive recursive vector sequences, and coprime polynomial pairs over finite fields

Article history: Received 22 June 2010 Revised 21 November 2010 Accepted 12 February 2011 Available online xxxx Communicated by Zhe-Xian Wan MSC: 11T35 11T06 20G40 15B05

متن کامل

Additive functions on pseudo-polynomial sequences

The present paper deals with functions acting on the digits of an q-ary expansion. In particular let n be a positive integer, then we call

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theory of Computing Systems

سال: 2021

ISSN: 1432-4350,1433-0490

DOI: 10.1007/s00224-021-10046-9