TOPICS
Search

Search Results for ""


351 - 360 of 2174 for Non Elementary IntegralSearch Results
A floating-point number is a finite or infinite number that is representable in a floating-point format, i.e., a floating-point representation that is not a NaN. In the IEEE ...
Let S(x) denote the number of positive integers not exceeding x which can be expressed as a sum of two squares (i.e., those n<=x such that the sum of squares function ...
The word net has several meanings in mathematics. It refers to a plane diagram in which the polyhedron edges of a polyhedron are shown, a point set satisfying certain ...
The rhombic dodecahedral graph is the Archimedean dual graph which is the skeleton of the rhombic dodecahedron (as well as the Bilinski dodecahedron). It is the Levi graph of ...
A sequence of positive integers 1<=a_1<a_2<a_3<... (1) is a nonaveraging sequence if it contains no three terms which are in an arithmetic progression, i.e., terms such that ...
The spherical harmonics Y_l^m(theta,phi) are the angular portion of the solution to Laplace's equation in spherical coordinates where azimuthal symmetry is not present. Some ...
The integral transform obtained by defining omega=-tan(1/2delta), (1) and writing H(omega)=R(omega)+iX(omega), (2) where R(omega) and X(omega) are a Hilbert transform pair as ...
A triangle is a 3-sided polygon sometimes (but not very commonly) called the trigon. Every triangle has three sides and three angles, some of which may be the same. The sides ...
The braced square problem asks, given a hinged square composed of four equal rods (indicated by the red lines above), how many more hinged rods must be added in the same ...
A graph is planar if it can be drawn in a plane without graph edges crossing (i.e., it has graph crossing number 0). The number of planar graphs with n=1, 2, ... nodes are 1, ...
1 ... 33|34|35|36|37|38|39 ... 218 Previous Next

...