English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Tools annual

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

Let $\mathcal{P}_r$ denote an almost-prime with at most $r$ prime factors,counted according to multiplicity. In this paper, it is proved that, for$12\leqslant b\leqslant 35$ and for every sufficiently large odd integer $N$,the equation \begin{equation*}  N=x^2+p_1^3+p_2^3+p_3^3+p_4^3+p_5^4+p_6^b \end{equation*} is solvable with$x$ being an almost-prime $\mathcal{P}_{r(b)}$ and the other variables primes,where $r(b)$ is defined in the Theorem. This result constitutes an improvementupon that of L\"u and Mu.

Waring-Goldbach Problem: One Square, Four Cubes and Higher Powers