Related papers: Superelliptic equations arising from sums of conse…

Here, we find all positive integer solutions of the Diophantine equation in the title, where $(\mathcal{U}_n)_{n\geqslant 0}$ is the generalized Lucas sequence $\mathcal{U}_0=0, \ \mathcal{U}_1=1$ and $\mathcal{U}_{n+1}=r \mathcal{U}_n +s…

Let $r, v, n$ be positive integers. This paper investigate the number of solutions $s_{r,v}(n)$ of the following infinite Diophantine equations $$ n=1^{r}\cdot |k_{1}|^{v}+2^{r}\cdot |k_{2}|^{v}+3^{r}\cdot |k_{3}|^{v}+\ldots, $$ for ${\bf…

In this paper we find non-negative integer solutions for exponential Diophantine equations of the type $p \cdot 3^x+ p^y=z^2,$ where $p$ is a prime number. We prove that such equation has a unique solution…

We solve the two Diophantine equations $P_k=J_n+J_m$ and $Q_k=J_n+J_m$ where $\left\lbrace P_{k}\right\rbrace_{k\geq0}$, $\left\lbrace Q_{k}\right\rbrace_{k\geq0}$ and $\left\lbrace J_{k}\right\rbrace_{k\geq0}$ are the sequences of Pell…

In this note we find all the solutions of the Diophantine equation $x^4\pm y^4=iz^2$ using elliptic curves over $\mathbb Q(i)$. Also, using the same method we give a new proof of Hilbert's result that the equation $x^4\pm y^4=z^2$ has only…

In 1876 Brocard, and independently in 1913 Ramanujan, asked to find all integer solutions for the equation $n!=x^2-1$. It is conjectured that this equation has only three solutions, but up to now this is an open problem. Overholt observed…

We are motivated by a result of Alzer and Luca who presented all the integer solutions to the relations $(k!)^n-k^n=(n!)^k-n^k$ and $(k!)^n+k^n=(n!)^k+n^k$. We modify the equations by considering the double factorial instead and present all…

A conjecture of N. Terai states that for any integer $k>1$, the equation $x^2+(2k-1)^y =k^z$ has only one solution, namely, $(x, y, z) = (k-1, 1, 2).$ Using the structure of class groups of binary quadratic forms, we prove the conjecture…

From a known result of diophantine equations of the first degree with 2 unknowns we simply find the results of the distribution function of the sequences of positive integers generated by the functions at the origin of the 3x+1 and 5x+1…

Let $(U_n)_{n\geq 0}$ be a fixed linear recurrence sequence of integers with order at least two, and for any positive integer $\ell$, let $\ell \cdot 2^{\ell} + 1$ be a Cullen number. Recently in \cite{bmt}, generalized Cullen numbers in…

This paper finds all Lucas numbers which are the sum of two Jacobsthal numbers. It also finds all Jacobsthal numbers which are the sum of two Lucas numbers. In general, we find all non-negative integer solutions $(n, m, k)$ of the two…

In this paper, we prove results about solutions of the Diophantine equation $x^p+y^p=z^3$ over various number fields using the modular method. Firstly, by assuming some standard modularity conjecture we prove an asymptotic result for…

The main result of the present paper is the construction of fundamental solutions for a class of multidimensional elliptic equations with three singular coefficients, which could be expressed in terms of a confluent hypergeometric function…

In this paper, we introduce a new class of confluent hypergeometric functions of many variables, study their properties, and determine a system of partial differential equations that this function satisfies. It turns out that all the…

In this paper we determine possible decompositions of Euler polynomials $E_k(x)$, i.e. possible ways of writing Euler polynomials as a functional composition of polynomials of lower degree. Using this result together with the well-known…

We prove that for given integers b and c, the diophantine equation x^2+bx+c=y^2, has finitely many integer solutions(i.e. pairs in ZxZ),in fact an even number of such solutions(including the zero or no solutions case).We also offer an…

Let f(n)=1 if n=1, 2^(2^(n-2)) if n \in {2,3,4,5}, (2+2^(2^(n-4)))^(2^(n-4)) if n \in {6,7,8,...}. We conjecture that if a system T \subseteq {x_i+1=x_k, x_i \cdot x_j=x_k: i,j,k \in {1,...,n}} has only finitely many solutions in positive…

Let $A,B,C,D$ be rational numbers such that $ABC \neq 0$, and let $n_1>n_2>n_3>0$ be positive integers. We solve the equation $$ Ax^{n_1}+Bx^{n_2}+Cx^{n_3}+D = f(g(x)),$$ in $f,g \in \mathbb{Q}[x]$. In sequel we use Bilu-Tichy method to…

In this paper we present a new method of solving the classical diophantine equation $A^4+B^4=C^4+D^4$. Two methods of solving this equation, given by Euler, yield parametric solutions given by polynomials of degrees 7 and 13. Several other…

In this paper we examine the diophantine equation $x^k-y^k=x-y$ where $k$ is a positive integer $\geq 2$, and consider its applications. While the complete solution of the equation $x^k-y^k=x-y$ in positive rational numbers is already known…