For a sample of size , defineFor the zero-mean Gaussian sample, the standardized vector has independent standard normal coordinates. Apply an orthogonal transformation whose first row is . The resulting coordinates remain independent standard normals: their joint density depends only on squared Euclidean length and the transformation has unit absolute Jacobian. Its first coordinate is , while orthogonal decomposition givesThusThe ratio of the first independent standard normal and the square root of the normalized chi-square variable has a Student probability distribution, giving
For the paired height observations, form one cross-minus-self difference per pot. The sampling units for this test are the fifteen differences, not thirty separate plant heights. Under the usual independent normal model for differences, a null mean of zero gives a statistic. The observed statistic isFor the two-sided alternative, reject at significance level if . Its two-sided -value is . This uses the recorded values without performing the numerical calculation forbidden by the question. The normal difference model is what makes the small-sample Student calibration exact.
Choose each factor with its argument between zero and in the upper half-plane. On an interval between consecutive real prevertices, each factor has a constant boundary argument, so has constant argument and the image is a straight side. Crossing from left to right decreases by , hence increases by , giving the prescribed exterior turn. Locally,so an upper half-disc maps to angle , the required interior angle. The overall constant rotates and scales the polygon; integration adds translation. For a general prescribed polygon, the prevertex positions must also satisfy the side-length conditions: the derivative formula fixes angles but arbitrary choices do not fix arbitrary side lengths.
For the slit domain, the slit tip has interior angle , so its exterior parameter is . The two vertices at infinity give the factors at , leading to proportional to . Integrating and imposing the tip value givesThe square root is the principal one: for , never lies on the nonpositive real axis. Thus . Boundary points map to the two banks of the slit, with at the tip; the outside intervals map to the imaginary axis. The derivative is nonzero in the open half-plane. Conversely each point of the slit domain determines exactly one root of with positive imaginary part, proving bijectivity.
The Möbius map takes the upper half-plane to itself, so its principal argument lies in . The imaginary part of its analytic logarithm is harmonic, equals on and zero on the other real intervals. ThusIt lies between zero and one and has the required boundary limits away from the two discontinuities. Pulling this harmonic function back by the inverse conformal map yieldsThis specifies all branches and remains bounded even as tends to either end at infinity.
To exhibit nonuniqueness without the growth restriction, putThis is harmonic in the domain. On its boundary the corresponding is real and the rational expression is real, except at , which represent infinity. At , representing , the expression tends to zero. Thus has zero finite boundary data. It is nonzero, since for its value is , and it is unbounded as approaches either pole non-tangentially. Therefore gives distinct solutions with the same finite boundary data when boundedness at infinity is removed.
Prevertices, the slit domain, and the bounded harmonic boundary values
. Details. The integral construction requires differentiation under the integral and vanishing boundary terms. With those assumptions, integration by parts givesThe standard construction therefore sets , giving . Convergent contours run between rays where : convenient central rays have arguments , and . Two choices are the oriented pathsThe cubic exponential dominates the linear one at both ends. To verify independence directly, put and . At the value and derivative of the integral along rays are and . For the two contours above their derivative-to-value ratios are respectively and , which differ. Hence their Wronskian is nonzero.
For the second equation multiply by before integrating by parts:Setting the residual weight to zero gives . One contour is the segment from to , with the square root positive at . Its integral is a nonzero multiple of : substituting gives , an entire function nonzero at zero.
A second contour starts at and follows , , choosing a continuous branch along the path. For it converges at infinity; at the branch endpoint its integrable singularity is . In both cases the boundary term contains and vanishes at branch endpoints. The second integral has a nonzero logarithmic divergence as through positive real values, because its large- integrand is a nonzero multiple of . It is therefore independent of the entire first solution; analytic continuation supplies solutions elsewhere away from the equation's singular point.
Strictly, nonzero and an arbitrary contour alone do not prove the printed necessity for . Necessity also needs injectivity of the chosen Laplace representation, while the vanishing-integrand argument above is the usual sufficient construction. For a concrete counterexample to unconditional necessity in the Bessel case, take a positively oriented circle , choose the branch outside the cut , and add one to that weight. The added entire integrand integrates to zero. Expanding the original weight on this circle gives integral , which is nonzero and solves the equation, although the modified weight is not a constant multiple of the printed one. The standard weights and contours above still give the requested independent solutions.
Let be the separation of the Earth and Moon, and let be the spacecraft's distance from the Earth's centre towards the Moon. On , the two gravitational forces oppose each other. Their equality, by Newton's law of universal gravitation, isTaking the positive square root givesThe centre of mass of the two bodies is at from the Earth's centre. Thus the gravitational field null between two point masses lies a distancefrom their centre of mass, on the Moon's side. With , and , soThe point is from the Moon. It is an instantaneous zero of the physical gravitational field, not a co-rotating Lagrange point: a spacecraft remaining fixed relative to the Earth-Moon line would need a nonzero centripetal acceleration. With zero net force it cannot follow that circular co-rotation.
For motion in a central potential, conservation of angular momentum gives . In polar coordinates, the conserved mechanical energy isConsequently, for ,The sign in distinguishes inward and outward motion. Choosing the orientation so , it is also the sign of . The expression under the square root must be nonnegative. If , the motion is radial and is constant, so cannot be parametrized by this way.
Let , which is real. The dispersion, or quantum uncertainty, is the nonnegative standard deviationIndeed, self-adjointness and normalization giveA squared norm is nonnegative, so the square root is defined. It vanishes precisely when , namely when is an eigenvector of . Conversely, an eigenvector with eigenvalue has and hence zero dispersion. Thus zero dispersion is equivalent to being an eigenstate.
Take a singular value decomposition , with positive and . Such a choice is possible because . Left material frame indifference removes , and right material isotropy removes , giving .
Moreover is unchanged when the positive diagonal entries are permuted. Every permutation can be implemented by a signed permutation matrix of determinant one; the signs disappear in conjugating a diagonal matrix. Thus the energy depends only on the unordered principal stretches.
The three invariants determine precisely this unordered triple: the roots of are , and their positive square roots give the stretches. Consequently, on the set of admissible invariant triples, define to be . The preceding argument proves that this is well defined and thatNot every positive triple is realizable by three positive roots. Since the requested statement only asserts existence of a function on , extend arbitrarily on the nonrealizable triples; no choice there affects the formula for a deformation in continuum mechanics. Smooth invariant representations, where needed for differentiating the constitutive equation, are understood locally on the realizable set.
Put . momentum eigenstates evolve with energy , so the retarded momentum kernel is . Its Fourier transform reduces toCompleting the square and defining the oscillatory Gaussian integral by a convergent limiting prescription givesFor the square root has quantum phase . As , this kernel tends to in the distributional sense. Differentiating the Heaviside step function consequently supplies the required source; an extra factor would correspond to a different Green-function convention.
Let . The outgoing analytic branch of Klein-Gordon step momentum iswhere each square root is continued from the upper half-plane. It behaves as at large positive or negative real . The branch points are ; replacing this product by a principal square root of can choose the wrong sign below the lower threshold.
I. For , and both transmitted kinetic energy and group velocity are positive. Thus and ; the transmission decreases to zero on approaching the upper threshold from above.
II. For , write with . The right wave decays, has modulus one, and . There is an evanescent tail but no flux transmitted to infinity. Its reflection quantum phase changes continuously between the two thresholds.
III. For , the analytic continuation gives , where . The group velocity is again rightward, while the charge density and transmitted charge current are negative. ThereforeChoosing would describe a wavepacket arriving from the right, inconsistent with the chosen incoming channel. As the lower threshold is approached, and from above. This Klein-Gordon step amplification has a real denominator zero at when : there , and no finite stationary solution with unit incoming amplitude satisfies both matching equations. The resulting formal pole must not be described as an infinite single-particle probability. Finite switching, wavepackets and the treatment of the external source require a multiparticle analysis.[ref]
Klein Paradox for Spin-0 Particles by Douglas M. Gingrich. Equations 4.142–4.155: outgoing negative-momentum branch, boundary matching and charge currents
Past exam of the topics in applied mathematics course of the University of Oxford 2008 B 7 Solution 2026-10-31
For , differentiate and use the two differential equations:Substituting , gives the required equations in polar coordinates. The origin is handled in Cartesian coordinates, where it is an equilibrium point; an angular coordinate is not defined there.
A Lyapunov function near an equilibrium point is a continuously differentiable positive-definite scalar function whose derivative along solutions is nonpositive. This implies local Lyapunov stability under the usual comparison bounds; if its derivative is negative definite, the Second Lyapunov theorem gives local asymptotic stability. Here takeIf , continuity gives a small ball and such that inside it. Consequently . A sufficiently small initial sublevel set stays inside the ball, and . The origin is asymptotically stable, in fact locally exponentially stable. If , continuity instead gives in a small ball. Every nonzero initial point there exits that ball in forward time, proving instability of the origin. These inequalities hold along all local solutions; continuity of alone need not supply uniqueness for a general vector field.
If , a nonzero constant radius satisfying gives a periodic orbit of period , since . Linearizing the scalar radial equation there givesThus the periodic orbit is orbitally asymptotically stable for and unstable for . The direction along the periodic orbit is neutral, as expected for an autonomous periodic orbit; orbital asymptotic stability means attraction in a dynamical system to the orbit with a possible phase shift.
For the specified radial response,The origin is therefore stable for and unstable for . The nonzero-radius equation has roots of an equationretaining only positive radii. For , the square root exceeds one, so only exists and : the periodic orbit is unstable. For , both radii are positive; gives and a stable periodic orbit, while remains unstable.
As increases through , the stable small-radius periodic orbit emerges from the origin while the origin loses Lyapunov stability. This is the supercritical Hopf-type transition with a nonsmooth radial response requested. It follows directly from the explicit radial dynamics. There is a regularity qualification: near zero, so the vector field in Cartesian coordinates contains and terms. It is continuously differentiable but not generally twice differentiable at the origin, and the periodic orbit radius grows as rather than the square-root law of a generic smooth Hopf normal form. One should therefore use the explicit computation here rather than invoke a smooth Hopf bifurcation theorem with unmet hypotheses. At itself the origin is still weakly attracting, because for small positive .
The update in Newton's method is exactly . Positivity is preserved, and the arithmetic-geometric mean inequality from part (a) applies to every update. ConsequentlyThis holds even when : the first update moves to or above the positive square root.
Use the iterator adapter from part (b) with a primality test by trial division. A composite positive integer has a divisor no greater than its square root.Before each trial division iteration, no integer in divides
def primeIter(upperBound: Int): Iter[Int] = {
def isPrime(n: Int): Boolean = {
if (n < 2) false
else {
var d = 2
while (d <= n / d && n % d != 0) d += 1
d > n / d
}
}
filterIter[Int](isPrime _, new RangeIter(2, upperBound, 1))
}n. If division succeeds, the condition becomes false with , and isPrime returns false. Otherwise the loop ends with , so every possible small divisor has been excluded. The quotient comparison is equivalent to for positive values and avoids integer overflow in d*d.Bounds at most two give an empty iterator. This method tests candidates lazily and uses trial divisions for candidate ; no efficiency requirement in the question forces a sieve of Eratosthenes implementation.Use trial division on a shrinking residual. Once the trial divisor exceeds its square root, any residual larger than one is itself prime.For the outer loop invariant, let be the set of primes below
PROCEDURE divisors(n: INTEGER): INTEGER;
VAR residual, trial, exponent, answer: INTEGER;
BEGIN
residual := n; trial := 2; answer := 1;
WHILE trial * trial <= residual DO
exponent := 0;
WHILE residual MOD trial = 0 DO
residual := residual DIV trial;
exponent := exponent + 1
END;
answer := answer * (exponent + 1);
trial := trial + 1
END;
IF residual > 1 THEN answer := 2 * answer END;
RETURN answer
END divisors;trial and their exponents in the original . Thenand residual has no prime factor below trial. If trial divides the residual it must therefore be prime: a composite trial value would have a smaller prime factor, contradicting this clause. If it does not divide, the zero exponent contributes the factor .For the inner loop invariant, let be the residual on entry. Then . Each exact division reduces the positive residual by at least a factor of two, so this loop terminates. At exit the exponent is the full multiplicity of
trial; multiplying by exponent+1 preserves the outer loop invariant. The outer loop terminates because trial increases and residual never increases. When it exits, a composite residual would have a prime factor at most its square root, yet every smaller trial factor has already been excluded. Hence the residual is or a single remaining prime of exponent .The procedure computes in unit-cost time and auxiliary space, with the separate successful divisions bounded by . No array or table of primes is needed, and correctly returns .
The second procedure should reach large outputs faster, because the first makes exactly expensive
MOD operations when processing argument , whereas the second tries only up to the square root of a shrinking residual, with at most successful DIV operations. Each successful division also requires a successful MOD test; each outer iteration adds one final unsuccessful MOD test. Thus its expensive-operation count is per argument, and at most cumulatively through argument , compared with for direct counting.The speedup is not an assertion that every single call uses fewer divisions: for , the second code makes three
MOD tests and two DIV operations, while the first makes four MOD tests. Small constant costs can go either way. The many small prime factors in highly composite numbers also shrink the residual early, which often helps further; the cumulative comparison includes every preceding argument, not only the printed records.
