Search Results for ""
681 - 690 of 1524 for Jeep problemSearch Results
A surface of revolution obtained by rotating a closed plane curve about an axis parallel to the plane which does not intersect the curve. The simplest toroid is the torus. ...
Given n mutually exclusive events A_1, ..., A_n whose probabilities sum to unity, then P(B)=P(B|A_1)P(A_1)+...+P(B|A_n)P(A_n), where B is an arbitrary event, and P(B|A_i) is ...
To inscribe an equilateral triangle in an ellipse, place the top polygon vertex at (0,b), then solve to find the (x,y) coordinate of the other two vertices. ...
A unimodal sequence is a finite sequence that first increases and then decreases. A sequence {s_1,s_2,...,s_n} is unimodal if there exists a t such that s_1<=s_2<=...<=s_t ...
A square with side lengths 1. The unit square usually means the one with coordinates (0, 0), (1, 0), (1, 1), (0, 1) in the real plane, or 0, 1, 1+i, and i in the complex ...
The quantity which a function f takes upon application to a given quantity.
The system of partial differential equations (partial_t+partial_z^3+partial_(z^_)^3)v+partial_z(uv)+partial_(z^_)(vw) (1) partial_(z^_)u=3partial_zv (2) ...
Let H=l^2, (alpha_n) be a bounded sequence of complex numbers, and (xi_n) be the (usual) standard orthonormal basis of H, that is, (xi_n)(m)=delta_(nm), n,m in N, where ...
A set of three conjectures proposed by Weil in 1942 for extending Riemann hypothesis-like statements to classes of mathematical structures. The conjectures were proved by ...
A k-partite graph is a graph whose graph vertices can be partitioned into k disjoint sets so that no two vertices within the same set are adjacent.
...
View search results from all Wolfram sites (160108 matches)

