Then the MF** description should rule out the k always being 1, because that is legal with this type of explanation.

Isn't the point of codewars to improve your coding skills? Why would someone want to cheat?

Yep. Don't think anyone will actively cheat here, but the lack of test cases is just lazy and disappointing.

Even if clients didn't provide a clear description usually they know what output to expect. In this case it's not even clear from the description what do you want as an output. Confusing.

Clients don't always give quite clear descriptions of their need, sorry for that.

JS ?
It is a bit difficult here: the input string has a correct version number (4.44). The description has to be read with attention. Note moreover that since 35 guys passed the JS kata there should not be any error (at least I hope). Cheers.

Please which language?

Phone and version seems to be in a valid format

One is not.

You have to find it:

"Is there an integer k such as : (a ^ p + b ^ (p+1) + c ^(p+2) + d ^ (p+3) + ...) = n * k"

Please re-read the description.