New Formulas for Semi-Primes. Testing, Counting and Identification of the nthn^{th} and next Semi-Primes

preprint2016arXivOpen access

Abstract

In this paper we give a new semiprimality test and we construct a new formula for π(2)(N)π^{(2)}(N), the function that counts the number of semiprimes not exceeding a given number NN. We also present new formulas to identify the nthn^{th} semiprime and the next semiprime to a given number. The new formulas are based on the knowledge of the primes less than or equal to the cube roots of N:P1,  P2....Pπ(N3)≤N3N : P_{1}, \; P_{2}....P_{π\left( \sqrt[3]{N}\right) }\leq \sqrt[3]{N}.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.