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 Plus annual

Presents the access of premium content as premium feature

Premium Content

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 annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

We propose a new search algorithm to solve the equation x 3 + y 3 + z 3 = n for a fixed value of n > 0. By parametrizing |x| =min|x|, |y|, |z|, this algorithm obtains |y| and |z| (if they exist) by solving a quadratic equation derived from divisors of |x 3 | ± n. By using several efficient number-theoretic sieves, the new algorithm is much faster on average than previous straightforward algorithms. We performed a computer search for 51 values of n below 1000 (except n = ±4 (mod9)) for which no solution has previously been found. We found eight new integer solutions for n = 75, 435, 444, 501, 600, 618, 912, and 969 in the range of |x| ≤ 2.10 7 .

On searching for solutions of the Diophantine equation 𝑥³+𝑦³+𝑧³=𝑛