Search Results for ""
11921 - 11930 of 13135 for Use of computers and internetSearch Results
An extremely fast factorization method developed by Pollard which was used to factor the RSA-130 number. This method is the most powerful known for factoring general numbers, ...
An obtuse triangle is a triangle in which one of the angles is an obtuse angle. (Obviously, only a single angle in a triangle can be obtuse or it wouldn't be a triangle.) A ...
There are a number of attractive polyhedron compounds consisting of five octahedra. The first octahedron 5-compound is a polyhedron compound composed of five octahedra ...
An ordered factorization is a factorization (not necessarily into prime factors) in which a×b is considered distinct from b×a. The following table lists the ordered ...
Given an arrangement of points, a line containing just two of them is called an ordinary line. Dirac (1951) conjectured that every sufficiently set of n noncollinear points ...
Let DeltaH_AH_BH_C be the orthic triangle of a triangle DeltaABC. Then each side of each triangle meets the three sides of the other triangle, and the points of intersection ...
The trilinear pole of the orthotransversal of a point P is called its orthocorrespondent. The orthocorrespondent of a point P=p:q:r is given by where S_A, S_B, and S_C is ...
Orthogonal circles are orthogonal curves, i.e., they cut one another at right angles. By the Pythagorean theorem, two circles of radii r_1 and r_2 whose centers are a ...
If all the diagonals--including those obtained by "wrapping around" the edges--of a magic square sum to the same magic constant, the square is said to be a panmagic square ...
The parachute graph is the graph on 7 vertices illustrated above. It is implemented in the Wolfram Language as GraphData["ParachuteGraph"].
...
View search results from all Wolfram sites (204332 matches)

