Search Results for ""
1931 - 1940 of 1944 for Hundred Dollar Hundred Digit Challenge P...Search Results
The divisor function sigma_k(n) for n an integer is defined as the sum of the kth powers of the (positive integer) divisors of n, sigma_k(n)=sum_(d|n)d^k. (1) It is ...
A Hamiltonian cycle, also called a Hamiltonian circuit, Hamilton cycle, or Hamilton circuit, is a graph cycle (i.e., closed loop) through a graph that visits each node ...
A generalized hypergeometric function _pF_q(a_1,...,a_p;b_1,...,b_q;x) is a function which can be defined in the form of a hypergeometric series, i.e., a series for which the ...
The prime counting function is the function pi(x) giving the number of primes less than or equal to a given number x (Shanks 1993, p. 15). For example, there are no primes ...
The regular tetrahedron, often simply called "the" tetrahedron, is the Platonic solid with four polyhedron vertices, six polyhedron edges, and four equivalent equilateral ...
Zeros of the Riemann zeta function zeta(s) come in two different types. So-called "trivial zeros" occur at all negative even integers s=-2, -4, -6, ..., and "nontrivial ...
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 ...
A unit-distance graph is a distance graph having an embedding in the Euclidean plane (unit-distance embedding) in which vertices are distinct points and all edges are of ...
The Jacobi theta functions are the elliptic analogs of the exponential function, and may be used to express the Jacobi elliptic functions. The theta functions are ...
In mathematics, a knot is defined as a closed, non-self-intersecting curve that is embedded in three dimensions and cannot be untangled to produce a simple loop (i.e., the ...
...
View search results from all Wolfram sites (27602 matches)

