TOPICS
Search

Search Results for ""


1891 - 1900 of 5881 for math 0Search Results
A finite group is a group having finite group order. Examples of finite groups are the modulo multiplication groups, point groups, cyclic groups, dihedral groups, symmetric ...
Consider the process of taking a number, adding its digits, then adding the digits of the number derived from it, etc., until the remaining number has only one digit. The ...
For a finite group G, let p(G) be the subgroup generated by all the Sylow p-subgroups of G. If X is a projective curve in characteristic p>0, and if x_0, ..., x_t are points ...
Also known as araneidan, this curve owes its name to its spider-like shape. It is given by the polar equation r=a(sin(ntheta))/(sin[(n-1)theta]), where a>0 and n>2 is an ...
A number n is called a barrier of a number-theoretic function f(m) if, for all m<n, m+f(m)<=n. Neither the totient function phi(n) nor the divisor function sigma(n) has a ...
The partial differential equation u_t+u_x+uu_x-u_(xxt)=0 (Benjamin et al. 1972; Arvin and Goldstein 1985; Zwillinger 1997, p. 130). A generalized version is given by u_t-del ...
A financial measure of a fund's sensitivity to market movements which measures the relationship between a fund's excess return over Treasury Bills and the excess return of a ...
Let the nth composition of a function f(x) be denoted f^((n))(x), such that f^((0))(x)=x and f^((1))(x)=f(x). Denote the composition of f and g by f degreesg(x)=f(g(x)), and ...
Let {A_n}_(n=0)^infty be a sequence of events occurring with a certain probability distribution, and let A be the event consisting of the occurrence of a finite number of ...
For every p, the kernel of partial_p:C_p->C_(p-1) is called the group of cycles, Z_p={c in C_p:partial(c)=0}. (1) The letter Z is short for the German word for cycle, ...
1 ... 187|188|189|190|191|192|193 ... 589 Previous Next

...