Ok so the name I copied it from was from a different place I had it in, but I have tried it with the correct name. But I do see what you mean about it being recursed only once.

The function's name should be digital_root not sum_digits and you're doing recursion wrong for this problem, you're only adding all digits once. Unless that's one function you use in your code and you didn't write the rest of it.

If that value has more than one digit, continue reducing in this way until a single-digit number is produced.

I get Log:7 then underneath 'None should equal 7' and then Log>6 ,'None should equal 6' and so on for all of the tests...The numbers match up but Ive still failed?

No problem.

This comment is hidden because it contains spoiler information about the solution

Ok so the name I copied it from was from a different place I had it in, but I have tried it with the correct name. But I do see what you mean about it being recursed only once.

The function's name should be

`digital_root`

not`sum_digits`

and you're doing recursion wrong for this problem, you're only adding all digits once. Unless that's one function you use in your code and you didn't write the rest of it.This comment is hidden because it contains spoiler information about the solution

I get Log:7 then underneath 'None should equal 7' and then Log>6 ,'None should equal 6' and so on for all of the tests...The numbers match up but Ive still failed?

This comment is hidden because it contains spoiler information about the solution

I am 100% sure that made code works. I even tested it in a seperate program. There is somethimng wrong with the test cases.