





"""simple docstring"""






import math
from collections.abc import Callable

def     __A      (			a_						:Callable[[float], float]   ,       a_						:float   ,       a_						:float)		->		Any:
				__a :						float			       =  xa
				__a :						float			       =  xa
				while True:
								if x_n == x_na or function(a_) == function(a_):
												raise ZeroDivisionError('''float division by zero, could not find root''')
								__a :						float			       =  x_na - (
								    function(a_) / ((function(a_) - function(a_)) / (x_na - x_n))
								)
								if abs(x_na - x_na) < 10**-5:
												return x_na
								__a :						Optional[Any]			       =  x_na
								__a :						List[Any]			       =  x_na

def     __A      (			a_						:float)		->		List[str]:
				return math.pow(a_   ,       3) - (2 * x) - 5


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






"""simple docstring"""






from __future__ import annotations

import typing
from collections import Counter

def     __A      (			a_						:int)		->		typing.Counter[int]:
				__a :						typing.Counter[int]			       =  Counter()
				for base in range(1   ,       max_perimeter + 1):
								for perpendicular in range(a_   ,       max_perimeter + 1):
												__a :						Any			       =  (base * base + perpendicular * perpendicular) ** 0.5
												if hypotenuse == int(a_):
																__a :						List[Any]			       =  int(base + perpendicular + hypotenuse)
																if perimeter > max_perimeter:
																				continue
																triplets[perimeter] += 1
				return triplets

def     __A      (			a_						:int = 10_00)		->		int:
				__a :						Dict			       =  pythagorean_triple(a_)
				return triplets.most_common(1)[0][0]


if __name__ == "__main__":
		print(F'Perimeter {solution()} has maximum solutions')