Factoring Polynomials with Rational Coefficients.
Factorisation in fractional powers
Factorization of matrices associated with classes of arithmetical functions
Let f be an arithmetical function. A set S = x₁,..., xₙ of n distinct positive integers is called multiple closed if y ∈ S whenever x|y|lcm(S) for any x ∈ S, where lcm(S) is the least common multiple of all elements in S. We show that for any multiple closed set S and for any divisor chain S (i.e. x₁|...|xₙ), if f is a completely multiplicative function such that (f*μ)(d) is a nonzero integer whenever d|lcm(S), then the matrix having f evaluated at the greatest common divisor of and as its...
Fermat's Equation in Matrices
The Fermat equation is solved in integral two by two matrices of determinant one as well as in finite order integral three by three matrices.
Fermat's theorem for matrices revisited
Fifteen problems in number theory.
Finding integers k for which a given Diophantine equation has no solution in kth powers of integers
Finding the roots of polynomial equations: an algorithm with linear command.
We show how an old principle, due to Walsh (1922), can be used in order to construct an algorithm which finds the roots of polynomials with complex coefficients. This algorithm uses a linear command. From the very first step, the zero is located inside a disk, so several zeros can be searched at the same time.
Finiteness of a class of Rabinowitsch polynomials
We prove that there are only finitely many positive integers such that there is some integer such that is 1 or a prime for all , thus solving a problem of Byeon and Stark.
Fixpunktmannigfaltigkeiten symplektischer Matrizen
Flat cyclotomic polynomials of order four and higher.
Fonctions entières à valeurs dans un corps de nombres
Soit un sous-groupe de rang maximal d’un corps de nombres . On montre qu’une fonction entière, envoyant dans l’anneau des entiers d’une extension finie de , de croissance analytique et arithmétique faibles est un polynôme. Ce résultat étend un théorème bien connu de Pólya. On montre également que ce résultat est à constante près optimal.
Further generalizations of the Fibonacci-coefficient polynomials.