Search Results for ""
921 - 930 of 3822 for 0^ 0Search Results
Given a "good" graph G (i.e., one for which all intersecting graph edges intersect in a single point and arise from four distinct graph vertices), the crossing number is the ...
Roughly speaking, the metric tensor g_(ij) is a function which tells how to compute the distance between any two points in a given space. Its components can be viewed as ...
The dihedral group D_4 is one of the two non-Abelian groups of the five groups total of group order 8. It is sometimes called the octic group. An example of D_4 is the ...
The nth Beraha constant (or number) is given by B(n)=2+2cos((2pi)/n). B(5) is phi+1, where phi is the golden ratio, B(7) is the silver constant, and B(10)=phi+2. The ...
product_(k=1)^(infty)(1-x^k) = sum_(k=-infty)^(infty)(-1)^kx^(k(3k+1)/2) (1) = 1+sum_(k=1)^(infty)(-1)^k[x^(k(3k-1)/2)+x^(k(3k+1)/2)] (2) = (x)_infty (3) = ...
Consider a Boolean algebra of subsets b(A) generated by a set A, which is the set of subsets of A that can be obtained by means of a finite number of the set operations ...
In combinatorial logic minimization, a device known as a Karnaugh map is frequently used. It is similar to a truth table, but the various variables are represented along two ...
The simple continued fraction for pi is given by [3; 7, 15, 1, 292, 1, 1, 1, 2, 1, 3, 1, 14, 2, 1, 1, 2, 2, 2, 2, ...] (OEIS A001203). A plot of the first 256 terms of the ...
A Carmichael number is an odd composite number n which satisfies Fermat's little theorem a^(n-1)-1=0 (mod n) (1) for every choice of a satisfying (a,n)=1 (i.e., a and n are ...
The conjecture made by Belgian mathematician Eugène Charles Catalan in 1844 that 8 and 9 (2^3 and 3^2) are the only consecutive powers (excluding 0 and 1). In other words, ...
...
View search results from all Wolfram sites (190826 matches)

