
def 			_lowercase    (      __UpperCamelCase     :		List[Any]   ,       __UpperCamelCase     :		List[Any] ):
      # "Simpson Rule"
      # int(f) = delta_x/2 * (b-a)/3*(f1 + 4f2 + 2f_3 + ... + fn)
      snake_case__					=   (boundary[1] - boundary[0]) / steps
      snake_case__					=   boundary[0]
      snake_case__					=   boundary[1]
      snake_case__					=   make_points(__UpperCamelCase   ,       __UpperCamelCase   ,       __UpperCamelCase )
      snake_case__					=   0.0
      y += (h / 3.0) * f(__UpperCamelCase )
      snake_case__					=   2
      for i in x_i:
            y += (h / 3) * (4 - 2 * (cnt % 2)) * f(__UpperCamelCase )
            cnt += 1
      y += (h / 3.0) * f(__UpperCamelCase )
      return y





def 			_lowercase    (      __UpperCamelCase     :		Dict   ,       __UpperCamelCase     :		Any   ,       __UpperCamelCase     :		Optional[Any] ):
      snake_case__					=   a + h
      while x < (b - h):
            yield x
            snake_case__					=   x + h





def 			_lowercase    (      __UpperCamelCase     :		Optional[Any] ):  # enter your function here
      snake_case__					=   (x - 0) * (x - 0)
      return y





def 			_lowercase    (      ):
      snake_case__					=   0.0  # Lower bound of integration
      snake_case__					=   1.0  # Upper bound of integration
      snake_case__					=   1_0.0  # define number of steps or resolution
      snake_case__					=   [a, b]  # define boundary of integration
      snake_case__					=   method_a(__UpperCamelCase   ,       __UpperCamelCase )
      print(F'''y = {y}''' )


if __name__ == "__main__":
       main()









from doctest import testmod
from math import sqrt





def 			_lowercase    (      __UpperCamelCase     :		int ):
      snake_case__					=   []
      if num < 1:
            return facs
      facs.append(1 )
      if num == 1:
            return facs
      facs.append(__UpperCamelCase )
      for i in range(2   ,       int(sqrt(__UpperCamelCase ) ) + 1 ):
            if num % i == 0:  # If i is a factor of num
                  facs.append(__UpperCamelCase )
                  snake_case__					=   num // i  # num//i is the other factor of num
                  if d != i:  # If d and i are distinct
                        facs.append(__UpperCamelCase )  # we have found another factor
      facs.sort()
      return facs


if __name__ == "__main__":
       testmod(name='''factors_of_a_number''', verbose=True)






