اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدOn the exponential Diophantine equation $(n-1)^{x}+(n+2)^{y}=n^{z}$
163
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Suppose that $n$ is a positive integer. In this paper, we show that the exponential Diophantine equation $$(n-1)^{x}+(n+2)^{y}=n^{z}, ngeq 2, xyz eq 0$$ has only the positive integer solutions $(n,x,y,z)=(3,2,1,2), (3,1,2,3)$. The main tools on the proofs are Bakers theory and Bilu-Hanrot-Voutiers result on primitive divisors of Lucas numbers.
قيم البحث
اقرأ أيضاً
In this paper, we determine the primitive solutions of the Diophantine equation $(x-d)^2+x^2+(x+d)^2=y^n$ when $ngeq 2$ and $d=p^b$, $p$ a prime and $pleq 10^4$. The main ingredients are the characterization of primitive divisors on Lehmer sequences
and the development of an algorithmic method of proving the non-existence of integer solutions of the equation $f(x)=a^b$, where $f(x)inmathbb Z[x]$, $a$ a positive integer and $b$ an arbitrary positive integer.
This work determine the entire family of positive integer solutions of the diophantine equation. The solution is described in terms of $frac{(m-1)(m+n-2)}{2} $ or $frac{(m-1)(m+n-1)}{2}$ positive parameters depending on $n$ even or odd. We find the s
olution of a diophantine system of equations by using the solution of the diophantine equation. We generalized all the results of the paper [5].
Let $f(x)=x^{2}(x^{2}-1)(x^{2}-2)(x^{2}-3).$ We prove that the Diophantine equation $ f(x)=2f(y)$ has no solutions in positive integers $x$ and $y$, except $(x, y)=(1, 1)$.
In this paper, we solve the equation of the title under the assumption that $gcd(x,d)=1$ and $ngeq 2$. This generalizes earlier work of the first author, Patel and Siksek [BPS16]. Our main tools include Frey-Hellegouarch curves and associated modular
forms, and an assortment of Chabauty-type techniques for determining rational points on curves of small positive genus.
We show that the largest prime factor of $n^2+1$ is infinitely often greater than $n^{1.279}$. This improves the result of de la Bret`eche and Drappeau (2019) who obtained this with $1.2182$ in place of $1.279.$ The main new ingredients in the proof
are a new Type II estimate and using this estimate by applying Harmans sieve method. To prove the Type II estimate we use the bounds of Deshouillers and Iwaniec on linear forms of Kloosterman sums. We also show that conditionally on Selbergs eigenvalue conjecture the exponent $1.279$ may be increased to $1.312.$
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
