Search Results for ""

The set R union {infty}, obtained by adjoining one improper element to the set R of real numbers, is the set of projectively extended real numbers. Although notation is not ...

An extended rooted binary tree satisfying the following conditions: 1. Every node has two children, each colored either red or black. 2. Every tree leaf node is colored ...

An algorithm for making tables of primes. Sequentially write down the integers from 2 to the highest number n you wish to include in the table. Cross out all numbers >2 which ...

A method for finding recurrence relations for hypergeometric polynomials directly from the series expansions of the polynomials. The method is effective and easily ...

An integer is k-smooth if it has no prime factors >k. The following table gives the first few k-smooth numbers for small k. Berndt (1994, p. 52) called the 7-smooth numbers ...

In database structures, two quantities are generally of interest: the average number of comparisons required to 1. Find an existing random record, and 2. Insert a new random ...

A vector bundle is special class of fiber bundle in which the fiber is a vector space V. Technically, a little more is required; namely, if f:E->B is a bundle with fiber R^n, ...

An e-prime is a prime number appearing in the decimal expansion of e. The first few are 2, 271, 2718281, ...

Given a Taylor series f(z)=sum_(n=0)^inftyC_nz^n=sum_(n=0)^inftyC_nr^ne^(intheta), (1) where the complex number z has been written in the polar form z=re^(itheta), examine ...

Let {u_n(x)} be a sequence of functions. If 1. u_n(x) can be written u_n(x)=a_nf_n(x), 2. suma_n is convergent, 3. f_n(x) is a monotonic decreasing sequence (i.e., ...