





'''simple docstring'''


import math


def 						__a(SCREAMING_SNAKE_CASE_	:       int     ):



    '''simple docstring'''





    _lowerCAmelCase						      =   math.loga(math.sqrt(4 * positive_integer + 1     ) / 2 + 1 / 2     )

    return exponent == int(SCREAMING_SNAKE_CASE_     )


def 						__a(SCREAMING_SNAKE_CASE_	:       float = 1 / 12345     ):



    '''simple docstring'''





    _lowerCAmelCase						      =   0
    _lowerCAmelCase						      =   0

    _lowerCAmelCase						      =   3
    while True:
        _lowerCAmelCase						      =   (integer**2 - 1) / 4
        # if candidate is an integer, then there is a partition for k
        if partition_candidate == int(SCREAMING_SNAKE_CASE_     ):
            _lowerCAmelCase						      =   int(SCREAMING_SNAKE_CASE_     )
            total_partitions += 1
            if check_partition_perfect(SCREAMING_SNAKE_CASE_     ):
                perfect_partitions += 1
        if perfect_partitions > 0:
            if perfect_partitions / total_partitions < max_proportion:
                return int(SCREAMING_SNAKE_CASE_     )
        integer += 1


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









def  __magic_name__  (				lowercase				)				-> list:

							"""simple docstring"""



							if n_term == "":
														return []
							lowercase_	:   list  				=     []
							for temp in range(int(lowercase				)				):
														series.append(f"""1/{temp + 1}""" if series else """1"""				)
							return series


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