相关论文: An optical Eratosthenes' sieve for large prime num…

We encode the sequence of prime numbers into simple superpositions of identical waves, mimicking the archetypal prime number sieve of Eratosthenes. The primes are identified as zeros accompanied by phase singularities in a physically…

This paper presents a new distributed approach for generating all prime numbers in a given interval of integers. From Eratosthenes, who elaborated the first prime sieve (more than 2000 years ago), to the current generation of parallel…

In this document, prime numbers are related as functions over time, mimicking the Sieve of Eratosthenes. For this purpose, the mathematical representation is a uni-dimentional time line depicting the number line for positive natural numbers…

We have devised an alternative approach to sifting integers in the sieve of Eratosthenes that helps refine the error term. Instead of eliminating all multiples of a prime number $p<z$ in the traditional sieve method, our approach solely…

We make two algorithms that generate all prime numbers up to a given limit, they are a development of sieve of Eratosthenes algorithm, we use two formulas to achieve this development, where all the multiples of prime number 2 are eliminated…

We show how to carry out a sieve of Eratosthenes up to N in space O(N^{1/3} (log N)^{2/3}) and time O(N log N). These bounds constitute an improvement over the usual versions of the sieve, which take space about O(sqrt{N}) and time at least…

We introduce a novel sieve for prime numbers based on detecting topological obstructions in a M\"obius-transformed rational metric space. Unlike traditional sieves which rely on divisibility, our method identifies primes as those numbers…

We improve the "sieve" part of the number field sieve used in factoring integer and computing discrete logarithm. The runtime of our method is shorter than that of existing methods. Under some reasonable assumptions, we prove that it is…

We propose various strategies for improving the computation of discrete logarithms in non-prime fields of medium to large characteristic using the Number Field Sieve. This includes new methods for selecting the polynomials; the use of…

We derived the sum identities for generalized harmonic and corresponding oscillatory numbers for which a sieve procedure can be applied. The obtained results enable us to understand better the properties of these numbers and their…

In this paper, we analyze properties of prime number sequences produced by the alternating sum of higher-order subsequences of the primes. We also introduce a new sieve which will generate these prime number sequences via the systematic…

We suggest other models of sieve generated sequences like the Sieve of Eratosthenes to explain randomness properties of the prime numbers, like the twin prime conjecture, the lim sup conjecture, the Riemann conjecture, and the prime number…

We propose a multi-scale analysis method for studying arithmetic properties of integer sets, such as primality. Our approach organizes information through a hierarchy of nested sequences, where each level enables a hierarchical expression…

We demonstrate first- and second-order spatial differentiation of an optical beam transverse profile using thin suspended subwavelength gratings. Highly reflective one-dimensional gratings are patterned on suspended 200 nm-thick silicon…

Lattice sieving in two or more dimensions has proven to be an indispensable practical aid in integer factorization and discrete log computations involving the number field sieve. The main contribution of this article is to show that a…

Let $a_0\in\{0,\dots,9\}$. We show there are infinitely many prime numbers which do not have the digit $a_0$ in their decimal expansion. The proof is an application of the Hardy-Littlewood circle method to a binary problem, and rests on…

The author gives nontrivial upper and lower bounds for the number of primes in the interval $[x - x^{\theta}, x]$ for some $0.52 \leqslant \theta \leqslant 0.525$, showing that the interval $[x - x^{0.52}, x]$ contains prime numbers for all…

We are interested in classifying those sets of primes $\mathcal{P}$ such that when we sieve out the integers up to $x$ by the primes in $\mathcal{P}^c$ we are left with roughly the expected number of unsieved integers. In particular, we…

Using a sieve procedure akin to the sieve of Eratosthenes we show how for each prime $p$ to build the corresponding M\"obius prime-function, which in the limit of infinitely large primes becomes identical to the original M\"obius function.…

The far-field pattern of a simple one-dimensional laser array of emitters radiating into free space is considered. In the path of investigating the inverse problem for their near fields leading to a target beam form, surprisingly we found…