Skip to main content
Code Golf

Return to Answer

oops
Source Link
totallyhuman
totallyhuman
  • 17.4k
  • 3
  • 34
  • 89

Python 2 + numpy, 58 bytes

lambda m:sum(linalg.svd(m)[1]>1e-10)==1 from numpy import*

Try it online!

Credit to this.

Python 2, 58 bytes

lambda m:sum(linalg.svd(m)[1]>1e-10)==1 from numpy import*

Try it online!

Credit to this.

Python 2 + numpy, 58 bytes

lambda m:sum(linalg.svd(m)[1]>1e-10)==1 from numpy import*

Try it online!

Credit to this.

Post Undeleted by totallyhuman
deleted 116 characters in body
Source Link
totallyhuman
totallyhuman
  • 17.4k
  • 3
  • 34
  • 89

Python 2 + numpy, 3758 bytes

lambda m:sum(linalg.svd(m)[1]>1e-10)==1 from numpy import* linalg.matrix_rank

Try it online!Try it online!

Yeah... I definitely don't understand a lot of the math involved in singular value decomposition and doing otherwise seems like a PITA so...Credit to numpy yaythis.

Python 2 + numpy, 37 bytes

from numpy import* linalg.matrix_rank

Try it online!

Yeah... I definitely don't understand a lot of the math involved in singular value decomposition and doing otherwise seems like a PITA so... numpy yay.

Python 2, 58 bytes

lambda m:sum(linalg.svd(m)[1]>1e-10)==1 from numpy import*

Try it online!

Credit to this.

Post Deleted by totallyhuman
Source Link
totallyhuman
totallyhuman
  • 17.4k
  • 3
  • 34
  • 89

Python 2 + numpy, 37 bytes

from numpy import* linalg.matrix_rank

Try it online!

Yeah... I definitely don't understand a lot of the math involved in singular value decomposition and doing otherwise seems like a PITA so... numpy yay.