Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
First - The Good Radix solution in Clear category for The Good Radix by AQiccl135
def checkio(number):
"""
This function finds the lowest radix that leaves no remainder when
(radix - 1) is divided into the given number-string.
"""
k = '123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ'.index(max(number)) + 2
while int(number, k) % (k - 1) != 0:
k+=1
if k > 35:
return 0
return k
Jan. 12, 2015
