CALL FOR PAPERS

Author Information

CERTIFICATE

IMPACT FACTOR 2021

Subject Area

Life Sciences / Biology
Architecture / Building Management
Asian Studies
Business & Management
Chemistry
Computer Science
Economics & Finance
Engineering / Acoustics
Environmental Science
Agricultural Sciences
Pharmaceutical Sciences
General Sciences
Materials Science
Mathematics
Medicine
Nanotechnology & Nanoscience
Nonlinear Science
Chaos & Dynamical Systems
Physics
Social Sciences & Humanities

Why Us? >>

Open Access
Peer Reviewed
Rapid Publication
Life time hosting
Free promotion service
Free indexing service
More citations
Search engine friendly

Plagiarism Detection

IJCR is following an instant policy on rejection those received papers with plagiarism rate of more than 20%. So, All of authors and contributors must check their papers before submission to making assurance of following our anti-plagiarism policies.

A Formula for the prime counting function π(n).

Author:

Noor Zaman Sheikh

Subject Area:

Physical Sciences and Engineering

Abstract:

We have created a formula to calculate the number of primes less than or equal to any given positive integer ‘ n ‘ . It is denoted by π (n) . This is a fundamental concept in number theory and it is difficult to calculate. A prime number can be divided by 1 and the number itself. The set of all primes can be written as { 2,3,5,7,11,13,17,...............}. The Prime Counting Function was conjectured in the end of 18th century by the famous Mathematician Gauss and Legendre Sir, to be approximately x/(ln x) .But in this paper we are presenting the real formula, by applying the modern approach, that is by applying the basic concept of set theory.

PDF file: