# Thread:

1. ## Matrix operation

Determine A^18

dont know what to do besides to just count. But i had a similar question before where i could se it was a rotation matrix and then it was easy. Is there an easy way for this one to?

Thanks!

2. Decompose

$A=2I+N$

and apply the Newton's binomial theorem. The matrix N is nilpotent of order 3.

3. Two comments:

1. Your matrix is in Jordan Normal Form already.
2. Take a look here.

Cheers.

4. Jordan Normal Form did the job really easy

Cheers!

5. I think FernandoRevilla's method and my proposed method boil down to the same thing (as they should!). The binomial theorem is going to give you those binomial coefficients that are showing up in the Jordan Normal Form power section of the wiki post.
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 1, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.9304218292236328, "perplexity_flag": "middle"}