Displaying similar documents to “The Diophantine equation f(x) = g(y)”

On the computation of the GCD of 2-D polynomials

Panagiotis Tzekis, Nicholas Karampetakis, Haralambos Terzidis (2007)

International Journal of Applied Mathematics and Computer Science

Similarity:

The main contribution of this work is to provide an algorithm for the computation of the GCD of 2-D polynomials, based on DFT techniques. The whole theory is implemented via illustrative examples.

On three questions concerning 0 , 1 -polynomials

Michael Filaseta, Carrie Finch, Charles Nicol (2006)

Journal de Théorie des Nombres de Bordeaux

Similarity:

We answer three reducibility (or irreducibility) questions for 0 , 1 -polynomials, those polynomials which have every coefficient either 0 or 1 . The first concerns whether a naturally occurring sequence of reducible polynomials is finite. The second is whether every nonempty finite subset of an infinite set of positive integers can be the set of positive exponents of a reducible 0 , 1 -polynomial. The third is the analogous question for exponents of irreducible 0 , 1 -polynomials.

On Garcia numbers.

Brunotte, Horst (2009)

Acta Mathematica Academiae Paedagogicae Nyí regyháziensis. New Series [electronic only]

Similarity: