Search Results for ""

Elliptic curve primality proving, abbreviated ECPP, is class of algorithms that provide certificates of primality using sophisticated results from the theory of elliptic ...

If P is a pedal point inside a triangle DeltaABC, and P_A, P_B, and P_C are the feet of the perpendiculars from P upon the respective sides BC, CA, and AB, then ...

The Galton board, also known as a quincunx or bean machine, is a device for statistical experiments named after English scientist Sir Francis Galton. It consists of an ...

The Gaussian integral, also called the probability integral and closely related to the erf function, is the integral of the one-dimensional Gaussian function over ...

For an integer n>=2, let gpf(x) denote the greatest prime factor of n, i.e., the number p_k in the factorization n=p_1^(a_1)...p_k^(a_k), with p_i<p_j for i<j. For n=2, 3, ...

A sequence {a_n}_(n=1)^N forms a (binary) heap if it satisfies a_(|_j/2_|)<=a_j for 2<=j<=N, where |_x_| is the floor function, which is equivalent to a_i<a_(2i) and ...

The recursive sequence generated by the recurrence equation Q(n)=Q(n-Q(n-1))+Q(n-Q(n-2)), with Q(1)=Q(2)=1. The first few values are 1, 1, 2, 3, 3, 4, 5, 5, 6, 6, ... (OEIS ...

By way of analogy with the usual tangent tanz=(sinz)/(cosz), (1) the hyperbolic tangent is defined as tanhz = (sinhz)/(coshz) (2) = (e^z-e^(-z))/(e^z+e^(-z)) (3) = ...

Let there be n ways for a "good" selection and m ways for a "bad" selection out of a total of n+m possibilities. Take N samples and let x_i equal 1 if selection i is ...

Infinity, most often denoted as infty, is an unbounded quantity that is greater than every real number. The symbol infty had been used as an alternative to M (1000) in Roman ...