Related papers: First-hit analysis of algorithms for computing qua…

Let p be a fixed prime number. Let K be a totally real number field of discriminant D\_K and let T\_K be the torsion group of the Galois group of the maximal abelian p-ramified pro-p-extension of K (under Leopoldt's conjecture). We…

In 2004 Vasiga and Shallit studied the number of periodic points of two particular discrete quadratic maps modulo prime numbers. They found the asymptotic behaviour of the sum of the number of periodic points for all primes less than some…

Riemann zeta function is an important object of number theory. It was also used for description of disordered systems in statistical mechanics. We show that Riemann zeta function is also useful for the description of integrable model. We…

Motivated by questions of Fouvry and Rudnick on the distribution of Gaussian primes, we develop a very general setting in which one can study inequities in the distribution of analogues of primes through analytic properties of infinitely…

For positive integers $q$, Dirichlet's theorem states that there are infinitely many primes in each reduced residue class modulo $q$. A stronger form of the theorem states that the primes are equidistributed among the $\varphi(q)$ reduced…

Let $[\, \cdot\,]$ be the floor function and $\|x\|$ denote the distance from $x$ to the nearest integer. In this paper we show that whenever $\alpha$ is irrational and $\beta$ is real then for any fixed $\frac{13}{14}<\gamma<1$, there…

We describe an algorithm for computing Bernoulli numbers. Using a parallel implementation, we have computed B(k) for k = 10^8, a new record. Our method is to compute B(k) modulo p for many small primes p, and then reconstruct B(k) via the…

A famous theorem of Zudilin states that at least one of the Riemann zeta values $\zeta(5), \zeta(7), \zeta(9), \zeta(11)$ is irrational. In this paper, we establish the $p$-adic analogue of Zudilin's theorem. As a weaker form of our result,…

Mersenne numbers and Fermat numbers are two hot and difficult issues in number theory. This paper constructs a special group for every positive odd number other than 1, and discovers an algorithm for determining the multiplicative order of…

We represent the Riemann zeta function in the half-plane $\Re s >1$ via series whose terms admit geometrically decreasing bounds. Due to an underlying recurrence relation, which is used to compute coefficients entering into the terms, the…

The main purpose of these lectures is to discuss briefly recent methods of calculation of statistical properties of quantum eigenvalues for chaotic systems based on semi-classical trace formulas. Under the assumption that periodic orbit…

Appeals to randomness in various number-theoretic constructions appear regularly in modern scientific publications. Such famous names as V.I. Arnold, M. Katz, Ya.G. Sinai, and T. Tao are just a few examples. Unfortunately, all of these…

There are two basic number sequences which play a major role in the prime number distribution. The first Number Sequence SQ1 contains all prime numbers of the form 6n+5 and the second Number Sequence SQ2 contains all prime numbers of the…

Fix irrational numbers $\alpha,\hat\alpha>1$ of finite type and real numbers $\beta,\hat\beta\ge 0$, and let $B$ and $\hat B$ be the Beatty sequences $$ B:=(\lfloor\alpha m+\beta\rfloor)_{m\ge 1}\quad\text{and}\quad\hat…

Conditional on the extended Riemann hypothesis, we show that with high probability, the characteristic polynomial of a random symmetric $\{\pm 1\}$-matrix is irreducible. This addresses a question raised by Eberhard in recent work. The main…

We present new algorithms for computing zeta functions of algebraic varieties over finite fields. In particular, let X be an arithmetic scheme (scheme of finite type over Z), and for a prime p let zeta_{X_p}(s) be the local factor of its…

Fermat showed that every prime p = 1 mod 4 is a sum of two squares: $p = a^2 + b^2$. To any of the 8 possible representations (a,b) we associate an angle whose tangent is the ratio b/a. In 1919 Hecke showed that these angles are uniformly…

We address the general mathematical problem of computing the inverse $p$-th root of a given matrix in an efficient way. A new method to construct iteration functions that allow calculating arbitrary $p$-th roots and their inverses of…

Continuing previous study of the Beurling zeta function, here we prove two results, generalizing long existing knowledge regarding the classical case of the Riemann zeta function and some of its generalizations. First, we address the…

Let p denote an odd prime. For all p-admissible conductors c over a quadratic number field \(K=\mathbb{Q}(\sqrt{d})\), p-ring spaces \(V_p(c)\) modulo c are introduced by defining a morphism \(\psi:\,f\mapsto V_p(f)\) from the divisor…