加载中…
In this paper, it is proved that every sufficiently large odd integer can be represented as \begin{equation*} n=p_1^2+p_2^2+p_3^4+p_4^4+p_5^4+p_6^5+p_7^7, \end{equation*} where are prime variables. This result constitutes an enhancement upon a previous result of Andrade [1].

生成讲解博客的中文版本

生成AI智能校验的中文版本