We consider $N$, the number of solutions $(x,y,u,v)$ to the equation ${(-1)}^{u}r{a}^x+{(-1)}^{v}s{b}^y=c$ in nonnegative integers $x,y$ and integers $u,v\in \{0,1\}$, for given integers $a\>1$, $b\>1$, $c\>0$, $r\>0$ and $s\>0$. When $gcd(ra,sb)=1$, we show that $N\le 3$ except for a finite number of cases all of which satisfy $max(a,b,r,s,x,y)\<2·{10}^{15}$ for each solution; when $gcd(a,b)\>1$, we show that $N\le 3$ except for three infinite families of exceptional cases. We find several different ways to generate an infinite number of cases giving $N=3$ solutions.

Let $k\ge 2$ and let ${\left(P_n^{\left(k\right)}\right)}_{n\ge 2-k}$ be the $k$-generalized Pell sequence defined by $$P_n^{\left(k\right)}=2P_{n-1}^{\left(k\right)}+P_{n-2}^{\left(k\right)}+\cdots +P_{n-k}^{\left(k\right)}$$ for $n\ge 2$ with initial conditions $$P_{-(k-2)}^{\left(k\right)}=P_{-(k-3)}^{\left(k\right)}=\cdots =P_{-1}^{\left(k\right)}=P_0^{\left(k\right)}=0,P_1^{\left(k\right)}=1.$$ In this study, we handle the equation $P_n^{\left(k\right)}=y^m$ in positive integers $n$, $m$, $y$, $k$ such that $k,y\ge 2,$ and give an upper bound on $n.$ Also, we will show that the equation $P_n^{\left(k\right)}=y^m$ with $2\le y\le 1000$ has only one solution given by $P_7^{\left(2\right)}={13}^2.$

Let ${\left(L_n\right)}_{n\ge 0}$ be the Lucas sequence. We show that the Diophantine equation $L_n-L_m=M_k$ has only the nonnegative integer solutions $(n,m,k)=(2,0,1)$, $(3,1,2)$, $(3,2,1)$, $(4,3,2)$, $(5,3,3)$, $(6,2,4)$, $(6,5,3)$ where $M_k=2^k-1$ is the $k$th Mersenne number and $n>m$.

Let $W(m,n;\underline{\psi })$ denote the set of ${\psi }_1,...,{\psi }_n$–approximable points in ${ℝ}^{mn}$. The classical Khintchine–Groshev theorem assumes a monotonicity condition on the approximating functions $\underline{\psi }$. Removing monotonicity from the Khintchine–Groshev theorem is attributed to different authors for different cases of $m$ and $n$. It can not be removed for $m=n=1$ as Duffin–Schaeffer provided the counter example. We deal with the only remaining case $m=2$ and thereby remove all unnecessary conditions from the Khintchine–Groshev theorem. ...

Let $k\ge 5$ be an odd integer and $\eta$ be any given real number. We prove that if ${\lambda }_1$, ${\lambda }_2$, ${\lambda }_3$, ${\lambda }_4$, $\mu$ are nonzero real numbers, not all of the same sign, and ${\lambda }_1/{\lambda }_2$ is irrational, then for any real number $\sigma$ with $0<\sigma <1/\left(8\vartheta \right(k\left)\right)$, the inequality $$|{\lambda }_1{p}_1^2+{\lambda }_2{p}_2^2+{\lambda }_3{p}_3^2+{\lambda }_4{p}_4^2+\mu p_5^k+\eta |<{\left(\underset{1\le j\le 5}{max}{p}_j\right)}^{-\sigma }$$ has infinitely many solutions in prime variables $p_1,p_2,\cdots ,p_5$, where $\vartheta \left(k\right)=3\times 2^{(k-5)/2}$ for $k=5,7,9$ and $\vartheta \left(k\right)=[(k^2+2k+5)/8]$ for odd integer $k$ with $k\ge 11$. This improves a recent result in W. Ge, T. Wang (2018).

The sequence of balancing numbers $\left(B_n\right)$ is defined by the recurrence relation $B_n=6B_{n-1}-B_{n-2}$ for $n\ge 2$ with initial conditions $B_0=0$ and $B_1=1.$ $B_n$ is called the $n$th balancing number. In this paper, we find all repdigits in the base $b,$ which are sums of four balancing numbers. As a result of our theorem, we state that if $B_n$ is repdigit in the base $b$ and has at least two digits, then $(n,b)=(2,5),(3,6)$. Namely, $B_2=6={\left(11\right)}_5$ and $B_3=35={\left(55\right)}_6.$

For an integer $k\ge 2$, let ${\left(n\right)}_n$ be the $k-$generalized Pell sequence which starts with $0,...,0,1$ ($k$ terms) and each term afterwards is given by the linear recurrence $n=2n-1+n-2+\cdots +n-k$. In this paper, we find all $k$-generalized Pell numbers with only one distinct digit (the so-called repdigits). Some interesting estimations involving generalized Pell numbers, that we believe are of independent interest, are also deduced. This paper continues a previous work that searched for repdigits in the usual Pell sequence ${\left(P_n^{\left(2\right)}\right)}_n$. ...

Let $\left\{U_n\right\}=\left\{U_n(P,Q)\right\}$ and $\left\{V_n\right\}=\left\{V_n(P,Q)\right\}$ be the Lucas sequences of the first and second kind respectively at the parameters $P\ge 1$ and $Q\in \{-1,1\}$. In this paper, we provide a technique for characterizing the solutions of the so-called Bartz-Marlewski equation $$x^2-3xy+y^2+x=0,$$ where $(x,y)=(U_i,U_j)$ or $(V_i,V_j)$ with $i$, $j\ge 1$. Then, the procedure of this technique is applied to completely resolve this equation with certain values of such parameters.

Let $D$ be a ${𝒞}^d$ $q$-convex intersection, $d\ge 2$, $0\le q\le n-1$, in a complex manifold $X$ of complex dimension $n$, $n\ge 2$, and let $E$ be a holomorphic vector bundle of rank $N$ over $X$. In this paper, ${𝒞}^k$-estimates, $k=2,3,\cdots ,\infty$, for solutions to the $\overline{\partial }$-equation with small loss of smoothness are obtained for $E$-valued $(0,s)$-forms on $D$ when $n-q\le s\le n$. In addition, we solve the $\overline{\partial }$-equation with a support condition in ${𝒞}^k$-spaces. More precisely, we prove that for a $\overline{\partial }$-closed form $f$ in ${𝒞}_{0,q}^k(X\setminus D,E)$, $1\le q\le n-2$, $n\ge 3$, with compact support and for $\epsilon$ with $0<\epsilon <1$ there...

In this paper we prove the following theorems in incidence geometry. 1. There is $\delta >0$ such that for any $P_1,\cdots ,P_4$, and $Q_1,\cdots ,Q_n\in {ℂ}^2$, if there are $\le n^{(1+\delta )/2}$ many distinct lines between $P_i$ and $Q_j$ for all $i$, $j$, then $P_1,\cdots ,P_4$ are collinear. If the number of the distinct lines is $<c{n}^{1/2}$ then the cross ratio of the four points is algebraic. 2. Given $c>0$, there is $\delta >0$ such that for any $P_1,P_2,P_3\in {ℂ}^2$ noncollinear, and $Q_1,\cdots ,Q_n\in {ℂ}^2$, if there are $\le c{n}^{1/2}$ many distinct lines between $P_i$ and $Q_j$ for all $i$, $j$, then for any $P\in {ℂ}^2\setminus \{P_1,P_2,P_3\}$, we have $\delta n$ distinct lines between $P$ and $Q_j$. 3. Given...