Search Results for ""
561 - 570 of 1181 for Lotka's Law (Scientific Productivity)Search Results
Let M be a regular surface with v_(p),w_(p) points in the tangent space M_(p) of M. Then the first fundamental form is the inner product of tangent vectors, ...
Consider the forms Q for which the generic characters chi_i(Q) are equal to some preassigned array of signs e_i=1 or -1, e_1,e_2,...,e_r, subject to product_(i=1)^(r)e_i=1. ...
A free Abelian group is a group G with a subset which generates the group G with the only relation being ab=ba. That is, it has no group torsion. All such groups are a direct ...
The fundamental theorem of arithmetic states that every positive integer (except the number 1) can be represented in exactly one way apart from rearrangement as a product of ...
A Gaussian integer is a complex number a+bi where a and b are integers. The Gaussian integers are members of the imaginary quadratic field Q(sqrt(-1)) and form a ring often ...
The geometric mean of a sequence {a_i}_(i=1)^n is defined by G(a_1,...,a_n)=(product_(i=1)^na_i)^(1/n). (1) Thus, G(a_1,a_2) = sqrt(a_1a_2) (2) G(a_1,a_2,a_3) = ...
Any composite number n with p|(n/p-1) for all prime divisors p of n. n is a Giuga number iff sum_(k=1)^(n-1)k^(phi(n))=-1 (mod n) (1) where phi is the totient function and ...
A finite, increasing sequence of integers {n_1,...,n_m} such that sum_(i=1)^m1/(n_i)-product_(i=1)^m1/(n_i) in N. A sequence is a Giuga sequence iff it satisfies ...
Gram-Schmidt orthogonalization, also called the Gram-Schmidt process, is a procedure which takes a nonorthogonal set of linearly independent functions and constructs an ...
An algorithm used to recursively construct a set of objects from the smallest possible constituent parts. Given a set of k integers (a_1, a_2, ..., a_k) with a_1<a_2<...<a_k, ...
...
View search results from all Wolfram sites (9224 matches)

