TOPICS
Search

Search Results for ""


151 - 160 of 160 for pascalSearch Results
A matrix is a concise and useful way of uniquely representing and working with linear transformations. In particular, every linear transformation can be represented by a ...
The nine-point circle, also called Euler's circle or the Feuerbach circle, is the circle that passes through the perpendicular feet H_A, H_B, and H_C dropped from the ...
A parabola (plural "parabolas"; Gray 1997, p. 45) is the set of all points in the plane equidistant from a given line L (the conic section directrix) and a given point F not ...
A polygon can be defined (as illustrated above) as a geometric object "consisting of a number of points (called vertices) and an equal number of line segments (called sides), ...
Let N steps of equal length be taken along a line. Let p be the probability of taking a step to the right, q the probability of taking a step to the left, n_1 the number of ...
The important binomial theorem states that sum_(k=0)^n(n; k)r^k=(1+r)^n. (1) Consider sums of powers of binomial coefficients a_n^((r)) = sum_(k=0)^(n)(n; k)^r (2) = ...
The Catalan numbers on nonnegative integers n are a set of numbers that arise in tree enumeration problems of the type, "In how many ways can a regular n-gon be divided into ...
The angles mpi/n (with m,n integers) for which the trigonometric functions may be expressed in terms of finite root extraction of real numbers are limited to values of m ...
The Bernoulli numbers B_n are a sequence of signed rational numbers that can be defined by the exponential generating function x/(e^x-1)=sum_(n=0)^infty(B_nx^n)/(n!). (1) ...
The Fibonacci numbers are the sequence of numbers {F_n}_(n=1)^infty defined by the linear recurrence equation F_n=F_(n-1)+F_(n-2) (1) with F_1=F_2=1. As a result of the ...
1 ... 13|14|15|16 Previous

...