|
|
The use of Computers in the Number Theory
Konečný, Zdeněk ; Karásek, Jiří (referee) ; Skula, Ladislav (advisor)
PARI/GP is a relatively obscure mathematical software that was designed especially for quick calculations in the number theory, but which has also found its application in other areas of mathematics. This work gives an overview of the basic commands of PARI/GP, and some simple examples to show their potential use. PARI/GP is then used for looking for large primes of special forms.
|
|
|
Hardware generation of cryptographic-safe primes.
Kabelková, Barbora ; Smékal, David (referee) ; Cíbik, Peter (advisor)
The bachelor's thesis deals with the topic of prime numbers and their generation. It briefly introduces prime numbers and points out the importance of secure primes in cryptography. It gives examples of asymmetric ciphers and closely analyses RSA algorithm. The thesis then presents some pseudo-random and true-random methods of generating sequences of numbers and compares their properties. It evaluates the most used primality tests, both probabilistic and real, based on their applicability in practice. It suggests several combinations of primality tests with generating methods and chooses one to implement on FPGA. The thesis describes the implementation of a generator that generates a sequence of numbers using the von Neumann middle-square method and subsequently uses the Miller-Rabin test to find primes between those numbers. Key processes of the proposed generator are explained and illustrated. The proposed implementation is simulated and synthesized in the Xilinx Viavado environment. The individual parts of the generator are tested using several behavioral simulations. Finally, the thesis comments on the conducted simulations and evaluates the properties of the proposed implementation.
|
|
| |
|
|
Algebraic proofs of Dirichlet's theorem on arithmetic progressions
Čech, Martin ; Kala, Vítězslav (advisor) ; Příhoda, Pavel (referee)
Dirichlet's theorem on arithmetic progressions says that there are infinitely many primes in any arithmetic progression an = kn + with coprime k, . The original proof of this theorem was analytic using a lot of non-elementary methods. The goal of this thesis is to give sufficient and necessary conditions on k and under which a more elementary algebraic proof of the theorem can exist, and give the proof in these cases. 1
|
|
|
Divisibility for talented students of secondary schools
Živčáková, Andrea ; Robová, Jarmila (advisor) ; Bečvář, Jindřich (referee)
This thesis is an educational text for high school students. It aims to teach them how to solve typical problems concerning divisibility found in mathematical correspondence seminars and mathematical olympiad. Basic notions from the theory of divisibility are recalled (e.g. prime numbers, divisors, multiples). Criteria of divisibility by 2 to 20 are introduced, as well as diophantine equations and practical applications of prime numbers in real life. One whole chapter is dedicated to problems and exercises. Powered by TCPDF (www.tcpdf.org)
|
|
|
Hardware generation of cryptographic-safe primes.
Kabelková, Barbora ; Smékal, David (referee) ; Cíbik, Peter (advisor)
The bachelor's thesis deals with the topic of prime numbers and their generation. It briefly introduces prime numbers and points out the importance of secure primes in cryptography. It gives examples of asymmetric ciphers and closely analyses RSA algorithm. The thesis then presents some pseudo-random and true-random methods of generating sequences of numbers and compares their properties. It evaluates the most used primality tests, both probabilistic and real, based on their applicability in practice. It suggests several combinations of primality tests with generating methods and chooses one to implement on FPGA. The thesis describes the implementation of a generator that generates a sequence of numbers using the von Neumann middle-square method and subsequently uses the Miller-Rabin test to find primes between those numbers. Key processes of the proposed generator are explained and illustrated. The proposed implementation is simulated and synthesized in the Xilinx Viavado environment. The individual parts of the generator are tested using several behavioral simulations. Finally, the thesis comments on the conducted simulations and evaluates the properties of the proposed implementation.
|
|
|
Algebraic proofs of Dirichlet's theorem on arithmetic progressions
Čech, Martin ; Kala, Vítězslav (advisor) ; Příhoda, Pavel (referee)
Dirichlet's theorem on arithmetic progressions says that there are infinitely many primes in any arithmetic progression an = kn + with coprime k, . The original proof of this theorem was analytic using a lot of non-elementary methods. The goal of this thesis is to give sufficient and necessary conditions on k and under which a more elementary algebraic proof of the theorem can exist, and give the proof in these cases. 1
|
|
|
Divisibility for talented students of secondary schools
Živčáková, Andrea ; Robová, Jarmila (advisor) ; Bečvář, Jindřich (referee)
This thesis is an educational text for high school students. It aims to teach them how to solve typical problems concerning divisibility found in mathematical correspondence seminars and mathematical olympiad. Basic notions from the theory of divisibility are recalled (e.g. prime numbers, divisors, multiples). Criteria of divisibility by 2 to 20 are introduced, as well as diophantine equations and practical applications of prime numbers in real life. One whole chapter is dedicated to problems and exercises. Powered by TCPDF (www.tcpdf.org)
|
|
|
Theory of Numbers in Ancient Greece
Smrčka, Zdeněk ; Bečvář, Jindřich (advisor) ; Halas, Zdeněk (referee)
Title: Theory of Numbers in Ancient Greece Author: Bc. Zdenek Smrcka Department: The Department of Mathematics Education Supervisor: doc. RNDr. Jindřich Bečvář, CSc. Abstract: The goal of this thesis is to write up clearly and comprehensibly numeric theoretical research and its results in Ancient Greece between 6 century before Christ and 4 century after Christ. In this thesis we try show examples use of Greece's Mathematics for improvement teaching in education and better understanding abstract thinking in Mathematics. We want so that students understand thinking and abilities Greece's mathematicians. We compare high school view on searching greatest common divisor and Euclidean algorithm. We present important Greece's knowledges as sieve of Eratosthenes, arithmetic of Diofantos etc.. Something of Greece's knowledges as Euclidean algorithm, sieve of Eratosthenes etc. are use of up to now. Keywords: Mathematics in Ancient Greece, figurate number, theory of numbers, Continual fraction, Euclidean algorithm
|
|
|
Probabilistic algorithms for testing primality
Tejkalová, Natálie ; Švejdar, Vítězslav (advisor) ; Glivický, Petr (referee)
Attention has been paid mostly to the new deterministic algorithm for primality testing AKS recently. However, probabilistic algorithms remain an efficient tool for primality testing. Our thesis focuses mostly on two most well-known probabilistic algorithms for primality testing. It describes the main idea and gives proofs of correctness of Solovay-Strassen and Rabin-Miller algorithms. Apart from that, it also tries to look at the subject of probabilistic algorithms from a wider perspective. It presents a definition of a probabilistic algorithm and various complexity classes that correspond to Monte Carlo or Las Vegas algorithms. Besides pure mathematical theory, we mention also some philosophical aspects that need to be considered when we decide to use the probabilistic method. Powered by TCPDF (www.tcpdf.org)
|
guest ::
