A sequence of functions ( f n ) is defined by f 1 ( x ) = 1 for any real number x , and f n + 1 ( x ) = x ∗ f n ( x − 1 ) for any natural number n ≥ 1 and any real number x . Let us defined the matrix A ( x ) as ( f i ( x + j − 1 ) ) 1 ≤ i ≤ 2 0 1 8 , 1 ≤ j ≤ 2 0 1 8 . Find the number of real zeros of the equation d ( x ) = 0 , where d ( x ) represents the determinant of A ( x ) .
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 believe this is a Vandermonde determinant, which comes out to be the product of all ( x + q ) − ( x + p ) for 0 ≤ p < q ≤ 2 0 1 7 , a positive constant.
Log in to reply
I agree with you Otto. I was telling you before that I used a different approach: to prove that the derivative of the d ( x ) is equal to zero for any value of x , and the value of the determinant can be found evaluating at convenient value of x .
Log in to reply
A very charming and enlightening problem; thank you for sharing!
Problem Loading...
Note Loading...
Set Loading...
It can be proved that d ( x ) is a constant function, such that its constant value is always different from 0. Therefore the number of real zeros is zero.
To prove that d ( x ) is a constant function, we can prove a more general result. We can prove that for any set of polynomials f 1 , f 2 , . . . f n , such that the degree of f k is equal to k − 1 , for all k in the set { 1 , 2 , . . . , n } , the determinant D ( x ) of the matrix ( f i ( x + j − 1 ) ) 1 ≤ i ≤ n , 1 ≤ j ≤ n is always constant. To prove it, we just have to prove that D ′ ( x ) = 0 . This can be done in the following way. First, we need to notice that the derivative of D ( x ) will be a sum of n determinants, where the determinant number k in the sum is the determinant of the matrix that is obtained replacing in the original matrix the k th- row by f k ′ ( x ) , f k ′ ( x + 1 ) , . . . f k ′ ( x + n − 1 ) . Since the degree of f k ′ ( x ) is k − 2 , and { f 1 , f 2 , f 3 , . . . , f k − 1 } is a base of the vector space of all polynomials of degree k − 2 , then there are certain real numbers c 1 , c 2 , . . . , c k − 1 , such that f k ′ ( x ) = ∑ i = 1 k − 1 c i f i ( x ) . Then f k ′ ( x + j − 1 ) = ∑ i = 1 k − 1 c i f i ( x + j − 1 ) , for all j such that 1 ≤ j ≤ n . This implies that the k -th row of this determinant is a linear combination of the previous k − 1 rows and that is why that determinant is zero. Since this can be proved for any of the determinant of the sum, then D ′ ( x ) = 0 for all x . In a similar way, it can be proved that d ( x ) is constant, and you can find its value evaluating at a particular value of x . For example, evaluating at x = 0 . When we do this, we obtain a triangular determinant whose entries below the main diagonal are all zeros and whose entries corresponding to the main diagonal are 0 ! , 1 ! , 2 ! , . . . , ( n − 1 ) ! , where n = 2 0 1 8 . So, the constant value of d ( x ) is 0 ! ∗ 1 ! ∗ 2 ! ∗ . . . ∗ ( 2 0 1 7 ) ! , which is different from zero.