TOPICS
Search

Search Results for ""


41 - 50 of 115 for get upSearch Results
In Robert Louis Stevenson's "bottle imp paradox," you are offered the opportunity to buy, for whatever price you wish, a bottle containing a genie who will fulfill your every ...
A real-valued stochastic process {B(t):t>=0} is a Brownian motion which starts at x in R if the following properties are satisfied: 1. B(0)=x. 2. For all times ...
A bundle map is a map between bundles along with a compatible map between the base manifolds. Suppose p:X->M and q:Y->N are two bundles, then F:X->Y is a bundle map if there ...
A centered polygonal number consisting of a central dot with four dots around it, and then additional dots in the gaps between adjacent dots. The general term is n^2+(n+1)^2, ...
Let z=x+iy and f(z)=u(x,y)+iv(x,y) on some region G containing the point z_0. If f(z) satisfies the Cauchy-Riemann equations and has continuous first partial derivatives in ...
A surface of constant negative curvature obtained by twisting a pseudosphere and given by the parametric equations x = acosusinv (1) y = asinusinv (2) z = ...
The angle obtained by drawing the auxiliary circle of an ellipse with center O and focus F, and drawing a line perpendicular to the semimajor axis and intersecting it at A. ...
In a graph G, contraction of an edge e with endpoints u,v is the replacement of u and v with a single vertex such that edges incident to the new vertex are the edges other ...
The Egawa graph with parameters (p,s) is a distance-regular but not distance-transitive graph on 16^p4^s nodes. These graphs generalize the Doob graphs and give (s,4)-Hamming ...
The numbers 2^npq and 2^nr are an amicable pair if the three integers p = 2^m(2^(n-m)+1)-1 (1) q = 2^n(2^(n-m)+1)-1 (2) r = 2^(n+m)(2^(n-m)+1)^2-1 (3) are all prime numbers ...
1|2|3|4|5|6|7|8 ... 12 Previous Next

...