sinesum.py
def Sn(t,n):
    '''Sn function
Args: t - a value between -pi/2 and pi/2
      n - amount of recursions of the converging sum function
Returns: the sum of the converging sum function Sn (found on README) 
Should be converting to a value -1,0,or 1 as n grows arbitrary large.'''
    k = np.arange(1,n+1,1)
    constant  = np.divide(4,np.pi)
    
    
    def term(k,t,T = np.multiply(2,np.pi)):
        '''term function
        Args: k - arange of the number of iteratiosn
        t = the Value of a*T
        Returns: The value calcualted at each t which will at the end be summed together.'''
        coefficient = np.divide(1,(2*k-1))
        insideSine = np.divide((2*(2*k-1)*np.pi*t),T)
        return np.multiply(coefficient,np.sin(insideSine))
    
    
    
    vectorizedTerm = np.vectorize(term)
    returnVal = np.multiply(vectorizedTerm(k,t),constant)
    return returnVal.sum()
Sn function
Args: t - a value between -pi/2 and pi/2
      n - amount of recursions of the converging sum function
Returns: the sum of the converging sum function Sn (found on README) 
Should be converting to a value -1,0,or 1 as n grows arbitrary large.
Sn function
Args: t - a value between -pi/2 and pi/2
n - amount of recursions of the converging sum function
Returns: the sum of the converging sum function Sn (found on README)
Should be converting to a value -1,0,or 1 as n grows arbitrary large.
Sn function Args : t - a value between - pi / 2 and pi / 2 n - amount of recursions of the converging sum function Returns : the sum of the converging sum function Sn ( found on README ) Should be converting to a value - 1 0 or 1 as n grows arbitrary large .
def Sn(t,n):
    k = np.arange(1,n+1,1)
    constant  = np.divide(4,np.pi)
    def term(k,t,T = np.multiply(2,np.pi)):
        coefficient = np.divide(1,(2*k-1))
        insideSine = np.divide((2*(2*k-1)*np.pi*t),T)
        return np.multiply(coefficient,np.sin(insideSine))
    vectorizedTerm = np.vectorize(term)
    returnVal = np.multiply(vectorizedTerm(k,t),constant)
    return returnVal.sum()
def Sn ( t , n ) : k = np . arange ( 1 , n + 1 , 1 ) constant = np . divide ( 4 , np . pi ) def term ( k , t , T = np . multiply ( 2 , np . pi ) ) : '''term function
        Args: k - arange of the number of iteratiosn
        t = the Value of a*T
        Returns: The value calcualted at each t which will at the end be summed together.''' coefficient = np . divide ( 1 , ( 2 * k - 1 ) ) insideSine = np . divide ( ( 2 * ( 2 * k - 1 ) * np . pi * t ) , T ) return np . multiply ( coefficient , np . sin ( insideSine ) ) vectorizedTerm = np . vectorize ( term ) returnVal = np . multiply ( vectorizedTerm ( k , t ) , constant ) return returnVal . sum ( )
Sn function
Args: t - a value between -pi/2 and pi/2
n - amount of recursions of the converging sum function
Returns: the sum of the converging sum function Sn (found on README)
Should be converting to a value -1,0,or 1 as n grows arbitrary large.
Sn function Args : t - a value between - pi / 2 and pi / 2 n - amount of recursions of the converging sum function Returns : the sum of the converging sum function Sn ( found on README ) Should be converting to a value - 1 0 or 1 as n grows arbitrary large .
'''Sn function
Args: t - a value between -pi/2 and pi/2
      n - amount of recursions of the converging sum function
Returns: the sum of the converging sum function Sn (found on README) 
Should be converting to a value -1,0,or 1 as n grows arbitrary large.''' '''term function
        Args: k - arange of the number of iteratiosn
        t = the Value of a*T
        Returns: The value calcualted at each t which will at the end be summed together.'''
t
n