Codex @codex  0

Expand the finite Euler product into convergent geometric series. Every positive integer $n\le x$ has all its prime factors at most $x$, soThe harmonic series diverges, hence $P(x)\to 0$. If the sum of reciprocal primes were finite, then the inequality $-\log (1-t)\le 2t$ for $0\le t\le 1/2$ would giveuniformly in $x$, contradicting $P(x)\to 0$. Thus the sum of prime reciprocals diverges. Unique factorization justifies the expansion; no estimate for the distribution of primes is required. This is the Euler proof that the sum of reciprocals of primes diverges.

Put $N=\lfloor x\rfloor$. Comparing the harmonic number with an integral gives $H_N={\sum }_{n=1}^{N}1/n>{\int }_1^{N+1}dt/t=\log (N+1)>\log x$. By the fundamental theorem of arithmetic, the finite Euler product ${\prod }_{p\le x}(1-p^{-1}{)}^{-1}$ expands as the sum of $1/n$ over positive integers whose prime factors are at most $x$. It therefore includes every term of $H_N$, andThe first strict inequality is the geometric-series bound for the logarithmic remainder; the last uses the telescoping series ${\sum }_{n=2}^{\infty }1/[n(n-1)]=1$. Thus the prime reciprocal lower bound is

Write the rational number as $r=p/q$ with coprime integers $p,q$ and $q>0$. Substituting into the monic polynomial and multiplying by $q^n$ givesAll terms except the first are divisible by $q$, so $q\mid p^n$. If $q>1$, it has a prime factor dividing $p^n$, and the Euclid lemma implies that this prime divides $p$, contradicting coprimality. Thus $q=1$, proving this special case of the rational root theorem:

Write $1(n)=1$ and let $\epsilon$ be the Identity for Dirichlet convolution. The Möbius function uses the empty-product convention $\mu (1)=1$; the Von Mangoldt function has $\Lambda (1)=0$. We first establish all the arithmetic function identities needed below. Every integer divisor of $n$ contributes one to $\tau (n)$, so $\tau =1\ast 1$. If $n>1$ has $r$ distinct prime factors, the squarefree divisors correspond to their subsets andAt $n=1$ the sum is one. Thus $\mu \ast 1=\epsilon$. Writing $n={\prod }_p{p}^{v_p(n)}$, the only divisors with nonzero Von Mangoldt function are $p,p^2,\dots ,p^{v_p(n)}$, and henceThe Dirichlet convolution is commutative by replacing $d$ with $n/d$, and associative because either bracketing sums $f(a)g(b)h(c)$ over $abc=n$. ConsequentlyThese are consequences of the definitions, rather than unproved invocations of Möbius inversion.

To identify the constant, integrate on each interval $[j,j+1)$:The tail is $O(1/J)$, since the integrand is at most $2/x^2$ for $x\ge 2$. Summation therefore gives $\gamma ={\lim }_{J\to \infty }(H_J-\log (J+1))$, where $H_J$ is the harmonic number, and $H_J=\log J+\gamma +O(1/J)$. Thus this is Euler's constant.

Put $r=\lfloor \sqrt{N}\rfloor$. Counting pairs of positive integers whose product is at most $N$, and subtracting the square counted twice, gives the Dirichlet hyperbola method identitySince $r=\sqrt{N}+O(1)$, the harmonic number estimate yieldsThe increasing natural logarithm also satisfies ${\sum }_{n\le N}\log n=N\log N-N+O(\log (2N))$ by comparison with its integral. Subtracting proves

For the second implication, denote the Mertens function by $M(x)$ and the Second Chebyshev function by $\psi (x)$. Apply the proved Dirichlet convolution identities to $b(n)=\tau (n)-\log n-2\gamma 1(n)$:Summing this identity over integers up to $N$ gives the exact relationFix an integer $K\ge 2$. The contribution to $E(N)$ from $d\le N/K$ has absolute value at mostFor $d>N/K$, group by $j=\lfloor N/d\rfloor$. This gives exactlyunder the assumed cancellation $M(x)=o(x)$; extending that assumption from integers to real $x$ uses $M(x)=M(\lfloor x\rfloor )$. Therefore ${\mathrm{limsup}}_{N\to \infty }|E(N)|/N\ll K^{-1/2}$. Letting $K\to \infty$ proves the prime number asymptotic from Mertens cancellation:

For $\Re s>1$, the Euler products areThe Dirichlet character is completely multiplicative, and unique prime factorization expands each finite product into the terms of the corresponding Dirichlet series supported on those primes. Absolute convergence permits passage to all primes. More strongly, the absolutely convergent Euler product logarithm givessince the sum of absolute values is bounded by ${\sum }_{n\ge 2}{\sum }_{m\ge 1}{n}^{-m\Re s}/m<\infty$.

We prove nonvanishing of a nonprincipal Dirichlet L-function at one, including real Dirichlet characters. If $\chi$ is nonprincipal modulo $q$, periodicity and the given Orthogonality of Dirichlet characters bound $A_{\chi }(x)={\sum }_{n\le x}\chi (n)$ by $q$. Partial summation giveswhich is holomorphic for $\Re s>0$ by locally uniform convergence, including after differentiation. The principal Dirichlet character instead haswith a simple pole at one.

For a nonreal Dirichlet character, consider $P(s)={\prod }_{\chi \mathrm{mod}q}L(s,\chi )$. For real $\sigma >1$, its Euler product logarithm isThe given character inversion with $a=1$ makes each inner sum either $\phi (q)$ or zero, so $P(\sigma )\ge 1$. If $L(1,\chi )=0$ for a nonreal Dirichlet character, then $L(1,\overline{\chi })=0$ as well, since their values at real $s$ are conjugate. These are two distinct factors. All nonprincipal factors are holomorphic at one, and only the principal factor has a simple pole. Their two zeros would force $P(\sigma )\to 0$, a contradiction.

For a real nonprincipal Dirichlet character, suppose $L(1,\chi )=0$. Then $G(s)=\zeta (s)L(s,\chi )$ is holomorphic throughout $\Re s>0$: the supplied continuation of the Riemann zeta function has no other pole there, and the zero cancels the pole at one. On $\Re s>1$ its Dirichlet series has coefficientsTo check the sign explicitly, for a prime power $p^j$ the local sum is $j+1$ if $\chi (p)=1$, is $1$ for even $j$ and $0$ for odd $j$ if $\chi (p)=-1$, and is $1$ if $\chi (p)=0$. Multiplication over prime factors proves nonnegativity and $g_{m^2}\ge 1$. Also $g_n\le \tau (n)$, so termwise derivatives at $s=2$ are justified by absolute convergence:The disc $|s-2|<2$ lies in $\Re s>0$. Its Taylor series therefore converges at $s=1/2$, and Tonelli theorem givesThis contradicts holomorphy at $1/2$. It is the positive-coefficient argument behind the Landau theorem for a Dirichlet series with nonnegative coefficients, proved here rather than invoked. Thus $L(1,\chi )\ne 0$ for every nonprincipal Dirichlet character.

It remains to detect the primes. For real $\sigma >1$, the Euler product logarithm satisfiesuniformly as $\sigma \downarrow 1$: terms with $m\ge 2$ are bounded in absolute value by ${\sum }_{n\ge 2}{\sum }_{m\ge 2}{n}^{-m}/m<\infty$. For a nonprincipal Dirichlet character, a holomorphic logarithm of $L$ exists near one by the nonvanishing just proved. On a short real interval it differs from the Euler product logarithm by a fixed multiple of $2\pi i$, so the prime sum stays bounded. For the principal Dirichlet character, the simple pole instead givesApplying the supplied Orthogonality of Dirichlet characters for a reduced residue class $a$ now yieldsThe right side tends to infinity, whereas a finite set of primes would give a bounded left side. Therefore every residue class coprime to $q$ contains infinitely many primes, proving the Dirichlet theorem on primes in arithmetic progressions.

Since $a=kp\ge 2$, we have $a^p\equiv 1(\mathrm{mod}{a}^p-1)$ and $\gcd (a,a^p-1)=1$. Its multiplicative order therefore divides the prime number $p$. It cannot be one, because $0<a-1<a^p-1$. Thus the order is exactly $p$.

To find the desired prime divisor, use the cyclotomic polynomialChoose a prime factor $q$ of this integer. Since $p\mid a$, we have ${\Phi }_p(a)\equiv 1(\mathrm{mod}p)$, so $q\ne p$. Also $q\nmid a$. If $a\equiv 1(\mathrm{mod}q)$, then ${\Phi }_p(a)\equiv p(\mathrm{mod}q)$, contradicting $q\ne p$. Consequently $a$ has multiplicative order $p$ in the multiplicative group of a finite field ${\mathbb{F}}_q^{\times }$. Lagrange theorem givesThis $q$ divides $a^p-1$ as required. Notice that order $p$ modulo a composite integer alone would not justify selecting an arbitrary prime divisor; the cyclotomic polynomial selects a suitable one.

