1 problem

Let $n,m\in\mathbb{N}$ satisfy $n>2$, $\lfloor\log_2(n)\rfloor+1\geq m>1$, and suppose there is no $k\in\mathbb{N}$ such that $k^m=n$. Then Shunia's conjecture. … The formula gives…