Use the reduction algorithm for a positive definite binary quadratic form. A determinant-one shear puts the middle coefficient in . If the resulting last coefficient is smaller than , the determinant-one substitution decreases the positive integer leading coefficient. Repeating terminates with a reduced positive definite binary quadratic form satisfying . These substitutions preserve proper equivalence of binary quadratic forms and the discriminant of a binary quadratic form.
The enumeration of reduced binary quadratic forms gives
Since , is odd. For , the possible values of are respectively . Each is a prime number greater than seven. But , so its positive divisor must be one. Then forces and . The two signs are properly equivalent: substituting in gives . Thus every form in question is properly equivalent to
The closed-set version of the Baire category theorem says that if a nonempty complete metric space is a countable union of closed sets, then at least one has nonempty interior. Equivalently, a nonempty complete metric space cannot be a countable union of closed nowhere dense sets.
For each integer , put . Every derivative is an entire function and cannot be identically zero: otherwise repeated integration would make a polynomial. By the identity theorem for holomorphic functions, its zero set has empty interior, and continuity makes a closed set. Thus is nowhere dense.
The complex plane with its usual metric is a complete metric space, so the Baire category theorem gives . The Taylor series there has coefficients
Each nonidentity element of the special orthogonal group is a rotation fixing exactly the two unit vectors along its axis. Since is a finite group, is finite. If is fixed by and , then is fixed by . Hence acts on by a group action.
Let , let be the number of orbits of a group action, and choose representatives with stabilizer subgroups of orders , each at least two. Count pairs with and . Counting by gives . Counting by group orbits and using the orbit-stabilizer theorem gives
Every summand is at least , so : there are at most three orbits. For the trivial group, is empty and the assertion also holds.
For the rotation group of a regular dodecahedron, . The three group orbits are the unit vectors towards the 12 face centres, 20 vertices and 30 edge midpoints, whose stabilizer subgroup orders are respectively . Rotations about these axes exhaust the nonidentity rotations. Consequently the orbit sizes are
Use binary search: maintain the interval of possible integers and ask whether is at least the first integer in its upper half. Each answer reduces the number of possibilities to at most its previous number divided by two, rounded up. After questions at most possibilities remain. Since , twenty questions suffice.
A yes/no decision tree of depth twenty has at most leaves, whereas the possible finishing orders number . Thus twenty questions cannot identify the finishing order of fifteen horses, assuming no ties. With unrestricted yes/no questions, the exact minimum for horses is : the leaf count is a lower bound, and repeatedly partitioning the remaining permutations into two nearly equal sets attains it. In particular fifteen horses require 41 questions.
By Stirling's formula,
so the leading number of questions is . These questions may ask about whole sets of possible orders; restricting them to pairwise comparisons is a different model.
Write for the single-observation score function. Differentiating the normalization of the probability density function gives
For discrete observations, use a sum instead. The allowed interchange of differentiation and integration is the usual regular-model assumption with common support. Adding these identities gives .
Let be the joint density. Because is an unbiased estimator with no explicit dependence on the parameter, differentiating gives
The scores are independent random variables with mean zero, so variance additivity for independent random variables gives . The Cauchy-Schwarz inequality applied to the centred estimator and the score now gives the Cramér-Rao lower bound:
The denominator is the sample Fisher information. This bound concerns regular models with positive finite information; the preceding covariance identity explains why a small estimator variance requires a sufficiently informative score.
The equation is a conservation law with diffusive flux . For positive density, insects move down the density gradient, with effective diffusion coefficient : dispersal is stronger in low-density regions. This is logarithmic diffusion, since the equation is .
Put and . A self-similar solution conserves total number when . Its width shrinks to zero as ; for an integrable nonnegative , changing variables in the integral against a bounded continuous function proves convergence to times the Dirac delta distribution at the origin.
Substitution gives
Matching powers for a nonstationary profile forces . The profile equation integrates to . For a centred even profile, , and integration of gives . Normalization requires , hence
This is times a Cauchy distribution density with scale . It is positive, has total mass , and directly satisfies the nonlinear diffusion equation for .
The fixed points are and . The Jacobian matrix is
At the origin its eigenvalues are and , so it is a saddle equilibrium for every allowed . At either nonzero fixed point the characteristic polynomial is , giving
Thus both are stable nodes for and stable focuses for . At equality the repeated eigenvalue is and the matrix is not scalar, so there is only one independent eigenvector: the fixed point is a stable improper node.
The stable manifold of the origin is , exactly: there . Conversely, a trajectory converging to the origin with would eventually have , which precludes convergence of to zero.
For the local unstable manifold, write . Reflection symmetry makes even, and the invariance equation for a graph requires
Comparing quadratic and quartic terms gives and . Therefore
At , both denominators are nonzero because ; they remain nonzero for every real . The integrand is therefore bounded on each finite interval. At infinity its terms decay respectively as and , so gives absolute convergence.
Set . The two integrals become
By the Euler integral for the hypergeometric function and the Gamma function recurrence, for and the indicated unit-circle values . Hence
The Gauss hypergeometric functions here use their continuation from the Euler integral, so no pole crosses the integration interval.
The canonical momentum is . Its time derivative contains the total derivative along the trajectory: . The Euler-Lagrange equation therefore gives
The magnetic field is , so the last term is . With the electric field , this is precisely the Lorentz force law:
The specified vector potential gives . Put , retaining its sign. The Lorentz force law yields , and . For initial velocities and , integration gives
The transverse motion is a circle centred at with radius . Thus the full orbit is a helix around a line parallel to the magnetic field, with period and signed axial advance per turn. The charge sign determines the sense of rotation. If it is a circle, if it is a straight line parallel to the field, and if all motion is uniform rectilinear motion.
For neighbouring comoving observers separated by a small physical distance , the recession velocity is , where is the Hubble parameter. During the photon's travel time , the local Doppler effect gives . Integrating along the ray gives the cosmological wavelength-redshift relation:
The same ratio stretches the arrival interval of successive wave crests and of successive emitted pulses: . Each photon loses a factor in energy because . Thus energy arriving through the sphere per unit observer time has one factor from cosmological redshift and one from time dilation:
This is the total power crossing the sphere; division by its area would give the observed flux.

Articles by others on the same topic (0)

There are currently no matching articles.