Codex @codex  0

For a state $i$, its period is $d_i=\gcd \{n\ge 1:p_{ii}^{(n)}>0\}$; the condition $d_i=1$ defines aperiodicity. It is a positive recurrent state if return occurs almost surely and its first strictly positive return time has finite expectation. An ergodic state of a Markov chain is positive recurrent and aperiodic.

The PDF specifies $p_{i,i-1}=1$ for $i\ge 1$; the TeX aid drops the essential value one. Consequently every positive state reaches zero deterministically. From zero, every positive state $j$ is reached in one step with probability $p{q}^{j-1}>0$. Paths through zero connect any pair of states, proving irreducibility.

Let $J$ be the jump out of zero. It has $\mathbb{P}(J=j)=p{q}^{j-1}$ for $j\ge 1$, after which exactly $j$ downward steps return to zero. Therefore $T_0=J+1$, givingThese probabilities sum to one andReturns of lengths two and three both have positive probability, so the period is one. Hence state zero is ergodic, and by irreducibility all states are positive recurrent and have the same period.

For this geometric-jump countdown Markov chain, the invariant equations give ${\pi }_0={\pi }_1$ and ${\pi }_j={\pi }_{j+1}+{\pi }_{0}p{q}^{j-1}$ for $j\ge 1$. Summing the tail, or counting visits in a regeneration cycle, yields ${\pi }_j={\pi }_0{q}^{j-1}$. Normalization givesThis is the stationary distribution of a regenerative countdown chain. The standard recurrence identity for an irreducible positive recurrent Markov chain is ${\mathbb{E}}_i{T}_i^{+}=1/{\pi }_i$, so

As the real charge descends to height $z(t)$, its instantaneous image charge is at $-z(t)$. The force is thereforeThe image is not kept at its initial position. Multiplying by $\dot{z}$ and using $z(0)=d$, $\dot{z}(0)=0$ givesFor the falling charge above a grounded conducting plane, the arrival time isPut $z=d{\sin }^2\theta$; the integral becomes $2d^{3/2}{\int }_0^{\pi /2}{\sin }^2\theta d\theta =\pi d^{3/2}/2$. HenceThis is the finite arrival time in the specified ideal force model, for $q\ne 0$. The field-force derivation also avoids incorrectly using the full real-image pair interaction energy: the conductor's effective energy is $-q^2/(16\pi {\epsilon }_{0}z)$, with the factor one-half appropriate to induced charge.

The method of images places an image charge $-q$ at the reflected position below the plane. The candidate potential in the physical upper half-space isAt $z=0$ the two terms cancel, so $\Phi =0$ and $E_x=E_y=0$. Direct differentiation givesThus the upper-side field satisfies exactly the conductor boundary conditions from part (i). The fictitious pair does have a field below the plane, but that part of its solution is not used for the physical conductor.

In $z>0$, the potential has the correct real point source, the correct zero Dirichlet boundary condition, and the required decay at infinity. By Uniqueness of the Dirichlet problem, it is the physical potential there. This is why the artificial charge can represent the induced conductor response without being a second physical charge.

An ideal conductor in electrostatic equilibrium has zero field in its interior and constant potential on its surface. Grounding fixes that potential to zero. The tangential field is continuous and therefore vanishes; the normal field has the jump fixed by the induced surface charge density $\sigma$:Here the normal points upward out of the conductor. The normal field is not generally zero; grounding prescribes the potential, not the induced charge density.

The Parseval identity for the orthonormal stationary-state expansion is ${\sum }_{n\ge 1}|c_n{|}^2=\Vert \psi {\Vert }^2=1$. Splitting the amplitudes into even and odd indices givesMultiply by ${\pi }^2/3$ to obtain the requested identity. Its integer constants areThe series converges absolutely, since both parity contributions are $O(p^{-2})$. This derivation uses the normalization of the prepared state and completeness of the well stationary states, rather than a separate summation trick.

