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

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

A perfect cuboid is a rectangular parallelepiped whose all linear extents aregiven by integer numbers, i. e. its edges, its face diagonals, and its spacediagonal are of integer lengths. None of perfect cuboids is known thus far.Their non-existence is also not proved. This is an old unsolved mathematicalproblem.  Three mathematical propositions have been recently associated with the cuboidproblem. They are known as three cuboid conjectures. These three conjecturesspecify three special subcases in the search for perfect cuboids. The case ofthe second conjecture is associated with solutions of a tenth degreeDiophantine equation. In the present paper a fast algorithm for searchingsolutions of this Diophantine equation using modulo primes seive is suggestedand its implementation on 32-bit Windows platform with Intel-compatibleprocessors is presented.

A fast modulo primes algorithm for searching perfect cuboids and its implementation