value of d < 1000 for which 1/d contains the longest recurring cycle in its decimal fraction par

reciprocal_cycles.py

largest_num = 1000
largest_divisor = 3
longest_cycle = 1
rdigits = ''

def get_divide_result(i):
	seen_remainders = [False] * i
	remainder = 10 % i
	cycle_count = 0
	while remainder!= 0 and seen_remainders[remainder] is False:
		seen_remainders[remainder] = True
		cycle_count += 1	
		remainder = (remainder * 10) % i
	return remainder, cycle_count

for i in range(4, largest_num + 1):
	remainder, cycle_count = get_divide_result(i)
	if remainder != 0 and cycle_count > longest_cycle:
		largest_divisor = i
		longest_cycle = cycle_count


print(largest_divisor, longest_cycle)