Related papers: An Elementary Proof of the Prime Number Theorem ba…

The unique prime factorization theorem is used to show the existence of a function on a countable set $\mathcal{X}$ so that the sum aggregator function is injective on all multisets of $\mathcal{X}$ of finite size.

We give an estimate for sums appearing in the Nyman-Beurling criterion for the Riemann Hypothesis. These sums contain the M\"obius function and are related to the imaginary part of the Estermann zeta function. The estimate is remarkably…

Let m>=1 be an arbitrary fixed integer and let N_m(x) count the number of odd integers u<=x such that the order of 2 modulo u is not divisible by m. In case m is prime estimates for N_m(x) were given by H. Mueller that were subsequently…

Let $\alpha$ be a real number such that $1< \alpha <2$ and let $x_0=x_0(\alpha)$ be a {\rm(}unique{\rm)} positive solution of the equation $$ x^{\alpha-1} -\frac{\pi}{e^2\sqrt{3}}x +1=0. $$ Then we prove that for each positive integer…

We prove a highly uniform version of the prime number theorem for a certain class of $L$-functions. The range of $x$ depends polynomially on the analytic conductor, and the error term is expressed in terms of an optimization problem…

This work provides a complete characterization of congruent numbers in terms of Pythagorean triples. Specifically, we show that every congruent number can be written as $$\frac{nm\left(m-n\right)\left(m+n\right)}{\sigma^2}$$ were as…

The results of the study provide guidelines for the development and applications of algorithms. When the number of steps for calculating an assumption tends to infinity, probability theory can be applied to predict whether the assumption…

Under Cram\'er's conjecture concerning the prime numbers, we prove that for any $x>1$, there exists a real $A=A(x)>1$ for which the formula $[A^{n^x}]$ (where $[]$ denotes the integer part) gives a prime number for any positive integer $n$.…

We introduce the sequence $(a_n) \subset (0,1]$ and prove that the asymptotic behaviour of $\sum_{k=1}^n a_k$ is the same than $\pi(n)$, the prime-counting function. We also obtain that $\pi(n) \sim n a_n$ and we estimate…

By considering the prime zeta function, the author intended to demonstrate in that the Riemann zeta function zeta(s) does not vanish for Re(s)>1/2, which would have proven the Riemann hypothesis. However, he later realised that the proof of…

Denote by $N(n)$ the number of integer solutions $(x_1,\,x_2,\ldots ,x_n)$ of the equation $x_1+x_2+\ldots+x_n=x_1x_2\cdot\ldots\cdot x_n$ such that $x_1\ge x_2\ge\ldots\ge x_n\ge 1$, $n \in \mathbb{Z}^+$. The aim of this paper are is…

In this short note, we give two proofs of the infinitude of primes via valuation theory and give a new proof of the divergence of the sum of prime reciprocals by Roth's theorem and Euler-Legendre's theorem for arithmetic progressions.

In his Classical approximation to the Twin prime problem, Selberg proved that for $x$ sufficiently large, there is an $n \in (x,2x)$ such that $2^{\Omega(n)}+2^{\Omega(n+2)} \leq \lambda$ with $\lambda=14$, where $\Omega(n)$ is the number…

Multivariate distributions are explored using the joint distributions of marginal sample quantiles. Limit theory for the mean of a function of order statistics is presented. The results include a multivariate central limit theorem and a…

We study in an explicit manner the partial sums of the multiplicative inverse of the Riemann zeta function and its derivative.

We present a notion of primitive which corresponds exactly with the Riemann integral. We obtain a characterization of the integrability in the sense of Riemann which produces a Fundamental Theorem of Calculus without special assumptions. We…

From known effective bounds on the prime counting function of the form \[ |\pi(x)-\mathrm{Li}(x)| < a \;x \;(\ln x)^{b} \; \exp\left(-{c}\; \sqrt{\ln x}\right); \qquad (x \geq x_0); \] it is possible to establish exponentially tight…

Let v be a multiplicative arithmetic function with support of positive asymptotic density. We prove that for any not identically zero arithmetic function f such that \sum_{f(n) \neq 0} 1 / n < \infty, the support of the Dirichlet…

Recently, Merca and Schmidt proved a number of identities relating partitions of an integer with two classic number-theoretic functions, namely the M\"obius function and Euler's totient function. Their demonstrations were mainly algebraic.…

We prove an asymptotic formula for the number of integers $\leq x$ which can be written as the product of $k ~(\geq 2)$ distinct primes $p_1\cdots p_k$ with each prime factor in an arithmetic progression $p_j\equiv a_j \bmod q$, $(a_j,…