Since and the factors are coprime,
Hence
The required integer is the exponent of the unit group. Since and ,
The residue is a primitive root modulo . Choose
Writing gives , so one may take
Its Chinese-remainder components have orders and , hence its order modulo is .
Chebyshev's equal-ripple criterion says that a polynomial of degree at most is a best uniform approximation to a continuous function if and only if the error attains alternating extrema of maximum magnitude at ordered points.
Since has leading coefficient , the polynomial is monic and alternates between at . Therefore
At each , both and have sign , because . Each has a root in every interval between consecutive extrema, hence all its at most roots lie in . For both polynomials remain positive, giving . For both have sign , giving . On the hypothesis gives . Thus
The received word has Hamming distances from and from , so
After multiplying by the priors, the unnormalized posterior probabilities are and . Thus the ideal observer decodes as , while maximum-likelihood and minimum-distance decoding both choose .
The ideal observer minimizes average error but needs priors and channel statistics. Maximum likelihood needs the channel law but not priors, and can be suboptimal for unequal codeword probabilities. Minimum distance is simple and agrees with maximum likelihood for a binary symmetric channel with crossover probability below , but ignores unequal priors and general channel asymmetry.
A language satisfies the context-free pumping lemma if there is an integer such that every with has a decomposition
with
and
Every context-free language has this property, although the property by itself is not sufficient for context-freeness.
This language is not context-free. If were a pumping length, apply the lemma to
Because , the pumped region meets at most two adjacent blocks and cannot meet both zero blocks. Pumping with or changes at least one symbol count. If it changes either zero block, that block no longer agrees with the untouched zero block; if it changes only the middle block, the number of ones no longer agrees with the two zero counts. In every case the pumped word leaves the language, contradicting the lemma.
The language is context-free. A grammar with start symbol is
Every derivation adds matching symbols to the two ends and starts with a matching central pair, so it produces exactly the nonempty even palindromes .
This language is not context-free. Intersect it with the regular language
An even palindrome in has the form , and its first half is . The required equality of the numbers of zeros and ones in forces . Hence the intersection is
This is not context-free: applying the pumping lemma to , a pumped substring of length at most cannot meet both zero blocks. Pumping therefore either destroys equality of the two zero counts or changes the middle count away from twice their common value.
Context-free languages are closed under intersection with regular languages, so a context-free would make context-free. This contradiction proves the claim.
This language is context-free. Let
The nonterminal produces exactly with . The base production for supplies one leading and one trailing zero, and each recursive production supplies one more of each. Thus produces exactly
Write for the yield in replicate of genotype . Model 1 is the one-way cell-means model
Thus its three coefficients estimate the three genotype means directly.
Put . Model 2 is
It imposes and . The reported finite-sample p-values assume independent normal errors, a common unknown variance in every genotype, fixed full-rank design matrices, and correctness of the relevant mean model. Random assignment of genotypes supports interpreting the fitted differences as treatment effects.
The displayed analysis of variance compares Model 2 with the unrestricted three-mean Model 1. It tests
which is precisely full dominance: once an allele is present, a second copy has no further effect. Under ,
The p-value rejects full dominance at the level, providing evidence that the heterozygote and means differ.
No dominance says that mean yield is affine in the number of alleles:
Equivalently, . Fit that reduced model and compare it with Model 1 using
r
model3 <- lm(yield ~ count, data = potato)
anova(model3, model1)
The resulting one-degree-of-freedom F-test tests the no-dominance constraint against unrestricted genotype means.
The term removes healthy foxes through mass-action contact with infectives. The Laplacian models random migration of infected foxes. The matching term creates newly infected animals, while removes infectives at per-capita rate . The equation records those removed from infectious circulation, for example foxes that have died from rabies; they neither migrate nor return to susceptibility in this model.
In a homogeneous population,
An infected fox remains infectious for mean time and creates new infections at initial rate , so the basic reproductive ratio is
Initially grows exactly when , equivalently . Below that threshold each infective produces fewer than one replacement on average and the infection decays.
With , time derivatives become times derivatives and . Hence
or equivalently
At the leading edge and is small, so
Seek a decaying mode with . Its characteristic equation is
A nonoscillatory positive leading edge requires real positive roots, hence
For an invasive infection, , and the selected minimum speed is therefore
If , the state ahead of the wave is below the epidemic threshold and no growing infection front is selected.
The partial-fraction decomposition is
The residues at and are respectively and . If two paths from to have winding-number differences and about those poles, their integrals differ by
Loops can wind around either pole independently, so the value changes by arbitrary integer multiples of and is multivalued.
Along the straight real segment,
Consequently the complete set of values is
Let be any closed curve in . Since the arc joins to without meeting , those two points lie in the same component of . Their winding numbers about are therefore equal. The residue theorem gives
Thus every closed-path period vanishes. Integrals from to along any two paths avoiding agree, so is single-valued. Notice that this argument uses cancellation of the two residues; simple connectedness of the slit domain is not required.
On the positive real axis, whose path does not cross the left-displaced cut,
Since near infinity, integrating this derivative along large arcs extends the same expansion uniformly there:
Therefore
and hence
For a one-dimensional closed energy orbit, define
After locally inverting this relation to write , use the Hamilton--Jacobi generating function
and define the angle modulo . The transformation is canonical, the Hamiltonian depends only on , and
The adiabatic-invariance principle says that if an external parameter changes on a time scale much longer than the orbital period, and no separatrix is crossed, the action remains approximately constant. Its small within-cycle changes do not accumulate at leading adiabatic order.
Put . On the energy surface,
so
Equality occurs at a turning point, so this is the smallest possible bound.
Using the natural collision continuation through the singular point, a full orbit runs between both turning points. Hence
Set . Then
Therefore
If instead one identifies the singularity as a reflecting endpoint and regards one half-line as the orbit, the action is half this value; the following scaling is identical.
Adiabatic invariance keeps constant. Thus doubling doubles :
The energy becomes twice as negative.
Chemical equilibrium in gives
The negligible lepton chemical potentials therefore imply . Nonrelativistic Maxwell--Boltzmann number densities satisfy
Neutrons and protons have equal spin degeneracy and nearly equal masses, so their prefactor ratio is approximately one. Hence
The ratio
falls rapidly as the universe cools. Below , weak reactions occur less than once per expansion time and can no longer track the falling equilibrium ratio. The neutron-to-proton ratio therefore freezes at approximately .
Before nuclei can form efficiently, free neutrons continue to beta-decay,
During the deuterium bottleneck this lowers the ratio to about by .
Once deuterium survives photodissociation, nuclear reactions rapidly assemble nearly every available neutron into tightly bound helium-4. Protons are more abundant, so neutrons are the limiting constituent. If , then
Neglecting the neutron--proton mass difference,
Thus
Increasing makes smaller at every fixed temperature, so freeze-out occurs earlier, at a higher . The equilibrium value is then closer to one. Although some neutrons subsequently decay, the final neutron fraction is larger, and
increases, approaching unity if the surviving neutron and proton abundances become comparable.
Such a universe begins with less hydrogen and more helium. It has less fuel for long-lived hydrogen-burning stars; stellar evolution would tend to proceed through hotter, faster helium-burning stages, reducing typical stellar lifetimes. The shorter stable-energy window, altered heavy-element production, and lower primordial hydrogen abundance would make familiar water-rich, slowly evolving habitats less likely, although a detailed conclusion would require a stellar-evolution model.
By the Born rule,
and
Each is the expectation of the projector onto the span of the two displayed matching-label product states.
In the basis, the transformations whose columns are the new basis vectors are
Thus is a rotation through , while is a real orthogonal reflection, equivalently a rotation with one basis-vector phase reversed.
For any real orthogonal matrix with columns ,
Applying this to and and normalizing proves
For , independence of the product state gives
For the remaining pair,
Therefore
For the real Bell state , real one-qubit vectors satisfy
For each adjacent pair , , and , the two same-label overlaps have magnitude . Hence every matching-label probability is
It follows that
Assume (i), and suppose a map as in (ii) existed. Then
are closed, cover , and contain , respectively. But
since the three sides have no common point. This contradicts (i), so (i) implies (ii).
Conversely, suppose (i) fails. Let be a counterexample and put
No point lies in all three closed sets, so . Identify affinely with the standard simplex so that side is the side on which the first barycentric coordinate is zero, and similarly for . Define to be the point with barycentric coordinates
Because covers , at least one distance is zero, so . If , then , so ; likewise for . Thus is a forbidden map from (ii). This proves (ii) implies (i).
Brouwer's fixed-point theorem in the plane states that every continuous map from a closed disk to itself has a fixed point. Equivalently, the same holds for every nonempty compact convex subset of .
On the closed unit disk define
For ,
so maps the disk continuously into itself. Brouwer supplies with , which is equivalent to
Thus this polynomial has a root with .
Write , , and
The endpoint conditions imply
Let and define the continuous self-map of
By Brouwer, has a fixed point . If is interior, its fixed-point equation gives . At or , the projection equation and the corresponding displayed boundary sign again force . The identical argument in the second coordinate gives . Hence
so
The two paths intersect.
The unicity distance is the ciphertext length at which the key is uniquely determined, or equivalently at which key equivocation vanishes:
For Shannon's idealized calculation, assume a uniformly chosen key independent of an iid plaintext source, deterministic invertible encryption for each key, and uniformly distributed ciphertext over an alphabet . Since is determined by ,
Setting this to zero gives
Equivalently, each ciphertext symbol supplies the source redundancy bits toward identifying the key.
For the stated cipher, the original formula uses , so , while . Split first according to whether . This event and its complement each have probability , and conditional on the probabilities are . Hence
If , then
so, using ,
Therefore
Binary entropy is symmetric about probability and increases up to that point. Since equality holds at , it also holds at . Thus
and all requested values are
Finally let , so the source is uniform on . Use one uniform key bit and encrypt each symbol by
Thus the second key swaps and . Every ciphertext has two possible plaintexts, a binary string and its complement, with equal source probability. No amount of ciphertext distinguishes the keys: for every . This cipher has infinite unicity distance.
With ,
The chain rule gives
Hence becomes
A Papperitz symbol records the three regular singular points of a second-order Fuchsian equation and the two characteristic exponents at each point. Near , substituting into the leading terms gives
so the exponents are and . The same calculation at gives and . At infinity, gives
so . Since an exponent at infinity denotes behavior , these are recorded as . Thus the equation has P-symbol
The exponent sum is , as required by the Fuchs relation for three singular points.
Set
This Möbius change sends to , respectively, without changing the corresponding exponents. The hypergeometric P-symbol has exponents
Matching it with at both finite singularities and at infinity gives
The exponent-zero solution normalized to one at is therefore
The second standard local solution at is
After absorbing the constant into its normalization, this becomes
Their exponents at are and , so they are linearly independent.
Take in part (c). The original equation has the solution . The solution is normalized by as , so
Comparing this with the formula for and using gives
This also agrees with the general identity .
With the pivot as origin and upward vertical coordinate,
Therefore
The potential energy is
Thus is
Put and . The Euler--Lagrange equations, after division by the appropriate powers of , are
Time-translation invariance conserves the total energy
Setting both angles and velocities to zero satisfies the equations, so the downward configuration is an equilibrium. Writing and retaining linear terms gives
Equivalently, the mass and stiffness matrices are
Seek and put . The generalized characteristic equation is
or
As a quadratic in , this is
so
A corresponding displacement vector is
Thus the four normal modes are and . Both squared frequencies are positive for every , proving linear stability.
For ,
Therefore, labeling the larger and smaller positive frequencies by and ,
so .
The order of modulo is the least positive integer such that
It exists because is a unit in the finite group .
Define
using the inverse of for negative . Since , . Conversely, if then , so the definition of order gives . Two integers in the same block of consecutive integers cannot differ by a nonzero multiple of . Hence is one-to-one within each period.
Since is even,
The first factor is not divisible by , since that would contradict minimality of , and the second is not divisible by by hypothesis. Nevertheless their product is divisible by . Therefore
and Euclid's algorithm computes a nontrivial factor. One can also compute ; together the two gcds expose factors lying on opposite sides of the congruence modulo the prime-power divisors of .
Articles were limited to the first 100 out of 369 total.

Articles by others on the same topic (0)

There are currently no matching articles.