Abstract:In this paper we consider N, the number of solutions (x, y, u, v) to the equation (−1) u ra x + (−1) v sb y = c in positive integers x, y and integers u, v ∈ {0, 1}, for given integers a > 1, b > 1, c > 0, r > 0 and s > 0. We show that N 2 when gcd(ra, sb) = 1, except for a finite number of cases that can be found in a finite number of steps. For arbitrary gcd(ra, sb) with (u, v) = (0, 1), we show that N 3 with an infinite number of cases for which N = 3.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.