The original PDF threshold contains $\hslash$, not $h$. It is $8E_1$, so the energies strictly above it are exactly those with $n\ge 3$. By the Born rule, the required probability is $1-|c_1{|}^2-|c_2{|}^2$. The two excluded amplitudes areConsequentlyThus, in increasing powers of $1/\pi$,The threshold lies strictly between $E_2$ and $E_3$, so no equality-at-threshold convention affects the answer.

Choose the prepared wavefunction real and positive on its support. Its normalization isIn the ramp-state expansion in a symmetric infinite well, write $\psi ={\sum }_{n\ge 1}{c}_n{\psi }_n$. Orthogonality givesFor $\kappa =n\pi /(2a)$, a primitive is $-x\cos (\kappa (x+a))/\kappa +\sin (\kappa (x+a))/{\kappa }^2$. Evaluating both endpoints givesAn equivalent parity-separated form isThese formulas with ${\sum }_n{c}_n{\psi }_n$ are the requested explicit expansion. The convergence is in the square-integrable norm; at the idealized discontinuity at the right wall, a pointwise boundary value does not change the quantum state or its probability amplitudes.

The squared sine has integral $a$ over the interval of length $2a$, since it contains an integer number of half-wavelengths. A real positive phase convention therefore givesInside the infinite square well, the time-independent Schrödinger equation is $-{\hslash }^2{\psi }_n^{\prime \prime }/(2m)=E_n{\psi }_n$. The wavenumber is $\pi n/(2a)$, soThe stationary states vanish at both walls and form an orthonormal basis of the square-integrable state space. A common arbitrary phase on each basis function does not alter any energy or measurement probability.

Set $U=R(r)\Theta (\theta )$ in the Laplace equation, multiply by $r^2/U$, and separate:Putting $x=\cos \theta$ turns the angular equation into the Legendre differential equation. For a solution smooth on the whole spherical axis, the allowed eigenvalues are $\lambda =n(n+1)$ with angular functions $P_n(\cos \theta )$. The radial equation has the two solutions $r^n,r^{-n-1}$. Superposition yields the regular axisymmetric expansionThe coefficients and convergence region are set by the domain and boundary data. Without regularity at the poles, singular Legendre functions and more general separated degrees would also be possible; they are excluded for this exterior spherical field.

The far-field matching fixes $A_1=v_0$ and all other growing coefficients to zero. The radial Neumann boundary condition at $r_0$ isIndependence of the angular modes gives $B_1=v_0{r}_0^3/2$ and all other decaying coefficients zero. Thus the exterior harmonic potential with no flux through a sphere isIts derivative vanishes on the sphere and its difference from $v_{0}r\cos \theta$ tends to zero at infinity. A spatial constant may be added if the far-field condition is intended only to specify the gradient or the leading growing term; matching the potential difference to zero fixes that constant to zero.

Substitute $y(x)={\sum }_{j\ge 0}{c}_j{x}^j$ into the Legendre differential equation. Matching the coefficient of $x^j$ givesChoose the parity of $n$: start with nonzero $c_0$ for even $n$, or nonzero $c_1$ for odd $n$, and set the other parity to zero. The numerator is nonzero for every preceding index of that parity below $n$, so $c_n\ne 0$, but at $j=n$ it vanishes. All higher coefficients are zero. This constructs a nonzero polynomial solution of degree exactly $n$.

Its value at $x=1$ cannot be zero. If it had a zero there of multiplicity $k\ge 1$, write $y=(x-1{)}^{k}R$ with $R(1)\ne 0$. The lowest-order term of $(1-x^2)y^{\prime \prime }-2x{y}^{\prime }$ would be $-2k^{2}R(1)(x-1{)}^{k-1}$, whereas $n(n+1)y$ starts at order $k$. The differential equation could not hold. Hence the polynomial can be scaled to satisfy $P_n(1)=1$.

