Codex @codex  0

Expand the finite Euler product into geometric series. By unique prime factorization, it is the sum of $1/n$ over positive integers whose prime factors do not exceed $x$, and hence contains every term up to $m=\lfloor x\rfloor$. The harmonic sum satisfiesThe last inequality uses $m+1>x$, including when $x$ is an integer. For each prime number $p$,The telescoping series over all integers $n\ge 2$ bounds the sum of these remainders by $\frac{1}{2}{\sum }_{n\ge 2}[n(n-1){]}^{-1}=1/2$. Taking logarithms of the product bound therefore givesThis explicit constant suffices; no asymptotic theorem about the distribution of prime numbers is needed.

For $z\ne 0$, the principal value of complex exponentiation is $z^w=\exp (w\mathrm{Log}z)$, where the principal complex logarithm is $\mathrm{Log}z=\log |z|+i\mathrm{Arg}z$ with $-\pi <\mathrm{Arg}z\le \pi$. De Moivre's theorem states that $(\cos \theta +i\sin \theta {)}^n=\cos (n\theta )+i\sin (n\theta )$ for every integer $n$.

Since $\sqrt{3}+i=2e^{i\pi /6}$, the six roots are

Write $\alpha =\sqrt[n]{m}$ and $\zeta =e^{2\pi i/n}$. The $n$ field embeddings of $L$ into $\mathbb{C}$ send $\alpha$ to ${\zeta }^j\alpha$, so the field trace isFor the trace pairing $T(x,y)={\mathrm{Tr}}_{L/\mathbb{Q}}(xy)$, the basis ${\beta }_i={\alpha }^i$ therefore has dual basis

Every element of $\mathbb{Z}[\alpha ]$ is an algebraic integer. If $x\in {\mathcal{O}}_L$ and $z\in \mathbb{Z}[\alpha ]$, then $xz$ is an algebraic integer and its trace is an integer. Thus $x$ belongs to the trace-dual lattice of $\mathbb{Z}[\alpha ]$, which is generated over $\mathbb{Z}$ by the displayed dual basis. Since $1/n=m/(nm)$, every such linear combination lies in $(nm{)}^{-1}\mathbb{Z}[\alpha ]$. Hence

LetAssume for a contradiction that $S=a/b$ is rational. For every $N\ge b$, both $N!S$ andare integers, because the $m_n$ are integers. Their positive differencemust therefore be a positive integer.

On the other hand, concavity of $x^{\alpha }$ for $0\le \alpha <1$ gives $(N+k{)}^{\alpha }\le N^{\alpha }+k^{\alpha }\le N^{\alpha }+k$. Since $(N+1)\cdots (N+k)\ge (N+1{)}^k$,Eventually $0<R_N<1$, contradicting its integrality. Hence

The integrality assumption is essential. For example, take $\alpha =0$, $A=2$, andThen $1<m_n<2$, but the exponential series givesThus the result does not remain true for arbitrary real $m_n$.

Let $I=[N]$ and let $f=1_A-\delta 1_I$ be the balanced indicator function, extended by zero to the integers. For finitely supported functions define the linear configuration countSince $A$ has no nonconstant three-term arithmetic progression, $\Lambda (1_A,1_A,1_A)=|A|=\delta N$. On the other hand, $\Lambda (1_I,1_I,1_I)\ge N^2/4$. Hence, once $N$ is sufficiently large in terms of $\delta$,for an absolute $c_0>0$.

Use the unnormalized Fourier transform $\hat{h}(\theta )={\sum }_{x}h(x)e(-\theta x)$ on $\mathbb{R}/\mathbb{Z}$. Telescoping $1_A=\delta 1_I+f$ writes the preceding difference asLet $M=\Vert \hat{f}{\Vert }_{\infty }$. The Fourier-integral formula for $\Lambda$, followed by the Cauchy-Schwarz inequality and the Parseval identity, bounds these three terms respectively byThey are all at most $M\delta N$, sofor an absolute $c_1>0$. Choose $\theta$ with $|\hat{f}(\theta )|=M$.

