
'''simple docstring'''







def   lowerCAmelCase(  a__    :  float      ):







       '''simple docstring'''






       return -num if num < 0 else num







def   lowerCAmelCase(  a__    :  list[int]      ):







       '''simple docstring'''






       if len(a__      ) == 0:
              raise ValueError("abs_min() arg is an empty sequence"      )
       lowerCamelCase__				   =      x[0]
       for i in x:
              if abs_val(a__      ) < abs_val(a__      ):
                     lowerCamelCase__				   =      i
       return j







def   lowerCAmelCase(  a__    :  list[int]      ):







       '''simple docstring'''






       if len(a__      ) == 0:
              raise ValueError("abs_max() arg is an empty sequence"      )
       lowerCamelCase__				   =      x[0]
       for i in x:
              if abs(a__      ) > abs(a__      ):
                     lowerCamelCase__				   =      i
       return j







def   lowerCAmelCase(  a__    :  list[int]      ):







       '''simple docstring'''






       if len(a__      ) == 0:
              raise ValueError("abs_max_sort() arg is an empty sequence"      )
       return sorted(a__      , key=a__      )[-1]







def   lowerCAmelCase(  ):







       '''simple docstring'''






       assert abs_val(0      ) == 0
       assert abs_val(34      ) == 34
       assert abs_val(-1000_0000_0000      ) == 1000_0000_0000

       lowerCamelCase__				   =      [-3, -1, 2, -11]
       assert abs_max(a__      ) == -11
       assert abs_max_sort(a__      ) == -11
       assert abs_min(a__      ) == -1


if __name__ == "__main__":
    import doctest

    doctest.testmod()

    test_abs_val()
    print(abs_val(-3_4))  # --> 34



'''simple docstring'''







def   lowerCAmelCase(  a__    :  float      , a__    :  float      , a__    :  int      ):







       '''simple docstring'''






       lowerCamelCase__				   =      [1 / first_term]
       lowerCamelCase__				   =      1 / first_term
       for _ in range(number_of_terms - 1      ):
              first_term += common_difference
              arithmetic_progression.append(a__      )
       lowerCamelCase__				   =      [1 / step for step in arithmetic_progression]
       return sum(a__      )


if __name__ == "__main__":
    import doctest

    doctest.testmod()
    print(sum_of_harmonic_progression(1 / 2, 2, 2))

