The generalized Pillai equation ±rax±sby=c\pm r a^x \pm s b^y = c, II

preprint2011arXivOpen access

Abstract

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

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.