Do not brute force the sum of divisors. Use math to reduce iteration while finding the sum of divisors

Cannot solve in Common Lisp, keep timing out, but I have tried every optimization trick I can find, like narowwing the window divisors, and calculating m directly each iteration of n... what am I missing?

Way to spoil the fun.

Thanks for the compliments :-)

Even smaller and more readable than mine. Awesome solution.

I keep doing these kata because I'm continually surprised by the variety of options python gives you to solve any problem.

Kudos

This is one of the most common questions asked for this kata.

I won't repeat myself for the 100th time.
See this: https://www.codewars.com/kata/554b4ac871d6813a03000035/discuss#5862f485e20244604600003b

still need a fix for this, but I have to close this because having an open issue has some consequences.

'6' > '542' #True
6 > 542 #False

In python, the condition if c > largest is true for c = 6 and largest = 542. How is 6 > 542??

Oh, I thought it was some other operator. Just a lessthanorequal. Thanks