Search Results for ""

A circle packing is an arrangement of circles inside a given boundary such that no two overlap and some (or all) of them are mutually tangent. The generalization to spheres ...

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 ...

Algebraic topology is the study of intrinsic qualitative aspects of spatial objects (e.g., surfaces, spheres, tori, circles, knots, links, configuration spaces, etc.) that ...

When the index nu is real, the functions J_nu(z), J_nu^'(z), Y_nu(z), and Y_nu^'(z) each have an infinite number of real zeros, all of which are simple with the possible ...

The café wall illusion, sometimes also called the Münsterberg illusion (Ashton Raggatt McDougall 2006), is an optical illusion produced by a black and white rectangular ...

A camel graph is a graph formed by all possible moves of a hypothetical chess piece called a "camel" which moves analogously to a knight except that it is restricted to moves ...

The confocal ellipsoidal coordinates, called simply "ellipsoidal coordinates" by Morse and Feshbach (1953) and "elliptic coordinates" by Hilbert and Cohn-Vossen (1999, p. ...

A Cunningham number is a binomial number of the form C^+/-(b,n)=b^n+/-1 with b>1 and n positive integers. Bases b^k which are themselves powers need not be considered since ...

Discrete mathematics is the branch of mathematics dealing with objects that can assume only distinct, separated values. The term "discrete mathematics" is therefore used in ...

Erfc is the complementary error function, commonly denoted erfc(z), is an entire function defined by erfc(z) = 1-erf(z) (1) = 2/(sqrt(pi))int_z^inftye^(-t^2)dt. (2) It is ...