Search Results for ""

Let G be a finite, connected, undirected graph with graph diameter d(G) and graph distance d(u,v) between vertices u and v. A radio labeling of a graph G is labeling using ...

Ramanujan developed a number of interesting closed-form expressions for generalized continued fractions. These include the almost integers ...

Consider the Fibonacci-like recurrence a_n=+/-a_(n-1)+/-a_(n-2), (1) where a_0=0, a_1=1, and each sign is chosen independently and at random with probability 1/2. ...

The rational distance problem asks to find a geometric configuration satisfying given properties such that all distances along specific edges are rational numbers. (This is ...

If there exists a rational integer x such that, when n, p, and q are positive integers, x^n=q (mod p), then q is the n-adic residue of p, i.e., q is an n-adic residue of p ...

A recursive sequence {f(n)}_n, also known as a recurrence sequence, is a sequence of numbers f(n) indexed by an integer n and generated by solving a recurrence equation. The ...

A d-repdigit is a number composed of repetition of a single digit (in a given base, generally taken as base 10 unless otherwise specified). For example, the beast number 666 ...

Two nonisomorphic graphs that have equal resistance spectra (i.e., multisets of resistance distances) are said to be resistance-equivalent. All nonisomorphic simple graphs on ...

Consider a network of n resistors R_i so that R_2 may be connected in series or parallel with R_1, R_3 may be connected in series or parallel with the network consisting of ...

Consider the sequence defined by w_1=01 and w_(n+1)=w_nw_nw_n^R, where l^R denotes the reverse of a sequence l. The first few terms are then 01, 010110, 010110010110011010, ...