this paper. In this paper k, n are natural numbers and r is a real number. Let us consider n. The functor R

Abstract not found

Summary. We define the following functions: exponential function (for natural exponent), factorial function and Newton coefficients. We prove some basic properties of notions introduced. There is also a proof of binominal formula. We prove also that ∑ n �n � k=0 k = 2n.

this paper.

Summary. The article is a translation of the first chapters of a book Wste¸p do teorii liczb (Eng. Introduction to Number Theory) by W. Sierpiński, WSiP, Biblioteczka Matematyczna, Warszawa, 1987. The first few pages of this book have already been formalized in MML. We prove the Chinese Remainder Theorem and Thue’s Theorem as well as several

Summary. This article is concerned with a generalization of concepts introduced in [11], i.e., there are introduced the sum and the product of finite number of elements of any field. Moreover, the product of vectors which yields a vector is introduced. According to [11], some operations on i-tuples of elements of field are introduced: addition, subtraction, and complement. Some properties of the sum and the product of finite number of elements of a field are present.

We present a formalization of the factor theorem for univariate polynomials, also called the (little) Bezout theorem: Let r belong to a commutative ring L and p(x) be a polynomial over L. Then x − r divides p(x) iff p(r) = 0. We also prove some consequences of this theorem like that any non zero polynomial of degree n over an algebraically closed integral domain has n (non necessarily distinct) roots.

Summary. This article is concerned with Euler’s theorem and small Fermat’s theorem that play important roles in public-key cryptograms. In the first section, we present some selected theorems on integers. In the following section, we remake definitions about the finite sequence of natural, the function of natural times finite sequence of natural and π of the finite sequence of natural. We also prove some basic theorems that concern these redefinitions. Next, we define the function of modulus for finite sequence of natural and some fundamental theorems about this function are proved. Finally, Euler’s theorem and small Fermat’s theorem are proved.

Summary. We present a Mizar formalization of chapter 4.4 of [8] devoted to special orderings in additive monoids to be used for ordering terms in multivariate polynomials. We have extended the treatment to the case of infinite number of variables. It turns out that in such case admissible orderings are not necessarily well orderings. MML Identifier:BAGORDER. WWW:http://mizar.org/JFM/Vol14/bagorder.html

Summary. Convexity of a function in a real linear space is defined as convexity of its epigraph according to “Convex analysis ” by R. Tyrrell Rockafellar. The epigraph of a function is a subset of the product of the function’s domain space and the space of real numbers. Therefore the product of two real linear spaces should be defined. The values of the functions under consideration are extended real numbers. We define the sum of a finite sequence of extended real numbers and get some properties of the sum. The relation between notions “function is convex ” and “function is convex on set ” (see RFUNCT 3:def 13) is established. We obtain another version of the criterion for a set to be convex (see CONVEX2:6 to compare) that may be more suitable in some cases. Finally we prove Jensen’s inequality (both strict and not strict) as criteria for functions to be convex.