Search Results for ""
4681 - 4690 of 13134 for Order TheorySearch Results
Campbell (2022) used the WZ method to obtain the sum (pi^2)/4=sum_(n=1)^infty(16^n(n+1)(3n+1))/(n(2n+1)^2(2n; n)^3), (1) where (n; k) is a binomial coefficient. There is a ...
Given an open subset U in n-dimensional space and two compact subsets C_0 and C_1 of U, where C_1 is derived from C_0 by a continuous motion, is it possible to move C_0 to ...
Plancherel's theorem states that the integral of the squared modulus of a function is equal to the integral of the squared modulus of its spectrum. It corresponds to ...
Pogson's ratio is the constant 100^(1/5)=10^(2/5)=2.511886431... (OEIS A189824) appearing in the definition of the astronomical magnitude (brightness) scale. This scale is ...
A Poisson process is a process satisfying the following properties: 1. The numbers of changes in nonoverlapping intervals are independent for all intervals. 2. The ...
A polar representation of a complex measure mu is analogous to the polar representation of a complex number as z=re^(itheta), where r=|z|, dmu=e^(itheta)d|mu|. (1) The analog ...
A prime factorization algorithm which can be implemented in a single-step or double-step form. In the single-step version, a prime factor p of a number n can be found if p-1 ...
There appears to be no standard term for a simple connected graph with exactly n edges, though the words "polynema" (Kyrmse) and "polyedge" (Muñiz 2011) have been proposed. ...
The positive integers are the numbers 1, 2, 3, ... (OEIS A000027), sometimes called the counting numbers or natural numbers, denoted Z^+. They are the solution to the simple ...
Consider the sequence {x_n}_(n=0)^infty defined by x_0=1 and x_(n+1)=[3/2x_n], where [z] is the ceiling function. For n=0, 1, ..., the first few terms are 1, 2, 3, 5, 8, 12, ...
...
View search results from all Wolfram sites (44093 matches)

