### A complete Vinogradov 3-primes theorem under the Riemann hypothesis.

Skip to main content (access key 's'),
Skip to navigation (access key 'n'),
Accessibility information (access key '0')

We give an effective procedure to find minimal bases for ideals of the ring of polynomials over the integers.

It is already known that all Pisot numbers are beta numbers, but for Salem numbers this was proved just for the degree 4 case. In 1945, R. Salem showed that for any Pisot number θ we can construct a sequence of Salem numbers which converge to θ. In this short note, we give some results on the beta expansion for infinitely many sequences of Salem numbers obtained by this construction.

We investigate the density and distribution behaviors of the chinese remainder representation pseudorank. We give a very strong approximation to density, and derive two efficient algorithms to carry out an exact count (census) of the bad pseudorank integers. One of these algorithms has been implemented, giving results in excellent agreement with our density analysis out to 5189-bit integers.

We investigate the density and distribution behaviors of the chinese remainder representation pseudorank. We give a very strong approximation to density, and derive two efficient algorithms to carry out an exact count (census) of the bad pseudorank integers. One of these algorithms has been implemented, giving results in excellent agreement with our density analysis out to $5189$-bit integers.

In [22], the authors proved an explicit formula for the arithmetic intersection number $\left(CM\left(K\right).{G}_{1}\right)$ on the Siegel moduli space of abelian surfaces, under some assumptions on the quartic CM field $K$. These intersection numbers allow one to compute the denominators of Igusa class polynomials, which has important applications to the construction of genus $2$ curves for use in cryptography. One of the main tools in the proof was a previous result of the authors [21] generalizing the singular moduli formula of Gross...

In this article we formalize some number theoretical algorithms, Euclidean Algorithm and Extended Euclidean Algorithm [9]. Besides the a gcd b, Extended Euclidean Algorithm can calculate a pair of two integers (x, y) that holds ax + by = a gcd b. In addition, we formalize an algorithm that can compute a solution of the Chinese remainder theorem by using Extended Euclidean Algorithm. Our aim is to support the implementation of number theoretic tools. Our formalization of those algorithms is based...

While most algebra is done by writing text and formulas, diagrams have always been used to present structural information clearly and concisely. Text shells are the de facto interface for computational algebraic number theory, but they are incapable of presenting structural information graphically. We present GiANT, a newly developed graphical interface for working with number fields. GiANT offers interactive diagrams, drag-and-drop functionality, and typeset formulas.

In this paper, a new class of Hierarchical Residue Number Systems (HRNSs) is proposed, where the numbers are represented as a set of residues modulo factors of 2k ± 1 and modulo 2k . The converters between the proposed HRNS and the positional binary number system can be built as 2-level structures using efficient circuits designed for the RNS (2k-1, 2k, 2k+1). This approach allows using many small moduli in arithmetic channels without large conversion overhead. The advantages resulting from the...

It is well known that getting the estimate of integral points in right-angled simplices is equivalent to getting the estimate of Dickman-De Bruijn function $\psi (x,y)$ which is the number of positive integers $\le x$ and free of prime factors $>y$. Motivating from the Yau Geometry Conjecture, the third author formulated the Number Theoretic Conjecture which gives a sharp polynomial upper estimate that counts the number of positive integral points in n-dimensional ($n\ge 3$) real right-angled simplices. In this paper, we...