Scribd
Upload
20 views3 pages

Euler 1

This article discusses the Euler's function, which plays an important role in cryptography. It first presents some theorems about integers, then defines the Euler's function. Finally, it proves three theorems relating to the Euler's function, including one about two relatively prime integers that are used as public and private keys in cryptography. The article acknowledges Professor A. Trybulec for advising on the work.

Uploaded by

Shane Fernandes
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
20 views3 pages

Euler 1

This article discusses the Euler's function, which plays an important role in cryptography. It first presents some theorems about integers, then defines the Euler's function. Finally, it proves three theorems relating to the Euler's function, including one about two relatively prime integers that are used as public and private keys in cryptography. The article acknowledges Professor A. Trybulec for advising on the work.

Uploaded by

Shane Fernandes
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

FORMALIZED

MATHEMATICS

Volume , Number , University of Biaystok

1997

The Eulers Function


Yoshinori Fujisawa Shinshu University Nagano Yasushi Fuwa Shinshu University Nagano

Summary. This article is concerned with the Eulers function [10] that plays an important role in cryptograms. In the rst section, we present some selected theorems on integers. Next, we dene the Eulers function. Finally, three theorems relating to the Eulers function are proved. The third theorem concerns two relatively prime integers which make up the Eulers function parameter. In the public key cryptography these two integer values are used as public and secret keys.
MML Identier: EULER 1.

The notation and terminology used here are introduced in the following papers: [12], [6], [1], [13], [9], [2], [3], [7], [8], [14], [11], [15], [4], and [5]. 1. Preliminary

We follow the rules: a, b, c, k, l, m, n are natural numbers and i, j, x, y are integers. The following propositions are true: (1) k n i k < n. (2) n and n are relative prime i n = 1. (3) If k = 0 and k < n and n is prime, then k and n are relative prime. (4) n is prime and k {k1 ; k1 ranges over natural numbers: n and k1 are relative prime k1 1 k1 n} if and only if n is prime and k n and k {0}. / (5) For every nite set A and for every set x such that x A holds A \ {x} = A {x}. 549
c
1997 University of Biaystok ISSN 14262630

550

yoshinori fujisawa and yasushi fuwa

(6) If gcd(a, b) = 1, then for every c holds gcd(a c, b c) = c. (7) If a = 0 and b = 0 and c = 0 and gcd(a c, b c) = c, then a and b are relative prime. (8) If gcd(a, b) = 1, then gcd(a + b, b) = 1. (9) For every c holds gcd(a + b c, b) = gcd(a, b). (10) Suppose m and n are relative prime. Then there exists k such that (i) there exist integers i0 , j0 such that k = i0 m + j0 n and k > 0, and (ii) for every l such that there exist integers i, j such that l = i m + j n and l > 0 holds k l. (11) If m and n are relative prime, then for every k there exist i, j such that i m + j n = k. (12) For all non empty nite sets A, B such that there exists a function from A into B which is one-to-one and onto holds A = B . (13) For all integers i, k, n such that n = 0 holds (i + k n) mod n = i mod n. (14) If a = 0 and b = 0 and c = 0 and c | a b and a and c are relative prime, then c | b. (15) Suppose a = 0 and b = 0 and c = 0 and a and c are relative prime and b and c are relative prime. Then a b and c are relative prime. (16) If x = 0 and y = 0 and i > 0, then i x gcd i y = i (x gcd y). (17) For every x such that a = 0 and b = 0 holds a + x b gcd b = a gcd b. 2. Definition of Eulers Function

Let n be a natural number. The functor Euler n yields a natural number and is dened as follows: (Def. 1) Euler n = {k; k ranges over natural numbers: n and k are {relative prime k 1 k n}. We now state several propositions: (18) Euler 1 = 1. (19) Euler 2 = 1. (20) If n > 1, then Euler n n 1. (21) If n is prime, then Euler n = n 1. (22) If m > 1 and n > 1 and m and n are relative prime, then Euler m n = Euler m Euler n. Acknowledgments The authors wish to thank Professor A. Trybulec for all his advice on this article.

the eulers function References


[1] Grzegorz Bancerek. Cardinal numbers. Formalized Mathematics, 1(2):377382, 1990. [2] Grzegorz Bancerek. The fundamental properties of natural numbers. Formalized Mathematics, 1(1):4146, 1990. [3] Grzegorz Bancerek and Krzysztof Hryniewiecki. Segments of natural numbers and nite sequences. Formalized Mathematics, 1(1):107114, 1990. [4] Czesaw Byliski. Functions and their basic properties. Formalized Mathematics, 1(1):55 65, 1990. [5] Czesaw Byliski. Functions from a set to a set. Formalized Mathematics, 1(1):153164, 1990. [6] Czesaw Byliski. Some basic properties of sets. Formalized Mathematics, 1(1):4753, 1990. [7] Agata Darmochwa. Finite sets. Formalized Mathematics, 1(1):165167, 1990. [8] Krzysztof Hryniewiecki. Basic properties of real numbers. Formalized Mathematics, 1(1):3540, 1990. [9] Rafa Kwiatek and Grzegorz Zwara. The divisibility of integers and integer relative primes. Formalized Mathematics, 1(5):829832, 1990. [10] Teiji Takagi. Elementary Theory of Numbers. Kyoritsu Publishing Co., Ltd., second edition, 1995. [11] Yozo Toda. The formalization of simple graphs. Formalized Mathematics, 5(1):137144, 1996. [12] Andrzej Trybulec. Tarski Grothendieck set theory. Formalized Mathematics, 1(1):911, 1990. [13] Micha J. Trybulec. Integers. Formalized Mathematics, 1(3):501505, 1990. [14] Zinaida Trybulec and Halina wiczkowska. Boolean properties of sets. Formalized Mathematics, 1(1):1723, 1990. [15] Edmund Woronowicz. Relations and their basic properties. Formalized Mathematics, 1(1):7383, 1990.

551

Received December 10, 1997

You might also like