“…Clearly,e fficient algorithms to compute resultants are connected to the GCD problem and we refer to Collins (1971) [42], Schwartz (1980) [157], and Rothstein (1984) [145].…”
Section: Integerand Polynomial Greatest Common Divisor (Gcd)mentioning
“…Clearly,e fficient algorithms to compute resultants are connected to the GCD problem and we refer to Collins (1971) [42], Schwartz (1980) [157], and Rothstein (1984) [145].…”
Section: Integerand Polynomial Greatest Common Divisor (Gcd)mentioning
ABSTRACT. We show that if the first case of Fermat's Last Theorem is false for prime exponent p then p2 divides qp -q for all primes q < 8q. As a corollary we state the theorem of the title.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.