If there were only finitely many such primes $q_1,\dots ,q_r$, choose $k=q_1\cdots q_r$, with the empty product interpreted as one. Each $q_i$ divides $a=kp$ and hence does not divide $a^p-1$. The preceding argument supplies a further prime $q\equiv 1(\mathrm{mod}p)$ dividing that integer, a contradiction. There are infinitely many primes in this residue class.

Suppose the prime numbers were the finite list $p_1,\dots ,p_r$. The integer $N=p_1\cdots p_r+1>1$ has a prime factor, by repeatedly factoring any composite factor until a prime is reached. But division by any $p_j$ leaves remainder one, so that prime factor is absent from the list. This contradiction proves there are infinitely many prime numbers. The argument does not require $N$ itself to be prime.

Fermat's little theorem says that for a prime $p$ and $p\nmid a$, $a^{p-1}\equiv 1(\mathrm{mod}p)$; equivalently $a^p\equiv a(\mathrm{mod}p)$ for every integer $a$. The Wilson theorem says $(p-1)!\equiv -1(\mathrm{mod}p)$ for a prime $p$ (and, conversely, this congruence characterizes primes among integers greater than one).

For $p=2$, $x=1$ is a square root of minus one modulo a prime. If $p$ is odd and $x^2\equiv -1$, Fermat's little theorem givesso $(p-1)/2$ is even and $p\equiv 1(\mathrm{mod}4)$. Conversely, put $h=(p-1)/2$. Pairing $j$ with $p-j$ in the factorial gives $(p-1)!\equiv (-1{)}^h(h!{)}^2$. For $p\equiv 1(\mathrm{mod}4)$, $h$ is even, so the Wilson theorem yields $(h!{)}^2\equiv -1$. Thusand in the latter case $x=h!$ supplies a solution.

For the multiplicative order assertion, divide $k$ by $d$: $k=qd+r$, $0\le r<d$. Since $x^d\equiv 1$ and $x^k\equiv 1$, it follows that $x^r\equiv 1$. Minimality of the positive order excludes $0<r<d$, hence $r=0$ andIn particular $d\mid p-1$ by Fermat's little theorem. Negative $k$, if included, are handled by the same division using the modular inverse of $x$.

A Fermat number in the paper has $n\ge 1$. If a prime $p$ divides $F_n=2^{2^n}+1$, it is odd and $2^{2^n}\equiv -1(\mathrm{mod}p)$. Squaring gives $2^{2^{n+1}}\equiv 1$, so the order $d$ divides $2^{n+1}$. It does not divide $2^n$, since $-1\ne 1$ modulo an odd prime. Every divisor of $2^{n+1}$ is a power of two, so the only possibility isIf two different Fermat numbers shared a prime factor, the same element $2$ modulo that prime would have two different orders. This is impossible, proving pairwise coprimality. Also $2^{n+1}\mid p-1$, so for $n\ge 1$ every such prime is $1$ modulo $4$. No prime $3$ modulo $4$ can occur.

A prime $1$ modulo $4$ need not occur: take $p=13$. It is prime, $2^6=64\equiv -1(\mathrm{mod}13)$, and $2^4\equiv 3\ne 1$. Since the order divides $12$, the first congruence excludes every divisor of $6$ and the second excludes $4$; hence the order is $12$. This is not a power of two, so $13$ is not a prime divisor of a Fermat number. The index restriction matters: the conventional extra number $F_0=3$ is outside the paper's positive-$n$ family.

Let $n=[G:H]<\infty$. The group action by left multiplication on $G/H$ gives a group homomorphism $G\to S_n$. Its kernel is the normal core of a subgroup,The containment follows by looking at the stabilizer of the coset $H$, and finite index follows from the finite image in $S_n$.

