Search Results for ""

A problem posed by L. Collatz in 1937, also called the 3x+1 mapping, 3n+1 problem, Hasse's algorithm, Kakutani's problem, Syracuse algorithm, Syracuse problem, Thwaites ...

The ideal generated by a set in a vector space.

Given a property P, if P(x)∼x as x->infty (so, using asymptotic notation, the number of numbers less than x not satisfying the property P is o(x), where o(x) is one of the ...

A ruled surface M is said to be a binormal developable of a curve y if M can be parameterized by x(u,v)=y(u)+vB^^(u), where B is the binormal vector.

A metric space X is boundedly compact if all closed bounded subsets of X are compact. Every boundedly compact metric space is complete. (This is a generalization of the ...

A clear-cut way of describing every object in a class in a one-to-one manner.

Attractive compounds can be constructed from the cube 3-compounds and their octahedron 3-compound duals. One is illustrated above. This compound will be implemented in a ...

The term in logic used to describe the operation commonly known as OR. A literal is considered a (degenerate) disjunction (Mendelson 1997, p. 30). The Wolfram Language ...

A group action phi:G×X->X is called faithful if there are no group elements g (except the identity element) such that gx=x for all x in X. Equivalently, the map phi induces ...

If A is a unital Banach algebra where every nonzero element is invertible, then A is the algebra of complex numbers.