Related papers: Mertens's theorem for splitting primes and more
An elementary proof of Bertrand's theorem is given by examining the radial orbit equation, without needing to solve complicated equations or integrals.
Hardy's uncertainty principle is a classical result in harmonic analysis, stating that a function in $L^2(\mathbb{R}^d)$ and its Fourier transform cannot both decay arbitrarily fast at infinity. In this paper, we extend this principle to…
We survey the classical results on the prime number theorem
We show that there are infinitely many primes $p$ such that not only does $p + 2$ have at most two prime factors, but $p + 6$ also has a bounded number of prime divisors. This refines the well known result of Chen.
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…
Taylor's theorem (and its variants) is widely used in several areas of mathematical analysis, including numerical analysis, functional analysis, and partial differential equations. This article explains how Taylor's theorem in its most…
It is well known that the distribution of the prime numbers plays a central role in number theory. It has been known, since Riemann's memoir in 1860, that the distribution of prime numbers can be described by the zero-free region of the…
Given any number field, we prove that there exist arbitrarily shaped constellations consisting of pairwise non-associate prime elements of the ring of integers. This result extends the celebrated Green-Tao theorem on arithmetic progressions…
In this work, the author shows a sufficient and necessary condition for an integer of the form $(zn-y^n)/(z-y)$ to be divisible by some perfect $mth$ power $p$, where $p$ is an odd prime and $m$ is a positive integer. A constructive method…
It is known that there are infinitely-many prime numbers which take the form of a polynomial of degree one with integer coefficients, this is Dirichlet's theorem. We use an elementary sieving argument together with bounds on the prime…
In this paper we prove sharp Hardy inequalities by using Maximal function theory. Our results improve and extend the well-known results of G.Hardy \cite{Ha04}, T.Cazenave \cite {Ca03}, J.-Y.Chemin\cite {Ch06} and T.Tao\cite {TT06}.
In this paper we study some improvements of the classical Hardy inequality. We add to the right hand side of the inequality a term which depends on some Lorentz norms of $u$ or of its gradient and we find the best values of the constants…
We establish results with an arithmetic flavor that generalize the polynomial multidimensional Szemeredi theorem and related multiple recurrence and convergence results in ergodic theory. For instance, we show that in all these statements…
We give a concise introduction to the theory of continuants and show how Perron used them in his proof of Tietze theorem on the convergence of infinite semi-regular continued fractions, as well as for the study of the convergence of purely…
A short and elementary proof is given of a celebrated eigenvalue-perturbation result due to Alfred Brauer.
This analysis which uses new mathematical methods aims at proving the Riemann hypothesis and figuring out an approximate base for imaginary non-trivial zeros of zeta function at very large numbers, in order to determine the path that those…
Inspired by the proof of the Bertrand postulate given by P. Erd\H{o}S, we carefully examine and solve one less usual inequality in positive integers which could help to find an arithmetically pure proof that for every positive integer…
We study Kummer's approach towards proving the Fermat's last Theorem for regular primes. Some basic algebraic prerequisites are also discussed in this report, and also a brief history of the problem is mentioned. We review among other…
In the first paper under this title (1977), the first author utilized a duality identity between the largest and smallest prime factors involving the Moebius function, to establish the following result as a consequence of the Prime Number…
Herbrand's Theorem is a fundamental result in mathematical logic which provides a reduction of first-order formulas satisfied by a universal class to formulas free of existential quantifiers. In this work, a simpler and self-contained…