Skip to main content
Mathematics

Return to Question

replaced http://math.stackexchange.com/ with https://math.stackexchange.com/
Source Link
Community Bot
Community Bot
  • 1

Inspired by a previous questionprevious question, given a square non-symmetric matrix whose elements are all prime but distinct from each other, does this guarantee that the matrix is invertible? It's easy to see $N=2$ this holds, a counter-example would imply that there must be four distinct primes such that $p_1 p_2 = p_3 p_4$.

Inspired by a previous question, given a square non-symmetric matrix whose elements are all prime but distinct from each other, does this guarantee that the matrix is invertible? It's easy to see $N=2$ this holds, a counter-example would imply that there must be four distinct primes such that $p_1 p_2 = p_3 p_4$.

Inspired by a previous question, given a square non-symmetric matrix whose elements are all prime but distinct from each other, does this guarantee that the matrix is invertible? It's easy to see $N=2$ this holds, a counter-example would imply that there must be four distinct primes such that $p_1 p_2 = p_3 p_4$.

Source Link
Hooked
Hooked
  • 6.7k
  • 2
  • 39
  • 60

Matrices with elements that are a distinct set of prime numbers: always invertible?

Inspired by a previous question, given a square non-symmetric matrix whose elements are all prime but distinct from each other, does this guarantee that the matrix is invertible? It's easy to see $N=2$ this holds, a counter-example would imply that there must be four distinct primes such that $p_1 p_2 = p_3 p_4$.