Search Results for ""
5551 - 5560 of 13135 for Use of computers and internetSearch Results
Chvátal defines the term hole to mean "a chordless cycle of length at least four." The restriction "of length at least four" allows use of the term "hole" regardless of if ...
For any prime number p and any positive integer n, the p^n-rank r_(p^n)(G) of a finitely generated Abelian group G is the number of copies of the cyclic group Z_(p^n) ...
The notion of a Hilbert C^*-module is a generalization of the notion of a Hilbert space. The first use of such objects was made by Kaplansky (1953). The research on Hilbert ...
The regular tessellation {6,3} consisting of regular hexagons (i.e., a hexagonal grid). In general, the term honeycomb is used to refer to a tessellation in n dimensions for ...
Hypothesis testing is the use of statistics to determine the probability that a given hypothesis is true. The usual process of hypothesis testing consists of four steps. 1. ...
A class of illusion in which an object which is physically unrealizable is apparently depicted. More than 100 papers have been written about impossible figures (Kulpa 1987), ...
Points, also called polar reciprocals, which are transformed into each other through inversion about a given inversion circle C (or inversion sphere). The points P and P^' ...
The Jacobi symbol, written (n/m) or (n/m) is defined for positive odd m as (n/m)=(n/(p_1))^(a_1)(n/(p_2))^(a_2)...(n/(p_k))^(a_k), (1) where m=p_1^(a_1)p_2^(a_2)...p_k^(a_k) ...
A theorem, also known as Bachet's conjecture, which Bachet inferred from a lack of a necessary condition being stated by Diophantus. It states that every positive integer can ...
A root-finding algorithm which converges to a complex root from any starting position. To motivate the formula, consider an nth order polynomial and its derivatives, P_n(x) = ...
...


