Displaying similar documents to “Arithmetic properties of polynomial specializations over finite fields”

On pseudoprimes having special forms and a solution of K. Szymiczek’s problem

Andrzej Rotkiewicz (2005)

Acta Mathematica Universitatis Ostraviensis

Similarity:

We use the properties of p -adic integrals and measures to obtain general congruences for Genocchi numbers and polynomials and tangent coefficients. These congruences are analogues of the usual Kummer congruences for Bernoulli numbers, generalize known congruences for Genocchi numbers, and provide new congruences systems for Genocchi polynomials and tangent coefficients.

Prime factors of values of polynomials

J. Browkin, A. Schinzel (2011)

Colloquium Mathematicae

Similarity:

We prove that for every quadratic binomial f(x) = rx² + s ∈ ℤ[x] there are pairs ⟨a,b⟩ ∈ ℕ² such that a ≠ b, f(a) and f(b) have the same prime factors and min{a,b} is arbitrarily large. We prove the same result for every monic quadratic trinomial over ℤ.

Greatest prime divisors of polynomial values over function fields

Alexei Entin (2014)

Acta Arithmetica

Similarity:

For a function field K and fixed polynomial F ∈ K[x] and varying f ∈ F (under certain restrictions) we give a lower bound for the degree of the greatest prime divisor of F(f) in terms of the height of f, establishing a strong result for the function field analogue of a classical problem in number theory.

On the Properties of the Möbius Function

Magdalena Jastrzebska, Adam Grabowski (2006)

Formalized Mathematics

Similarity:

We formalized some basic properties of the Möbius function which is defined classically as [...] as e.g., its multiplicativity. To enable smooth reasoning about the sum of this number-theoretic function, we introduced an underlying many-sorted set indexed by the set of natural numbers. Its elements are just values of the Möbius function.The second part of the paper is devoted to the notion of the radical of number, i.e. the product of its all prime factors.The formalization (which is...