Handling a large bound for a problem on the generalized Pillai equation $\pm r a^x \pm s b^y = c$

Mathematics – Number Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

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$. Previous work showed that there are nine essentially distinct $(a,b,c,r,s)$ for which $N \ge 4$, except possibly for cases in which the solutions have $r$, $a$, $x$, $s$, $b$, and $y$ each bounded by $8 \cdot 10^{14}$ or $2 \cdot 10^{15}$. In this paper we show that there are no further cases with $N \ge 4$ within these bounds. We note that $N = 3$ for an infinite number of $(a,b,c,r,s)$, even if we eliminate from consideration cases which are directly derived from other cases in one of several completely designated ways. Our work differs from previous work in that we allow $x$ and $y$ to be zero and also allow choices of $(u,v)$ other than $(0,1)$.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Handling a large bound for a problem on the generalized Pillai equation $\pm r a^x \pm s b^y = c$ does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Handling a large bound for a problem on the generalized Pillai equation $\pm r a^x \pm s b^y = c$, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Handling a large bound for a problem on the generalized Pillai equation $\pm r a^x \pm s b^y = c$ will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-54437

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.