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

The question whether a system of n — 1 real algebraic numbers (n = 2, 3, •) chosen from an algebraic field of degree not higher than n9 yields periodicity by Jacobi's Algorithm is still as open and challenging as hundred years ago. The present paper gives an affirmative answer to this problem in the following case: let K(w) be an algebraic number field generated by w = (Dn — d: m)ί/n, where m, n, d, D are natural numbers satisfying the conditions m^ 1, n έ 3, d | D, 1 ^ d ^ D/2(n — 1). Then n — 1 numbers can be chosen from K(w), so that their Jacobi Algorithm becomes purely periodic. The length of the period equals n2 (or n, if d = m = 1). This is the longest period of a periodic Jacobi Algorithm ever known. In three corollaries the following special cases are investigated

New infinite classes of periodic Jacobi-Perron algorithms