Let $L(s)=\sum_{n=1}^{+\infty}\dfrac{a(n)}{n^s}$ be a Dirichlet series were $a(n)$ is a bounded completely multiplicative function. We prove that if $L(s)$ extends to a holomorphic function on the open half space $\Re s >1-δ$, $δ>0$ and $L(1)=0$ then such a half space is a zero free region of the Riemann zeta function $ζ(s)$. Similar results is proven for completely multiplicative functions defined on the space of the ideals of the ring of the algebraic integers of a number field of finite degree.
Euler wrote a formula expressing that l(n)/n is a completely multiplicative function with sum 0 (a CMO function) , where l(n) is the completely multiplicative function equal to -1 on the prime numbers (the Liouville function). We extend this formula to Beurling generalized numbers, using a result of Diamond. As an application we show how to construct a CMO function carried by a set of integers whose counting function is of the form D x^a (1+o(1) ) for any a between 0 and 1.
In this article we prove that all completely multiplicative automatic sequences $(a_n)_{n \in \mathbf{N}}$ defined on $\mathbf{C}$, vanishing or not, can be written in the form $a_n=b_nχ_n$ where $(b_n)_{n \in \mathbf{N}}$ is an almost constant sequence, and $(χ_n)_{n \in \mathbf{N}}$ is a Dirichlet character.
In this article we consider the completely multiplicative sequences $(a_n)_{n \in \mathbf{N}}$ defined on a field $\mathbf{K}$ and satisfying $$\sum_{p| p \leq n, a_p \neq 1, p \in \mathbf{P}}\frac{1}{p}<\infty,$$ where $\mathbf{P}$ is the set of prime numbers. We prove that if such sequences are automatic then they cannot have infinitely many prime numbers $p$ such that $a_{p}\neq 1$. Using this fact, we prove that if a completely multiplicative sequence $(a_n)_{n \in \mathbf{N}}$, vanishing or not, can be written in the form $a_n=b_nχ_n$ such that $(b_n)_{n \in \mathbf{N}}$ is a non ultimate…
We prove that if $A$ is an infinite multiplicative Sidon set, then $\liminf\limits_{n\to \infty}\frac{|A(n)|-π(n)}{\frac{n^{3/4}}{(\log n)^3}}<\infty$ and construct an infinite multiplicative Sidon set satisfying $\liminf\limits_{n\to \infty}\frac{|A(n)|-π(n)}{\frac{n^{3/4}}{(\log n)^3}}>0$.
$CMO$ functions are completely multiplicative functions $f$ for which $\sum_{n=1}^\infty f(n)$ $=0$. These functions were first introduced and studied by Kahane and Saïas [5]. The main purpose of this paper is to generalise such functions to multiplicative functions and we shall call them $MO$ functions. More precisely, we define $MO$ functions to be multiplicative functions for which $\sum_{n=1}^\infty f(n) = 0$ and $\sum_{k=0}^\infty f(p^k)$ $\ne 0$ for all $p \in \mathbb{P}$. We give some properties and find examples of $MO$ functions, as well as pointing out the connection between these fu…
We prove that any $q$-automatic completely multiplicative function $f:\mathbb{N}\to\mathbb{C}$ essentially coincides with a Dirichlet character. This answers a question of J. P. Allouche and L. Goldmakher and confirms a conjecture of J. Bell, N. Bruin and M. Coons for completely multiplicative functions. Further, assuming two standard conjectures in number theory, the methods allows for removing the assumption of completeness.
In this article, we study the behavior of consecutive values of random completely multiplicative functions $(X_n)_{n \geq 1}$ whose values are i.i.d. at primes. We prove that for $X_2$ uniform on the unit circle, or uniform on the set of roots of unity of a given order, and for fixed $k \geq 1$, $X_{n+1}, \dots, X_{n+k}$ are independent if $n$ is large enough. Moreover, with the same assumption, we prove the almost sure convergence of the empirical measure $N^{-1} \sum_{n=1}^N δ_{(X_{n+1}, \dots, X_{n+k})}$ when $N$ goes to infinity, with an estimate of the rate of convergence. At the end of t…
Let $f$ be a positive multiplicative function and let $k\geq 2$ be an integer. We prove that if the prime values $f(p)$ converge to $1$ sufficiently slowly as $p\rightarrow +\infty$, in the sense that $\sum_{p}|f(p)-1|=\infty$, there exists a real number $c>0$ such that the $k$-tuples $(f(p+1),\ldots,f(p+k))$ are dense in the hypercube $[0,c]^k$ or in $[c,+\infty)^k$. In particular, the values $f(p+1),\ldots,f(p+k)$ can be put in any increasing order infinitely often. Our work generalises previous results of De Koninck and Luca.
In the first chapter, we will present a computation of the square value of the module of L functions associated to a Dirichlet character. This computation suggests to ask if a certain ring of arithmetic multiplicative functions exists and if it is unique. This search has led to the construction of that ring in chapter two. Finally, in the third chapter, we will present some propositions associated with this ring. The result below is one of the main results of this work : For F and G two completely multiplicative functions, $ s $ a complex number such as the dirichlet series $ D(F,s) $ and $ D(…
It is observed that the infinite matrix with entries $(\sqrt{mn}\log (mn))^{-1}$ for $m, n\ge 2$ appears as the matrix of the integral operator $\mathbf{H}f(s):=\int_{1/2}^{+\infty}f(w)(ζ(w+s)-1)dw$ with respect to the basis $(n^{-s})_{n\ge 2}$; here $ζ(s)$ is the Riemann zeta function and $H$ is defined on the Hilbert space ${\mathcal H}^2_0$ of Dirichlet series vanishing at $+\infty$ and with square-summable coefficients. This infinite matrix defines a multiplicative Hankel operator according to Helson's terminology or, alternatively, it can be viewed as a bona fide (small) Hankel operator o…
Let $\mathcal{B} = (B_1,\ldots, B_h)$ be an $h$-tuple of sets of positive integers. Let $g_{\mathcal{B} }(n)$ count the number of representations of $n$ in the form $n = b_1\cdots b_h$, where $b_i \in B_i$ for all $i \in \{1,\ldots, h\}$. It is proved that $\liminf_{n\rightarrow \infty} g_{\mathcal{B} }(n) \geq 2$ implies $\limsup_{n\rightarrow \infty} g_{\mathcal{B} }(n) = \infty$.
We consider a wide class of summatory functions F{f;N,p^m}=\sum_{k\leq N}f(p^m k), m\in \mathbb Z_+\cup {0}, associated with the multiplicative arithmetic functions f of a scaled variable k\in \mathbb Z_+, where p is a prime number. Assuming an asymptotic behavior of summatory function, F{f;N,1}\stackrel{N\to \infty}{=}G_1(N) [1+ {\cal O}(G_2(N))], where G_1(N)=N^{a_1}(log N)^{b_1}, G_2(N)=N^{-a_2}(log N)^{-b_2} and a_1, a_2\geq 0, -\infty < b_1, b_2< \infty, we calculate a renormalization function defined as a ratio, R(f;N,p^m)=F{f;N,p^m}/F{f;N,1}, and find its asymptotics R_{\infty}(f;p^m) w…
For completely multiplicative functions f(n) taking values 1 and -1, under certain conditions on f(n) we show that f(n) changes sign at least x exp(-7(log log x)sqrt(log x)) times as n runs through the integers <= x.
Define {\em the Liouville function for $A$}, a subset of the primes $P$, by $λ_{A}(n) =(-1)^{Ω_A(n)}$ where $Ω_A(n)$ is the number of prime factors of $n$ coming from $A$ counting multiplicity. For the traditional Liouville function, $A$ is the set of all primes. Denote $$L_A(n):=\sum_{k\leq n}λ_A(n)\quad{and}\quad R_A:=\lim_{n\to\infty}\frac{L_A(n)}{n}.$$ We show that for every $α\in[0,1]$ there is an $A\subset P$ such that $R_A=α$. Given certain restrictions on $A$, asymptotic estimates for $\sum_{k\leq n}λ_A(k)$ are also given. With further restrictions, more can be said. For {\em character…
We establish several results concerning the expected general phenomenon that, given a multiplicative function $f:\mathbb{N}\to\mathbb{C}$, the values of $f(n)$ and $f(n+a)$ are "generally" independent unless $f$ is of a "special" form. First, we classify all bounded completely multiplicative functions having uniformly large gaps between its consecutive values. This implies the solution of the following folklore conjecture: for any completely multiplicative function $f:\mathbb{N}\to\mathbb{T}$ we have $$\liminf_{n\to\infty}|f(n+1)-f(n)|=0.$$ Second, we settle an old conjecture due to N.G. Chuda…
Let p be a prime number. The p-adic case of the Mixed Littlewood Conjecture states that liminf_{q \to \infty} q . |q|_p . ||q x|| = 0 for all real numbers x. We show that with the additional factor of log q.loglog q the statement is false. Indeed, our main result implies that the set of x for which liminf_{q\to\infty} q . log q . loglog q. |q|_p . ||qx|| > 0 is of full dimension. The result is obtained as an application of a general framework for Cantor sets developed in this paper.
We characterize all pairs of completely multiplicative functions $f,g:\mathbb{N}\to\mathbb{T}$ such that the orbit closure \[\overline{\{(f(n),g(n+1))\}_{n\ge 1}} \neq \mathbb{T}\times \mathbb{T}.\] In so doing, we settle an old conjecture of Zoltán Daróczy and Imre Kátai.
A first encounter with $A(λ) := \int_0^{+\infty}\{λt\}\{t\}t^{-2}dt.$ This text contains the detailed calculations leading to the results of our paper "Etude de l'autocorrelation multiplicative de la fonction "partie fractionnaire"", to appear in the Ramanujan Journal.
We show that Sarnak's conjecture on Möbius disjointness holds in every uniquely ergodic modelof a quasi-discrete spectrum automorphism. A consequence of this result is that, for each non constant polynomial $P\in\R[x]$ with irrational leading coefficient and for each multiplicative function $\bnu:\N\to\C$, $|\bnu|\leq1$, we have\[ \frac{1}{M} \sum\_{M\le m\textless{}2M} \frac{1}{H} \left| \sum\_{m\le n \textless{} m+H} e^{2πiP(n)}\bnu(n) \right|\longrightarrow 0 \] as $M\to\infty$, $H\to\infty$, $H/M\to 0$.
We prove the Zilber--Pink conjecture for curves in $Y(1)^n$ whose Zariski closure in $(\mathbb{P}^1)^n$ passes through the point $(\infty, \ldots, \infty)$, going beyond the asymmetry condition of Habegger and Pila. Our proof is based on a height bound following André's G-functions method. The principal novelty is that we exploit relations between evaluations of G-functions at unboundedly many non-archimedean places.
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.
The null-function $0(a):=0$, $\forall a\in $N, has Ramanujan expansions: $0(a)=\sum_{q=1}^{\infty}(1/q)c_q(a)$ (where $c_q(a):=$ Ramanujan sum), given by Ramanujan, and $0(a)=\sum_{q=1}^{\infty}(1/φ(q))c_q(a)$, given by Hardy ($φ:=$ Euler's totient function). Both converge pointwise (not absolutely) in N. A $G:$N $\rightarrow $C is called a Ramanujan coefficient, abbrev. R.c., iff (if and only if) $\sum_{q=1}^{\infty}G(q)c_q(a)$ converges in all $a\in $N; given $F:$N $\rightarrow $C, we call $<F>$, the set of its R.c.s, the Ramanujan cloud of $F$. Our Main Theorem in arxiv:1910.14640, for Rama…
We consider the random functions $S_N(z):=\sum_{n=1}^N z(n) $, where $z(n)$ is the completely multiplicative random function generated by independent Steinhaus variables $z(p)$. It is shown that ${\Bbb E} |S_N|\gg \sqrt{N}(\log N)^{-0.05616}$ and that $({\Bbb E} |S_N|^q)^{1/q}\gg_{q} \sqrt{N}(\log N)^{-0.07672}$ for all $q>0$.
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 $μ(n)n^{it}$ for some $t$.
Let S be a subset of the unit disk, and let F(s) denote the class of completely multiplicative functions f such that f(p) is in S for all primes p. The authors' main concern is which numbers arise as mean-values of functions in F(s). More precisely, let Gamma_N(S) = {1/N sum_{n <= N} f(n): f in F(S)} and Gamma(S) = lim_{N -> infinity} Gamma_N(s). The authors call Gamma(S) the spectrum of the set S, and study its properties.
We study sets of recurrence, in both measurable and topological settings, for actions of $(\mathbb{N},\times)$ and $(\mathbb{Q}^{>0},\times)$. In particular, we show that autocorrelation sequences of positive functions arising from multiplicative systems have positive additive averages. We also give criteria for when sets of the form $\{(an+b)^{\ell}/(cn+d)^{\ell}: n \in \mathbb{N}\}$ are sets of multiplicative recurrence, and consequently we recover two recent results in number theory regarding completely multiplicative functions and the Omega function.
Bounded Exponential Sums with Multiplicative Coefficients
Institut de Mathématiques de Jussieu-Paris Rive Gauche, Université Paris Cité, Sorbonne Université, CNRS（巴黎左岸数学研究所，巴黎西岱大学，索邦大学，法国国家科学研究中心）；Faculty of Mathematics, University of Cambridge（剑桥大学数学系）；School of Mathematics, University of Bristol（布里斯托尔大学数学学院）
Let $f$ be a Rademacher or a Steinhaus random multiplicative function. Let $\varepsilon>0$ small. We prove that, as $x\rightarrow +\infty$, we almost surely have $$\bigg|\sum_{\substack{n\leq x\\ P(n)>\sqrt{x}}}f(n)\bigg|\leq\sqrt{x}(\log\log x)^{1/4+\varepsilon},$$ where $P(n)$ stands for the largest prime factor of $n$. This gives an indication of the almost sure size of the largest fluctuations of $f$.
In this paper, we find asymptotic formula for the following sum with explicit error term: \[M_{x}(g_{1}, g_{2}, g_3)=\frac{1}{x}\sum_{n\le x}g_{1}(F_1(n))g_{2}(F_2(n))g_{3} (F_3(n)),\] where $F_1(x), F_2(x)$ and $F_3(x)$ are polynomials with integer coefficients and $g_1,g_2,g_3$ are multilpicative functions with modulus less than or equal to $1.$ Moreover, under some assumption on $g_1,g_2,$ we prove that as $x\rightarrow \infty,$ \[\frac{1}{x}\sum\limits_{n\le x}g_1(n+3)g_2(n+2)μ(n+1)=o(1)\] and assuming $2$-point Chowla type conjecture we show that as $x\rightarrow \infty,$ \[\frac{1}{x}\su…
We say a power series $\sum_{n=0}^\infty a_n q^n$ is multiplicative if the function $n\mapsto a_n/a_1$ ($n\ge 1$) is so. In this paper, we consider multiplicative power series $f$ such that $f^2$ is also multiplicative. We find various solutions for which $f$ is a rational function or a theta series and prove that the complete set of solutions is the locus of a (probably reducible) affine variety over C. The precise determination of this variety is a finite computational problem but seems to be outside the reach of current computer algebra systems. The proof of the theorem depends on a bound o…
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 asymptotic upper bound of $O(\exp(-\exp( \frac{\log x}{C\log \log x })))$ on the exceptional probability that a particular truncation is negative, where $C$ is some positive constant.
We extend the Matomäki-Radziwiłł theorem to a large collection of unbounded multiplicative functions that are uniformly bounded, but not necessarily bounded by 1, on the primes. Our result allows us to estimate averages of such a function $f$ in typical intervals of length $h(\log X)^c$, with $h = h(X) \rightarrow \infty$ and where $c = c_f \geq 0$ is determined by the distribution of $\{|f(p)|\}_p$ in an explicit way. We give three applications. First, we show that the classical Rankin-Selberg-type asymptotic formula for partial sums of $|λ_f(n)|^2$, where $\{λ_f(n)\}_n$ is the sequence of no…
We introduce a simple sieve-theoretic approach to studying partial sums of multiplicative functions which are close to their mean value. This enables us to obtain various new results as well as strengthen existing results with new proofs. As a first application, we show that for a completely multiplicative function $f : \mathbb{N} \to \{-1,1\},$ \begin{align*} \limsup_{x\to\infty}\Big|\sum_{n\leq x}μ^2(n)f(n)\Big|=\infty. \end{align*} This confirms a conjecture of Aymone concerning the discrepancy of square-free supported multiplicative functions. Secondly, we show that a completely multiplica…
Let $A$ be a subset of a finite field $\mathbb{F}$. When $\mathbb{F}$ has prime order, we show that there is an absolute constant $c > 0$ such that, if $A$ is both sum-free and equal to the set of its multiplicative inverses, then $|A| < (0.25 - c)|\mathbb{F}| + o(|\mathbb{F}|)$ as $|\mathbb{F}| \rightarrow \infty$. We contrast this with the result that such sets exist with size at least $0.25|\mathbb{F}| - o(|\mathbb{F}|)$ when $\mathbb{F}$ has characteristic $2$.
In this short note we prove the following result: If a completely multiplicative function $f:\mathbb{N}\to[-1,1]$ is small on average in the sense that $\sum_{n\leq x}f(n)\ll x^{1-δ}$, for some $δ>0$, and if the Dirichlet series of $f$, say $F(s)$, is such that $F(1)=0$, then we obtain that for any $ε>0$, $\sum_{p\leq x}(1+f(p))\log p\ll x^{1-δ+ε}$. Moreover, a necessary condition for the existence of such $f$ is that the Riemann zeta function $ζ(s)$ has no zeros in the half plane $Re(s)>1-δ$.
We prove that if $ω$ is uniformly distributed on $[0,1]$, then as $T\to\infty$, $t\mapsto ζ(iωT+it+1/2)$ converges to a non-trivial random generalized function, which in turn is identified as a product of a very well behaved random smooth function and a random generalized function known as a complex Gaussian multiplicative chaos distribution. This demonstrates a novel rigorous connection between number theory and the theory of multiplicative chaos -- the latter is known to be connected to many other areas of mathematics. We also investigate the statistical behavior of the zeta function on the …
Turán 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)=λ(n)$) tend to be positive. We develop a general approach to prove two results aiming to explain this phenomena. Firstly, we show that for every $\varepsilon>0$ there exists some $x_0\ge 1,$ such that for any completely multiplicative function $f$ satisfying $-1\le f(n)\le 1$, we have $$\sum_{n\le x}\frac{f(n)}{n}\ge -\frac{1}{(\log\log{x})^{1-\varepsilon}}, \quad x\ge x_0.$$ This improves a previous bound due to Granville and…
We introduce several classes of monoids satisfying up to five axioms and establish basic theories on their arithmetics. The one satisfying all the axioms is named natural monoid. Two typical examples are 1) the monoid $\mathbb{N}$ of natural numbers in the group of positive rationals and 2) a certain monoid $\mathbb{S}$ in one of Thompson's groups. The latter one is non-abelian, which serves as an important example for non-commutative arithmetics. Defining primes in a non-abelian monoid $S$ is highly non-trivial, which relies on a concept we called `castling'. Three types of castlings are esse…
Let $E$ be an elliptic curve---defined over a number field $K$---without complex multiplication and with good ordinary reduction at all the primes above a rational prime $p \geq 5$. We construct a pairing on the dual $p^\infty$-Selmer group of $E$ over any strongly admissible $p$-adic Lie extension $K_\infty/K$ under the assumption that it is a torsion module over the Iwasawa algebra of the Galois group $G=\operatorname{Gal}(K_\infty/K)$. Under some mild additional hypotheses this gives an algebraic functional equation of the conjectured $p$-adic L-function. As an application we construct comp…
We present a class of multiplicative functions $f:\mathbb{N}\to\mathbb{C}$ with bounded partial sums. The novelty here is that our functions do not need to have modulus bounded by $1$. The key feature is that they pretend to be the constant function $1$ and that for some prime $q$, $\sum_{k=0}^\infty \frac{f(q^k)}{q^k}=0$. These combined with other conditions guarantee that these functions are periodic and have sum equal to zero inside each period. Further, we study the class of multiplicative functions $f=f_1\ast f_2$, where each $f_j$ is multiplicative and periodic with bounded partial sums.…
In this paper, we give various identities for the weighted average of the product of generalized Anderson-Apostol sums with weights concerning completely multiplicative function, completely additive function, logarithms, the Gamma function, Bernoulli polynomials and binomial coefficients respectively. Our results generalize many known results.
We determine the order of magnitude of $\mathbb{E}|\sum_{n \leq x} f(n)|^{2q}$, where $f(n)$ is a Steinhaus or Rademacher random multiplicative function, and $0 \leq q \leq 1$. In the Steinhaus case, this is equivalent to determining the order of $\lim_{T \rightarrow \infty} \frac{1}{T} \int_{0}^{T} |\sum_{n \leq x} n^{-it}|^{2q} dt$. In particular, we find that $\mathbb{E}|\sum_{n \leq x} f(n)| \asymp \sqrt{x}/(\log\log x)^{1/4}$. This proves a conjecture of Helson that one should have better than squareroot cancellation in the first moment, and disproves counter-conjectures of various other …
Completely multiplicative functions whose sum is zero ($CMO$).The paper deals with $CMO$, meaning completely multiplicative ($CM$) functions $f$ such that $f(1)=1$ and $\sum\limits\_1^\infty f(n)=0$. $CM$ means $f(ab)=f(a)f(b)$ for all $(a,b)\in \N^{*2}$, therefore $f$ is well defined by the $f(p)$, $p$ prime. Assuming that $f$ is $CM$, give conditions on the $f(p)$, either necessary or sufficient, both is possible, for $f$ being $CMO$ : that is the general purpose of the authors.The $CMO$ character of $f$ is invariant under slight modifications of the sequence $(f(p))$ (theorem 3). The same i…
Let $λ$ denote the Liouville function. We show that as $X \rightarrow \infty$, $$ \int_{X}^{2X} \sup_α \left | \sum_{x < n \leq x + H} λ(n) e(-αn) \right | dx = o ( X H) $$ for all $H \geq X^θ$ with $θ> 0$ fixed but arbitrarily small. Previously, this was only known for $θ> 5/8$. For smaller values of $θ$ this is the first `non-trivial' case of local Fourier uniformity on average at this scale. We also obtain the analogous statement for (non-pretentious) $1$-bounded multiplicative functions. We illustrate the strength of the result by obtaining cancellations in the sum of $λ(n) Λ(n + h) Λ(n + …
In this article we study the asymptotic behaviour of the correlation functions over polynomial ring $\mathbb{F}_q[x]$. Let $\mathcal{M}_{n, q}$ and $\mathcal{P}_{n, q}$ be the set of all monic polynomials and monic irreducible polynomials of degree $n$ over $\mathbb{F}_q$ respectively. For multiplicative functions $ψ_1$ and $ψ_2$ on $\mathbb{F}_q[x]$, we obtain asymptotic formula for the following correlation functions for a fixed $q$ and $n\to \infty$ \begin{align*} &S_{2}(n, q):=\displaystyle\sum_{f\in \mathcal{M}_{n, q}}ψ_1(f+h_1) ψ_2(f+h_2), \\ &R_2(n, q):=\displaystyle\sum_{P\in \mathcal{…
Let $f_1,\ldots,f_k : \mathbb{N} \rightarrow \mathbb{C}$ be multiplicative functions taking values in the closed unit disc. Using an analytic approach in the spirit of Halász' mean value theorem, we compute multidimensional averages of the shape $$x^{-l} \sum_{\mathbf{n} \in [x]^l} \prod_{1 \leq j \leq k} f_j(L_j(\mathbf{n}))$$ as $x \rightarrow \infty$, where $[x] := [1,x]$ and $L_1,\ldots, L_k$ are affine linear forms that satisfy some natural conditions. Our approach gives a new proof of a result of Frantzikinakis and Host that is distinct from theirs, with \emph{explicit} main and error te…
We study sums of a random multiplicative function; this is an example, of number-theoretic interest, of sums of products of independent random variables (chaoses). Using martingale methods, we establish a normal approximation for the sum over those n \leq x with k distinct prime factors, provided that k = o(log log x) as x \rightarrow \infty. We estimate the fourth moments of these sums, and use a conditioning argument to show that if k is of the order of magnitude of log log x then the analogous normal limit theorem does not hold. The methods extend to treat the sum over those n \leq x with a…
