Search Results for ""

The greatest common divisor, sometimes also called the highest common divisor (Hardy and Wright 1979, p. 20), of two positive integers a and b is the largest divisor common ...

A cycle of a graph G, also called a circuit if the first vertex is not specified, is a subset of the edge set of G that forms a path such that the first node of the path ...

The Champernowne constant has decimal expansion C=0.1234567891011... (OEIS A033307). The Earls sequence (starting position of n copies of the digit n) for e is given for n=1, ...

Define the abundancy Sigma(n) of a positive integer n as Sigma(n)=(sigma(n))/n, (1) where sigma(n) is the divisor function. Then a pair of distinct numbers (k,m) is a ...

The gnomon was an L-shaped movable sundial used for astronomical studies. It operated by resting on one leg so that the other pointed vertically upward. By measuring the ...

p^x is an infinitary divisor of p^y (with y>0) if p^x|_(y-1)p^y, where d|_kn denotes a k-ary Divisor (Guy 1994, p. 54). Infinitary divisors therefore generalize the concept ...

Ruffini's rule a shortcut method for dividing a polynomial by a linear factor of the form x-a which can be used in place of the standard long division algorithm. This method ...

Given a function f(x)=f_0(x), write f_1=f^'(x) and define the Sturm functions by f_n(x)=-{f_(n-2)(x)-f_(n-1)(x)[(f_(n-2)(x))/(f_(n-1)(x))]}, (1) where [P(x)/Q(x)] is a ...

Chess is a two-player board game believed to have been played in India as early as the sixth century AD. In different parts of this world, different chess games are played. ...

In this work, the name Pythagoras's constant will be given to the square root of 2, sqrt(2)=1.4142135623... (1) (OEIS A002193), which the Pythagoreans proved to be ...