Related papers: Numerically explicit estimates for the distributio…

For each integer $b \geq 3$ and every $x \geq 1$, let $\mathcal{N}_{b,0}(x)$ be the set of positive integers $n \leq x$ which are divisible by the product of their nonzero base $b$ digits. We prove bounds of the form $x^{\rho_{b,0} + o(1)}…

A well-known discovery of Feige's is the following: Let $X_1, \ldots, X_n$ be nonnegative independent random variables, with $\mathbb{E}[X_i] \leq 1 \;\forall i$, and let $X = \sum_{i=1}^n X_i$. Then for any $n$, \[\Pr[X < \mathbb{E}[X] +…

Let $\varepsilon>0$. We construct an explicit, full-measure set of $\alpha \in[0,1]$ such that if $\gamma \in \mathbb{R}$ then, for almost all $\beta \in[0,1]$, if $\delta \in \mathbb{R}$ then there are infinitely many integers $n\geq 1$…

Let $ \mu $ be the self-similar measure associated with a homogeneous iterated function system $ \Phi = \{ \lambda x + t_j \}_{j=1}^m $ on ${\Bbb R}$ and a probability vector $ (p_{j})_{j=1}^m$, where $0\neq \lambda\in (-1,1)$ and $t_j\in…

In classical statistics and distribution testing, it is often assumed that elements can be sampled from some distribution $P$, and that when an element $x$ is sampled, the probability $P$ of sampling $x$ is also known. Recent work in…

The well-known Hardy--Ramanujan inequality states that if $\omega(n)$ denotes the number of distinct prime factors of a positive integer $n$, then there is an absolute constant $C>0$ such that uniformly for $x\ge2$ and $k\in\mathbb{N}$,…

Random integers, sampled uniformly from $[1,x]$, share similarities with random permutations, sampled uniformly from $S_n$. These similarities include the Erd\H{o}s--Kac theorem on the distribution of the number of prime factors of a random…

Let a and b be non-zero rational numbers that are multiplicatively independent. We study the natural density of the set of primes p for which the subgroup of the multiplicative group of the finite field with p elements generated by (a\mod…

Landau's well known asymptotic formula $$N_k(x):=\ \mid\{n\leq x : \Omega(n)=k\}\mid \ \sim \left( \frac{x}{\log x} \right) \frac{(\log\log x)^{k-1}}{(k - 1)!}\ \ (x \rightarrow \infty),$$ which also holds for $$\pi_k(x):=\ \mid\{n\leq x :…

As for the Fourier transforms of positive and integrable functions supported in the unit interval, we make a list of improvements for P\'olya's results on the distribution of their positive zeros and give new sufficient conditions under…

We study the probability distribution of the index ${\mathcal N}_+$, i.e., the number of positive eigenvalues of an $N\times N$ Gaussian random matrix. We show analytically that, for large $N$ and large $\mathcal{N}_+$ with the fraction…

Let $p>3$ be a prime. Euler numbers $E_{p-3}$ first appeared in H. S. Vandiver's work (1940) in connection with the first case of Fermat Last Theorem. Vandiver proved that $x^p+y^p=z^p$ has no solution for integers $x,y,z$ with…

A Thue-Mahler equation is a Diophantine equation of the form $$F(X,Y) = a\cdot p_1^{z_1}\cdots p_v^{z_v}, \qquad \gcd(X,Y)=1$$ where $F$ be an irreducible homogeneous binary form of degree at least $3$ with integer coefficients, $a$ is a…

Let $\phi(n)$ be the Euler-phi function, define $\phi_0(n) = n$ and $\phi_{k+1}(n)=\phi(\phi_{k}(n))$ for all $k\geq 0$. We will determine an asymptotic formula for the set of integers $n$ less than $x$ for which $\phi_k(n)$ is $y$-smooth,…

We describe a simple and efficient procedure for approximating the L\'evy measure of a $\text{Gamma}(\alpha,1)$ random variable. We use this approximation to derive a finite sum-representation that converges almost surely to Ferguson's…

We study chance constrained optimization problems $\min_x f(x)$ s.t. $P(\left\{ \theta: g(x,\theta)\le 0 \right\})\ge 1-\epsilon$ where $\epsilon\in (0,1)$ is the violation probability, when the distribution $P$ is not known to the decision…

This paper studies the properties of the probability density function $p_{\alpha,\nu, n}(\mathbf{x})$ of the $n$-variate generalized Linnik distribution whose characteristic function $\varphi_{\alpha,\nu,n}(\boldsymbol{t})$ is given by…

In this paper we prove two results. The first theorem uses a paper of Kim \cite{K} to show that for fixed primes $p_1,...,p_k$, and for fixed integers $m_1,...,m_k$, with $p_i\not|m_i$, the numbers $(e_{p_1}(n),...,e_{p_k}(n))$ are…

A natural integer is called $y$-ultrafriable if none of the prime powers occurring in its canonical decomposition exceed $y$. We investigate the distribution of $y$-ultrafriable integers not exceeding $x$ among arithmetic progressions to…

By using Beta Dirichlet series and then Eisenstein series we ca represent primes with first a good approximation and an exact expression. This can be done with arbitrary prime (up to 10^101).