



from __future__ import annotations

import math





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


a_								=       [num for num in range(3, 100_001, 2) if not is_prime(num)]





def 		a__      (		_UpperCamelCase      :			int				):

   if not isinstance(__a			,__a				):
      raise ValueError('''n must be an integer'''				)
   if n <= 0:
      raise ValueError('''n must be >= 0'''				)

   __lowerCamelCase    				=     []
   for num in range(len(__a				)				):
      __lowerCamelCase    				=     0
      while 2 * i * i <= odd_composites[num]:
         __lowerCamelCase    				=     odd_composites[num] - 2 * i * i
         if is_prime(__a				):
            break
         i += 1
      else:
         list_nums.append(odd_composites[num]				)
         if len(__a				) == n:
            return list_nums

   return []





def 		a__      (		):
   return compute_nums(1				)[0]


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









def   __UpperCAmelCase					(      __a :     str      )     ->	list:

					"""simple docstring"""

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


if __name__ == "__main__":
			a__												=						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))



