اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدOn the generalized Fermat equation $a^2+3b^6=c^n$
82
0
0.0
(
0
)
تأليف
Angelos Koutsianas
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In this paper, we prove that the only primitive solutions of the equation $a^2+3b^6=c^n$ for $ngeq 3$ are $(a,b,c,n)=(pm 47,pm 2,pm 7,4)$. Our proof is based on the modularity of Galois representations of $mathbb Q$-curves and the work of Ellenberg for big values of $n$ and a variety of techniques for small $n$.
قيم البحث
اقرأ أيضاً
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 p
roofs are Bakers theory and Bilu-Hanrot-Voutiers result on primitive divisors of Lucas numbers.
In this paper, we characterize meromorphic solutions $f(z_1,z_2),g(z_1,z_2)$ to the generalized Fermat Diophantine functional equations $h(z_1,z_2)f^m+k(z_1,z_2)g^n=1$ in $mathbf{C}^2$ for integers $m,ngeq2$ and nonzero meromorphic functions $h(z_1,z
_2),k(z_1,z_2)$ in $mathbf{C}^2$. Meromorphic solutions to associated partial differential equations are also studied.
Quadratic functions have applications in cryptography. In this paper, we investigate the modular quadratic equation $$ ax^2+bx+c=0 quad (mod ,, 2^n), $$ and provide a complete analysis of it. More precisely, we determine when this equation has a solu
tion and in the case that it has a solution, we not only determine the number of solutions, but also give the set of solutions in $O(n)$ time. One of the interesting results of our research is that, when this equation has a solution, then the number of solutions is a power of two.
The purpose of the present article is to show how the modular method together with different techniques can be used to prove non-existence of primitive non-trivial solutions of the equation $x^2+dy^6=z^p$ for square-free values $1 le d le 20$ followi
ng the approach of [PT]. The main innovation is to make use of the symplectic argument over ramified extensions to discard solutions, together with a multi-Frey approach to deduce large image of Galois representations.
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.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
