Search Results for ""

A number is said to be biquadratefree (or quarticfree) if its prime factorization contains no quadrupled factors. All primes and prime powers p^n with n<=3 are therefore ...

Gauss stated the reciprocity theorem for the case n=4 x^4=q (mod p) (1) can be solved using the Gaussian integers as ...

The number of binary bits necessary to represent a number, given explicitly by BL(n) = 1+|_lgn_| (1) = [lg(n+1)], (2) where [x] is the ceiling function, |_x_| is the floor ...

A bitwin chain of length one consists of two pairs of twin primes with the property that they are related by being of the form: (n-1,n+1) and (2n-1,2n+1). (1) The first few ...

A block graph, also called a clique tree, is a simple graph in which every block is a complete graph. The numbers of connected block graphs on n=1, 2, ... vertices are 1, 1, ...

The blow-up lemma essentially says that regular pairs in Szemerédi's regularity lemma behave like complete bipartite graphs from the point of view of embedding bounded degree ...

Use the definition of the q-series (a;q)_n=product_(j=0)^(n-1)(1-aq^j) (1) and define [N; M]=((q^(N-M+1);q)_M)/((q;q)_m). (2) Then P. Borwein has conjectured that (1) the ...

The Borwein integrals are the class of definite integrals defined by I_n=1/piint_0^inftyx^(-(n+1)/2)product_(k=1,3,...)^nsin(x/k)dx for odd n. The integrals are curious ...

The box fractal is a fractal also called the anticross-stitch curve which can be constructed using string rewriting beginning with a cell [1] and iterating the rules {0->[0 0 ...

A bridged graph is a graph that contains one or more graph bridges. Examples of bridged graphs include path graphs, ladder rung graphs, the bull graph, star graphs, and ...