Related papers: The concept of primes and the algorithm for counti…
When people mention the mathematical achievements of Euclid, his geometrical achievements always spring to mind. But, his Number-Theoretical achievements (See Books 7, 8 and 9 in his magnum opus \emph{Elements} [1]) are rarely spoken. The…
Residue arithmetic is an elegant and convenient way of computing with integers that exceed the natural word size of a computer. The algorithms are highly parallel and hence naturally adapted to quantum computation. The process differs from…
While the prime numbers have been subject to mathematical inquiry since the ancient Greeks, the accumulated effort of understanding these numbers has - as Marcus du Sautoy recently phrased it - 'not revealed the origins of what makes the…
We present a quantum algorithm solving the greatest common divisor (GCD) problem. This quantum algorithm possesses similar computational complexity with classical algorithms, such as the well-known Euclidean algorithm for GCD. This…
A generalized Chinese remainder theorem (CRT) for multiple integers from residue sets has been studied recently, where the correspondence between the remainders and the integers in each residue set modulo several moduli is not known. A…
The famous partition theorem of Euler states that partitions of $n$ into distinct parts are equinumerous with partitions of $n$ into odd parts. Another famous partition theorem due to MacMahon states that the number of partitions of $n$…
Using an adaptation of Qin Jiushao's method from the 13th century, it is possible to prove that a system of linear modular equations a(i,1) x(i) + ... + a(i,n) x(n) = b(i) mod m(i), i=1, ..., n has integer solutions if m(i)>1 are pairwise…
The Twin Prime conjecture states that there are infinitely many pairs of distinct primes which differ by $2$. Until recently this conjecture had seemed to be far out of reach with current techniques. However, in April 2013, Yitang Zhang…
We propose a generic design for Chinese remainder algorithms. A Chinese remainder computation consists in reconstructing an integer value from its residues modulo non coprime integers. We also propose an efficient linear data structure, a…
We propose a generic design for Chinese remainder algorithms. A Chinese remainder computation consists in reconstructing an integer value from its residues modulo non coprime integers. We also propose an efficient linear data structure, a…
This 1964 paper developed as an off-shoot to the foundational query: Do we discover the natural numbers (Platonically), or do we construct them linguistically? The paper also assumes computational significance in the light of Agrawal, Kayal…
It is well-known that for any non-constant polynomial $P$ with integer coefficients the sequence $(P(n))_{ n\in \mathbb N}$ has the property that there are infinitely many prime numbers dividing at least one term of this sequence.…
As long as people have studied mathematics, they have wanted to know how many primes there are. Getting precise answers is a notoriously difficult problem, and the first suitable technique, due to Riemann, inspired an enormous amount of…
A well-known generalisation of positional numeration systems is the case where the base is the residue class of $x$ modulo a given polynomial $f(x)$ with coefficients in (for example) the integers, and where we try to construct finite…
Generalized Chinese Remainder Theorem (CRT) is a well-known approach to solve ambiguity resolution related problems. In this paper, we study the robust CRT reconstruction for multiple numbers from a view of statistics. To the best of our…
Since the mathematicians of ancient Greece until Fermat, since Gauss until today; the way how the primes along the numerical straight line are distributed has become perhaps the most difficult math problem; many people believe that their…
We consider primitive divisors of terms of integer sequences defined by quadratic polynomials. Apart from some small counterexamples, when a term has a primitive divisor, that primitive divisor is unique. It seems likely that the number of…
In 1737 Leonard Euler gave what we often now think of as a new proof, based on infinite series, of Euclid's theorem that there are infinitely many prime numbers. Our short paper uses a simple modification of Euler's argument to obtain new…
We show that the classical discrete logarithm problem over prime fields can be reduced to that of solving a system of linear modular equations.
We conjecture new elementary formulas for computing the greatest common divisor (GCD) of two integers, alongside an elementary formula for extracting the prime factors of semiprimes. These formulas are of fixed-length and require only the…