Skip to main content
1 of 4
user369335
  • 696
  • 1
  • 5
  • 22

Efficiently computing $\prod\limits_{i=1}^{n} A_i$

Let $k$ be a nonnegative integer, how to compute $\prod\limits_{i=1}^{n} A_i$ quickly and accurately, where $$A_i=\begin{bmatrix} 0 & 1\\ i^k & 1 \end{bmatrix}$$

I know if $k=0$, we can use the matrix diagonalization method.

However, if $k>0$, it seems that the matrix diagonalization method is not suitable for those cases.

Give a specific $k>0$, I am getting trouble by finding its close form.

Hints and comments are welcomed. Thanks.

user369335
  • 696
  • 1
  • 5
  • 22