Search Results for ""

omega^epsilon=epsilon, where omega is an ordinal number and epsilon is an inaccessible cardinal.

The cardinal number of any set is lower than the cardinal number of the set of all its subsets. A corollary is that there is no highest aleph (aleph).

A function f is Carathéodory differentiable at a if there exists a function phi which is continuous at a such that f(x)-f(a)=phi(x)(x-a). Every function which is Carathéodory ...

If Omega_1 and Omega_2 are bounded domains, partialOmega_1, partialOmega_2 are Jordan curves, and phi:Omega_1->Omega_2 is a conformal mapping, then phi (respectively, ...

The symbol ^ which is used to denote partial conjunction in symbolic logic. It also appears in several other contexts in mathematics and is sometimes called a "wedge". In ...

Let A be a unital Banach algebra. If a in A and ||1-a||<1, then a^(-1) can be represented by the series sum_(n=0)^(infty)(1-a)^n. This criterion for checking invertibility of ...

The system of partial differential equations u_t+u_x = v^2-u^2 (1) v_t-v_x = u^2-v^2. (2)

A number n satisfies the Carmichael condition iff (p-1)|(n/p-1) for all prime divisors p of n. This is equivalent to the condition (p-1)|(n-1) for all prime divisors p of n.

A finite, increasing sequence of integers {a_1,...,a_m} such that (a_i-1)|(a_1...a_(m-1)) for i=1, ..., m, where m|n indicates that m divides n. A Carmichael sequence has ...

If a and n are relatively prime so that the greatest common divisor GCD(a,n)=1, then a^(lambda(n))=1 (mod n), where lambda is the Carmichael function.