n=2
po=0.25

p1 = 1 -po
prob = [po,p1]
while len(prob)<= pow(2,n-1):
    A = [z*po for z in prob]
    B = [z*p1 for z in prob]
    prob = A + B
print(prob)


N = np.arange(0,2**n,1)
C = np.arange(1,n+1,1)
Q = np.arange(-5,6,1)

L = [2**c for c in C]


for q in Q:
    P = []
    sF = []
    sA = []
    SF = []
    alfa= []
    for k in N:
        P.append(prob[k]**q)
        for c in C:
            if len(P)==pow(2,c):
                s= sum(P)
                M = P/s
                F = [m*np.log(m) for m in M]
                A = [m*np.log(p) for m,p in zip(M,P)]
                sA.append(sum(A))
                sF.append(sum(F))
                #print(F, "n n", sF)
                if len(sF)==len(L):
                    f = pol.polynomial.polyfit(np.log(L), sF, deg=1)
                    SF.append(f[1])
                    print(SF)