Search Results for ""
561 - 570 of 1848 for Shortest path problemSearch Results
If C_1, C_2, ...C_r are sets of positive integers and union _(i=1)^rC_i=Z^+, then some C_i contains arbitrarily long arithmetic progressions. The conjecture was proved by van ...
There are two types of bordism groups: bordism groups, also called cobordism groups or cobordism rings, and there are singular bordism groups. The bordism groups give a ...
The braced square problem asks, given a hinged square composed of four equal rods (indicated by the red lines above), how many more hinged rods must be added in the same ...
If r is the inradius of a circle inscribed in a right triangle with sides a and b and hypotenuse c, then r=1/2(a+b-c). (1) A Sangaku problem dated 1803 from the Gumma ...
A congruent number can be defined as an integer that is equal to the area of a rational right triangle (Koblitz 1993). Numbers (a,x,y,z,t) such that {x^2+ay^2=z^2; ...
A system for specifying points using coordinates measured in some specified way. The simplest coordinate system consists of coordinate axes oriented perpendicularly to each ...
The maximum number of pieces into which a cylinder can be divided by n oblique cuts is given by f(n) = (n+1; 3)+n+1 (1) = 1/6(n+1)(n^2-n+6) (2) = 1/6(n^3+5n+6), (3) where (a; ...
The number 2^(1/3)=RadicalBox[2, 3] (the cube root of 2) which is to be constructed in the cube duplication problem. This number is not a Euclidean number although it is an ...
A pair of prime numbers (p,q) such that p^(q-1)=1 (mod q^2) and q^(p-1)=1 (mod p^2). The only known examples are (2, 1093), (3, 1006003), (5 , 1645333507), (83, 4871), (911, ...
Erdős and Heilbronn (Erdős and Graham 1980) posed the problem of estimating from below the number of sums a+b where a in A and b in B range over given sets A,B subset= Z/pZ ...
...
View search results from all Wolfram sites (161941 matches)

