The Perfect Number Theorem and Wilson's Theorem

This article formalizes proofs of some elementary theorems of number theory (see [1, 26]): Wilson's theorem (that n is prime iff n > 1 and (n - 1)! ≅ -1 (mod n)), that all primes (1 mod 4) equal the sum of two squares, and two basic theorems of Euclid and Euler about perfect numbers. The article also formally defines Euler's sum of divisors function Φ, proves that Φ is multiplicative and that Σ k|n Φ(k) = n.Casella Postale 49, 54038 Montignoso, ItalyM. Aigner and G. M. Ziegler. Proofs from THE BOOK. Springer-Verlag, Berlin Heidelberg New York, 2004.Grzegorz Bancerek. Cardinal numbers. Formalized Mathematics, 1(2):377-382, 1990.Grzegorz Bancerek. The fundamental properties of natural numbers. Formalized Mathematics, 1(1):41-46, 1990.Grzegorz Bancerek. König's theorem. Formalized Mathematics, 1(3):589-593, 1990.Grzegorz Bancerek. The ordinal numbers. Formalized Mathematics, 1(1):91-96, 1990.Grzegorz Bancerek and Krzysztof Hryniewiecki. Segments of natural numbers and finite sequences. Formalized Mathematics, 1(1):107-114, 1990.Józef Białas. Infimum and supremum of the set of real numbers. Measure theory. Formalized Mathematics, 2(1):163-171, 1991.Czesław Byliński. Basic functions and operations on functions. Formalized Mathematics, 1(1):245-254, 1990.Czesław Byliński. The complex numbers. Formalized Mathematics, 1(3):507-513, 1990.Czesław Byliński. Finite sequences and tuples of elements of a non-empty sets. Formalized Mathematics, 1(3):529-536, 1990.Czesław Byliński. Functions and their basic properties. Formalized Mathematics, 1(1):55-65, 1990.Czesław Byliński. Functions from a set to a set. Formalized Mathematics, 1(1):153-164, 1990.Czesław Byliński. Partial functions. Formalized Mathematics, 1(2):357-367, 1990.Czesław Byliński. Some basic properties of sets. Formalized Mathematics, 1(1):47-53, 1990.Czesław Byliński. The sum and product of finite sequences of real numbers. Formalized Mathematics, 1(4):661-668, 1990.Agata Darmochwał. Finite sets. Formalized Mathematics, 1(1):165-167, 1990.Yoshinori Fujisawa and Yasushi Fuwa. The Euler's function. Formalized Mathematics, 6(4):549-551, 1997.Yoshinori Fujisawa, Yasushi Fuwa, and Hidetaka Shimizu. Public-key cryptography and Pepin's test for the primality of Fermat numbers. Formalized Mathematics, 7(2):317-321, 1998.Krzysztof Hryniewiecki. Basic properties of real numbers. Formalized Mathematics, 1(1):35-40, 1990.Krzysztof Hryniewiecki. Recursive definitions. Formalized Mathematics, 1(2):321-328, 1990.Magdalena Jastrzebska and Adam Grabowski. On the properties of the Möbius function. Formalized Mathematics, 14(1):29-36, 2006, doi:10.2478/v10037-006-0005-0.Artur Korniłowicz and Piotr Rudnicki. Fundamental Theorem of Arithmetic. Formalized Mathematics, 12(2):179-186, 2004.Jarosław Kotowicz and Yuji Sakai. Properties of partial functions from a domain to the set of real numbers. Formalized Mathematics, 3(2):279-288, 1992.Rafał Kwiatek. Factorial and Newton coefficients. Formalized Mathematics, 1(5):887-890, 1990.Rafał Kwiatek and Grzegorz Zwara. The divisibility of integers and integer relative primes. Formalized Mathematics, 1(5):829-832, 1990.W. J. LeVeque. Fundamentals of Number Theory. Dover Publication, New York, 1996.Takaya Nishiyama and Yasuho Mizuhara. Binary arithmetics. Formalized Mathematics, 4(1):83-86, 1993.Beata Padlewska. Families of sets. Formalized Mathematics, 1(1):147-152, 1990.Piotr Rudnicki. Little Bezout theorem (factor theorem). Formalized Mathematics, 12(1):49-58, 2004.Piotr Rudnicki and Andrzej Trybulec. Abian's fixed point theorem. Formalized Mathematics, 6(3):335-338, 1997.Piotr Rudnicki and Andrzej Trybulec. Multivariate polynomials with arbitrary number of variables. Formalized Mathematics, 9(1):95-110, 2001.Andrzej Trybulec. Binary operations applied to functions. Formalized Mathematics, 1(2):329-334, 1990.Andrzej Trybulec. Tuples, projections and Cartesian products. Formalized Mathematics, 1(1):97-105, 1990.Andrzej Trybulec. On the sets inhabited by numbers. Formalized Mathematics, 11(4):341-347, 2003.Andrzej Trybulec and Czesław Byliński. Some properties of real numbers. Formalized Mathematics, 1(3):445-449, 1990.Michał J. Trybulec. Integers. Formalized Mathematics, 1(3):501-505, 1990.Wojciech A. Trybulec. Non-contiguous substrings and one-to-one finite sequences. Formalized Mathematics, 1(3):569-573, 1990.Zinaida Trybulec. Properties of subsets. Formalized Mathematics, 1(1):67-71, 1990.Edmund Woronowicz. Relations and their basic properties. Formalized Mathematics, 1(1):73-83, 1990.Edmund Woronowicz. Relations defined on sets. Formalized Mathematics, 1(1):181-186, 1990.Hiroshi Yamazaki, Yasunari Shidama, and Yatsuka Nakamura. Bessel's inequality. Formalized Mathematics, 11(2):169-173, 2003

