Advanced Search

In this paper, we use Baker’s method, based on linear forms of logarithms, to solve a family of Thue equations associated with a family of number fields of degree 3. We obtain all solutions to the Thue equation $$\begin{array}{cc}\hfill {\Phi }_n(x,y)& =x^3+(n^8+2n^6-3n^5+3n^4-4n^3+5n^2-3n+3)x^{2}y\hfill \\ & -(n^3-2)n^{2}x{y}^2-y^3=\pm 1,\hfill \end{array}$$ for $n\ge 0$.

In 2000, Florian Luca proved that F₁₀ = 55 and L₅ = 11 are the largest numbers with only one distinct digit in the Fibonacci and Lucas sequences, respectively. In this paper, we find terms of a linear recurrence sequence with only one block of digits in its expansion in base g ≥ 2. As an application, we generalize Luca's result by finding the Fibonacci and Lucas numbers with only one distinct block of digits of length up to 10 in its decimal expansion.

We find all the solutions of the Diophantine equation $x²+2^{\alpha }{13}^{\beta }=yⁿ$ in positive integers x,y,α,β,n ≥ 3 with x and y coprime.

In this paper, we find all the solutions of the Diophantine equation $B_1^p+2B_2^p+\cdots +k{B}_k^p=B_n^q$ in positive integer variables $(k,n)$, where $B_i$ is the $i^{th}$ balancing number if the exponents $p$, $q$ are included in the set $\{1,2\}$.

We give the answer to the question in the title by proving that $$L_{18}=5778=5555+222+1$$ is the largest Lucas number expressible as a sum of exactly three repdigits. Therefore, there are many Lucas numbers which are sums of three repdigits.

Let $p_1,p_2,\cdots$ be the sequence of all primes in ascending order. Using explicit estimates from the prime number theory, we show that if $k\ge 5$, then $$(p_{k+1}-1)!\mid \left(\frac{1}{2}(p_{k+1}-1)\right)!p_k!,$$ which improves a previous result of the second author.

We show that the only Lucas numbers which are factoriangular are $1$ and $2$.

In this paper, we find all solutions of the Diophantine equation $x^2+2^{\alpha }{5}^{\beta }{17}^{\gamma }=y^n$ in positive integers $x,y\ge 1$, $\alpha ,\beta ,\gamma ,n\ge 3$ with $gcd(x,y)=1$.

For any positive integer $k\ge 2$, let ${\left(P_n^{\left(k\right)}\right)}_{n\ge 2-k}$ be the $k$-generalized Pell sequence which starts with $0,\cdots ,0,1$ ($k$ terms) with the linear recurrence $$P_n^{\left(k\right)}=2P_{n-1}^{\left(k\right)}+P_{n-2}^{\left(k\right)}+\cdots +P_{n-k}^{\left(k\right)}\text{for}n\ge 2.$$ Let ${\left(N_n\right)}_{n\ge 0}$ be Narayana’s sequence given by $$N_0=N_1=N_2=1\text{and}{N}_{n+3}=N_{n+2}+N_n.$$ The purpose of this paper is to determine all $k$-Pell numbers which are sums of two Narayana’s numbers. More precisely, we study the Diophantine equation $$P_p^{\left(k\right)}=N_n+N_m$$ in nonnegative integers $k$, $p$, $n$ and $m$.

Let $P_m$ and $E_m$ be the $m$-th Padovan and Perrin numbers respectively. Let $r,s$ be non-zero integers with $r\ge 1$ and $s\in \{-1,1\}$, let ${\left\{U_n\right\}}_{n\ge 0}$ be the generalized Lucas sequence given by $U_{n+2}=r{U}_{n+1}+s{U}_n$, with $U_0=0$ and $U_1=1.$ In this paper, we give effective bounds for the solutions of the following Diophantine equations $$P_m=U_n{U}_k\text{and}{E}_m=U_n{U}_k,$$ where $m$, $n$ and $k$ are non-negative integers. Then, we explicitly solve the above Diophantine equations for the Fibonacci, Pell and balancing sequences.