Search Results for ""
491 - 500 of 2910 for Integer complexitySearch Results
The arithmetic-geometric mean agm(a,b) of two numbers a and b (often also written AGM(a,b) or M(a,b)) is defined by starting with a_0=a and b_0=b, then iterating a_(n+1) = ...
The number obtained by adding the reciprocals of the odd twin primes, B=(1/3+1/5)+(1/5+1/7)+(1/(11)+1/(13))+(1/(17)+1/(19))+.... (1) By Brun's theorem, the series converges ...
Checkers is a two-player game with the most common variant played on an 8×8 checkerboard with each player starts with twelve pieces of a fixed color on opposite sites of the ...
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 ...
Let K be a number field with r_1 real embeddings and 2r_2 imaginary embeddings and let r=r_1+r_2-1. Then the multiplicative group of units U_K of K has the form ...
A Hamiltonian path, also called a Hamilton path, is a graph path between two vertices of a graph that visits each vertex exactly once. If a Hamiltonian path exists whose ...
The number of equivalent hyperspheres in n dimensions which can touch an equivalent hypersphere without any intersections, also sometimes called the Newton number, contact ...
The lemniscate, also called the lemniscate of Bernoulli, is a polar curve defined as the locus of points such that the the product of distances from two fixed points (-a,0) ...
Closed forms are known for the sums of reciprocals of even-indexed Fibonacci numbers P_F^((e)) = sum_(n=1)^(infty)1/(F_(2n)) (1) = ...
There are many unsolved problems in mathematics. Some prominent outstanding unsolved problems (as well as some which are not necessarily so well known) include 1. The ...
...
View search results from all Wolfram sites (340627 matches)

