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

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.