





'''simple docstring'''







import math
from collections.abc import Iterator
from itertools import takewhile






def  _lowerCamelCase				( lowercase						:      int						)	->	bool:

				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(lowercase						) + 1						)    ,							6						):
								if number % i == 0 or number % (i + 2) == 0:
												return False
				return True






def  _lowerCamelCase				( )	->	Iterator[int]:
				_a								= 2
				while True:
								if is_prime(lowercase						):
												yield num
								num += 1






def  _lowerCamelCase				( lowercase						:      int = 200_0000						)	->	int:
				return sum(takewhile(lambda lowercase						: x < n    ,							prime_generator()						)						)


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







'''simple docstring'''







def  _lowerCamelCase				( lowercase						:      str						)	->	list:
				if n_term == "":
								return []
				_a								= []
				for temp in range(int(lowercase						)						):
								series.append(F'1/{temp + 1}' if series else "1"						)
				return series


if __name__ == "__main__":
					lowerCAmelCase_					:    Union[str, Any]      	=			input('Enter the last number (nth term) of the Harmonic Series')
					print('Formula of Harmonic Series => 1+1/2+1/3 ..... 1/n')
					print(harmonic_series(nth_term))
