Search Results for ""

An almost integer is a number that is very close to an integer. Near-solutions to Fermat's last theorem provide a number of high-profile almost integers. In the season 7, ...

The term analysis is used in two ways in mathematics. It describes both the discipline of which calculus is a part and one form of abstract logic theory. Analysis is the ...

Given two intersecting lines or line segments, the amount of rotation about the point of intersection (the vertex) required to bring one into correspondence with the other is ...

An array is a "list of lists" with the length of each level of list the same. The size (sometimes called the "shape") of a d-dimensional array is then indicated as ...

Baillie and Wagstaff (1980) and Pomerance et al. (1980, Pomerance 1984) proposed a test (or rather a related set of tests) based on a combination of strong pseudoprimes and ...

The n-ball, denoted B^n, is the interior of a sphere S^(n-1), and sometimes also called the n-disk. (Although physicists often use the term "sphere" to mean the solid ball, ...

Bertelsen's number is an erroneous name erroneously given to the erroneous value of pi(10^9)=50847478, where pi(x) is the prime counting function. This value is 56 lower than ...

A Bessel function of the second kind Y_n(x) (e.g, Gradshteyn and Ryzhik 2000, p. 703, eqn. 6.649.1), sometimes also denoted N_n(x) (e.g, Gradshteyn and Ryzhik 2000, p. 657, ...

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 hypothesis that an integer n is prime iff it satisfies the condition that 2^n-2 is divisible by n. Dickson (2005, p. 91) stated that Leibniz believe to have proved that ...