dc.contributor.advisor | Seip, Kristian | |
dc.contributor.author | Fissum, Robin | |
dc.date.accessioned | 2022-02-18T18:24:08Z | |
dc.date.available | 2022-02-18T18:24:08Z | |
dc.date.issued | 2020 | |
dc.identifier | no.ntnu:inspera:56982622:29703762 | |
dc.identifier.uri | https://hdl.handle.net/11250/2980249 | |
dc.description.abstract | Vi utleder en asymptotisk formel for tverrsummer, og viser hvordan den kan brukes til å estimere det totale antallet primfaktorer av n!=1·2···n (n fakultet). Vi gir også en kort oppsummering av historien bak problemet, og viser hvordan et resultat av Bahman Saffari fra 1970 impliserer en asymptotisk rekke for antall primfaktorer i n fakultet. | |
dc.description.abstract | We develop an asymptotic formula for digit sums, and show how it can be used to estimate the total number of prime factors of n!=1·2···n (n factorial). Then we give a brief history of the problem, and show how a result by Bahman Saffari from 1970 implies an asymptotic expansion for the number of prime factors of the factorial. | |
dc.language | | |
dc.publisher | NTNU | |
dc.title | Digit sums and the number of prime factors of the factorial n!=1·2···n | |
dc.type | Bachelor thesis | |