Related papers: Some experiments with Ramanujan-Nagell type Diopha…
Let $p$ be a prime number with $p>3$, $p\equiv 3\pmod{4}$ and let $n$ be a positive integer. In this paper, we prove that the Diophantine equation $(5pn^{2}-1)^{x}+(p(p-5)n^{2}+1)^{y}=(pn)^{z}$ has only the positive integer solution…
Let L_t denote the t-th Lucas number. We prove that the Diophantine equation L_m^{n+k} + L_m^n = L_r has no solutions in positive integers r, m, n, and k with m >= 2. In the case n = 1, the proof is based on a precise factorization formula…
Let $a, b\in \mathbb{N}$ be relatively prime. Previous work showed that exactly one of the two equations $ax + by = (a-1)(b-1)/2$ and $ax + by + 1 = (a-1)(b-1)/2$ has a nonnegative, integral solution; furthermore, the solution is unique.…
Let $k,l\geq2$ be fixed integers. In this paper, firstly, we prove that all solutions of the equation $(x+1)^{k}+(x+2)^{k}+...+(lx)^{k}=y^{n}$ in integers $x,y,n$ with $x,y\geq1, n\geq2$ satisfy $n<C_{1}$ where $C_{1}=C_{1}(l,k)$ is an…
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…
We give the complete solution in integers $(n,a,b,x,y)$ of the title equation when $\gcd(x,y)=1$, except for the case when $xab$ is odd.
The objective of the paper is to determine the complete solutions for the Diophantine equation $x^2 + 3^{\alpha}113^{\beta} = y^{\mathfrak{n}}$ in positive integers $x$ and $y$ (where $x, y \geq 1$), non-negative exponents $\alpha$ and…
In this paper, we determine the primitive solutions of the Diophantine equation $(x-d)^2+x^2+(x+d)^2=y^n$ when $n\geq 2$ and $d=p^b$, $p$ a prime and $p\leq 10^4$. The main ingredients are the characterization of primitive divisors on…
We find all solutions of Diophantine equation x^{2}+11^{2k} = y^{n} where x>=1, y>=1, n>=3 and k is natural number. We give p-adic interpretation of this equation.
Let $D_{1}$, $D_{2}$ be coprime odd integers with min$(D_{1},D_{2})>1$, and let $N(D_{1},D_{2})$ denote the number of positive integer solutions $(x, m, n)$ of the equation $D_{1}x^2+D_{2}^{m}=2^{n+2}$. In this paper, we prove that…
In this note we will analyze a diophantine equation raised by Michael Bennett in [1] that is pivotal in establishing that powers of five has few digits in its ternary expansion. We will show that the Diophantine equation…
The Brocard-Ramanujan problem pertaining to the diophantine equation $n!+1=m^2$, a famously unsolved problem, deals with finding the integer solutions to the equation. Nobody has discovered any new solution of the problem beyond $n=4,~5$…
Let $(P_n)_{n\ge 0}$ and $(Q_n )_{n\ge 0}$ be the Pell and Pell-Lucas sequences. Let $b$ be a positive integer such that $b\ge 2.$ In this paper, we prove that the following two Diophantine equations $P_{n}=b^{d}P_{m}+Q_{k}$ and…
We study purely exponential Diophantine equations with four terms of consecutive bases. Notably, we prove that all solutions to the equation \[ n^x=(n+1)^y+(n+2)^z+(n+3)^w \] in positive integers $n,x,y,z$ and $w$ are given by…
This paper explores the intricate relationships between Lucas numbers and Diophantine equations, offering significant contributions to the field of number theory. We first establish that the equation regarding Lucas number $L_n = 3x^2$ has…
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 the fall 2011 issue of the Journal'Mathematics and Computer Education', author Unal Hasan, in the one page article "Proof without Words", gives a purely geometric proof of the equality, arctan(1/3)+ arctan(1/7) = arctan(1/2) (1) (See…
Let $\lambda_i, \mu_j$ be non-zero real numbers not all of the same sign and let $a_i, b_k$ be non-zero integers not all of the same sign. We investigate a mixed Diophantine system of the shape \begin{equation*} \begin{cases} \left|…
In this paper, we proved that there are infinitely many integer solutions of $X^6 - Y^6 = W^n - Z^n,\ n=2,3,4$.
In this paper, we consider the exponential Diophantine equation \( (2^k-1)(b^k-1)=y^q \) with $k\ge 2$, odd integer $b$ and an odd prime exponent $q$ and obtain effective upper bounds for $q$ in terms of $b$. In particular, we show that…