Four differentiations give
For , the fifth derivative is negative, so the fourth derivative is strictly decreasing. Since , strict decrease towards that endpoint implies for . On the closed interval, , with the maximum at and minimum at .
Let , , and . The composite midpoint rule and composite trapezoidal rule are
For composite Simpson's rule with strips, the spacing is . Its odd-indexed nodes are the and its even interior nodes are the . Consequently
This is an identity between the quadrature rules, not an approximation involving an omitted quadrature error.
An upper bound of is an element with for every . It need not belong to . A maximum, or greatest element, is an with that same property. A least upper bound is an upper bound satisfying for every upper bound .
A maximum belongs to ; a least upper bound need not. In a partially ordered set, an existing maximum is automatically the least upper bound, and the antisymmetric relation condition makes each unique.
Use the inclusion-exclusion principle on the multiples of in . The pairwise least common multiples are , and the triple least common multiple is . Therefore the count is
The endpoint is excluded, which is why the numerators are rather than .
There are six functions: the four power maps for , and the two constant maps . All calculations in this part are in the finite field .
Put . Multiplicativity gives , so the absence of zero divisors forces or . If , then for every , giving only the constant-zero map.
Suppose . For nonzero , the equality shows . The nonzero elements form a cyclic group generated by , in the order . Choosing determines every value on this group by . Each satisfies , so all four choices give consistent group homomorphisms.
Finally, satisfies and for every . The choice works for all four group maps. The choice forces every nonzero value to be , giving one extra map, the constant-one map. Thus the count is . The four zero-preserving possibilities are exactly the four displayed power maps. This is the special case with five elements of multiplicative self-maps of a finite field.
The iterated function is for every positive integer . The exponent here denotes repeated function composition, not an ordinary power or a derivative.
For the base case , the formula is the definition. If it holds at , then
This proves the claim by mathematical induction, for every real input .

There are unlisted articles, also show them or only show them.