Could you elaborate on the SF is divisible by 10 if n = 3 mod 4 please? My simply brain couldn't understand this part. Thanks.

Nice. But why 4*n-1? Thanks.

Could anyone explain the n = 4*n - 1 part please? Thanks.

Looks great. Could anyone explain how this works exactly? Thanks.

Great solution. But could someone help me understand this part: if a is null or an element of a is null, wouldn't lns be False. Then wouldn't min(lns) raise an error?

Thanks

Thanks for the insightful comments on the O(n). Could anyone explain why this is n*(n-1)/2 instead of n**2? Thanks.

Wow, saucy code! In all candor, could anyone explain to me if this is real code or just redundant letters used purely for the shape? Thanks.

BTW how long do you guys think it would take to draft up an answer like this?

You are my hero. Thanks a lot for the laugh. Take my votes.

This looks very nice. But could anyone tell if this is really faster than the mundane if else control flow method?

Thanks.

Ho Lee Cow! This is fantastic.

Somehow I think this is the easiet to read