(Haskell, maybe others)

Fixed test cases allow for solutions that do not properly check for square matrices such as this solution.

I've made a Haskell fork that adds the following test cases:

matrix = [[1,1,-3,4],
          [1,1,-2,3],
          [1,1,-4,2]]
vector = [1,1,1,1]

matrix = [[1,1,-3],
          [1,1,-2],
          [1,1,-4,5]]
vector = [0,0,0]

Not sure what to make of vector V. Are the entries b1, b2 ... bn the result of a calculation, or just some random numbers ?

Approved by someone

Haskell translation

Lua translation !

Great Kata! Thanks to author!!!

done

You can remove this line Javascript and Ruby versions will be released soon!

Python sol corrected

My solution passes Python. Updated to Codewars test framework.

done

we might still manage to salvage this kata raul ;)

You could suggest a fork. I'll have a look at it. Original author stopped caring about this kata ages ago.

use katex

a, \ (a + d)r, \ (a + 2d)r^2, \ (a + 3d)r^3, \ \dots, \ (a + (n - 1)d)r^{n-1}

a, \ (a + d)r, \ (a + 2d)r^2, \ (a + 3d)r^3, \ \dots, \ (a + (n - 1)d)r^{n-1}