TOPICS
Search

Search Results for ""


1461 - 1470 of 13135 for complex numberSearch Results
The number of ways N(m,n) of finding a subrectangle with an m×n rectangle can be computed by counting the number of ways in which the upper right-hand corner can be selected ...
A formula for the permanent of a matrix perm(a_(ij))=(-1)^nsum_(s subset= {1,...,n})(-1)^(|s|)product_(i=1)^nsum_(j in s)a_(ij), where the sum is over all subsets of ...
Gödel's first incompleteness theorem states that all consistent axiomatic formulations of number theory which include Peano arithmetic include undecidable propositions ...
An analytic function approaches any given value arbitrarily closely in any epsilon-neighborhood of an essential singularity.
A Mersenne prime is a Mersenne number, i.e., a number of the form M_n=2^n-1, that is prime. In order for M_n to be prime, n must itself be prime. This is true since for ...
For a real number x in (0,1), let m be the number of terms in the convergent to a regular continued fraction that are required to represent n decimal places of x. Then Lochs' ...
Schur's partition theorem lets A(n) denote the number of partitions of n into parts congruent to +/-1 (mod 6), B(n) denote the number of partitions of n into distinct parts ...
The first Göllnitz-Gordon identity states that the number of partitions of n in which the minimal difference between parts is at least 2, and at least 4 between even parts, ...
Let a number n be written in binary as n=(epsilon_kepsilon_(k-1)...epsilon_1epsilon_0)_2, (1) and define b_n=sum_(i=0)^(k-1)epsilon_iepsilon_(i+1) (2) as the number of digits ...
The prime counting function is the function pi(x) giving the number of primes less than or equal to a given number x (Shanks 1993, p. 15). For example, there are no primes ...
1 ... 144|145|146|147|148|149|150 ... 1314 Previous Next

...