



from __future__ import annotations



def    snake_case_				(    _SCREAMING_SNAKE_CASE  ,	_SCREAMING_SNAKE_CASE   ):
	if nth_term == "":
		return [""]
	__lowercase		       =			int(_SCREAMING_SNAKE_CASE   )
	__lowercase		       =			int(_SCREAMING_SNAKE_CASE   )
	__lowercase		       =			[]
	for temp in range(int(_SCREAMING_SNAKE_CASE   )   ):
		series.append(F"""1 / {pow(temp + 1  ,	int(_SCREAMING_SNAKE_CASE   )   )}""" if series else "1"   )
	return series


if __name__ == "__main__":
	import doctest

	doctest.testmod()

	snake_case__					:     List[Any]    		=   int(input("""Enter the last number (nth term) of the P-Series"""))
	snake_case__					:     Tuple    		=   int(input("""Enter the power for  P-Series"""))
	print("""Formula of P-Series => 1+1/2^p+1/3^p ..... 1/n^p""")
	print(p_series(nth_term, power))








def    snake_case_				(    _SCREAMING_SNAKE_CASE   ):

	# bit count represents no. of bits in the gray code
	if bit_count < 0:
		raise ValueError("The given input must be positive"   )

	# get the generated string sequence
	__lowercase		       =			gray_code_sequence_string(_SCREAMING_SNAKE_CASE   )
	#
	# convert them to integers
	for i in range(len(_SCREAMING_SNAKE_CASE   )   ):
		__lowercase		       =			int(sequence[i]  ,	2   )

	return sequence



def    snake_case_				(    _SCREAMING_SNAKE_CASE   ):

	# The approach is a recursive one
	# Base case achieved when either n = 0 or n=1
	if bit_count == 0:
		return ["0"]

	if bit_count == 1:
		return ["0", "1"]

	__lowercase		       =			1 << bit_count  # defines the length of the sequence
	# 1<< n is equivalent to 2^n

	# recursive answer will generate answer for n-1 bits
	__lowercase		       =			gray_code_sequence_string(bit_count - 1   )

	__lowercase		       =			[]

	# append 0 to first half of the smaller sequence generated
	for i in range(seq_len // 2   ):
		__lowercase		       =			"0" + smaller_sequence[i]
		sequence.append(_SCREAMING_SNAKE_CASE   )

	# append 1 to second half ... start from the end of the list
	for i in reversed(range(seq_len // 2   )   ):
		__lowercase		       =			"1" + smaller_sequence[i]
		sequence.append(_SCREAMING_SNAKE_CASE   )

	return sequence


if __name__ == "__main__":
	import doctest

	doctest.testmod()



