Displaying similar documents to “The Perfect Number Theorem and Wilson's Theorem”

Proth Numbers

Christoph Schwarzweller (2014)

Formalized Mathematics

Similarity:

In this article we introduce Proth numbers and prove two theorems on such numbers being prime [3]. We also give revised versions of Pocklington’s theorem and of the Legendre symbol. Finally, we prove Pepin’s theorem and that the fifth Fermat number is not prime.

Basic Properties of Primitive Root and Order Function

Na Ma, Xiquan Liang (2012)

Formalized Mathematics

Similarity:

In this paper we defined the reduced residue system and proved its fundamental properties. Then we proved the basic properties of the order function. Finally, we defined the primitive root and proved its fundamental properties. Our work is based on [12], [8], and [11].

Uniqueness of Factoring an Integer and Multiplicative Group Z/pZ*

Hiroyuki Okazaki, Yasunari Shidama (2008)

Formalized Mathematics

Similarity:

In the [20], it had been proven that the Integers modulo p, in this article we shall refer as Z/pZ, constitutes a field if and only if Z/pZ is a prime. Then the prime modulo Z/pZ is an additive cyclic group and Z/pZ* = Z/pZ{0is a multiplicative cyclic group, too. The former has been proven in the [23]. However, the latter had not been proven yet. In this article, first, we prove a theorem concerning the LCM to prove the existence of primitive elements of Z/pZ*. Moreover we prove the...

Odd perfect polynomials over 𝔽 2

Luis H. Gallardo, Olivier Rahavandrainy (2007)

Journal de Théorie des Nombres de Bordeaux

Similarity:

A perfect polynomial over 𝔽 2 is a polynomial A ∈ 𝔽 2 [ x ] that equals the sum of all its divisors. If gcd ( A , x 2 + x ) = 1 then we say that A is odd. In this paper we show the non-existence of odd perfect polynomials with either three prime divisors or with at most nine prime divisors provided that all exponents are equal to 2 .

More on Divisibility Criteria for Selected Primes

Adam Naumowicz, Radosław Piliszek (2013)

Formalized Mathematics

Similarity:

This paper is a continuation of [19], where the divisibility criteria for initial prime numbers based on their representation in the decimal system were formalized. In the current paper we consider all primes up to 101 to demonstrate the method presented in [7].

On Square-Free Numbers

Adam Grabowski (2013)

Formalized Mathematics

Similarity:

In the article the formal characterization of square-free numbers is shown; in this manner the paper is the continuation of [19]. Essentially, we prepared some lemmas for convenient work with numbers (including the proof that the sequence of prime reciprocals diverges [1]) according to [18] which were absent in the Mizar Mathematical Library. Some of them were expressed in terms of clusters’ registrations, enabling automatization machinery available in the Mizar system. Our main result...

On rough and smooth neighbors.

William D. Banks, Florian Luca, Igor E. Shparlinski (2007)

Revista Matemática Complutense

Similarity:

We study the behavior of the arithmetic functions defined by F(n) = P+(n) / P-(n+1) and G(n) = P+(n+1) / P-(n) (n ≥ 1) where P+(k) and P-(k) denote the largest and the smallest prime factors, respectively, of the positive integer k.