Search Results for ""

Let g(x_1,...,x_n,y) be a function such that for any x_1, ..., x_n, there is at least one y such that g(x_1,...,x_n,y)=0. Then the mu-operator muy(g(x_1,...,x_n,y)=0) gives ...

The sequence obtained from reversing the digits of a number n and adding the result to the original number. For n=1, 2, ..., this gives 2, 4, 6, 8, 10, 12, 14, 16, 18, 11, ...

A Saunders graphic is a plot of the dth base-b digits of a function f(x,y) as a function of x and y. The plots above show Saunders graphics for the functions ...

A sequence is an ordered set of mathematical objects. Sequences of object are most commonly denoted using braces. For example, the symbol {2n}_(n=1)^infty denotes the ...

Following Yates (1980), a prime p such that 1/p is a repeating decimal with decimal period shared with no other prime is called a unique prime. For example, 3, 11, 37, and ...

In functional analysis, the Banach-Alaoglu theorem (also sometimes called Alaoglu's theorem) is a result which states that the norm unit ball of the continuous dual X^* of a ...

Let the difference of successive primes be defined by d_n=p_(n+1)-p_n, and d_n^k by d_n^k={d_n for k=1; |d_(n+1)^(k-1)-d_n^(k-1)| for k>1. (1) N. L. Gilbreath claimed that ...

There are at least two definitions of hypercomplex numbers. Clifford algebraists call their higher dimensional numbers hypercomplex, even though they do not share all the ...

The Lotka-Volterra equations describe an ecological predator-prey (or parasite-host) model which assumes that, for a set of fixed positive constants A (the growth rate of ...

An independent vertex set of a graph G is a subset of the vertices such that no two vertices in the subset represent an edge of G. Given a vertex cover of a graph, all ...