TOPICS
Search

Search Results for ""


6551 - 6560 of 13135 for Inline 8Search Results
The prime HP(n) reached starting from a number n, concatenating its prime factors, and repeating until a prime is reached. For example, for n=9, 9=3·3->33=3·11->311, so 311 ...
Any partition of the plane into regions of equal area has perimeter at least that of the regular hexagonal grid (i.e., the honeycomb, illustrated above). Pappus refers to the ...
The first example discovered of a map from a higher-dimensional sphere to a lower-dimensional sphere which is not null-homotopic. Its discovery was a shock to the ...
The 34 distinct convergent hypergeometric series of order two enumerated by Horn (1931) and corrected by Borngässer (1933). There are 14 complete series for which ...
The hyperbolic cosecant is defined as cschz=1/(sinhz)=2/(e^z-e^(-z)). (1) It is implemented in the Wolfram Language as Csch[z]. It is related to the hyperbolic cotangent ...
The hyperbolic cotangent is defined as cothz=(e^z+e^(-z))/(e^z-e^(-z))=(e^(2z)+1)/(e^(2z)-1). (1) The notation cthz is sometimes also used (Gradshteyn and Ryzhik 2000, p. ...
The hyperbolic octahedron is a hyperbolic version of the Euclidean octahedron, which is a special case of the astroidal ellipsoid with a=b=c=1. It is given by the parametric ...
The hyperbolic secant is defined as sechz = 1/(coshz) (1) = 2/(e^z+e^(-z)), (2) where coshz is the hyperbolic cosine. It is implemented in the Wolfram Language as Sech[z]. On ...
There are at least two definitions of hypercomplex numbers. Clifford algebraists call their higher dimensional numbers hypercomplex, even though they do not share all the ...
An imperfect graph G is a graph that is not perfect. Therefore, graphs G with omega(G)<chi(G) (1) where omega(G) is the clique number and chi(G) is the chromatic number are ...
1 ... 653|654|655|656|657|658|659 ... 1314 Previous Next

...