An upper bound for least solutions of the exponential Diophantine equation D<sub>1</sub>x<sup>2</sup> - D<sub>2</sub>y<sup>2</sup> = λk<sup>z</sup> (Q5253875): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Applications of the hypergeometric method to the generalized Ramanujan-Nagell equation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of solutions of the generalized Ramanujan-Nagell equation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some exponential diophantine equations. I: The equation \(D_1x^2 - D_2y^2 = \lambda k^z\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the diophantine equation $(x^3-1)/(x-1)=(y^n-1)/(y-1)$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5582375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Diophantine equation \(nx^2+2^{2m}=y^n\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the number of solutions of the generalized Ramanujan-Nagell equation x 2 − D = p n / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some generalized Lebesgue-Nagell equations / rank
 
Normal rank

Revision as of 05:08, 10 July 2024

scientific article; zbMATH DE number 6443266
Language Label Description Also known as
English
An upper bound for least solutions of the exponential Diophantine equation D<sub>1</sub>x<sup>2</sup> - D<sub>2</sub>y<sup>2</sup> = λk<sup>z</sup>
scientific article; zbMATH DE number 6443266

    Statements

    An upper bound for least solutions of the exponential Diophantine equation D<sub>1</sub>x<sup>2</sup> - D<sub>2</sub>y<sup>2</sup> = λk<sup>z</sup> (English)
    0 references
    0 references
    0 references
    5 June 2015
    0 references
    exponential Diophantine equation
    0 references
    solution class
    0 references
    least solution
    0 references
    upper bound
    0 references

    Identifiers