Add to ORKGAbstract For any fixed positive integer k ≥ 2, the power k sieve is defined as following: Starting to count on the natural numbers set at any step from 1:- delete every 2k-th numbers;- delete, from the remaining ones, every 3k-th numbers · · · , and so on: delete, from the remaining ones, every nk-th numbers, n = 2, 3, 4, · · ·. In this paper, we study the following two problems: (A) Are there an infinity of primes that belong to this sequence? (B) Are there an infinity of numbers of this sequence which are not prime? Then we using the elementary methods to study these problems, and prove that the problem (B) is true
This thesis focuses on refinements of Selberg's sieve as well as new applications of the sieve. Sie...
for his 50th birthday 0. In 1999, the second author of this remarks published a book over 30 of Smar...
The Twin Primes Conjecture (TPC) is one of the oldest, unsolved problems in math- ematics. This pape...
In this paper, we study the following two problems: (A) Are there an infinity of primes that belong ...
In this paper one proves that the remaining sequence of Smarandache n-ary sieve contains infinitely ...
In this paper a problem posed by Iacobescu concerning the number of primes in the Smarandache Unary ...
Abstract. In this paper we IS not a power of 2, then product sequence of the first prime 2. prove th...
Abstract. In this paper we completely determine the primes in the Smarandache power product sequence...
AbstractIn recent years several new algorithms have appeared for the problem of enumerating the prim...
In recent years several new algorithms have appeared for the problem of enumerating the prime number...
Our main result is that there are infinitely many primes of the form a² + b² such that a² + 4b² has ...
Abstract. We are interested in classifying those sets of primes P such that when we sieve out the in...
A new algorithm is presented for the problem of finding all primes between 2 and N. It is based on M...
AbstractThe main object of the paper is to prove that if P is a set of primes with sum of reciprocal...
Abstract For any positive integer n ≥ 2, the Smarandache Inferior Prime Part {pp(n)} is defined as t...
This thesis focuses on refinements of Selberg's sieve as well as new applications of the sieve. Sie...
for his 50th birthday 0. In 1999, the second author of this remarks published a book over 30 of Smar...
The Twin Primes Conjecture (TPC) is one of the oldest, unsolved problems in math- ematics. This pape...
In this paper, we study the following two problems: (A) Are there an infinity of primes that belong ...
In this paper one proves that the remaining sequence of Smarandache n-ary sieve contains infinitely ...
In this paper a problem posed by Iacobescu concerning the number of primes in the Smarandache Unary ...
Abstract. In this paper we IS not a power of 2, then product sequence of the first prime 2. prove th...
Abstract. In this paper we completely determine the primes in the Smarandache power product sequence...
AbstractIn recent years several new algorithms have appeared for the problem of enumerating the prim...
In recent years several new algorithms have appeared for the problem of enumerating the prime number...
Our main result is that there are infinitely many primes of the form a² + b² such that a² + 4b² has ...
Abstract. We are interested in classifying those sets of primes P such that when we sieve out the in...
A new algorithm is presented for the problem of finding all primes between 2 and N. It is based on M...
AbstractThe main object of the paper is to prove that if P is a set of primes with sum of reciprocal...
Abstract For any positive integer n ≥ 2, the Smarandache Inferior Prime Part {pp(n)} is defined as t...
This thesis focuses on refinements of Selberg's sieve as well as new applications of the sieve. Sie...
for his 50th birthday 0. In 1999, the second author of this remarks published a book over 30 of Smar...
The Twin Primes Conjecture (TPC) is one of the oldest, unsolved problems in math- ematics. This pape...