C#:

• Random tests are weak, all the values in the range should be tested.

• method name should be PascalCase (Please refer to implementation of backward compatibility here )

This is acceptable but I would ignore case compare the variable 'name' just in case someone passes 'zach' to the function!

O(n)+O(n) complexity?

Description say the value ranges from 1 to 15, yet it's possible to get 0 on the random tests. Also, 15 is never chosen.

Seems like fixed

Can anybody give me a key how to solve this kata? I tried to use binary representation of these numbers, but i still can't find the solve :(

Nice idea. Hard to find the wanted solution. But very exciting!

Removed svm()

I'll remove the svm() however the feel of the puzzle was to get people to think out of the box.
When I have time I'll be making more riddles into code

Issue: The static void main() part should be removed. It is confusing to new users of the site and causes errors on run.

As for the problem itself, this kata is more about solving the riddle than actually coding. Once you've solved the riddle, the coding portion is very simple. I'm not sure if you were going for this feel or not, but a good way to make it tougher would be to increase the maximum value to 9999. That would force people to think about the code rather than just thinking about the riddle and using brute force to get the answer.

I wouldn't say this is an issue.
Most people do the questions in Visual studio (or atleast I do, and it's a pet peeve of mine to add the static void Main(){} to every question.

What is the purpose of Main()?

Agreed. Just change the example to be clear that you can have negative values, and it's fine.