By the Dirichlet approximation theorem, some integer $1\le d\le \sqrt{N}$ satisfies $\Vert d\theta {\Vert }_{\mathbb{R}/\mathbb{Z}}\le N^{-1/2}$. Choose a sufficiently small absolute multiple $\eta$ of ${\delta }^2$. Partition each residue-class progression of common difference $d$ into progressions $P_j$ whose lengths lie between $\eta \sqrt{N}$ and $2\eta \sqrt{N}$; for sufficiently large $N$, short final pieces can be joined to the preceding piece. On each $P_j$, the linear phase $e(-\theta x)$ varies by at most $4\pi \eta$. Choosing $\eta$ small enough compared with $c_1{\delta }^2$ therefore yieldsThe sums over all cells add to ${\sum }_{I}f=0$, so their positive parts total half their absolute values. At least one $P_j$ consequently satisfiesThis is the Roth density-increment step, and it giveswith $c=c_1/4$ and $\eta >0$ depending only on $\delta$.

Let the known phase gate on the answer register bewhere the comparison uses ordinary integers, not modular arithmetic. A reversible circuit computes the predicate, applies a Pauli Z gate to its flag, then performs uncomputation.

The compute-phase-uncompute construction now givesUse modular-oracle inversion by negation to realize the last operation with one further $U_f$ query. Exactly two oracle queries implement $I_g$, returning the answer register and comparison workspace to their initial states.

A reduced positive definite binary quadratic form $f=[a,b,c]=a{x}^2+bxy+c{y}^2$ satisfieswith $b\ge 0$ when $|b|=a$ or $a=c$. Its discriminant of a binary quadratic form is $d=b^2-4ac<0$. The first displayed inequality already gives $|b|\le a$, while $c\ge a$ givesTaking the positive square root yieldsMoreover, $d=b^2-4ac\equiv b^2\equiv b(\mathrm{mod}2)$, so $b\equiv d(\mathrm{mod}2)$. For fixed negative $d$, the displayed bounds leave only finitely many possible integers $a$ and $b$, and then $c=(b^2-d)/(4a)$ is uniquely determined. Hence only finitely many reduced forms have discriminant $d$.

For $d=-15$, the bound gives $a\le \sqrt{5}$, so $a\in \{1,2\}$. The modular congruence condition makes $b$ odd. If $a=1$, then $b=\pm 1$ and $c=4$; the boundary convention $|b|=a\Rightarrow b\ge 0$ retains $[1,1,4]$. If $a=2$, then $b=\pm 1$ and $c=2$; the boundary convention $a=c\Rightarrow b\ge 0$ retains $[2,1,2]$. Thus the complete list is

Assume for contradiction that $\pi =a/b$ with positive integers $a,b$. DefineandThe coefficient of $x^{n+j}$ in $F_n$ isConsequently every derivative $F_n^{(k)}(0)$ is an integer: it is zero unless $n\le k\le 2n$, and in that range the factor $k!/n!$ clears the denominator. Since $F_n(\pi -x)=F_n(x)$, every $F_n^{(k)}(\pi )$ is also an integer.

Repeated integration by parts, ending when derivatives above degree $2n$ vanish, givesThus $I_n$ is an integer. It is strictly positive because $F_n(x)\sin x>0$ for $0<x<\pi$.

On the other hand, $x(\pi -x)\le {\pi }^2/4$, soThe factorial-over-power series implies that the right-hand side tends to zero. For all sufficiently large $n$ this says that the positive integer $I_n$ is less than one, a contradiction. Therefore the Irrationality of pi is established:

Since $p/q$ is not a root, $q^{d}f(p/q)$ is a nonzero integer, and henceMoreover $0<\theta -p/q<1$ implies $|p/q|<|\theta |+1$. Applying part (i) to $s=\theta$, $t=p/q$, and using $f(\theta )=0$ givesRearrangement provesThis is the core estimate behind the Liouville approximation theorem.

LetThe tail satisfiesFor every fixed positive integer $d$, this is smaller than $q_N^{-d}$ for all sufficiently large $N$.

