Search Results for ""
3121 - 3130 of 4277 for Graphing FunctionsSearch Results
Given a map with genus g>0, Heawood showed in 1890 that the maximum number N_u of colors necessary to color a map (the chromatic number) on an unbounded surface is N_u = ...
Maximum likelihood, also called the maximum likelihood method, is the procedure of finding the value of one or more parameters for a given statistic which makes the known ...
The three circumcircles through the triangle centroid G of a given triangle DeltaA_1A_2A_3 and the pairs of the vertices of the second Brocard triangle are called the McCay ...
A_m(lambda)=int_(-infty)^inftycos[1/2mphi(t)-lambdat]dt, (1) where the function phi(t)=4tan^(-1)(e^t)-pi (2) describes the motion along the pendulum separatrix. Chirikov ...
Roughly speaking, the metric tensor g_(ij) is a function which tells how to compute the distance between any two points in a given space. Its components can be viewed as ...
Mills (1947) proved the existence of a real constant A such that |_A^(3^n)_| (1) is prime for all integers n>=1, where |_x_| is the floor function. Mills (1947) did not, ...
A circle that in internally tangent to two sides of a triangle and to the circumcircle is called a mixtilinear incircle. There are three mixtilinear incircles, one ...
By way of analogy with the prime counting function pi(x), the notation pi_(a,b)(x) denotes the number of primes of the form ak+b less than or equal to x (Shanks 1993, pp. ...
Let A={a_1,a_2,...} be a free Abelian semigroup, where a_1 is the identity element, and let mu(n) be the Möbius function. Define mu(a_n) on the elements of the semigroup ...
The moment problem, also called "Hausdorff's moment problem" or the "little moment problem," may be stated as follows. Given a sequence of numbers {mu_n}_(n=0)^infty, under ...
...
View search results from all Wolfram sites (500312 matches)

