Since , its factorial is even, so is odd and its prime divisor is odd. Also cannot divide , since it would then divide1. Modulo ,
Raise this equation to the integer power . Fermat's little theorem gives
As is odd, and are distinct residues. Thus the exponent is even, and
Fermat's little theorem states that for a prime and an integer not divisible by ,
Equivalently, for every integer , with divisibility by allowed in that latter formulation.
Set , choose for a negative bound-state energy, and write . Multiplying the radial equation by gives
For , its second derivative is . Substitution cancels the two terms and gives
For the physical hydrogen problem, the angular eigenvalue has a nonnegative integer. Regularity at the origin selects the Frobenius exponent , rather than the singular branch. Put
The equation for the series factor is , and coefficient comparison yields
The regular confluent-hypergeometric solution generically grows like in this series factor; after the extracted it is not normalizable. A bound state requires termination at some degree , namely . Thus is an integer greater than , and
Regularity, normalizability and the integer angular index are the physical conditions selecting this spectrum; the differential equation without those conditions would admit many other solutions.
For , necessarily and . With ,
A normalized spatial ground state is . In spherical coordinates the radial probability has weight . Constants and the angular integral cancel in the tail ratio. The supplied integral with gives
A primitive root modulo is an integer whose residue generates the multiplicative group , equivalently has order .
The Chinese remainder theorem states that, for pairwise coprime positive integers , the system has a unique solution modulo . For a constructive proof put . Bézout's identity gives an integer with . Then has all the required residues. If two solutions exist, their difference is divisible by every ; pairwise coprimality makes it divisible by their product, proving uniqueness modulo .
Here divide , and none is zero modulo . Choose a primitive root and exponents with
Use the theorem with moduli to choose such that , , . Define nonzero residues
The exponents are integers; negative ones are interpreted using inverses in . Taking integer representatives now gives
The theorem aligns the exponent modular congruences, which is why a primitive root converts the three power conditions into a linear modular congruence problem.
A possibly randomized statistical test has rejection probability after observing . Its statistical power at parameter is , and its test size is the supremum of that statistical power over the null parameter set.
For simple hypotheses with densities , the Neyman-Pearson lemma states that a level- test is most powerful if it rejects where , accepts where , and randomizes on equality to obtain null rejection probability . Here is chosen to reach that test size. To prove optimality, let be this test and any test of level at most . Pointwise,
Integrating and using gives . This proves maximal statistical power. For , equality also forces any equally powerful test to use all its allowed test size and agree with the indicated decisions away from the likelihood-ratio tie set, up to null sets.
For the Poisson sample, and, for every fixed , the likelihood ratio is
It increases strictly with . Choose an integer so that , and reject for , with boundary rejection probability
This has exact test size . Its rejection ordering and calibration do not depend on which is selected, so the lemma proves it uniformly most powerful for the whole one-sided alternative. Randomization is generally needed for an exact arbitrary test size in a discrete model.
For the approximate design, the central limit theorem under gives critical sum . Under , the sum is approximately normal with mean and variance . Target statistical power therefore gives
or . Thus the requested design expression is
Round upward to obtain an integer design. This is a normal approximation to the requested statistical power, rather than an exact discrete sample-size guarantee; the exact Poisson test above provides its exact calibration.
The characteristic of a field is the least positive integer with , or zero if none exists. Finiteness forces a positive characteristic, since the sequence of integer multiples of one must repeat. If this least integer factored into two smaller positive factors, their nonzero field multiples would multiply to zero, contradicting the absence of zero divisors. Hence it is prime. The field is a finite-dimensional vector space over its prime subfield , so choosing a basis gives .
A nonzero polynomial of degree over a field has at most roots: each root supplies a linear factor by polynomial division, and induction applies to the quotient. In particular has at most roots. The elements of whose orders divide are precisely those roots. The permitted finite-group criterion therefore proves is cyclic.
For the final assertion take an odd Fermat prime , . Primality forces to be a power of two: an odd factor in would factor nontrivially. Since , the order of two divides but not . As is a power of two, its only divisor not dividing is itself. Thus
It generates the full group exactly when , which holds for and fails for . Therefore the possibilities are , equivalently among odd Fermat primes. The oddness is implicit in referring to two as a unit; is not an admissible case for that claim.
The characteristic of a field is the least positive integer with , or zero if none exists. Finiteness forces a positive characteristic, since the sequence of integer multiples of one must repeat. If this least integer factored into two smaller positive factors, their nonzero field multiples would multiply to zero, contradicting the absence of zero divisors. Hence it is prime. The field is a finite-dimensional vector space over its prime subfield , so choosing a basis gives .
A nonzero polynomial of degree over a field has at most roots: each root supplies a linear factor by polynomial division, and induction applies to the quotient. In particular has at most roots. The elements of whose orders divide are precisely those roots. The permitted finite-group criterion therefore proves is cyclic.
For the final assertion take an odd Fermat prime , . Primality forces to be a power of two: an odd factor in would factor nontrivially. Since , the order of two divides but not . As is a power of two, its only divisor not dividing is itself. Thus
It generates the full group exactly when , which holds for and fails for . Therefore the possibilities are , equivalently among odd Fermat primes. The oddness is implicit in referring to two as a unit; is not an admissible case for that claim.
Here the iteration index is a positive integer: . If , then fixes and the generator, so it fixes all of . Every element of would then solve . A nonzero polynomial of degree over a field has at most roots, contradicting . Thus . The printed inequality alone omits positivity of ; at the claimed inequality would be false.
The characteristic of a field is the least positive integer with , or zero if none exists. In a finite field a positive such integer exists because the sequence must repeat.
The prime subfield is the intersection of all subfields of , equivalently the subfield generated by . In characteristic it is the copy of formed by the multiples of . Every field automorphism preserves and addition, so it fixes every element of this subfield.
Finally, once the order- Frobenius automorphism below is established, all its powers are distinct. Any automorphism fixes and is determined by its value at the generator . That value must be a root of the degree- minimal polynomial of , so there are at most automorphisms. Hence
Suppose all primes congruent to modulo eight are , and put , an odd integer. The integer is odd and congruent to three modulo eight. If a prime divides it, then and , since a common divisor of and would divide two. Thus , so part (v) forces or .
If all prime factors congruent to three had even multiplicity, their product, including the factors congruent to one, would be one modulo eight. Since is three modulo eight, at least one prime factor is congruent to three and occurs to odd multiplicity. But it is none of the , since those divide . This contradiction proves infinitely many primes are congruent to three modulo eight.
For , the zero residue contributes zero. Write . Multiplication by any nonzero permutes these residues, so in . If , choose a primitive root ; then , and forces .
If , every nonzero has , so . Therefore
The source also lists , although its premise assumes . For that separate case, the integer sum has terms each equal to one, so it is zero modulo .
For every integer , the th derivative with respect to of is times a sine or cosine with a sign. Its absolute value is at most on the finite interval . This is an integrable dominating function independent of . Repeated differentiation under the integral sign is therefore justified for every order, giving .
For an odd prime number , a nonzero class is a quadratic residue if for some integer not divisible by . The Legendre symbol is
When discussing solvability of without a coprimality assumption, zero is also a square. This convention matters in the final local characterization of integer squares.
Every integer square remains a square modulo every prime number, including the zero class at its prime divisors. Conversely, let be an odd integer which is not an integer square. If is the negative of a square, part (i) supplies an odd with . In every other case, the prime factorization of has an odd exponent at some odd prime . Write with odd and , and apply part (ii).
In either case, factor the resulting into primes. Since its Jacobi symbol is a product of Legendre symbols and equals , at least one prime factor has . Thus is not a square modulo that prime. This proves an odd integer is an integer square exactly when it is a square modulo every prime. If the phrase quadratic residue is restricted to nonzero residue classes, the final statement must instead say “a square modulo every prime”; for example, reduces to zero modulo .
Choose a nonzero quadratic nonresidue . There is one because the squaring map on is two-to-one, so exactly half its elements are squares. The moduli are pairwise coprime, so the Chinese remainder theorem gives a positive integer satisfying
When , the last condition is vacuous. In particular is odd and coprime to . Since , Jacobi reciprocity gives
As is odd, multiplicativity of the Jacobi symbol now yields
Here is odd and nonzero. Choose . This is a positive odd integer, , and . By multiplicativity of the Jacobi symbol,
The coprimality condition ensures that the squared Jacobi symbol is rather than .
False. Let
This is a bounded measurable function, and the intervals are disjoint, so
Nevertheless for every positive integer , while . Hence it has no limit at infinity. Narrow spikes separate Lebesgue integrability from pointwise decay.
A constructible regular polygon can be translated, rotated, and rescaled by constructible operations to one inscribed in the unit circle with a vertex at . Thus the real and imaginary parts of are constructible. Part (c) puts both in a real field of degree over . Consequently , and because .
For prime , the supplied irreducibility of shows that . The intermediate-field tower law implies that divides . Every positive divisor of a power of two is a power of two, so
This necessary condition includes with . It does not assert sufficiency for arbitrary integers of this form.
For an integer and an odd prime , the Legendre symbol is
The value one refers to a nonzero quadratic residue; divisibility by is recorded separately by zero.
Reducing modulo gives . Reciprocity with five has positive sign, so
since the nonzero squares modulo five are one and four. Modulo , , and . Thus part (b) gives
As , a solution modulo would in particular solve the modular congruence modulo , contradicting the first symbol. Therefore there is no integer solution modulo .