A new condition equivalent to the Ankeny-Artin-Chowla conjecture (Q1786696): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q123020415, #quickstatements; #temporary_batch_1710346988437
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jnt.2018.04.011 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2805991753 / rank
 
Normal rank

Revision as of 23:43, 19 March 2024

scientific article
Language Label Description Also known as
English
A new condition equivalent to the Ankeny-Artin-Chowla conjecture
scientific article

    Statements

    A new condition equivalent to the Ankeny-Artin-Chowla conjecture (English)
    0 references
    0 references
    0 references
    24 September 2018
    0 references
    Let \(p\equiv 1\pmod{4}\) be a prime number and let \(\varepsilon=(t+u\sqrt{p})/2\) be the fundamental unit of \(\mathbb Q(\sqrt{p})\). The Ankeny-Artin-Chowla conjecture states that \(u\not\equiv 0\pmod{p}\). An analogous conjecture for primes \(p\equiv 3\pmod{4}\) is due to Mordell. The main results of this paper are two equivalent conditions for the above conjectures in terms of Lucas polynomials \(L_n(x)\) and Vieta-Lucas polynomials \(L_n^-(x)\), which are defined by \(L_0(x)=L_0^-(x)=2\), \(L_1(x)=L_1^-(x)=x\) and \(L_n(x)=xL_{n-1}(x)+L_{n-2}(x)\), \(L_n^-(x)=xL_{n-1}^-(x)-L_{n-2}^-(x)\) for \(n\geq 2\). More precisely it is shown that the Ankeny-Artin-Chowla conjecture holds if and only if there exists an integer \(c>0\) such that \(a_1=L_p(c)\) is the smallest positive integer solution for \(a\) in the diophantine equation \(a^2+4=p^3b^2\). The result concerning the conjecture by Mordell is very similar, involving \(L_p^-(x)\) instead of \(L_p(x)\).
    0 references
    Ankeny-Artin-Chowla conjecture
    0 references
    fundamental unit
    0 references
    Lucas polynomial
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references