On the diophantine equation \(ap^ x+bq^ y=c+dp^ zq^ w\) (Q915763): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Exponential diophantine equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3338318 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Products of Prime Powers in Binary Recurrence Sequences Part I: The Hyperbolic Case, with an Application to the Generalized Ramanujan-Nagell Equation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4143406 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3744223 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3671246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for linear forms in logarithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993308 / rank
 
Normal rank

Latest revision as of 09:41, 21 June 2024

scientific article
Language Label Description Also known as
English
On the diophantine equation \(ap^ x+bq^ y=c+dp^ zq^ w\)
scientific article

    Statements

    On the diophantine equation \(ap^ x+bq^ y=c+dp^ zq^ w\) (English)
    0 references
    1990
    0 references
    It is shown that the title equation (an exponential diophantine equation in x, y, z, and w, where p, q, a, b, c, d are fixed positive integers with \((p,q)=1)\) can be essentially solved, by proving the existence of effectively computable upper bounds on the solutions. Use is made of theorems of \textit{J.-H. Evertse} [Compos. Math. 53, 225-244 (1984; Zbl 0547.10008), Corollary 1, p. 225], \textit{A. J. van der Poorten} [Transcend. Theory, Adv. Appl., Proc. Conf., Cambridge 1976, 29-57 (1977; Zbl 0367.10034), Theorem 1] and \textit{M. Waldschmidt} [Acta Arith. 37, 257-283 (1980; Zbl 0357.10017), Main result]. The author claims that all constants involved can be explicitly computed in terms of the parameters. Moreover, the large bounds may be reduced so as to allow the practical solution of the equation. Demonstrations are given by the special equations \((p,q,a,b,c,d)=(2,3,1,1,1,1)\) and (2,3,5,7,11,1).
    0 references
    0 references
    exponential diophantine equation
    0 references
    existence of effectively computable upper bounds
    0 references