Guitart Morales, XavierBada Erta, Francesc Xavier2022-09-022022-09-022022-06-13https://hdl.handle.net/2445/188579Treballs Finals de Grau de Matemàtiques, Facultat de Matemàtiques, Universitat de Barcelona, Any: 2022, Director: Xavier Guitart Morales[en] A primality test is an algorithm which determines whether a number is prime or composite. In this project we will study mainly two of these tests and their complexities. The first one is a probabilistic test, which means that it claims whether a number is prime or composite within a certain error margin; the second one is a deterministic test, which claims unequivocally the primality of a number.34 p.application/pdfcatcc-by-nc-nd (c) Francesc Xavier Bada Erta, 2022http://creativecommons.org/licenses/by-nc-nd/3.0/es/Nombres primersTreballs de fi de grauAlgorismesFactorització (Matemàtica)Prime numbersBachelor's thesesAlgorithmsFactorization (Mathematics)info:eu-repo/semantics/bachelorThesisinfo:eu-repo/semantics/openAccess