def get_fare_list(n):
fare_value_list, fare_fraction_list = fare(n)
# print_fare_fraction_list(fare_fraction_list)
# we do not need to skip the last item, which is 1/1
fare_clean_list = fare_fraction_list[:(len(fare_fraction_list) )]
return fare_clean_list
if(len(args) != 2):
print 'Wrong arguments, require parameters: start_num, max_num'
sys.exit(0)
start_num = int(args[0])
if(start_num <8):
print 'start_num needs larger than or equal to 8'
sys.exit(0)
max_num = int(args[1])
fare_gbc_test__results_file = "fare_gbc_test_results.txt"
i_j_last = 0
smallest_largest_pair_only = False
for max in range(start_num, max_num + 1):
fare_vare_list, fare_fraction_list = fare(max, False, asc=True )
# print_fare_fraction_list(fare_fraction_list)
# print " "
write_fare_data_list_to_file(fare_gbc_test__results_file, fare_fraction_list )
# print_fare_fraction_list(fare_fraction_list)
if(max%2 == 0):
i_j = detect_gbc_pair_in_fare_sequence(max, fare_fraction_list, smallest_largest_pair_only)
# print 'i_j - last: ', (i_j - i_j_last), (i_j - i_j_last)%4
i_j_last = i_j
def mert_fare_for_n(n, print_option ):
fare_value_list, fare_fraction_list = fare(n, print_option)
if(print_option == True):
print fare_value_list
fare_list_arr = np.asarray(fare_value_list)
fare_list_arr_2_pi_i = 2*np.pi*1j*fare_list_arr
if(print_option == True):
print fare_list_arr_2_pi_i
fare_list_arr_2_pi_i_exp = np.exp(fare_list_arr_2_pi_i)
if(print_option == True):
print fare_list_arr_2_pi_i_exp
mert = np.sum(fare_list_arr_2_pi_i_exp)
return mert
