Search Results for ""

The characteristic function f(n)={1 n is prime; 0 n otherwise (1) of primes has values 0, 1, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, ... (OEIS A010051) for n=1, 2, ...

The prime signature of a positive integer n is a sorted list of nonzero exponents a_i in the prime factorization n=p_1^(a_1)p_2^(a_2).... By definition, the prime signature ...

Almost all processes that are not obviously simple can be viewed as computations of equivalent sophistication (Wolfram 2002, pp. 5 and 716-717). More specifically, the ...

A principle that was first enunciated by Jakob Bernoulli which states that if we are ignorant of the ways an event can occur (and therefore have no reason to believe that one ...

The Prosthaphaeresis formulas, also known as Simpson's formulas, are trigonometry formulas that convert a product of functions into a sum or difference. They are given by ...

An encoding which provides a bijection between the n^(n-2) labeled trees on n nodes and strings of n-2 integers chosen from an alphabet of the numbers 1 to n. A labeled tree ...

A pseudotree is a connected pseudoforest, i.e., an undirected connected graph that contains at most one graph cycle. Connected acyclic graphs (i.e., trees), are therefore ...

Let U=(U,<··>) be a T2 associative inner product space over the field C of complex numbers with completion H, and assume that U comes with an antilinear involution xi|->xi^* ...

Qubic is a generalization of tic-tac-toe in which players alternately place pieces to get four in a row (rows, columns, pillars, face diagonals, or space diagonals) on a ...

A RAT-free ("right angle triangle-free") set is a set of points, no three of which determine a right triangle. Let f(n) be the largest integer such that a RAT-free subset of ...