The Higman group isIt is visibly a finitely presented group. To prove infinitude, first formIt is the amalgamated free product of $⟨a,b\mid ab{a}^{-1}=b^2⟩$ and $⟨b,c\mid bc{b}^{-1}=c^2⟩$, identifying their infinite cyclic subgroups generated by $b$. Each factor is an HNN extension of an infinite cyclic group, so its base and stable letter both have infinite order. No nonzero power of $a$ belongs to $⟨b⟩$ in the first factor, by the map to $\mathbb{Z}$ sending $a$ to one and $b$ to zero. In the second factor, no nonzero power of $c$ belongs to $⟨b⟩$: the stable-letter map forces a hypothetical equality $c^k=b^l$ to have $l=0$, and the base $c$ has infinite order. The normal form theorem for an amalgamated free product therefore shows that $⟨a,c⟩\le K$ is a rank-two free group.

Similarly,contains $⟨c,a⟩$ as a rank-two free group. Identifying these two free subgroups yieldsThe normal form theorem for an amalgamated free product embeds $K$ in $J$. In particular, $J$ contains a free group of rank two and is infinite.

The finite quotients of cyclic squaring presentations argument now rules out every nontrivial finite quotient of $J$. In a finite image, a relation $xy{x}^{-1}=y^2$ forces the order of $y$ to be odd, since conjugate elements have the same order. If any generator has nontrivial image, let $p$ be the least prime number dividing the order of any of the four generator images, and choose $y$ whose order is divisible by $p$. Its predecessor $x$ conjugates it to its square. If $r$ is the order of $x$, iterating conjugation gives $2^r\equiv 1(\mathrm{mod}p)$. Hence the multiplicative order of $2$ modulo $p$ divides $r$. It is greater than one and divides $p-1$, so it has a prime factor smaller than $p$, which also divides $r$. This contradicts the minimal choice of $p$. Thus all four generator images are trivial. $J$ has no nontrivial finite quotient, and the normal-core argument above implies that $J$ has no proper finite-index subgroup.

For the final argument, Conjugation preserves the order of an element. Thus if one nonidentity element has finite order $n$, every nonidentity element has that same order, and $n\ge 2$. Moreover $n$ is prime: if a prime factor $p$ properly divides $n$, then $g^p$ is nonidentity but has the smaller order $n/p$.

When $n\ge 3$, the element $g^2$ is nonidentity, so choose $x$ with $xg{x}^{-1}=g^2$. The conjugator is not the identity, since $g^2\ne g$, and therefore $x^n=1$. Induction gives $x^{k}g{x}^{-k}=g^{2^k}$, and at $k=n$ this yieldsBut Fermat's little theorem, with the odd prime $n$, gives $2^n\equiv 2(\mathrm{mod}n)$, contradicting that divisibility.

For $n=2$, $g^2=1$ is not in the nonidentity conjugacy class, so the required conjugator cannot be chosen. Instead, a group in which every element has square one is an abelian group: $(ab{)}^{-1}=ab$ also equals $b^{-1}{a}^{-1}=ba$. In an abelian group every conjugacy class is a singleton, so one nonidentity class permits only one nonidentity element, giving a group of order two. This contradicts infinitude. Consequently the infinite group in question is a $\boxed{\text{torsion-free group}}$.

This establishes the torsion-freeness from one nonidentity conjugacy class criterion.

Reflexivity follows by taking the two exponents equal to $1$, and symmetry is built into the two divisibility conditions. For transitivity, suppose $m\mid n^a$, $n\mid m^b$, $n\mid {\ell }^c$ and $\ell \mid n^d$. Then $m\mid {\ell }^{ac}$ and $\ell \mid m^{bd}$, with positive exponents. Thus the relation is an equivalence relation.

Its equivalence classes have a useful description by prime factorization. Let $S(n)$ be the finite set of prime factors of $n$, with $S(1)=\varnothing$. If $m\mid n^a$, every prime factor of $m$ divides $n$; the reverse divisibility gives $S(n)\subseteq S(m)$. Conversely, if $S(m)=S(n)$, write $m={\prod }_{p\in S}{p}^{{\alpha }_p}$ and $n={\prod }_{p\in S}{p}^{{\beta }_p}$, with all exponents positive. Choosing $a\ge {\max }_p\lceil {\alpha }_p/{\beta }_p\rceil$ and $b\ge {\max }_p\lceil {\beta }_p/{\alpha }_p\rceil$ gives the required divisibilities. The empty case is exactly $m=n=1$.

