Search Results for ""

Polysticks, sometimes also known as polyedges, are polyforms obtained from the edges of a regular grid. Square polysticks are polyforms obtained from the edges of a regular ...

Let A be a C^*-algebra. An element a in A is called positive if a=a* and sp(a) subset= R^+, or equivalently if there exists an element b in A such that a=bb^*. For example, ...

The prime distance pd(n) of a nonnegative integer n is the absolute difference between n and the nearest prime. It is therefore true that pd(p)=0 for primes p. The first few ...

Let a!=b, A, and B denote positive integers satisfying (a,b)=1 (A,B)=1, (i.e., both pairs are relatively prime), and suppose every prime p=B (mod A) with (p,2ab)=1 is ...

The base-4 method of counting in which only the digits 0, 1, 2, and 3 are used. The illustration above shows the numbers 0 to 63 represented in quaternary, and the following ...

A K-rational point is a point (X,Y) on an algebraic curve f(X,Y)=0, where X and Y are in a field K. For example, rational point in the field Q of ordinary rational numbers is ...

Closed forms are known for the sums of reciprocals of even-indexed Lucas numbers P_L^((e)) = sum_(n=1)^(infty)1/(L_(2n)) (1) = sum_(n=1)^(infty)1/(phi^(2n)+phi^(-2n)) (2) = ...

A set S of integers is said to be recursive if there is a total recursive function f(x) such that f(x)=1 for x in S and f(x)=0 for x not in S. Any recursive set is also ...

Let R be the class of expressions generated by 1. The rational numbers and the two real numbers pi and ln2, 2. The variable x, 3. The operations of addition, multiplication, ...

There exists a positive integer s such that every sufficiently large integer is the sum of at most s primes. It follows that there exists a positive integer s_0>=s such that ...