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

dc.contributor.author	Polorida
dc.contributor.author	Sirait, Asli
dc.contributor.author	Musraini
dc.date.accessioned	2016-02-04T04:49:30Z
dc.date.available	2016-02-04T04:49:30Z
dc.date.issued	2016-02-04
dc.identifier.other	wahyu sari yeni
dc.identifier.uri	http://repository.unri.ac.id/xmlui/handle/123456789/7914
dc.description.abstract	This 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.provenance	Submitted by wahyu sari yeni (ayoe32@ymail.com) on 2016-02-04T04:49:30Z No. of bitstreams: 1 artikel polorida.pdf: 684241 bytes, checksum: 7c739695f775f3ce0a519f067e3a3d94 (MD5)	en
dc.description.provenance	Made available in DSpace on 2016-02-04T04:49:30Z (GMT). No. of bitstreams: 1 artikel polorida.pdf: 684241 bytes, checksum: 7c739695f775f3ce0a519f067e3a3d94 (MD5)	en
dc.description.sponsorship	Fakultas Matematika dan Ilmu Pengetahuan Alam Universitas Riau	en_US
dc.language.iso	en	en_US
dc.subject	Prime number	en_US
dc.subject	prime counting function	en_US
dc.subject	arithmetic function	en_US
dc.title	MENGHITUNG BANYAKNYA BILANGAN PRIMA YANG LEBIH KECIL DARI ATAU SAMA DENGAN SUATU BILANGAN BULAT n	en_US
dc.type	student Paper Post Degree	en_US