Good Kata. This actually took me a while but then I clocked. I was searching for ages on how to make a large list of Long types to then count in scala. Was really inefficient and didn't find a simple solution. But this was a good way to think differently. To anyone trying in scala... you'll slap yourself when you get it.

Good easy kata to start practicing recursion on

I've tried to do two ways here but just cutting short of completion.

First function has come to 69 characters however including the "from ******** import ********** as **" it equals 101 characters.

Second function has come to 70 characters however including the "import ******** as *" it equals 91 characters.

I can't find any other solution on stack overflow or other forums/websites. I think I've shortened it as much as possible...unless someone can give another hint to point me in another direction?

So your example for the FIRST 4 integers of a number are divisble by 4:
1232 /4 = 308 // Works

also means that for the number 1232454:

1/ 1 = 1
12 / 2 = 6
123 / 3 = 41
1232 / 4 = 308
12324 / 5 = 2464.8

1232454 is not polydivisible

Somy code should stop at that point and return False?

Can someone please break down why my code didn't work? I thought I produced efficient code:

def polydivisible(x):
    return isinstance(x / len(str(x)), int)
polydivisible(1232)

Please enable latest version of Python

It didn't return a value though. Like I said...I tried return and it didn't output odd or even

Well smack me with a tigers tail I should open my eyes more lol