Probabilistic Methods on Erdos Problems

The study of perfect numbers dates back to Euler and Mersenne. A perfect number is a number that is equal to the sum of its proper divisors which are said to include the multiplicative unit 1. The following theorem is a classical number theory result. All even numbers are of the form $2^k(2^k-1)$ where $2^k-1$ is a Mersenne prime, that is, a prime where $k=P$ and the number $P$ is prime. One interesting conjecture is that there are no odd perfect numbers

Odd multiperfect numbers of abundancy 4

Euler's structure theorem for any odd perfect number is extended to odd multiperfect numbers of abundancy power of 2. In addition, conditions are found for classes of odd numbers not to be 4-perfect: some types of cube, some numbers divisible by 9 as the maximum power of 3, and numbers where 2 is the maximum even prime power

Matchings in Random Biregular Bipartite Graphs

We study the existence of perfect matchings in suitably chosen induced subgraphs of random biregular bipartite graphs. We prove a result similar to a classical theorem of Erdos and Renyi about perfect matchings in random bipartite graphs. We also present an application to commutative graphs, a class of graphs that are featured in additive number theory.Comment: 30 pages and 3 figures - Latest version has updated introduction and bibliograph

A vanishing theorem for Fano varieties in positive characteristic

We prove a Kodaira-type vanishing theorem for the Witt vector sheaf on a Fano variety over a perfect field of characteristic p. As a corollary, we deduce that the number of rational points on a Fano variety over a finite field with q=p^n elements is congruent to 1 mod q. This refines a result of Esnault which say that the number is congruent to 1 mod p.Comment: A correct proof of the original vanishing theorem (mod torsion) has been given in the meanwhile by Esnault. This note strengthens that result slightl

On the structure of non-full-rank perfect codes

The Krotov combining construction of perfect 1-error-correcting binary codes from 2000 and a theorem of Heden saying that every non-full-rank perfect 1-error-correcting binary code can be constructed by this combining construction is generalized to the $q$-ary case. Simply, every non-full-rank perfect code $C$ is the union of a well-defined family of $\mu$-components $K_\mu$, where $\mu$ belongs to an "outer" perfect code $C^*$, and these components are at distance three from each other. Components from distinct codes can thus freely be combined to obtain new perfect codes. The Phelps general product construction of perfect binary code from 1984 is generalized to obtain $\mu$-components, and new lower bounds on the number of perfect 1-error-correcting $q$-ary codes are presented.Comment: 8 page