On the ratio of values of a polynomial (Q1059098)

For given positive integers \(a>b\) consider the diophantine equation \[ (*)\quad a (x+1)...(x+k)=b (y+1)...(y+k) \] with positive integers k,x,y. One of the author's results is: if \(\alpha:=\log (b/a)/\log (x/y)>0\) then there exists an effectively computable constant C such that (*) with \(k\geq C\) implies \(k=[\alpha +1]\). Applying Baker's estimates of linear forms in logarithms the author proves Theorem 2: (*) implies that max(k,x,y) is bounded by an effectively computable number depending only on a,b and the greatest prime factor of x y. - Further results are given and more general equations are also considered.