Results 281 to 290 of about 11,676,412 (344)

Sharper bounds for the error term in the prime number theorem

Research in Number Theory, 2022
We obtain bounds for the error term in the prime number theorem of the form $$\begin{aligned} \left| \pi (x) - {{\,\textrm{Li}\,}}(x) \right| \le 9.2211\, x\sqrt{\log (x)} \exp \left( -0.8476 \sqrt{\log (x)} \right) \ \text {for all} \ x\ge 2, \end ...
Andrew Fiori   +2 more
semanticscholar   +1 more source

Prime number theorem for analytic skew products

Annals of Mathematics, 2020
We establish a prime number theorem for all uniquely ergodic, analytic skew products on the $2$-torus $\mathbb{T}^2$. More precisely, for every irrational $\alpha$ and every $1$-periodic real analytic $g:\mathbb{R}\to\mathbb{R}$ of zero mean, let $T_ ...
Adam Kanigowski   +2 more
semanticscholar   +1 more source

Prime Number

Emerging Security Algorithms and Techniques, 2019
Khaleel Ahmad   +2 more
openaire   +2 more sources

Explicit Kronecker–Weyl theorems and applications to prime number races

Research in Number Theory, 2020
We prove explicit versions of the Kronecker–Weyl theorems, both in a discrete and a continuous settings, without any linear independence hypothesis. As an application, we propose an alternative approach to problems concerning asymptotic densities in ...
Alexandre Bailleul
semanticscholar   +1 more source

Prime-Perfect Numbers

Integers, 2012
Abstract.We discuss a relative of the perfect numbers for which it is possible to prove that there are infinitely many examples. Call a natural numberasWe conclude by discussing some related problems posed by Harborth and Cohen.
Pollack, Paul, Pomerance, Carl
openaire   +1 more source

A public key cryptosystem using Affine Hill Cipher under modulation of prime number

Journal of Information and Optimization Sciences, 2019
M.K. Viswanath in [1] proposed the concepts a public key cryptosystem using Hill’s Cipher. This paper develops a public key cryptosystem using Affine Hill Cipher.
P. Sundarayya   +2 more
semanticscholar   +1 more source

Counting Homomorphisms Modulo a Prime Number

International Symposium on Mathematical Foundations of Computer Science, 2019
Counting problems in general and counting graph homomorphisms in particular have numerous applications in combinatorics, computer science, statistical physics, and elsewhere.
A. Kazeminia, A. Bulatov
semanticscholar   +1 more source

Home - About - Disclaimer - Privacy