TOPICS
Search

Search Results for ""


2561 - 2570 of 13134 for Extremal graph theorySearch Results
A totative is a positive integer less than or equal to a number n which is also relatively prime to n, where 1 is counted as being relatively prime to all numbers. The number ...
Let a knot K be n-embeddable. Then its tunnel number is a knot invariant which is related to n.
An R-module M is said to be unital if R is a commutative ring with multiplicative identity 1=1_R and if 1m=m for all elements m in M.
An aliquot sequence computed using the analog of the restricted divisor function s^*(n) in which only unitary divisors are included.
An infinite sequence {a_i} of positive integers is called weakly independent if any relation sumepsilon_ia_i with epsilon_i=0 or +/-1 and epsilon_i=0, except finitely often, ...
The operator e^(nut^2/2) which satisfies e^(nut^2/2)p(x)=1/(sqrt(2pinu))int_(-infty)^inftye^(-u^2/(2nu))p(x+u)du for nu>0.
The satellite knot of an unknot twisted inside a torus.
A zero-sum game is a game in which players make payments only to each other. In such a game, one player's loss is the other player's gain, so the total amount of "money" ...
d is called an e-divisor (or exponential divisor) of a number n with prime factorization n=p_1^(a_1)p_2^(a_2)...p_r^(a_r) if d|n and d=p_1^(b_1)p_2^(b_2)...p_r^(b_r), where ...
A number n is called a k e-perfect number if sigma_e(n)=kn, where sigma_e(n) is the sum of the e-divisors of n.
1 ... 254|255|256|257|258|259|260 ... 1314 Previous Next

...