TOPICS
Search

Search Results for ""


9791 - 9800 of 13131 for booleanalgebra.htmlSearch Results
Closed forms are known for the sums of reciprocals of even-indexed Fibonacci numbers P_F^((e)) = sum_(n=1)^(infty)1/(F_(2n)) (1) = ...
Closed forms are known for the sums of reciprocals of even-indexed Lucas numbers P_L^((e)) = sum_(n=1)^(infty)1/(L_(2n)) (1) = sum_(n=1)^(infty)1/(phi^(2n)+phi^(-2n)) (2) = ...
The sum of reciprocal multifactorials can be given in closed form by the beautiful formula m(n) = sum_(n=0)^(infty)1/(n!...!_()_(k)) (1) = ...
Given a polynomial in a single complex variable with complex coefficients p(z)=a_nz^n+a_(n-1)z^(n-1)+...+a_0, the reciprocal polynomial is defined by ...
Reciprocation is an incidence-preserving transformation in which points are transformed into their polars. A projective geometry-like duality principle holds for ...
If there exists a rational integer x such that, when n, p, and q are positive integers, x^n=q (mod p), then q is the n-adic residue of p, i.e., q is an n-adic residue of p ...
A closed planar quadrilateral with opposite sides of equal lengths a and b, and with four right angles. A square is a degenerate rectangle with a=b. The area of the rectangle ...
The rectangle function Pi(x) is a function that is 0 outside the interval [-1/2,1/2] and unity inside it. It is also called the gate function, pulse function, or window ...
Given a rectangle BCDE, draw EF=DE on an extension of BE. Bisect BF and call the midpoint G. Now draw a semicircle centered at G, and construct the extension of ED which ...
The number of ways N(m,n) of finding a subrectangle with an m×n rectangle can be computed by counting the number of ways in which the upper right-hand corner can be selected ...
1 ... 977|978|979|980|981|982|983 ... 1314 Previous Next

...