By the generalized pigeonhole principle, 13 cards guarantee cards in one suit. The guarantee is sharp: 12 cards can consist of three cards from each suit, with no four cards of a common suit.
Set , using the ceiling function. If no box contains at least objects, all boxes contain at most , so the total number of objects is at most . Taking the contrapositive, a total greater than forces some box to contain at least objects. But , hence . This proves the generalized pigeonhole principle: some box contains at least objects.
Let contain the multiples of among . Its cardinality is , using the floor function. Because are pairwise coprime, their pairwise intersections correspond to divisibility by , and their triple intersection to divisibility by . The inclusion-exclusion principle gives
For finite sets, the inclusion-exclusion principle states
Thus single-set cardinalities are added, pairwise-intersection cardinalities subtracted, triple-intersection cardinalities added, and so on.
Each of the elements is either included or excluded, so the rule of product gives . Alternatively, partition the power set into disjoint families according to cardinality. The family of -element subsets has size equal to the binomial coefficient . The rule of sum therefore gives
The rule of product says that a sequence of choices, with possibilities at stage regardless of earlier choices, has possible outcomes. Applied to the Cartesian product of finite sets, it gives . Here independence means that the available choices do not restrict one another; no probability assumption is needed.
By the diagonal reduction in a two-variable Newton iteration, for . Put . Direct factorization gives the exact Newton map in optimization error identity
The assumed convergence makes the final factor tend to , so it is bounded for all sufficiently large . Hence . For the Euclidean norm error , this becomes , proving quadratic convergence. Unless the exact limit is reached in finitely many steps, .
For Newton's method in optimization, let . Its second row equation is , so . Therefore . The given first coordinate yields
The Newton step is defined where ; both coordinates after any defined step are equal.
For a generic integrand in 20 dimensions, Monte Carlo integration gives root mean square error , whereas tensor-product quadrature with composite Simpson's rule gives only . One can sample uniformly in the Euclidean unit ball, for example by an independent uniform direction and radius with uniform on .
For this particular integrand, the most efficient elementary choice uses radial integration over a ball first. The area of the unit 19-sphere is , as follows from the volume of an n-ball. Hence
The reduced integrand is smooth. Apply composite Simpson's rule to obtain deterministic error in big O notation, with one original radial integrand evaluation per node. If the selection is restricted to direct multidimensional methods, Monte Carlo integration with root mean square error is the appropriate choice.
A convenient choice for this irregular region is Monte Carlo integration. The region is contained in . For independent uniform points in that square, let
The indicator random variable incorporates the curved boundary directly. This estimator is unbiased; the integrand is bounded on the square, so its variance is finite. The variance of a sum of independent terms gives root mean square error in big O notation. This is a stochastic error rate. Applying a rectangular Simpson's rule to the indicator-weighted integrand would lose the smoothness required for its fourth-order error bound.
Use tensor-product quadrature with composite Simpson's rule in each coordinate. If there are subintervals in each direction, then and the quadrature rule error is : apply the one-dimensional error bound for composite Simpson's rule successively, using bounded fourth partial derivatives. Hence the error is in big O notation. The rectangular domain makes the product grid convenient.

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