Ta.

Fork here.

I suggest you do one thing: either parse the polynomial from a string, or find roots. ( I think both are duplicates though. )

at first, I wanted to set the condition in a different way. Inputing the string like '2x^2 + 4x + 5 = 0' and needs find roots. But i think that it hard for 7 kyu and for 6 kyu it not interesting to solve this kata.

That you think, maybe make case of '2x^2 + 4x + 5 = 0' and gives it on 6 kyu?

Inconsistent return types is not good kata design. Find another way to signify infinite solutions.

Please use appropriate datatypes. The input should be a 3-tuple of numbers, not a string. Adding a secondary parsing task to the primary arithmetic one is not a good way to make a kata more interesting.
"Do one thing, and do it well."

Python, JS and Haskell have permuts(0) -> 1 test.

C needs updated example solution.

Approved with permuts(0)

JS translation

does not yet have permuts(0)

What makes you think there aren't?

I love this Math.ceil method.

I still see unsigned in the function signature and the description still has "Values up to n = 200 will be tested." ??

( Python, possibly C )

Add a test for permuts(0) -> 1 ( because [] -> [] is valid ).

Or specify n > 0. But that's the chicken way out of course.

I love the irony of using show in the error case :D

Rounding is ( almost ) never the appropriate solution. If something's wrong, provide the problem, not the solution.