That's kinda impressive: one line. Incomprehensible, but impressive :)

Yes, pls: add the ouput example to the instructions. That would be helpful.

No worries. I solved it. Basically using the same logic. Thanks anyways

Thnx. That solved it for me.

As so many others I don't understand when/why the solution should or shouldn't end with a \n. Unfortunately the description or comments can't clarify this for me...

Thanks so much! I should have know that! Guess, it won't stick, cause it doesn't make sense to me.

I don't understand what you mean. But I'm guessing the return call always needs to be in the main body and not in an if/elif/statement (or a loop)?

I clearly don't understand the Kata, because in my Attempts, I get false positives. An example: ferzdffpubobgmilcnk and ldcxkfyrlcbdxsekl. It appears to me, that this case should return True for ek, but according to the Attempts it should return False. What am I not understanding correctly?

Because I thought checking against primes, would be too hard too implement for this newbie, I amended my code to just check for odd numbers and stop at the midway point. Unfotunately, though still time-outs. I wonder how many more of these great tips, you still have available. Many thanks, though up to now. This is probably more instructive than peeking at the solutions.

I though I wasn't calculating the complete factorial, but off course that was only true, when the factorial produces zeros. Which makes me realize I really don't need the (incomplete) factorial, only the last digit of the factorial. But even then I get a time-out. Am I just thinking in the completely wrong direction?