





'''simple docstring'''


def 							UpperCAmelCase_						(		__lowerCamelCase      :      float			,__lowerCamelCase      :      float			,__lowerCamelCase      :      int				):
   lowercase_    :Dict					    =				[1 / first_term]
   lowercase_    :Optional[Any]					    =				1 / first_term
   for _ in range(number_of_terms - 1				):
      first_term += common_difference
      arithmetic_progression.append(__lowerCamelCase				)
   lowercase_    :Union[str, Any]					    =				[1 / step for step in arithmetic_progression]
   return sum(__lowerCamelCase				)


if __name__ == "__main__":
 import doctest

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









'''simple docstring'''


import math
def 							UpperCAmelCase_						(		__lowerCamelCase      :      int				):

   if 1 < number < 4:
      # 2 and 3 are primes
      return True
   elif number < 2 or number % 2 == 0 or number % 3 == 0:
      # Negatives, 0, 1, all even numbers, all multiples of 3 are not primes
      return False

   # All primes number are in format of 6k +/- 1
   for i in range(5			,int(math.sqrt(__lowerCamelCase				) + 1				)			,6				):
      if number % i == 0 or number % (i + 2) == 0:
         return False
   return True
def 							UpperCAmelCase_						(		__lowerCamelCase      :      int = 2_00_00_00				):
   return sum(num for num in range(3			,__lowerCamelCase			,2				) if is_prime(__lowerCamelCase				)				) + 2 if n > 2 else 0


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


