



'''simple docstring'''





def 						__snake_case(				_lowerCAmelCase     ,   _lowerCAmelCase     ,   _lowerCAmelCase		)		-> float:
      snake_case__  :    str    						=      (num_of_terms / 2) * (2 * first_term + (num_of_terms - 1) * common_diff)
      # formula for sum of series
      return total





def 						__snake_case(				)		-> List[str]:
      print(sum_of_series(1     ,   1     ,   10		)		)


if __name__ == "__main__":
       import doctest

       doctest.testmod()





'''simple docstring'''






from __future__ import annotations

import typing
from collections import Counter




def     snake_case_					(     lowerCAmelCase_		)->		typing.Counter[int]:





       '''simple docstring'''


       _UpperCAmelCase  :						typing.Counter[int]			     = Counter()
       for base in range(1       ,   max_perimeter + 1		):
              for perpendicular in range(lowerCAmelCase_       ,   max_perimeter + 1		):
                     _UpperCAmelCase  :						List[str]			     = (base * base + perpendicular * perpendicular) ** 0.5
                     if hypotenuse == int(lowerCAmelCase_		):
                            _UpperCAmelCase  :						Optional[Any]			     = int(base + perpendicular + hypotenuse		)
                            if perimeter > max_perimeter:
                                   continue
                            triplets[perimeter] += 1
       return triplets




def     snake_case_					(     lowerCAmelCase_ = 1000		)->		int:





       '''simple docstring'''


       _UpperCAmelCase  :						int			     = pythagorean_triple(lowerCAmelCase_		)
       return triplets.most_common(1		)[0][0]


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



