Related papers: An improved upper bound for the distribution of it…

Let $G$ be a finite group and $\varphi(G)=|\{a\in G \mid o(a)=\exp(G)\}|$, where $o(a)$ denotes the order of $a$ in $G$ and $\exp(G)$ denotes the exponent of $G$. Under a natural hypothesis, in this note we determine the groups $G$ such…

Let $T_{\epsilon}$ be the noise operator acting on functions on the boolean cube $\{0,1\}^n$. Let $f$ be a nonnegative function on $\{0,1\}^n$ and let $q \ge 1$. We upper bound the $\ell_q$ norm of $T_{\epsilon} f$ by the average $\ell_q$…

We derive an upper bound on the number of models for exact satisfiability (XSAT) of arbitrary CNF formulas F. The bound can be calculated solely from the distribution of positive and negated literals in the formula. For certain subsets of…

We establish asymptotic formulas for sums of reciprocals of primes in arithmetic progressions, generalizing recent results on multiple Mertens evaluations by Tenenbaum, Qi, and Hu. Specifically, for any fixed constant $K>0$, we derive…

We prove new upper bounds for a spectral exponential sum by refining the process by which one evaluates mean values of $L$-functions multiplied by an oscillating function. In particular, we introduce a method which is capable of taking into…

In this paper we improve the upper bound of the third order Hankel determinant for the class of Ozaki close-to-convex functions. The sharp bound is conjectured.

Let $R(n)$ denote the number of rich words of length $n$ over a given finite alphabet. In 2017 it was proved that $\lim_{n\rightarrow\infty} \sqrt[n]{R(n)}=1$; it means the number of rich words has a subexponential growth. However, up to…

We show, conditional on a uniform version of the prime k-tuples conjecture, that there are x(log x)^{-1+o(1)} numbers not exceeding x common to the ranges of Euler's function phi(n) and the sum-of-divisors function sigma(m).

A folklore proof of Euclid's theorem on the infinitude of primes uses the Euler product and the irrationality of $\zeta(2) = \pi^2/6$. A quantified form of Euclid's Theorem is Bertrand's postulate $p_{n+1} < 2p_n$. By quantifying the…

Using a recent verification of the Riemann hypothesis up to height $3\cdot 10^{12}$, we provide strong estimates on $\pi(x)$ and other prime counting functions for finite ranges of $x$. In particular, we get that…

We present a new lower bound for Euler's beta function, $B(x,y)$, which states that the inequality \begin{equation*} B(x,y)>\frac{x+y}{xy}\left(1-\frac{2xy}{x+y+1}\right) \end{equation*} holds on $(0,1]\times(0,1]$, which improves a lower…

This manuscript includes some classical results we select apart from the new results we've found on the Analysis of Boolean Functions and Fourier-Entropy-Influence conjecture. We try to ensure the self-completeness of this work so that…

In this paper we propose an alternative formulation of the binary and ternary Goldbach conjectures as the systems of equations involving the Euler $\phi$-function.

We improve using elementary means an explicit bound on the divisor function due to Friedlander and Iwaniec. Consequently we modestly improve a result regarding a sieving inequality for Gaussian sequences.

We obtain positive and negative results concerning lacunary discrete maximal operators defined by dilations of sufficiently nonsingular hypersurfaces arising from Diophantine equations in many variables. Our negative results show that this…

We give a closed-form expression for $\varphi(1+\varphi(2+\varphi(3+...+\varphi(n)$, where $\varphi$ is Euler's totient function. More generally, for an integer sequence $A=\{a_j\}$ we study the value of…

In this paper, basing on the linear algebra methods and elementary techniques, for any positive integers $ e $ and $ n $, we obtain a recursion formula for the generalized Euler function $ \varphi_e(n) $, which is determined by some…

As a well-known enumerative problem, the number of solutions of the equation $m=m_1+...+m_k$ with $m_1\leqslant...\leqslant m_k$ in positive integers is $\Pi(m,k)=\sum_{i=0}^k\Pi(m-k,i)$ and $\Pi$ is called the additive partition function.…

For each of the functions $f \in \{\phi, \sigma, \omega, \tau\}$ and every natural number $k$, we show that there are infinitely many solutions to the inequalities $f(p_n-1) < f(p_{n+1}-1) < \dots < f(p_{n+k}-1)$, and similarly for…

Let $S=K[x_1,\ldots,x_n]$ be the polynomial ring over the field $K$, and let $I\subset S$ be a graded ideal. It is shown that the higher iterated Hilbert coefficients of the graded $S$-modules $\Tor_i^S(M,I^k)$ and $\Ext^i_S(M,I^k)$ are…