The sequence x 0 , x 1 , x 2 , … is defined by the recurrence relation
x n + 1 = a x n + b x n − 1 + c x n − 2 + d x n − 3 , n ≥ 3 .
For fixed integers a , b , c , d , it turns out that regardless of the initial values x 0 , x 1 , x 2 , x 3 , the sequence is eventually periodic. Find the sum of all possible periods.
This problem is posed by C L .
Details and assumptions
As an explicit example, 3 is a possible period since the recurrence relation x n + 1 = x n − 2 , n ≥ 3 is eventually periodic regardless of the starting values x 0 , x 1 , x 2 , x 3 .
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
I didn't understand the question. If a=1, b=1, c=0, d=0 for example then the sequence is never periodic, contradicting the assertion that it is eventually periodic.
Also, there are sets (a,b,c,d) where sometimes it is periodic and sometimes is not, depending on x0 etc.
Was it supposed to read something like "Find the sum of all numbers P such that there exists a,b,c,d such that regardless of the initial values of x0 etc. the sequence eventually is periodic with period P" ?
Log in to reply
Yes. The point is that the sequence had to be eventually periodic irrespective of the choices of initial values, and this limited the possible values of a , b , c , d , and hence the possible values of f ( z ) .
By defining polynomial you mean the characteristic polynomial of the recurrence relation right?
Log in to reply
If you like. I wanted to be clear that the polynomial was not always equal to z 4 − a z 3 − b z 2 − c z − d , but dropped in order according as some of the coefficients vanished. When d = 0 , for example, this is not what we would normally call a recurrence relation of order 3 , since the relation is only defined for n ≥ 3 , and hence we always need to know x 0 , x 1 , x 2 , x 3 to define the sequence even though the defining polynomial/characteristic polynomial is order 3 , and a normal order 3 recurrence relation would only require us to specify x 0 , x 1 , x 2 .
We'll start by assuming that d = 0 . Our logic can be extended to most of the other cases by ignoring any trailing zeroes in the tuple ( a , b , c , d ) , and reducing the order of the matrices we use. Having d = 0 is nice since it means the sequence can always be extended backward uniquely, given any consecutive four terms at any point --- the sequence is completely periodic.
We can write the recurrence as a matrix equation, for reasons that will soon be clear:
⎝ ⎜ ⎜ ⎛ x i + 1 x i + 2 x i + 3 x i + 4 ⎠ ⎟ ⎟ ⎞ = ⎝ ⎜ ⎜ ⎛ 0 0 0 d 1 0 0 c 0 1 0 b 0 0 1 a ⎠ ⎟ ⎟ ⎞ ⎝ ⎜ ⎜ ⎛ x i x i + 1 x i + 2 x i + 3 ⎠ ⎟ ⎟ ⎞
Let the 4 × 4 matrix there be A . Note that since d = 0 , the matrix A is invertible.
The periodicity of the sequence is equivalent to saying that for an arbitrary X = ( x 0 , x 1 , x 2 , x 3 ) T , there exists positive integer n such that A n X = X . Plug in the four obvious unit basis vectors as X and take the LCM of the resulting n to see that we have a positive integer n such that A n = I . Furthermore, if we also pick n to be minimal, then there exists an initial vector X such that A i X = X for 0 < i < n , since otherwise A i X ≡ A j X would imply that A i = A j and A ∣ i − j ∣ = I .
Then all of A 's eigenvalues are roots of unity (write it out in Jordan canonical form, and note that if e is on the diagonal, then A n has e n in its place, so e n = 1 ). In fact, A is diagonalizable (clear from the form of powers of a Jordan block ). So by diagonalizing A we see that the period n is the LCM of the orders of the roots of unity that are A 's eigenvalues.
The characteristic polynomial of A is λ 4 − a λ 3 − b λ 2 − c λ − d , and a , b , c , d are integers. In order for a root of unity with order r to be a root of such an integer polynomial, the r th cyclotomic polynomial has to divide the characteristic polynomial, which is attainable iff φ ( r ) ≤ 4 (all cyclotomic polynomials have integer coefficients and are monic, so we only need the degree to be small enough). So all r that satisfy φ ( r ) ≤ 4 work.
In fact, they are the only ones that work, although there are other cases to consider: we have to check for cases where we squeeze two (or more!) separate cyclotomic polynomial factors into the characteristic polynomial, so the period will be the LCM of the numbers of the cyclotomic polynomials. After some checking, this doesn't result in any new periods.
If d = 0 and c = 0 , etc., similar logic will lead us again to similar conditions φ ( r ) ≤ 3 , 2 , 1 , which doesn't give us any new solutions.
So, we have our answer: 1 + 2 + 3 + 4 + 5 + 6 + 8 + 1 0 + 1 2 = 5 1
Problem Loading...
Note Loading...
Set Loading...
If a = b = c = d = 0 then x n = 0 for all n ≥ 4 , and so the sequence eventually has period 1 . Let us assume now that at least one of a , b , c , d is nonzero. We shall call the defining polynomial to be f(z) \; = \; \left\{ \begin{array}{l@{\qquad}l} z^4 - az^3 - bz^2 - cz - d & d \neq 0 \\ z^3 - az^2 - bz - c & c \neq 0, d=0 \\ z^2 - az - b & b \neq 0, c=d=0 \\ z-a & a \neq 0, b=c=d=0 \end{array}\right. Then the solutions to the recurrence relation are given in term of powers of the roots of the defining polynomial.
All of these roots are nonzero.
If λ is a root of f ( z ) , it would be possible to choose x 0 , x 1 , x 2 , x 3 so that x n = λ n for all n ≥ 0 . Since this sequence has to be periodic, it follows that λ must be a root of unity. The minimal polynomial of λ is thus one of the cyclotomic polynomials, and divides f ( z ) .
3.If f ( z ) had a repeated root λ , it would be possible to choose x 0 , x 1 , x 2 , x 3 so that x n = n λ n for all n ≥ 0 , and this sequence would not be periodic. Thus we deduce that f ( z ) has no repeated roots.
Thus we deduce that f ( z ) must be a product of distinct cyclotomic polynomials, while having degree no greater than 4 . The cyclotomic polynomials of low degree are Degree 1 2 4 Polynomial Φ 1 , Φ 2 Φ 3 , Φ 4 , Φ 6 Φ 5 , Φ 8 , Φ 1 0 , Φ 1 2 because φ ( n ) > 4 for all positive integers n other than 1 , 2 , 3 , 4 , 5 , 6 , 8 , 1 0 , 1 2 . Thus the possible values for the defining polynomial f ( z ) are: Degree 1 2 3 4 Polynomial Φ 1 , Φ 2 Φ 1 Φ 2 , Φ 3 , Φ 4 , Φ 6 Φ 1 Φ 3 , Φ 1 Φ 4 , Φ 1 Φ 6 , Φ 2 Φ 3 , Φ 2 Φ 4 , Φ 2 Φ 6 Φ 5 , Φ 8 , Φ 1 0 , Φ 1 2 , Φ 3 Φ 4 , Φ 3 Φ 6 , Φ 4 Φ 6 Φ 1 Φ 2 Φ 3 , Φ 1 Φ 2 Φ 4 , Φ 1 Φ 2 Φ 6 If the defining polynomial is Φ a , any sequence it defines will have period a or 1 .
If the defining polynomial is Φ a Φ b where a = b , any sequence it defines will have period 1 or a or b or { a , b } (the LCM of a and b ).
If the defining polynomial is Φ a Φ b Φ c where a , b , c are distinct, any sequence it defines will have period 1 or a or b or c or { a , b } or { a , c } or { b , c } or { a , b , c } .
Running through the possible cases for f ( z ) , we see that the possible orders are 1 , 2 , 3 , 4 , 5 , 6 , 8 , 1 0 , 1 2 , which sum to 5 1 .