
from __future__ import annotations




def 							__SCREAMING_SNAKE_CASE   (		SCREAMING_SNAKE_CASE       :      int | float | str    ,							SCREAMING_SNAKE_CASE       :      int | float | str			)     ->						list[str]:

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


if __name__ == "__main__":
							import doctest

							doctest.testmod()

							SCREAMING_SNAKE_CASE__							=				int(input("""Enter the last number (nth term) of the P-Series"""))
							SCREAMING_SNAKE_CASE__							=				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))






'''simple docstring'''

def      UpperCamelCase_						(					snake_case_       :       Union[str, Any]=2_81_23      )					->     str:






 '''simple docstring'''

 __lowerCAmelCase											=						[1] * (limit + 1)

 for i in range(2						,		int(limit**0.5      ) + 1      ):
  sum_divs[i * i] += i
  for k in range(i + 1						,		limit // i + 1      ):
   sum_divs[k * i] += k + i

 __lowerCAmelCase											=						set()
 __lowerCAmelCase											=						0

 for n in range(1						,		limit + 1      ):
  if sum_divs[n] > n:
   abundants.add(snake_case_      )

  if not any((n - a in abundants) for a in abundants      ):
   res += n

 return res


if __name__ == "__main__":
 print(solution())






