예제 #1
0
## Last Modified: 09-01-2016
#
# chow_conj
# Note_1: as {\mu^a = \mu^{a+2}} for any {a \geq 1}, we can reduce to the case when the {a_i} take values in {0,1,2}
#         Here, we only implemented a few selected case when { a_i } take value 1
# Note 2: functions in this file is related to functions in hard_littlew_von_mang_correlation_conj.py
#         For example, take a look of verify_hard_littlew_conj_for_twi_prim()

import matplotlib.pyplot as plt
import numpy as np

from read_write_a_list_to_file import read_1d_data_list_from_file

target_num = 200000
file_name = 'outputs_mert\\mobi_upto_%d.txt'%(target_num)
mobi_list = read_1d_data_list_from_file(file_name)

# sum(mobi(n)*mobi(n + 2) where sum is for n <= x
# chow_conj in this case imply twi_prim conj.
def verify_chow_conj_for_twi_prim(x):

    # fix h = 2
    h = 2

    mobi_n_mobi_n_h_sum_list = []

    for i in range(1, x+1):

        mobi_n_mobi_n_h_sum = 0
        for n in range(1, i):
예제 #2
0
        sys.exit(0)

    max_num = int(args[0])

    if(max_num <=1):
        print 'Wrong input: max_num %d'%(max_num)
        sys.exit(0)

    prime_option = int(args[1])
    if(prime_option <=0):
        print 'Wrong input: prime_option %d'%(prime_option)
        sys.exit(0)

    # set global num_settings.g_prime_list_option
    num_settings.g_prime_list_option = prime_option

    prime_list = get_prime_list(max_num)

    print prime_list

    if(prime_option == 1):
        file_name = 'outputs_primes_lists\\primes_upto_%d_trueprime.txt'%(max_num)

    else:
        file_name = 'outputs_primes_lists\\primes_upto_%d_option_%d.txt'%(max_num, prime_option)

    write_1d_data_list_to_file(file_name, prime_list )

    # read back again for checking
    prime_list_again = read_1d_data_list_from_file(file_name )
    print 'prime_list_again: ', prime_list_again