Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
Radical bound for Zaremba's conjecture - MaRDI portal

Radical bound for Zaremba's conjecture (Q6593636)

From MaRDI portal





scientific article; zbMATH DE number 7902257
Language Label Description Also known as
English
Radical bound for Zaremba's conjecture
scientific article; zbMATH DE number 7902257

    Statements

    Radical bound for Zaremba's conjecture (English)
    0 references
    0 references
    27 August 2024
    0 references
    The author makes a thorough study of the developments concerning \textit{S. K. Zaremba}'s conjecture [in: Appl. Number Theory Numer. Analysis, Proc. Sympos. Univ. Montreal 1971, 39--119 (1972; Zbl 0246.65009)]:\N\Nfor each positive integer \(q\geq 2\), there exists a positive integer \(1\leq a < q\), coprime to \(q\), such that if you expand \(a/q\) into a continued fraction \(a/q=[a_1,\ldots,a_n]\), all of the coefficients of the \(a_i\)'s are bounded by some absolute constant \(\mathcal{T}\), independent of \(q\).\N\NThe layout of the paper is as follows:\N\N\S1. Introduction and main result (\(2\) pages).\N\NThis contains a short history of the developments with respect to (partial) proofs of the conjecture and gives the main theorem of the paper:\N\NTheorem 1.2. For any integer \(q\geq 2\), such that \(q\not= 2^n,3^n\), there exists a positive integer \(a\) with \(1\leq a< q\) and \(\text{gcd}(a,q)=1\), such that \(K(a/q)\leq\text{rad}(q)-1\) (here \(\text{rad}(n)=\prod_{p|n,p\,\text{prime}}\ p\)).\N\N\S2. Proof of the main result (\(5\) pages).\N\NReferences (\(19\) items).
    0 references
    Zaremba's conjecture
    0 references
    continued fractions
    0 references
    the `radical' of a number
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references