1,003 research outputs found

    A new upper bound for odd perfect numbers of a special form

    Full text link
    We shall given a new effectively computable upper bound of odd perfect numbers whose Euler factors are powers of fixed exponent, improving our old result in T. Yamada, Colloq. Math. 103 (2005), 303--307.Comment: 10 pages, the author's revised version; 3 pages, corrigendum to the previous (published in the journal) versio

    Searching for Diophantine quintuples

    Full text link
    We consider Diophantine quintuples {a,b,c,d,e}\{a, b, c, d, e\}. These are sets of distinct positive integers, the product of any two elements of which is one less than a perfect square. It is conjectured that there are no Diophantine quintuples; we improve on current estimates to show that there are at most 1.18β‹…10271.18\cdot 10^{27} Diophantine quintuples.Comment: 15 page

    On a conjecture on exponential Diophantine equations

    Full text link
    We study the solutions of a Diophantine equation of the form ax+by=cza^x+b^y=c^z, where a≑2(mod4)a\equiv 2 \pmod 4, b≑3(mod4)b\equiv 3 \pmod 4 and gcd⁑(a,b,c)=1\gcd (a,b,c)=1. The main result is that if there exists a solution (x,y,z)=(2,2,r)(x,y,z)=(2,2,r) with r>1r>1 odd then this is the only solution in integers greater than 1, with the possible exception of finitely many values (c,r)(c,r). We also prove the uniqueness of such a solution if any of aa, bb, cc is a prime power. In a different vein, we obtain various inequalities that must be satisfied by the components of a putative second solution

    A Survey on the Ternary Purely Exponential Diophantine Equation ax+by=cza^x + b^y = c^z

    Get PDF
    Let aa, bb, cc be fixed coprime positive integers with min⁑{a,b,c}>1\min\{a,b,c\}>1. In this survey, we consider some unsolved problems and related works concerning the positive integer solutions (x,y,z)(x,y,z) of the ternary purely exponential diophantine equation ax+by=cza^x + b^y = c^z

    On the Diophantine equation x2+q2m=2ypx^2+q^{2m}=2y^p

    Full text link
    In this paper we consider the Diophantine equation x2+q2m=2ypx^2+q^{2m}=2y^p where m,p,q,x,ym,p,q,x,y are integer unknowns with m>0,m>0, pp and qq are odd primes and gcd⁑(x,y)=1.\gcd(x,y)=1. We prove that there are only finitely many solutions (m,p,q,x,y)(m,p,q,x,y) for which yy is not a sum of two consecutive squares. We also study the above equation with fixed yy and with fixed $q.
    • …
    corecore