What do you think is missing, could you suggest a better description? as far as I can tell, it has all the requirements there.

Thanks Chrono79, I think the task could be better written, your comment helped me clarify the requeriment, it was quite simple.

Read the thread again. The sum is not limited by that value. The tests are fine.

Let's say for example n is 9, the even Fibonacci numbers below 9 are 2 and 8, and its sum is 10. It doesn't matter n was 9 and 10 is greater than it.

Same here, obviosly 1,000,000 is lower than 1,089,154 tht is why the correct answer is 257114. Does anybody knows how can we achieve the kata if the tests are wrong

This helped me and I easy applied changes and passed all tests.
It was interesting and description makes me thinking :)

So the maximum value is not the maximum amount, but the maximum Fibonacci number?

@Kraigo I had a similar problem understanding the description. You need the sum of all the even fibonacci numbers that are lower than the given n (n is not the nth element) without including n.

Give the summation of all even numbers in a Fibonacci sequence up to, but not including, the maximum value.

You are not to include "the summation" into the "up to but not including", just the "all even numbers".

Apparently, this is absolutely not clear for you. Do you have a suggestion how to improve the description?

Javascript.
I see description:
"but not including, the maximum value."
But test expects value Great then max value.

(added points to make easy to read)
For max value eq 1.000.000
Expected: 1.089.154, instead got: 257.114

approved

Julia translation

I published a correct one yet ;)

I don't claim to be able to read COBOL, but if the original translation was OK then the fixed one looks OK.

Cheers!

Your Haskell solution was invalidated BTW. :P

Fixed there in COBOL, please check and approve.

Tests with negative numbers have been removed from Python and Ruby.