2000 character limit reached
Solution of certain Diophantine equations in Gaussian integers (2409.20416v2)
Published 30 Sep 2024 in math.NT
Abstract: In this article, we show that the quartic Diophantine equations $x4 \pm pqy4=\pm z2$ and $ x4 \pm pq y4= \pm iz2$ have only trivial solutions for some primes $p$ and $q$ satisfying conditions $ p \equiv 3 \pmod 8, ~ q \equiv 1 \pmod 8 ~\text{and}~ \displaystyle\legendre{p}{q} = -1$. Here we have found the torsion of the two families of elliptic curves to find the solutions of given Diophantine equations. Moreover, we also calculate the rank of these two families of elliptic curves over the Gaussian field $\mathbb{Q}(i)$.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.