Please use this identifier to cite or link to this item: http://hdl.handle.net/2445/188579
Full metadata record
DC FieldValueLanguage
dc.contributor.advisorGuitart Morales, Xavier-
dc.contributor.authorBada Erta, Francesc Xavier-
dc.date.accessioned2022-09-02T08:43:28Z-
dc.date.available2022-09-02T08:43:28Z-
dc.date.issued2022-06-13-
dc.identifier.urihttp://hdl.handle.net/2445/188579-
dc.descriptionTreballs Finals de Grau de Matemàtiques, Facultat de Matemàtiques, Universitat de Barcelona, Any: 2022, Director: Xavier Guitart Moralesca
dc.description.abstract[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.ca
dc.format.extent34 p.-
dc.format.mimetypeapplication/pdf-
dc.language.isocatca
dc.rightscc-by-nc-nd (c) Francesc Xavier Bada Erta, 2022-
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/es/*
dc.sourceTreballs Finals de Grau (TFG) - Matemàtiques-
dc.subject.classificationNombres primersca
dc.subject.classificationTreballs de fi de grau-
dc.subject.classificationAlgorismesca
dc.subject.classificationFactorització (Matemàtica)ca
dc.subject.otherPrime numbersen
dc.subject.otherBachelor's theses-
dc.subject.otherAlgorithmsen
dc.subject.otherFactorization (Mathematics)en
dc.titleAlguns testos de primeritatca
dc.typeinfo:eu-repo/semantics/bachelorThesisca
dc.rights.accessRightsinfo:eu-repo/semantics/openAccessca
Appears in Collections:Treballs Finals de Grau (TFG) - Matemàtiques

Files in This Item:
File Description SizeFormat 
tfg_bada_erta_xavier.pdfMemòria720.41 kBAdobe PDFView/Open


This item is licensed under a Creative Commons License Creative Commons