Search Results for ""
2541 - 2550 of 2617 for Prime Generating PolynomialSearch Results
An abundant number, sometimes also called an excessive number, is a positive integer n for which s(n)=sigma(n)-n>n, (1) where sigma(n) is the divisor function and s(n) is the ...
An algorithm is a specific set of instructions for carrying out a procedure or solving a problem, usually with the requirement that the procedure terminate at some point. ...
Angle trisection is the division of an arbitrary angle into three equal angles. It was one of the three geometric problems of antiquity for which solutions using only compass ...
Apéry's constant is defined by zeta(3)=1.2020569..., (1) (OEIS A002117) where zeta(z) is the Riemann zeta function. B. Haible and T. Papanikolaou computed zeta(3) to 1000000 ...
The average distance between two points chosen at random inside a unit cube (the n=3 case of hypercube line picking), sometimes known as the Robbins constant, is Delta(3) = ...
A double sum is a series having terms depending on two indices, sum_(i,j)b_(ij). (1) A finite double series can be written as a product of series ...
The E graph is the tree on 6 vertices illustrated above. It is isomorphic to the (3,2)-firecracker graph and 3-centipede graph. It is implemented in the Wolfram Language as ...
A fixed point is a point that does not change upon application of a map, system of differential equations, etc. In particular, a fixed point of a function f(x) is a point x_0 ...
The floor function |_x_|, also called the greatest integer function or integer value (Spanier and Oldham 1987), gives the largest integer less than or equal to x. The name ...
There are a number of algebraic equations known as the icosahedral equation, all of which derive from the projective geometry of the icosahedron. Consider an icosahedron ...
...
View search results from all Wolfram sites (24574 matches)

