Search Results for ""
961 - 970 of 1380 for Euler's IdentitySearch Results
In predicate calculus, a universal formula is a prenex normal form formula (i.e., a formula written as a string of quantifiers and bound variables followed by a ...
An ascending chain of subspaces of a vector space. If V is an n-dimensional vector space, a flag of V is a filtration V_0 subset V_1 subset ... subset V_r, (1) where all ...
On July 10, 2003, Eric Weisstein computed the numbers of n×n (0,1)-matrices all of whose eigenvalues are real and positive, obtaining counts for n=1, 2, ... of 1, 3, 25, 543, ...
The White House switchboard constant is the name given by Munroe (2012) to the constant W = exp[-(1+8^(1/(e-1)))^(1/pi)] (1) = 0.202456141492... (2) (OEIS A182064), the first ...
Willans' formula is a prime-generating formula due to Willan (1964) that is defined as follows. Let F(j) = |_cos^2[pi((j-1)!+1)/j]_| (1) = {1 for j=1 or j prime; 0 otherwise ...
Conditions arising in the study of the Robbins axiom and its connection with Boolean algebra. Winkler studied Boolean conditions (such as idempotence or existence of a zero) ...
An amazing pandigital approximation to e that is correct to 18457734525360901453873570 decimal digits is given by (1+9^(-4^(7·6)))^(3^(2^(85))), (1) found by R. Sabey in 2004 ...
Let a divisor d of n be called a 1-ary (or unitary) divisor if d_|_n/d (i.e., d is relatively prime to n/d). Then d is called a k-ary divisor of n, written d|_kn, if the ...
The (complete) gamma function Gamma(n) is defined to be an extension of the factorial to complex and real number arguments. It is related to the factorial by Gamma(n)=(n-1)!, ...
An amicable pair (m,n) consists of two integers m,n for which the sum of proper divisors (the divisors excluding the number itself) of one number equals the other. Amicable ...
...
View search results from all Wolfram sites (16501 matches)

