
def 			A_			(					lowercase						, lowercase						, lowercase      )     ->							float:


     """simple docstring"""







     UpperCAmelCase_						:    int    					=  [1 / first_term]
     UpperCAmelCase_						:    Dict    					=  1 / first_term
     for _ in range(number_of_terms - 1      ):
          first_term += common_difference
          arithmetic_progression.append(lowercase      )
     UpperCAmelCase_						:    List[Any]    					=  [1 / step for step in arithmetic_progression]
     return sum(lowercase      )


if __name__ == "__main__":
       import doctest

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



"""simple docstring"""







def 			A_			(					lowercase = 99_8001      )     ->							int:


     """simple docstring"""







     for number in range(n - 1						, 9999						, -1      ):
          UpperCAmelCase_						:    Union[str, Any]    					=  str(lowercase      )

          # checks whether 'str_number' is a palindrome.
          if str_number == str_number[::-1]:
               UpperCAmelCase_						:    List[str]    					=  999

               # if 'number' is a product of two 3-digit numbers
               # then number is the answer otherwise fetch next number.
               while divisor != 99:
                    if (number % divisor == 0) and (len(str(number // divisor      )      ) == 3.0):
                         return number
                    divisor -= 1
     raise ValueError("""That number is larger than our acceptable range."""      )


if __name__ == "__main__":
       print(f"""{solution() = }""")

