Related papers: On the Oscillations of Multiplicative Functions Ta…

Let $f(n)$ denote the number of unordered factorizations of a positive integer $n$ into factors larger than $1$. We show that the number of distinct values of $f(n)$, less than or equal to $x$, is at most $\exp \left( C \sqrt{\frac{\log…

We study two models of random multiplicative functions: Rademacher random multiplicative functions supported on the squarefree integers $f$, and Rademacher random completely multiplicative functions $f^*$. We prove that the partial sums…

We prove that if $f$ is a random completely multiplicative function, conditional $f(p)=1$ for each prime $p \le (\log x)^{2-\epsilon}$, the probability that $\sum_{1\le n \le N}f(n)\ge 0$ for all $N\le x$ is $o(1)$ as $x \rightarrow…

We show that if $f$ is the random completely multiplicative function, the probability that $\sum_{n\le x}\frac{f(n)}{n}$ is positive for every $x$ is at least $1-10^{-45}$, while also strictly smaller than $1$. For large $x$, we prove an…

Tur\'an observed that logarithmic partial sums $\sum_{n\le x}\frac{f(n)}{n}$ of completely multiplicative functions (in the particular case of the Liouville function $f(n)=\lambda(n)$) tend to be positive. We develop a general approach to…

The function $\sum_{p\leq x} \frac{1}{p} - \log\log(x) - M$ is known to change sign infinitely often, but so far all calculated values are positive. In this paper we prove that the first sign change occurs well before $\exp(495.702833165)$.

We prove that when $f$ is a Rademacher random multiplicative function for any $\epsilon>0$, then $\sum_{n \leqslant x}\frac{f(n)}{\sqrt{n}} \ll (\log\log(x))^{3/4+\epsilon}$ for almost all $f$. We also show that there exist arbitrarily…

We show that the functions $\sum_{p\leq x} (\log p)/p - \log x - E$ and $\sum_{p\leq x} 1/p - \log \log x -B$ change sign infinitely often, and that under certain assumptions, they exhibit a strong bias towards positive values. These…

Let $f$ be a Rademacher random multiplicative function. Let $$M_f(u):=\sum_{n \leq u} f(n)$$ be the partial sum of $f$. Let $V_f(x)$ denote the number of sign changes of $M_f(u)$ up to $x$. We show that for any constant $c > 2$, $$V_f(x) =…

Roughly speaking, the spectrum of multiplicative functions is the set of all possible mean values. In this paper, we are interested in the spectra of multiplicative functions supported over powerful numbers. We prove that its real…

Let $f(n)$ denote a multiplicative function with range $\{-1,0,1\}$, and let $F(x) = \sum_{n\leq x} f(n)$. Then $F(x)/\sqrt{x} = a\sqrt{x} + b + E(x)$, where $a$ and $b$ are constants and $E(x)$ is an error term that either tends to $0$ in…

Let $f$ be a completely multiplicative function that assumes values inside the unit disc. We show that if $\sum_{n<x} f(n) \ll x/(\log x)^A$, $x>2$, for some $A>2$, then either $f(p)$ is small on average or $f$ pretends to be $\mu(n)n^{it}$…

Following Wigert, various authors, including Ramanujan, Gronwall, Erd\H{o}s, Ivi\'{c}, Schwarz, Wirsing, and Shiu, determined the maximal order of several multiplicative functions, generalizing Wigert's result $$\max_{n\leq x} \log d(n) =…

We prove that if $f(n)$ is a Steinhaus or Rademacher random multiplicative function, there almost surely exist arbitrarily large values of $x$ for which $|\sum_{n \leq x} f(n)| \geq \sqrt{x} (\log\log x)^{1/4+o(1)}$. This is the first such…

We provide a simple proof that the partial sums $\sum_{n\leq x}f(n)$ of a Rademacher random multiplicative function $f$ change sign infinitely often as $x\to\infty$, almost surely.

An integer is said to be $y$-friable if its greatest prime factor P(n) is less than $y$. In this paper, we study numbers of the shape $n-1$ when $P(n)\leq y$ and $n\leq x$. One expects that, statistically, their multiplicative behaviour…

Let K_n denote the smaller mode of the nth row of Stirling numbers of the second kind S(n, k). Using a probablistic argument, it is shown that for all n>=2, [exp(w(n))]-2<=K_n<=[exp(w(n))]+1, where [x] denotes the integer part of x, and…

A real arithmetic function f is multiplicatively monotonous if f (mn) -- f (m) has constant sign for m, n positive integers. Properties and examples of such functions are discussed, with applications to positive hermitian…

Consider the positive integers $n$ such that $n$ divides the $n$-th Fibonacci number, and their counting function $A$. We prove that \[A(x) \leq x^{1-(1/2+o(1))\log\log\log x/\log\log x}.\]

In this paper we consider the iteration of infinitely many signed exponentials with the same base but the signs may vary. We show that for every base in an explicit interval this iteration converges for any sequence of signs and all the…