TOPICS
Search

Search Results for ""


3601 - 3610 of 13134 for Extremal graph theorySearch Results
Gauss stated the reciprocity theorem for the case n=4 x^4=q (mod p) (1) can be solved using the Gaussian integers as ...
A divisor d of a positive integer n is biunitary if the greatest common unitary divisor of d and n/d is 1. For a prime power p^y, the biunitary divisors are the powers 1, p, ...
The third-order ordinary differential equation 2y^(''')+yy^('')=0. This equation arises in the theory of fluid boundary layers, and must be solved numerically (Rosenhead ...
A braid is an intertwining of some number of strings attached to top and bottom "bars" such that each string never "turns back up." In other words, the path of each string in ...
In 1850, Bravais demonstrated that crystals were comprised of 14 different types of unit cells: simple cubic, body-centered cubic, face-centered cubic; simple tetragonal, ...
The Brent-Salamin formula, also called the Gauss-Salamin formula or Salamin formula, is a formula that uses the arithmetic-geometric mean to compute pi. It has quadratic ...
The least number of unknotted arcs lying above the plane in any projection. The knot 05-002 has bridge number 2. Such knots are called 2-bridge knots. There is a one-to-one ...
Brown numbers are pairs (m,n) of integers satisfying the condition of Brocard's problem, i.e., such that n!+1=m^2 where n! is the factorial and m^2 is a square number. Only ...
Letting Lk be the linking number of the two components of a ribbon, Tw be the twist, and Wr be the writhe, then Lk(K)=Tw(K)+Wr(K). (Adams 1994, p. 187).
The set of all sets is its own power set. Therefore, the cardinal number of the set of all sets must be bigger than itself.
1 ... 358|359|360|361|362|363|364 ... 1314 Previous Next

...