Therefore the prime-support equivalence relation iswhere the radical of an integer is the product of its distinct prime factors. The class with empty support is $\{1\}$. For every nonempty finite support $S$, all positive exponent choices give one class, and varying just one exponent produces infinitely many different integers in it.

There are infinitely many classes because each prime number gives a different singleton support. For completeness, if there were only finitely many prime numbers $p_1,\dots ,p_r$, a prime factor of $p_1\cdots p_r+1$ would differ from them all. There are infinitely many classes; the unique finite class is $\{1\}$.

Let $L=\sqrt{D}$. Regroup the finite divisor sum using the least common multiple:This is nonnegative. If $n$ has no prime factor in $\mathcal{P}$, only $d=1$ can contribute to the inner sum, so it equals ${\rho }_1=1$. This proves the required pointwise upper-bound sieve inequality. Whenever a term defining ${\lambda }_d$ is nonzero, $u,v\le L$ and their prime factors lie in $\mathcal{P}$. Hence $d=[u,v]\le uv\le L^2=D$, and every prime factor of $d$ lies in $\mathcal{P}$. Thus these are upper-bound sieve weights of level $D$, as described by the Selberg least-common-multiple weights.

For coefficients $b_n$ supported on an interval of length $H$, write $B=\sum b_n$ and $B_p(a)={\sum }_{n\equiv a(\mathrm{mod}p)}{b}_n$. The variance form of the large sieve statesThe constant is absolute. One may take the explicit right side $(Q^2+2\pi H)\sum |b_n{|}^2$, by orthogonality of roots of unity and the exponential-sum large sieve proved in Question 2.

Take $H=\lfloor N^2\rfloor$, $Q=N$, and $b_n$ the indicator function of the $N^{\epsilon }$-smooth numbers up to $N^2$. Applying the given smooth-number density with parameter $\epsilon /2$ giveswith a harmless adjustment of the constant for integer endpoints. If an odd prime $p\le N$ has least quadratic nonresidue $n(p)>N^{\epsilon }$, then $p>N^{\epsilon }$: a quadratic nonresidue always occurs among $1,\dots ,p-1$. Every prime factor of every selected smooth number is thus a nonzero quadratic residue modulo $p$. By the multiplicativity of the Legendre symbol, every selected number is a nonzero quadratic residue modulo $p$.

There are $(p-1)/2$ nonzero quadratic nonresidue classes, and $B_p(a)=0$ on all of them. Their contribution to the variance is at leastIf $R$ denotes the number of exceptional primes, the variance form of the large sieve, with $\sum |b_n{|}^2=B$, yields $R{B}^2\ll N^{2}B$. ConsequentlyThis is the bounded exceptional primes for least quadratic nonresidues argument. Using an interval of length $N^2$ is what matches the $Q^2$ term; an interval of length $N$ would not give a bounded exceptional set.

Set $L=\sqrt{D}$, and restrict attention to the set $\mathcal{S}$ of squarefree integers $d\le L$ all of whose prime factors lie in $\mathcal{P}$. Coefficients indexed by non-squarefree integers do not affect $\Sigma$, so they may be set to zero. PutIn particular, the normalizing sum runs to $\sqrt{D}$, as in the PDF; the converted TeX's $\sqrt{d}$ is a transcription error. Define $y_t={\sum }_{\begin{array}{c}m\in \mathcal{S}\\ t\mid m\end{array}}g(m){\rho }_m$. The finite multiples version of Möbius inversion isIt follows by substituting the definition and using ${\sum }_{r\mid m/d}\mu (r)=1_{m=d}$. Taking $d=1$ gives $1={\sum }_t\mu (t)y_t$. Thus the Selberg sieve diagonalization and the Cauchy-Schwarz inequality giveEquality holds at $y_t=\mu (t)/(Jh(t))$, which satisfies the constraint. Inverting, and writing $t=dv$, yieldsFor $d\notin \mathcal{S}$ set ${\rho }_d=0$. The formula has ${\rho }_1=1$ and gives minimum $\Sigma =1/J$.

To show these optimal Selberg weights have modulus at most one, fix $d\in \mathcal{S}$. Each integer $ev$, with $e\mid d$, $(v,d)=1$ and $v\le L/d$, is a distinct term of $\mathcal{S}$. The total weight of these terms isIt is at most $J$, so the displayed formula gives $|{\rho }_d|\le 1$. This proves the modulus bound without assuming that each factor $(1-g(p){)}^{-1}$ is itself small.