| dc.rights.license | CC-BY-NC-ND | |
| dc.contributor.advisor | Grimmelt, dr. L.P. | |
| dc.contributor.advisor | Schindler, dr. D. | |
| dc.contributor.advisor | Cornelissen, Prof. dr. G.L.M. | |
| dc.contributor.author | Hoek, P.B. van | |
| dc.date.accessioned | 2019-07-18T17:00:40Z | |
| dc.date.available | 2019-07-18T17:00:40Z | |
| dc.date.issued | 2019 | |
| dc.identifier.uri | https://studenttheses.uu.nl/handle/20.500.12932/32867 | |
| dc.description.abstract | We construct the Buchstab function using a ``stick-breaking process". This gives us a new way of expressing the function and thereby some new interpretations. To do this we first look at the basic results concerning rough numbers like the prime number theorem. We analyse the strongest known result for counting rough numbers by Gérald Tenenbaum. | |
| dc.description.sponsorship | Utrecht University | |
| dc.format.extent | 585557 | |
| dc.format.mimetype | application/pdf | |
| dc.language.iso | en | |
| dc.title | Rough numbers and stick-breaking | |
| dc.type.content | Master Thesis | |
| dc.rights.accessrights | Open Access | |
| dc.subject.keywords | Rough numbers;Buchstab function;prime number theorem;Perron's formula;Mertens' theorem;Stick-breaking | |
| dc.subject.courseuu | Mathematical Sciences | |
