On a diophantine inequality involving prime numbers
D. I. Tolev (1992)
Acta Arithmetica
Similarity:
D. I. Tolev (1992)
Acta Arithmetica
Similarity:
Peter Söhne (1993)
Acta Arithmetica
Similarity:
Kai-Man Tsang (1995)
Acta Arithmetica
Similarity:
Ti Zuo Xuan (1993)
Acta Arithmetica
Similarity:
Maohua Le (1997)
Acta Arithmetica
Similarity:
1. Introduction. Let ℤ, ℕ, ℚ be the sets of integers, positive integers and rational numbers respectively. In [7], Ribenboim proved that the equation (1) , x,y,m,n ∈ ℕ, x > 1, n > m ≥ 1, has no solution (x,y,m,n) with 2|x and (1) has only finitely many solutions (x,y,m,n) with 2∤x. Moreover, all solutions of (1) with 2∤x satisfy max(x,m,n) < C, where C is an effectively computable constant. In this paper we completely determine all solutions of (1) as follows. Theorem....
Zhi Wei Sun (1995)
Acta Arithmetica
Similarity:
D. I. Tolev (1995)
Acta Arithmetica
Similarity:
Dress, Andreas W.M., Wenzel, Walter (1989)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
Jeffrey Stopple (1995)
Acta Arithmetica
Similarity: