the last item in basic tests '3 should equal 4' is broken

Don't think this kata deserves 4 kyu in lua. Maybe 6 or 7. And the description can be improved:

1. "Professor Chambouliard hast just discovered " --> has just discovered

2. Why in the description it is called double and not doubles (plural) ?

3. I don't understand why to use different names for K and N. Why to introduce maxn and maxk for those ?

It seems this kata actually requires finding those prime factors which is a (very) hard problem in general. I'm not sure whether non-sophisticated approaches will work here (that depends on the size of the input numbers), so I will skip this kata for now.

Enjoyed writing my first Forth function. Seems a bit hard for 8 kuy, 7 would be more appropriate.

The Rust translation needs some work.

• Tests should be in a tests module with #[cfg(test)]
• &[_] is more idiomatic and flexible and should always be preferred over &Vec<_>
• -> () return type is moot and discouraged.
• The spacing should be inline with rustfmt, which leaves an empty line between functions, and spaces lists as [a, b, c] instead of [ a,b,c ].
• The todo!() macro is a more idiomatic way to mark unwritten code, rather than a comment that fails compilation.
• The type for a function that takes 2 i64s and returns 1 is fn(i64, i64) -> i64. The user shouldn't have to write their own function signatures.
• The reference solution is needlessly complex.

Kata is nearly unplayable in Clojure due to strict equality checking. Please fix.

closing issue: invalid report + unlikely to lead to anything

closing since it isn't an issue. the issue tag is for tracking things that need to be fixed, and an issue needs to demonstrate the issue - because if the reader can't see it they can't fix it.

as far as questions go, make sure you give other people something to reply to, ask about the things you need. essentially the responsibility for driving that conversation towards where you need it to go is on the one asking. people tend to be eager to reply when they're shown what help and why is needed.

there is in fact a broken test.

Excellent kata.

oops, i read one number in the description wrong, i have dyslexia

Your code is wrong and it fails even the first sample test. Debug it properly before creating a kata issue next time, please.

the code works just fine in vscode but does not work here, and gives a false error.

The code terminates when it reaches the last word of the string. (i.e, all comparisons with previous neighboring word have been done)

OP solved it, closing

I disagree. The part

n being given (n integer, 1 <= n <= 50) calculate enum(n) i.e. the partition of n

is given just to explain the tests procedure. Those who in your opinion don't calculate the partitions explicitely calculate them anyway, because I am very doubtful you can pass the tests without calculating the partitions. Otherwise I think you can publish an article about it :)