TOPICS
Search

Search Results for ""


2241 - 2250 of 3772 for Circle Line IntersectionSearch Results
The inverse hyperbolic secant sech^(-1)z (Beyer 1987, p. 181; Zwillinger 1995, p. 481), sometimes called the area hyperbolic secant (Harris and Stocker 1998, p. 271) and ...
The inverse hyperbolic sine sinh^(-1)z (Beyer 1987, p. 181; Zwillinger 1995, p. 481), sometimes called the area hyperbolic sine (Harris and Stocker 1998, p. 264) is the ...
The inverse hyperbolic tangent tanh^(-1)z (Zwillinger 1995, p. 481; Beyer 1987, p. 181), sometimes called the area hyperbolic tangent (Harris and Stocker 1998, p. 267), is ...
The (m,n)-lollipop graph is the graph obtained by joining a complete graph K_m to a path graph P_n with a bridge. Precomputed properties of lollipop graphs are available in ...
The longhorn graph is the graph on 7 vertices illustrated above. It is implemented in the Wolfram Language as GraphData["LonghornGraph"].
An NSW number (named after Newman, Shanks, and Williams) is an integer m that solves the Diophantine equation 2n^2=m^2+1. (1) In other words, the NSW numbers m index the ...
There are several related theorems involving Hamiltonian cycles of graphs that are associated with Pósa. Let G be a simple graph with n graph vertices. 1. If, for every k in ...
Hardy and Littlewood (1914) proved that the sequence {frac(x^n)}, where frac(x) is the fractional part, is equidistributed for almost all real numbers x>1 (i.e., the ...
The Riemann-Siegel formula is a formula discovered (but not published) by Riemann for computing an asymptotic formula for the Riemann-Siegel function theta(t). The formula ...
Ruffini's rule a shortcut method for dividing a polynomial by a linear factor of the form x-a which can be used in place of the standard long division algorithm. This method ...
1 ... 222|223|224|225|226|227|228 ... 378 Previous Next

...