Displaying similar documents to “Primitive prime factors in second-order linear recurrence sequences”

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.

Pocklington's Theorem and Bertrand's Postulate

Marco Riccardi (2006)

Formalized Mathematics

Similarity:

The first four sections of this article include some auxiliary theorems related to number and finite sequence of numbers, in particular a primality test, the Pocklington's theorem (see [19]). The last section presents the formalization of Bertrand's postulate closely following the book [1], pp. 7-9.

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...

A necessary and sufficient condition for the primality of Fermat numbers

Michal Křížek, Lawrence Somer (2001)

Mathematica Bohemica

Similarity:

We examine primitive roots modulo the Fermat number F m = 2 2 m + 1 . We show that an odd integer n ≥ 3 is a Fermat prime if and only if the set of primitive roots modulo n is equal to the set of quadratic non-residues modulo n . This result is extended to primitive roots modulo twice a Fermat number.