i just cant figure this out.(adsbygoogle = window.adsbygoogle || []).push({});

given a n x n matrix (with n>1) "A" such that all entries are integers and A is invertible such that A^{-1} also has integer entries. Let B be another matrix with integer coefficients so that:

A+B, A+2B, A+3B, ... A+(n^2)B

Are all invertible with integer entries.

Show that,

A+kB

Is also invertible with integer enties for any integer k.

who the heck do you solve this?

**Physics Forums - The Fusion of Science and Community**

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Hard matrix prob

Loading...

Similar Threads - Hard matrix prob | Date |
---|---|

Very hard problems about work | May 24, 2015 |

Evaluating the Svein-Graham Sum | Apr 28, 2015 |

Solving for a variable. Hard to do in this simple equation. | Feb 4, 2015 |

Hard half life equation | Jul 7, 2014 |

**Physics Forums - The Fusion of Science and Community**