MENGHITUNG BANYAKNYA BILANGAN PRIMA YANG LEBIH KECIL DARI ATAU SAMA DENGAN SUATU BILANGAN BULAT n

dc.contributor.authorPolorida
dc.contributor.authorSirait, Asli
dc.contributor.authorMusraini
dc.date.accessioned2016-02-04T04:49:30Z
dc.date.available2016-02-04T04:49:30Z
dc.date.issued2016-02-04
dc.description.abstractThis articel studies the explicit formula for a function to enumerate the number of primes less than or equal to n called Prime Counting Function, where n is natural number. Prime Counting Function is denoted by π(n). Explicit formula of π(n) is constructed by arithmetic function φ(n) and δ(n) with the help of notation of sum and the oor function.en_US
dc.description.sponsorshipFakultas Matematika dan Ilmu Pengetahuan Alam Universitas Riauen_US
dc.identifier.otherwahyu sari yeni
dc.identifier.urihttp://repository.unri.ac.id/xmlui/handle/123456789/7914
dc.language.isoenen_US
dc.subjectPrime numberen_US
dc.subjectprime counting functionen_US
dc.subjectarithmetic functionen_US
dc.titleMENGHITUNG BANYAKNYA BILANGAN PRIMA YANG LEBIH KECIL DARI ATAU SAMA DENGAN SUATU BILANGAN BULAT nen_US
dc.typestudent Paper Post Degreeen_US

Files

Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
artikel polorida.pdf
Size:
668.2 KB
Format:
Adobe Portable Document Format
Description:
artikel
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:

Collections