Project Euler Problems 1 to 100 - Problem 26: Reciprocal cycles

Project Euler
1

Tell us what’s happening:

I do not the reason why this is failing. I cannot get the answer of biggest repetend number.

Your code so far

def is_Prime(number):
    import math
    
    times_the_number_has_been_divided_by_another_number=0    
    if number<100:
        for i in range(2,number):
            if number%i==0:
                    times_the_number_has_been_divided_by_another_number=times_the_number_has_been_divided_by_another_number+1
            if times_the_number_has_been_divided_by_another_number<1:
               return number 
    else: 
         for i in range(2,math.ceil(math.sqrt(number))):
            if number%i==0:
                    times_the_number_has_been_divided_by_another_number=times_the_number_has_been_divided_by_another_number+1
            if times_the_number_has_been_divided_by_another_number<1:
               return number

#print(is_Prime(118))      

# Assuming is_Prime(number) is already defined

limit = 10
case_number = 1
biggest_count = 0

while case_number < limit:
    if is_Prime(case_number):
        number_to_add_zeroes = 10
        count = 1
        found = False
        
        while found==False:
            if number_to_add_zeroes % case_number == 1:
                found = True
                #print(case_number, number_to_add_zeroes)
            else:
                number_to_add_zeroes = number_to_add_zeroes * 10
                count = count + 1
        
        if count > biggest_count:
            biggest_count = count
    
    case_number = case_number + 2  # move to next odd number

print(biggest_count)

Your browser information:

User Agent is: Mozilla/5.0 (Windows NT 10.0; Win64; x64) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/141.0.0.0 Safari/537.36

Challenge Information:

Project Euler Problems 1 to 100 - Problem 26: Reciprocal cycles