




import math
from collections.abc import Callable





def        __UpperCAmelCase						(							lowerCamelCase_ :     Callable[[float], float]  ,							lowerCamelCase_ :     float  ,							lowerCamelCase_ :     float  )       ->  float:







			"""simple docstring"""





			SCREAMING_SNAKE_CASE_   : float					  =      xa
			SCREAMING_SNAKE_CASE_   : float					  =      xa
			while True:
						if x_n == x_na or function(lowerCamelCase_  ) == function(lowerCamelCase_  ):
									raise ZeroDivisionError('float division by zero, could not find root'  )
						SCREAMING_SNAKE_CASE_   : float					  =      x_na - (
						    function(lowerCamelCase_  ) / ((function(lowerCamelCase_  ) - function(lowerCamelCase_  )) / (x_na - x_n))
						)
						if abs(x_na - x_na  ) < 10**-5:
									return x_na
						SCREAMING_SNAKE_CASE_   : Optional[int]					  =      x_na
						SCREAMING_SNAKE_CASE_   : Optional[int]					  =      x_na





def        __UpperCAmelCase						(							lowerCamelCase_ :     float  )       ->  float:







			"""simple docstring"""





			return math.pow(lowerCamelCase_  ,							3  ) - (2 * x) - 5


if __name__ == "__main__":
						print(intersection(f, 3, 3.5))









def        __UpperCAmelCase						(							lowerCamelCase_ :     List[str]  ,							lowerCamelCase_ :     Optional[Any]  )       ->  int:







			"""simple docstring"""





			SCREAMING_SNAKE_CASE_   : List[Any]					  =      [0 for i in range(r + 1  )]
			# nc0 = 1
			SCREAMING_SNAKE_CASE_   : Dict					  =      1
			for i in range(1  ,							n + 1  ):
						# to compute current row from previous row.
						SCREAMING_SNAKE_CASE_   : Optional[int]					  =      min(lowerCamelCase_  ,							lowerCamelCase_  )
						while j > 0:
									c[j] += c[j - 1]
									j -= 1
			return c[r]




print(binomial_coefficient(n=10, r=5))



