Search Results for ""
161 - 170 of 391 for Amicable PairSearch Results
A method to obtain a signal C_l(z) with a flat spectrum c(theta;z) (such as a pulse), but having a smaller amplitude than the pulse. ...
A graph in which each graph edge is replaced by a directed graph edge, also called a digraph. A directed graph having no multiple edges or loops (corresponding to a binary ...
If S_1, S_2, and S_3 are three conics having the property that there is a point X, not on any of the conics, lying on a common chord of each pair of the three conics (with ...
The Droz-Farny circles are a pair of circles of equal radius obtained by particular geometric constructions. The following amazing property of a triangle, first given by ...
The appearance of nontrivial zeros (i.e., those along the critical strip with R[z]=1/2) of the Riemann zeta function zeta(z) very close together. An example is the pair of ...
The Mellin transform is the integral transform defined by phi(z) = int_0^inftyt^(z-1)f(t)dt (1) f(t) = 1/(2pii)int_(c-iinfty)^(c+iinfty)t^(-z)phi(z)dz. (2) It is implemented ...
A vertex-transitive graph, also sometimes called a node symmetric graph (Chiang and Chen 1995), is a graph such that every pair of vertices is equivalent under some element ...
A prime p is said to be a Sophie Germain prime if both p and 2p+1 are prime. The first few Sophie Germain primes are 2, 3, 5, 11, 23, 29, 41, 53, 83, 89, 113, 131, ... (OEIS ...
If two similar figures lie in the plane but do not have parallel sides (i.e., they are similar but not homothetic), there exists a center of similitude, also called a ...
Some interesting properties (as well as a few arcane ones not reiterated here) of the number 239 are discussed in Schroeppel (1972). 239 appears in Machin's formula ...
...
View search results from all Wolfram sites (4042 matches)

