Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 2 of 2 for “"Baker's Theorem"”.
-
Irreducibility Criteria For Polynomials With Non-Negative Integer Coefficients, and the Prime Factorization of F(N) For F(X) In Z[X]
… $p$-adic norm of $n$. In 1984, Stewart applied Baker's theorem to prove non-trivial, computationally effective upper bounds for $[n(n+1)...(n+k)]_S$ for any integer $k>0$. Effective upper bounds have also been given by Bennett, Filaseta, and Trifonov for $[n(n+1)]_S$ and $[n^2+7]_S$, where …
-
Classifying Polynomials With Reducible Nonreciprocal Parts and the Factorization of Values of Polynomials
… usual p-adic norm of n. In 1984, Stewart applied Baker's theorem to prove non-trivial, computationally effective upper bounds for [n(n + 1)···(n + k)]<sub>S</sub> for any integer k > 0. Effective upper bounds have also been given by Bennett, Filaseta, and Trifonov for [n(n + 1)]<sub>S</sub> and …