Prefer a chat interface with context about you and your work?
ON THE NUMBER OF SOLUTIONS OF THE DIOPHANTINE EQUATION<i>ax</i><sup><i>m</i></sup>โ<i>by</i><sup><i>n</i></sup>=<i>c</i>
Abstract Let a , b , c , x and y be positive integers. In this paper we sharpen a result of Le by showing that the Diophantine equation has at most two positive integer solutions ( m , n ) satisfying min ( m , n )>1.