TOPICS
Search

Search Results for ""


2411 - 2420 of 13134 for Extremal graph theorySearch Results
An integer n which is tested to see if it divides a given number.
The Reidemeister move of type I.
In the American system, 10^(36).
In the American system, 10^(63).
The p-layer of H, L_(p^')(H) is the unique minimal normal subgroup of H which maps onto E(H/O_(p^')(H)).
X is a p^'-group if p does not divide the group order of X.
The number 163 is very important in number theory, since d=163 is the largest number such that the imaginary quadratic field Q(sqrt(-d)) has class number h(-d)=1. It also ...
An abnormal number is a hypothetical number which can be factored into primes in more than one way. Hardy and Wright (1979) prove the fundamental theorem of arithmetic by ...
A subset B of a vector space E is said to be absorbing if for any x in E, there exists a scalar lambda>0 such that x in muB for all mu in F with |mu|>=lambda, where F is the ...
An addition chain for a number n is a sequence 1=a_0<a_1<...<a_r=n, such that each member after a_0 is the sum of two earlier (not necessarily distinct) ones. The number r is ...
1 ... 239|240|241|242|243|244|245 ... 1314 Previous Next

...