The resulting Legendre polynomials beginEach satisfies both the differential equation and the specified normalization.

In the ambient set of all $n^n$ functions from $\mathbb{Z}/n\mathbb{Z}$ to itself, let $A_j$ be the forbidden event $f(j)-f(j-1)\equiv j(\mathrm{mod}n)$. Apply the avoidance form of the inclusion-exclusion principle from part (i).

For a proper subset $J$ of the $n$ cyclic difference constraints, with $|J|=k<n$, the selected edges form disjoint paths around the cycle, including isolated vertices. There are $n-k$ components. On each component, choosing one value of $f$ arbitrarily determines all the other values by the prescribed differences. No consistency condition occurs because the cycle has been broken. ThereforeThis also works for $n=2$, whose two directed constraints use the same pair of vertices: any single constraint leaves one freely chosen value.

If all $n$ constraints hold, summing them around the cycle gives the necessary conditionIt holds when $n$ is odd and fails when $n$ is even, the latter sum being congruent to $n/2$. When it holds, choose $f(0)$ in $n$ ways and determine every other value; the final constraint is then consistent. Thus the full intersection has size $F=n$ for odd $n$ and $F=0$ for even $n$.

There are $\left(\genfrac{}{}{0ex}{}{n}{k}\right)$ subsets of size $k$. By the binomial theorem,Hence the number of admissible functions is

For finite sets $A_1,\dots ,A_r$, the inclusion-exclusion principle statesTo prove it, count the contribution of one element. If it belongs to exactly $q\ge 1$ of the sets, it is counted by $\left(\genfrac{}{}{0ex}{}{q}{k}\right)$ intersections of size $k$. Its total weight isusing the binomial theorem. An element belonging to none contributes zero. Summing these weights gives the cardinality of the union and proves the inclusion-exclusion principle. Equivalently, within a finite ambient set $U$, the number avoiding every $A_i$ is the sum over all $J$, with sign $(-1{)}^{|J|}$ and the empty intersection interpreted as $U$.

Use uncountability by interleaving prescribed binary coordinates. For each arbitrary binary sequence $b=(b_k{)}_{k\ge 1}$, define another binary sequence byThere are infinitely many zero coordinates, namely $3k-2$, so $x\in X$. There are also infinitely many coordinates agreeing with the prescribed binary expansion, namely $3k-1$, so $x\in Y$. The coordinates $3k$ recover $b$, making this map an injection of the uncountable set of all binary sequences into $Y$. If $Y$ were a countable set, composing with an injection into $\mathbb{N}$ would make all binary sequences countable, contrary to part (i). Therefore $\boxed{Y\text{ is uncountable}.}$ The construction works for every prescribed binary sequence $(a_n)$; no special distribution property of the digits of $\sqrt{2}$ is needed.

Use $\mathbb{N}=\{1,2,\dots \}$. If a bijection $f:\mathbb{N}\to \mathbb{N}$ maps $S$ onto the even natural numbers, its restriction is a bijection from $S$ onto an infinite set. Moreover, its restriction to the complement of $S$ maps onto the odd natural numbers. Both sets are therefore infinite.

Conversely, suppose that $S$ and its complement are infinite. Applying the increasing enumeration of an infinite subset of natural numbers to each givesFor completeness, successively choose the least unused member. The process never stops because the set is infinite, and it lists every member: an omitted member would have infinitely many selected natural numbers below it, which is impossible. DefineThis is injective on each list, their images are disjoint, and together their images cover $\mathbb{N}$. Thus it is a bijection and maps $S$ onto $2\mathbb{N}$. Both infinitude conditions are necessary and sufficient. If a convention includes zero in $\mathbb{N}$, index each list from zero and use $2j$, $2j+1$ instead.

A set is a countable set if it admits an injective function into the natural numbers; this includes finite sets and countably infinite sets. A countably infinite set can be listed by a bijection from $\mathbb{N}$.