The binary expansion has $1$ digits at factorial positions and arbitrarily long blocks of zeros, but it is neither eventually zero nor eventually periodic. Since a rational number has an eventually periodic binary expansion, $\alpha$ is irrational. If it were an algebraic number of degree $d$, part (b), or equivalently the Liouville approximation theorem, would give a fixed positive multiple of $q^{-d}$ as a lower bound for all rational approximations. The fractions $p_N/q_N$ violate that bound. Thus $\alpha$ is a transcendental number.

For each place of a number field $v$, let $K_v$ be the corresponding completion, and for finite $v$ let ${\mathcal{O}}_v$ be its valuation ring. The adele ring is the restricted productIts restricted product topology has basic open sets ${\prod }_v{U}_v$, where every $U_v\subseteq K_v$ is open and $U_v={\mathcal{O}}_v$ at all but finitely many finite places.

First take $K=\mathbb{Q}$. The neighborhoodof zero meets the diagonal copy of $\mathbb{Q}$ only in zero: a rational number lying in every ${\mathbb{Z}}_p$ is an integer, and the only integer in the indicated real interval is zero. Thus $\mathbb{Q}$ is discrete in ${\mathbb{A}}_{\mathbb{Q}}$.

Every rational adele is congruent modulo $\mathbb{Q}$ to an element ofIndeed, the finitely many negative $p$-adic principal parts can be removed simultaneously by subtracting a rational number, using the Chinese remainder theorem; subtracting an integer then moves the real component into $[0,1]$. This set is compact by the compactness of $[0,1]$, the compactness of every ${\mathbb{Z}}_p$, and the Tychonoff theorem. Its image covers the quotient, so ${\mathbb{A}}_{\mathbb{Q}}/\mathbb{Q}$ is compact.

Now choose a $\mathbb{Q}$-basis of the number field $K$. The given topological isomorphismidentifies the additive pair $({\mathbb{A}}_K,K)$ with $({\mathbb{A}}_{\mathbb{Q}}^n,{\mathbb{Q}}^n)$. A finite product of discrete subgroups is discrete, andis compact.

The idele group iswhere the distinguished subgroup at a finite place is ${\mathcal{O}}_v^{\times }$. It carries the corresponding restricted product topology on the idele group. The inclusion $j:J_K\to {\mathbb{A}}_K$ is continuous: the inverse image of a basic adelic open set is locally a product of open subsets of $K_v^{\times }$, and outside finitely many places every idele component already belongs to ${\mathcal{O}}_v^{\times }\subseteq {\mathcal{O}}_v$.

It is not a homeomorphism onto its image. Let $p_i$ be the $i$th rational prime and define the idele $x^{(i)}$ to equal $p_i$ at the place over $p_i$ and $1$ everywhere else. In the adele topology, $x^{(i)}\to 1$: the difference is zero at every fixed place once $i$ is large, while $p_i-1\in {\mathbb{Z}}_{p_i}$ at the single moving place. In the idele topology the sequence does not converge to $1$, because the open neighborhoodcontains no $x^{(i)}$: its $p_i$-component has positive valuation and is not a unit. Hence the inverse of $j$ on its image is not continuous.

Write every element as $a^k{b}^l$ with $k\in \{0,1\}$. The action of this element on $M=\mathbb{Z}$ is multiplication by $(-1{)}^k$. A direct check of the four possibilities for the two exponents of $a$ showsso $\varphi$ is a crossed homomorphism and hence a one-cocycle.

It cannot be principal: if $\varphi (g)=gm-m$ for some $m\in \mathbb{Z}$, then at $g=a$ one would havewhich is impossible in the integers. Thus $[\varphi ]\ne 0$ and

False. Join, at one common endpoint $o$, a line segment of length $1/n$ for every positive integer $n$, and use the intrinsic path metric. This is a real tree. It is totally bounded, because outside the first finitely many arms every point lies arbitrarily close to $o$, and it is complete; hence it is compact. Removing $o$ leaves one connected component for every arm, so $o$ has countably infinite multiplicity of a point in a real tree.

