Search Results for ""

The d-analog of a complex number s is defined as [s]_d=1-(2^d)/(s^d) (1) (Flajolet et al. 1995). For integer n, [2]!=1 and [n]_d! = [3][4]...[n] (2) = ...

An algorithm which finds a polynomial recurrence for terminating hypergeometric identities of the form sum_(k)(n; ...

Gram-Schmidt orthogonalization, also called the Gram-Schmidt process, is a procedure which takes a nonorthogonal set of linearly independent functions and constructs an ...

A related rates problem is the determination of the rate at which a function defined in terms of other functions changes. Related rates problems can be solved by computing ...

A number n with prime factorization n=product_(i=1)^rp_i^(a_i) is called k-almost prime if it has a sum of exponents sum_(i=1)^(r)a_i=k, i.e., when the prime factor ...

Let T(m) denote the set of the phi(m) numbers less than and relatively prime to m, where phi(n) is the totient function. Define f_m(x)=product_(t in T(m))(x-t). (1) Then a ...

Various forms of opening and closing bracket-like delimiters are used for a number of distinct notational purposes in mathematics. The most common variants of bracket ...

The Pippenger product is an unexpected Wallis-like formula for e given by e/2=(2/1)^(1/2)(2/34/3)^(1/4)(4/56/56/78/7)^(1/8)... (1) (OEIS A084148 and A084149; Pippenger 1980). ...

The reflection circle, a term coined here for the first time, is the circumcircle of the reflection triangle. It has center at Kimberling center X_(195), which is the ...

Also called "Ethiopian multiplication." To multiply two numbers a and b, write a_0=a and b_0=b in two columns. Under a_0, write |_a_0/2_|, where |_x_| is the floor function, ...