PrimeFactorComparison

import numpy as np
import math


def primeFactors(n):
    list=[]
    while n % 2 == 0:
        #print 2,
        n = n / 2

    for i in range(3,int(math.sqrt(n))+1,2):

        while n % i== 0:
           # print i,
            n = n / i
            list.append(i)

    if n > 2:
      #  print n
        list.append(n)

    return list


#digit prime count
def size_of_primefactors(n):
    Investigate = False

    size = len(str(i))
    if size>=3:
        Investigate = True

    return Investigate

def expirement():
    RGL_one=[]
    for i in range(294):
        RGL_one.append(np.random.randint(4,846))

    nine_RGL_one=[]
    for i in range(294):
        nine_RGL_one.append(RGL_one[i]*19)

    RGL_two=[]
    sums=0
    for i in range(294):
        sums+=np.random.randint(1,141)
        RGL_two.append(sums)

    lv=np.sum(RGL_two)
    nv=np.sum(nine_RGL_one)
    lvp=primeFactors(lv)
    nvp=primeFactors(nv)

    SamePrime=[0]
    SamePrimeFN=False

    for i in range(len(lvp)):
        for j in range(len(nvp)):
            Size= True
            Size=size_of_primefactors(lvp[i])
            if (lvp[i]==nvp[j]):
                    #print "Same PrimeF, %3d"%(lvp[i])
                SamePrime.append(lvp[i])


    return SamePrime

for i in range(1900000):
    SamePrime=expirement()
    for j in SamePrime:
        if j>10000:
            print SamePrime