It's written in maths, not C#, so it expands to 1 <= n AND n <= 2^64-1. ( Python understands the a <= b <= c syntax like that, but lots of other languages require the AND. )

Gonna try my best to explain. I read in C# btw. So first of the sign "**" I think it is the same as 2^2, not really sure though.

so 1 is less than or eual to n and if that is true then u check for if that value is <= 2^64 - 1. Is that correct?

Which part of that do you not understand? ( Yes, it helps to be able to read that, so this is not a fatuous question. )

ETA: Note that you can Google that exact phrase, and Google will explain it a bit, and offer a link to QuickMath whch will try to explain in more ways and different terms.

Hmm okay.. Could you explain how you read this "1 <= n <= 2 ** 64 - 1"? Guessing that is a vital part you need to understand to solve this.

But you do, don't you? It's in the description.

Could you ask that question directly on a solution you don't understand? That makes things easier to explain. Ask questions that are as specific as possible; tell us what syntax you understand and what you do not.

If I need to check every combination and see if any result is equals to n. Dont I need to know the max value of the exponent?

Could someone provide me with a resource explaining how to solve this? I looked at the solutions but I don't understand how they work ^^.

They should tell you what input you failed on, unless there's a language without assertion messages that I missed.

The test doesnt tell me anything other than I failed. xD gonna chew on this some more.

It should mostly work. There's another thing to consider, but the test results will probably tell you that.

The tests are correct!

Can you please do it in a fork rather than via the kata editor, currently there is no way for someone who has solved the kata in a different language to check the current state of the Lua tests without forfieting.

If you use a fork then it is easy to see and track who did what.

It also prevents you from rolling back other peoples translations by accident like you did to my fix for the Haskell tests.

Sure, I will update the solution to the most optimised version + adding the 3 fop loop version in test cases. thx you again for help, I learned a lot here