



from math import exp



def 				_lowerCAmelCase      (_lowerCAmelCase):
					return 8 * x - 2 * exp(-x)



def 				_lowerCAmelCase      (_lowerCAmelCase				,		_lowerCAmelCase				,		_lowerCAmelCase):
					UpperCamelCase_											=				lower_bound
					UpperCamelCase_											=				upper_bound
					for _ in range(0				,		_lowerCAmelCase):
										UpperCamelCase_					,      UpperCamelCase_											=				xa, xa - (f(_lowerCAmelCase) * (xa - xa)) / (f(_lowerCAmelCase) - f(_lowerCAmelCase))
					return xa


if __name__ == "__main__":
	print(F"Example: {secant_method(1, 3, 2)}")





def 				_lowerCAmelCase      (_lowerCAmelCase				,		_lowerCAmelCase):
					UpperCamelCase_											=				0
					for ele in arr:
										total_sum += product_sum(_lowerCAmelCase				,		depth + 1) if isinstance(_lowerCAmelCase				,		_lowerCAmelCase) else ele
					return total_sum * depth



def 				_lowerCAmelCase      (_lowerCAmelCase):
					return product_sum(_lowerCAmelCase				,		1)


if __name__ == "__main__":
	import doctest

	doctest.testmod()
