z-logo
open-access-imgOpen Access
On a sum involving powers of the prime counting function
Author(s) -
Hacène Belbachir,
Farid Bencherif
Publication year - 2006
Publication title -
publikacija elektrotehnickog fakulteta - serija matematika
Language(s) - English
Resource type - Journals
eISSN - 2406-0852
pISSN - 0353-8893
DOI - 10.2298/petf0617045b
Subject(s) - mathematics , prime (order theory) , extension (predicate logic) , function (biology) , combinatorics , prime number , discrete mathematics , number theory , asymptotic formula , pure mathematics , arithmetic , computer science , evolutionary biology , biology , programming language
An asymptotic formula is derived for the sum of powers of reciprocals of π(n), where π((x) denotes the number of primes not exceeding x. This is an extension of previous results of L. Panaitopol and A. Ivic.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom