A note on the Diophantine equation $x\sp{n}+y\sp{n}+z\sp{n}=3$

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Note on primitive permutation groups and a diophantine equation

If a group G has a maximal subgroup H, tl-.en G acts by right multiplication on the set fi of right cosets of H in G as a primitive, but not necessarily faithful, permutation group. As part of the search for new finite simple groups it is of interest to determine all possible groups G, and in particular all simple groups, which contain a given group H as a maximal subgroup. This problem is very...

متن کامل

On a Diophantine Equation

In this note, we mainly obtain the equation x2m − yn = z2 have finite positive integer solutions (x, y, z,m, n) satisfying x > y be two consecutive primes. Mathematics Subject Classification: 11A41; 11D41

متن کامل

On the Diophantine Equation

In this paper, we study the Diophantine equation x2 + C = 2yn in positive integers x, y with gcd(x, y) = 1, where n ≥ 3 and C is a positive integer. If C ≡ 1 (mod 4) we give a very sharp bound for prime values of the exponent n; our main tool here is the result on existence of primitive divisors in Lehmer sequence due Bilu, Hanrot and Voutier. When C 6≡ 1 (mod 4) we explain how the equation can...

متن کامل

On the Diophantine Equation

= c for some integers a, b, c with ab 6= 0, has only finitely many integer solutions. Stoll & Tichy proved more generally that if a, b, c ∈ Q and ab 6= 0, then for m > n ≥ 3, the above equation has only finitely many integral solutions x, y. Independently, Rakaczki established a more precise finiteness result on this binomial equation and extended this result to more general equations (see Acta...

متن کامل

On the Diophantine Equation

If a, b and n are positive integers with b ≥ a and n ≥ 3, then the equation of the title possesses at most one solution in positive integers x and y, with the possible exceptions of (a, b, n) satisfying b = a + 1, 2 ≤ a ≤ min{0.3n, 83} and 17 ≤ n ≤ 347. The proof of this result relies on a variety of diophantine approximation techniques including those of rational approximation to hypergeometri...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematics of Computation

سال: 1984

ISSN: 0025-5718

DOI: 10.1090/s0025-5718-1984-0726000-9