Search Results for ""

A connected graph is graph that is connected in the sense of a topological space, i.e., there is a path from any point to any other point in the graph. A graph that is not ...

An algorithm for computing an Egyptian fraction, called the Farey sequence method by Bleicher (1972).

While the above figure appears to be a sequence of nested squares, it actually consists of a single square spiral.

The largest cube dividing a positive integer n. For n=1, 2, ..., the first few are 1, 1, 1, 1, 1, 1, 1, 8, 1, 1, ... (OEIS A008834).

A natural number n>3 such that n|(a^(n-2)-a) whenever (a,n)=1 (a and n are relatively prime) and a<=n. (Here, n|m means that n divides m.) There are an infinite number of ...

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).

If, in an interval of x, sum_(r=1)^(n)a_r(x) is uniformly bounded with respect to n and x, and {v_r} is a sequence of positive non-increasing quantities tending to zero, then ...

The Dirichlet kernel D_n^M is obtained by integrating the number theoretic character e^(i<xi,x>) over the ball |xi|<=M, D_n^M=-1/(2pir)d/(dr)D_(n-2)^M.

An even number N for which N=0 (mod 4). The first few positive doubly even numbers are 4, 8, 12, 16, ... (OEIS A008586).

A dragon curve is a recursive nonintersecting curve whose name derives from its resemblance to a certain mythical creature. The curve can be constructed by representing a ...