The Exponential Diophantine Equation 2x+by=cz
Yahui Yu, Xiaoxue Li
Abstract
Open-access reader
Yahui Yu, Xiaoxue Li
Abstract
Open-access reader
Let b and c be fixed coprime odd positive integers with min{b, c} > 1. In this paper, a classification of all positive integer solutions (x, y, z) of the equation 2 (x) + b (y) = c (z) is given. Further, by an elementary approach, we prove that if c = b + 2, then the equation has only the positive integer solution (x, y, z) = (1,1, 1), except for (b, x, y, z) = (89,13,1, 2) and (2 (r) - 1, r + 2,2, 2), where r is a positive integer with r ≥ 2.
OpenAlex reports 146 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Let b and c be fixed coprime odd positive integers with min{b, c} > 1. In this paper, a classification of all positive integer solutions (x, y, z) of the equation 2 (x) + b (y) = c (z) is given. Further, by an elementary approach, we prove that if c = b + 2, then the equation has only the positive integer solution (x, y, z) = (1,1, 1), except for (b, x, y, z) = (89,13,1, 2) and (2 (r) - 1, r + 2,2, 2), where r is a positive integer with r ≥ 2.
Key concepts: Algorithm, Computer science