TOPICS
Search

Search Results for ""


4381 - 4390 of 4468 for Point Line DistanceSearch Results
Pascal's triangle is a number triangle with numbers arranged in staggered rows such that a_(nr)=(n!)/(r!(n-r)!)=(n; r), (1) where (n; r) is a binomial coefficient. The ...
Perfect numbers are positive integers n such that n=s(n), (1) where s(n) is the restricted divisor function (i.e., the sum of proper divisors of n), or equivalently ...
A square which can be dissected into a number of smaller squares with no two equal is called a perfect square dissection (or a squared square). Square dissections in which ...
Convergents of the pi continued fractions are the simplest approximants to pi. The first few are given by 3, 22/7, 333/106, 355/113, 103993/33102, 104348/33215, ... (OEIS ...
The simple continued fraction for pi is given by [3; 7, 15, 1, 292, 1, 1, 1, 2, 1, 3, 1, 14, 2, 1, 1, 2, 2, 2, 2, ...] (OEIS A001203). A plot of the first 256 terms of the ...
The word polyhedron has slightly different meanings in geometry and algebraic geometry. In geometry, a polyhedron is simply a three-dimensional solid which consists of a ...
A polyomino is a generalization of the domino to a collection of n squares of equal size arranged with coincident sides. Polyominos were originally called "super-dominoes" by ...
A power is an exponent to which a given quantity is raised. The expression x^a is therefore known as "x to the ath power." A number of powers of x are plotted above (cf. ...
There exist a variety of formulas for either producing the nth prime as a function of n or taking on only prime values. However, all such formulas require either extremely ...
A primitive root of a prime p is an integer g such that g (mod p) has multiplicative order p-1 (Ribenboim 1996, p. 22). More generally, if GCD(g,n)=1 (g and n are relatively ...
1 ... 436|437|438|439|440|441|442 ... 447 Previous Next

...