Search Results for ""

The computation of a derivative.

Given a real number x, find the powers of a base b that will shift the digits of x a number of places n to the left. This is equivalent to solving b^x=b^nx (1) or x=n+log_bx. ...

Let s_b(n) be the sum of the base-b digits of n, and epsilon(n)=(-1)^(s_2(n)) the Thue-Morse sequence, then product_(n=0)^infty((2n+1)/(2n+2))^(epsilon(n))=1/2sqrt(2).

An integer used to generate a digitaddition. A number can have more than one generator. If a number has no generator, it is called a self number.

The digraph intersection of two digraphs is the digraph whose vertex set (respectively, edge set) is the intersection of their vertex sets (respectively, edge sets). If n is ...

The digraph union of two digraphs is the digraph whose vertex set (respectively, edge set) is the union of their vertex sets (respectively, edge sets). Given a positive ...

The shortest path-spanning tree from a graph vertex of a graph.

Informally, a situation in which a decision must be made from several alternatives, none of which is obviously the optimal one. In formal logic, a dilemma is a specific type ...

R^n is homeomorphic to R^m iff n=m. This theorem was first proved by Brouwer.

An expansion based on the roots of x^(-n)[xJ_n^'(x)+HJ_n(x)]=0, where J_n(x) is a Bessel function of the first kind, is called a Dini expansion.