def forloop(n):
    if n>0:
        sum = 0
        for x in range(1,n+1):
            sum = sum + x
        return sum
    else:
        return 0

forloop(5)

def whileloop(n):
    if  n>0:
        sum=0
        x=1
        while x<= n:
            sum = sum+x
            x=x+1
        return sum
    else:
        return 0
        

whileloop(5)

whileloop(1)

i = 1+.044/12
1000*i**30*(1-i**30)/(1-i)

x=1+0.03/12
-140000*x**360*(1-x)/(1-x**360)

140000*x**120-590.25*(1-x**120)/(1-x)

x=1+0.035/12
-106427*x**240*(1-x)/(1-x**240)

106427*x**60-617.23*(1-x**60)/(1-x)

x=1+0.04/12
-86340.82*x**180*(1-x)/(1-x**180)

86340.82*x**60-638.65*(1-x)/(1-x**60)/(1-x
                               )

x=1+0.045/12
-110617.45*x**120*(1-x)/(1-x**120)

110617.45*x**120-1146*(1-x**120)/(1-x)

(1+r/12)**22-86.63*(1-(1+r/12)**22)/(1-(r/12))

x=1+0.16/12
-3000*x**24*(1-x)/(1-x**24)

3000*x**6-146.89*(1-x**6)/(1-x)

-2336.90*x**18*(1-x)/(1-x**18)

146.89*x**18-146.89*(1-x**18)/(1-x)

146.89*18

x=1+0.03/12
-140000*x**360*(1-x)/(1-x**360)

[cube**3 for cube in range(0,11)if cube % 2==0]

import numpy as np

x = np.array([0,2,4,6,8,10])

x**3

i=[]
def forloop(n):
    for i in (n):
        if length(n) == 1:
            return i
        else:
            return n[2]

#forloop([7,8,9])

def rec_max(L):
    if len(L) == 1:
        return L[0]
    else:
        m = rec_max(L[1:])
        if L[0] > m:
            return L[0]
        else:
            return m

rec_max([5,6,7,3,9,3,4])

def rec_in(n):
    if len(n)==1:
        return n[0]
    else:
        

        rest= rec_in(n[1:])
        r=rest+10
        y=n[:-1]
        return y
            

rec_in([2,3,5])

def list(j):
    if len(j)==0:
        return j[0]
    else:
        k=len(j)
        while k>1:
            k=len(j)-1
            fg=10+j[-1]
            return list(j[:-1])

def list(j):
    if len(j)==1:
        return j[0]
    else:
        
        return list(j[:-1])*10+j[-1]

list([6,6,7,3])

def rec_in(x):
    if len(x)==1:
        return x[0]
    else:
        n=len(x[:-1])
        return x[0]*10**n+rec_in(x[1:])

rec_in([7,1,5])

p(n)=c*p(n)-1 p(0)=1 c>0

c=.4
def p(n):
    if n == 0:
        return 1
    else:
        return c*p(n-1)

p(0)

p(1)

p(2)

p(3)

p(4)

p(0)= c*1=1
c=1
p(1)=1*1=1
p(2)=1*1=1
p(3)=1*1=1

def sign(x):
    
    if x<0:
        return-1
    else:
        
        return 1

sign(5)

def psum(n):
    a=0

    for v in range(1,n+1):
        a=a+v**2
    return a
    

psum(5)

import numpy as np
import matplotlib.pyplot as plt

x = np.linspace(-2,2,100)
y = x**3+1
plt.xlabel('x')
plt.ylabel('y')

plt.plot(x,y)

def rec_in(n):
    if len(n)==1:
        return n[0]
    else:
        

        rest= rec_in(n[1:])
        r=rest+10
        y=n[:-1]
        return y

rec_max([5,6,7,3,9,3,4])

def quad_tan(a,b,c):
    x = [-10+i/1000*20 for i in range(1001)]
    yquad = [a*n*n+b*n+c for n in x]
    ytan = [b*n+c for n in x]
    plt.plot(x,yquad,color='blue')
    plt.plot(x,ytan,color='red')
    plt.show()

def has_3(arr):
    for n in arr:
        if n == 3:
            return 1
    return -1

has_3([1,2,3,3,4])

20000*(1+0.082/12)**(48)/((1-(1+0.082/12)**(48))/(-0.082/12))

quad_tan(3,2,1)

def line_intersect(m1,b1,m2,b2):
    x = [-10+i/1000*20 for i in range(1001)]
    yline1 = [m1*n+b1 for n in x]
    yline2 = [m2*n+b2 for n in x]
    X = (b2-b1)/(m1-m2)
    Y = m1*X+b1
    plt.plot(x,yline1,color='blue')
    plt.plot(x,yline2,color='red')
    plt.scatter(X,Y,color='black',s=40)
    plt.show()

line_intersect(3,2,-3,4)

def min_cost(n):
    if n*10.99 > 100:
        print(100)
    else:
        print(n*10.99)
        
        
        

min_cost(9)

for n in range(501):
    for m in range(501):
        if n*n-7*m*m == 1:
            print(n)

for n in range(501):
    

[odd for odd in range(0,51)if odd%2==1]

    t=3*a*x**(3-1)+2*b*x**(2-1)+1*c*x+d(0)
  

cube_deriv(3,-2,0,5)

import numpy as np

np.random.randint(0,2,size=100)

import numpy as np
import matplotlib .pyplot as plt

def bisection(a,b,c,e):
    c = (a+b)/2
    while c-a > e:
        if f(c)==0:
            return c
        elif f(a)*f(c)>0:
            a=c
        else:
            b=c
        x= (a+b)/2
    return c

zero=heads
one=tails

coin_f=np.random.randint(0,2,size=10)

coin_f

def filp(n):
    for i in range(100):
        coin_f=np.random.randint(0,2,size=n)
        list=[]
        f_st=0
        for coin in coin_f:
            if coin ==1:
                f_st +=1
            else:
                if f_st>=4:
                    list.append(f_st)
                f_st =0
        return list

filp(10)

for i in range(100):
        coin_f=np.random.randint(0,2,size=10)
        list=[]
        f_st=0
        for coin in range(100):
            
            if coin ==1:
                f_st +=1
            else:
                
                if f_st==4:
                    
                    list.append(f_st)
                    f_st=0
                    
                
                

list

def flip(n):
    list=[]
    for i in range(n):
        coin_f=np.random.randint(0,2,size=10)
        return list.append(coin_f)

flip(100)

coin_f=np.random.randint(0,2,size=10)

for i in range(100):
    coin_f=np.random.randint(0,2,size=10)
    print(coin_f)