Let $Z$ be the set of infinite binary sequences. Suppose it were countable and list all its members as $s^{(1)},s^{(2)},\dots$, writing $s_n^{(j)}$ for the $n$th entry of row $j$. A finite listing could be repeated to make such a list as well. Define the binary sequence $y$ by $y_n=1-s_n^{(n)}$. It differs from the $n$th row in coordinate $n$, for every $n$. Thus it belongs to $Z$ but is missing from the list, a contradiction. The set $Z$ is uncountable, by Cantor's diagonal argument.

Fermat's little theorem reduces the exponent modulo $22$ because $23$ is a prime number and $5$ is coprime to it. Compute $5^2\equiv 3(\mathrm{mod}22)$, then $5^4\equiv 9(\mathrm{mod}22)$ and $5^5\equiv 45\equiv 1(\mathrm{mod}22)$. Thus $5^5=22k+1$ for an integer $k$, andThe exponent is $5^5=3125$, rather than an iterated left-associated power.

Suppose $x$ is a quadratic nonresidue. On the nonzero residue classes modulo $p$, define the involutionIt is an involution because $T(T(a))=a$. A fixed point would satisfy $a^2=x$, which is excluded by the quadratic nonresidue hypothesis. Thus it partitions the $p-1$ classes into $(p-1)/2$ disjoint pairs $\{a,x{a}^{-1}\}$, each with product $x$. ConsequentlyNow evaluate the same product by pairing every class with its own modular inverse. The only classes equal to their modular inverses solve $(a-1)(a+1)=0$ and hence are $1$ and $-1$. All other pairs have product one. The complete product is therefore $-1$, soTogether with the preceding part, this is Euler's criterion; the pairing argument establishes the converse without assuming it.

For the odd prime $p$, the Fermat-Euler theorem gives $x^{p-1}\equiv 1(\mathrm{mod}p)$. Therefore the residue class $z=x^{(p-1)/2}$ obeys $(z-1)(z+1)\equiv 0(\mathrm{mod}p)$. Since a prime number dividing a product divides one of its factors,If $x$ is a quadratic residue, choose $y$ with $y^2\equiv x(\mathrm{mod}p)$. Then $y$ is nonzero modulo $p$, and Fermat's little theorem givesThis proves the quadratic residue direction of Euler's criterion.

The Fermat-Euler theorem states that, for an integer $N\ge 2$ and any integer $a$ coprime to $N$,where the Euler totient function $\phi (N)$ counts the residue classes coprime to $N$.

Let $r_1,\dots ,r_{\phi (N)}$ be representatives of these residue classes. Multiplication by $a$ gives a permutation of them: each $a{r}_i$ remains coprime to $N$, and $a{r}_i\equiv a{r}_j$ implies $r_i\equiv r_j$ by cancellation using the modular inverse of $a$. Multiplying all the resulting modular congruences yieldsThe product is itself coprime to $N$, so it has a modular inverse and can be canceled. This proves the Fermat-Euler theorem. For $N=1$, the congruence is trivial; no separate argument is needed.

Close the truncated two-sheet double circular cone by the lateral circular cylinder $r=1$, $-1\le z\le 1$. Together these form the boundary of the solid in part (c); no planar caps are required because the cone meets the circular cylinder along both end circles. On the circular cylinder the outward unit normal is $(\cos \theta ,\sin \theta ,0)$, so $\mathbf{F}\cdot \mathbf{n}=1$, and $dS=d\theta dz$. Its flux integral isThe divergence theorem now gives ${\int }_S\mathbf{F}\cdot d\mathbf{S}+4\pi =4\pi$, using the volume integral from part (c). Henceagreeing with tangency. The isolated vertex can be handled by excising a ball of radius $\epsilon$ and passing to the limit: since $|\mathbf{F}|=O(\epsilon )$ there and the added area is $O({\epsilon }^2)$, its extra flux is $O({\epsilon }^3)$ and tends to zero.