Search Results for ""

A number is said to be squarefree (or sometimes quadratfrei; Shanks 1993) if its prime decomposition contains no repeated factors. All primes are therefore trivially ...

Let A and B be any sets, and let |X| be the cardinal number of a set X. Then cardinal exponentiation is defined by |A|^(|B|)=|set of all functions from B into A| (Ciesielski ...

Division by zero is the operation of taking the quotient of any number x and 0, i.e., x/0. The uniqueness of division breaks down when dividing by zero, since the product ...

An ordinal number alpha>0 is called a limit ordinal iff it has no immediate predecessor, i.e., if there is no ordinal number beta such that beta+1=alpha (Ciesielski 1997, p. ...

Let T(x,y,z) be the number of times "otherwise" is called in the TAK function, then the Takeuchi numbers are defined by T_n(n,0,n+1). A recursive formula for T_n is given by ...

The base-2 transcendental number 0.11011011111011011111..._2 (1) (OEIS A014578), where the nth bit is 1 if n is not divisible by 3 and is the complement of the (n/3)th bit if ...

The complex plane is the plane of complex numbers spanned by the vectors 1 and i, where i is the imaginary number. Every complex number corresponds to a unique point in the ...

The sequence of numbers {j_n} giving the number of digits in the three-fold power tower n^(n^n). The values of n^(n^n) for n=1, 2, ... are 1, 16, 7625597484987, ... (OEIS ...

A Smarandache prime is a prime Smarandache number, i.e., a prime number of the form 1234...n. Surprisingly, no Smarandache primes are known as of Nov. 2015. Upper limits on ...

The party problem, also known as the maximum clique problem, asks to find the minimum number of guests that must be invited so that at least m will know each other or at ...