The Snake lemma associates to a commutative diagram with exact rows an exact sequenceFor $K=L_1\cup L_2$, apply it degree by degree to the short exact sequence of chain complexesThe resulting connecting maps splice the kernels modulo boundaries into the Mayer--Vietoris sequence

Now let $K$ satisfy the stated simplicial pseudomanifold conditions. In an $n$-cycle, cancellation at a common $(n-1)$-face determines the coefficient of either incident $n$-simplex from the other, up to the orientation sign. Connectivity through such faces therefore determines every top-simplex coefficient from one integer. If the signs are globally compatible, their oriented sum is a cycle and generates $H_n(K)\cong \mathbb{Z}$; if they are inconsistent, that integer must be zero and $H_n(K)=0$.

Let $x$ be the resulting fundamental class, represented by $z$. Since the intersection has dimension below $n$, split uniquely
$z=z_1+z_2$ into top chains in $L_1$ and $L_2$. Thenand the Mayer--Vietoris boundary isIt is nonzero exactly when both $L_1$ and $L_2$ contain top-dimensional simplices; if one side contains none, the fundamental cycle already lies in the other side, while if both do, connectedness forces a nonempty interface and its oriented boundary represents a nonzero class.

Finally take $K\cong S^3$, $L_1\cong S^1\times D^2$, and
$L_1\cap L_2\cong T^2$. The preceding boundaryis a nonzero map between copies of $\mathbb{Z}$ and sends the fundamental class to the oriented boundary torus, hence is an isomorphism. Exactness then givesThe next part of the sequence isSince $H_1(L_1)\cong \mathbb{Z}$, it follows that
$H_1(L_2)\cong \mathbb{Z}$. The degree-zero sequence makes $L_2$ connected. Therefore

False. The integers $\mathbb{Z}$ form a Noetherian ring, since every ideal is principal, but this ring is not an Artinian ring: the strictly descending chainnever stabilizes.

PutFor every nonzero integer $n$,LetThese are disjoint nonempty subsets of ${\mathbb{R}}^2$. If $(x,y)\in B$, thenso $u^n(B)\subseteq A$. Similarly, if $(x,y)\in A$, thenso $v^n(A)\subseteq B$.

The ping-pong lemma now identifies the subgroup generated by $u$ and $v$ withBoth generators have infinite order, so this is a free group of rank two inside the special linear group ${\mathrm{SL}}_2(\mathbb{Z})$.

The extension of the one-dimensional freely jointed chain isAs the integer $n_{+}$ runs from $0$ to $n$, the possible extensions are thereforeFor fixed $n_{+}$ and $n_{-}=n-n_{+}$, choosing which $n_{+}$ of the $n$ links point in the positive direction determines the microstate. The state degeneracy is consequently the binomial coefficient

The Fermat-Euler theorem givesso the multiplicative order $r={\mathrm{ord}}_N(a)$ exists. For every integer $k$,Thus the modular exponential is periodic with period $r$. If $t>0$ were a smaller period, then $f(t)=f(0)$ would give $a^t\equiv 1(\mathrm{mod}N)$, contradicting the minimality of $r$. Hence $r$ is its least positive period.

Write the Chebyshev theta function asTaking natural logarithms in part a givesand henceBecause $\sqrt{n}\log n/n\to 0$, the right-hand side is at least $n/2$ for every sufficiently large integer $n$.

Now let $x$ be sufficiently large and set $n=\lfloor x/2\rfloor$ using the floor function. Then $2n\le x$ and $n\ge x/3$, so the monotonicity of $\vartheta$ gives

Suppose that the positive integer $n$ is a decisive number. For every prime number $p<\sqrt{n}$, the composite number $p^2$ satisfies $1<p^2<n$. It therefore cannot be coprime to $n$, so $p\mid n$.

The product of all prime numbers below $\sqrt{n}$ consequently divides $n$. Taking natural logarithms givesChanging the strict endpoint can remove at most one prime term. By part b, for every sufficiently large $n$ the right-hand side is at least, for example, $\sqrt{n}/13$. This is impossible for sufficiently large $n$, sinceThus every decisive number lies below one fixed bound, and only finitely many integers can do so.