TOPICS
Search

Search Results for ""


2951 - 2960 of 9127 for Logistic Map R 2Search Results
The Yff contact circle is the circumcircle of the Yff contact triangle. Its center has triangle center function alpha=((b-c)(3a^3+b^3+c^3-2a^2b-2a^2c-abc))/a, (1) which does ...
Zarankiewicz's conjecture asserts that graph crossing number for a complete bipartite graph K_(m,n) is Z(m,n)=|_n/2_||_(n-1)/2_||_m/2_||_(m-1)/2_|, (1) where |_x_| is the ...
A chordless graph is a simple graph possessing no chords. A chordal graph (which possesses no chordless cycles) is not the same as (or converse of) a chordless graph (which ...
The radius rho of the midsphere of a polyhedron, also called the interradius. Let P be a point on the original polyhedron and P^' the corresponding point P on the dual. Then ...
A noncylindrical ruled surface always has a parameterization of the form x(u,v)=sigma(u)+vdelta(u), (1) where |delta|=1, sigma^'·delta^'=0, and sigma is called the striction ...
The multiplicative suborder of a number a (mod n) is the least exponent e>0 such that a^e=+/-1 (mod n), or zero if no such e exists. An e always exists if GCD(a,n)=1 and n>1. ...
A bicubic graph is a bipartite cubic graph. Tutte (1971) conjectured that all 3-connected bicubic graphs are Hamiltonian (the Tutte conjecture), but a number of bicubic ...
A Chen prime is a prime number p for which p+2 is either a prime or semiprime. Chen primes are named after Jing Run Chen who proved in 1966 that there are infinitely many ...
The complementary Bell numbers, also called the Uppuluri-Carpenter numbers, B^~_n=sum_(k=0)^n(-1)^kS(n,k) (1) where S(n,k) is a Stirling number of the second kind, are ...
The Connell sequence is the sequence obtained by starting with the first positive odd number (1), taking the next two even numbers (2, 4), the next three odd numbers (5, 7, ...
1 ... 293|294|295|296|297|298|299 ... 913 Previous Next

...