Search Results for ""

A Proth number is a number of the form N=k·2^n+1 for odd k, n a positive integer, and 2^n>k. The 2^n>k condition is needed since otherwise, every odd number >1 would be a ...

An encoding which provides a bijection between the n^(n-2) labeled trees on n nodes and strings of n-2 integers chosen from an alphabet of the numbers 1 to n. A labeled tree ...

A simple closed curve on a sphere that is not necessarily a great circle but merely intersects as a great circle would (Billera et al. 1999).

Given a subset S subset R^n and a real function f which is Gâteaux differentiable at a point x in S, f is said to be pseudoconvex at x if del f(x)·(y-x)>=0,y in ...

A pseudoforest is an undirected graph in which every connected component contains at most one graph cycle. A pseudotree is therefore a connected pseudoforest and a forest ...

A pseudograph is a non-simple graph in which both graph loops and multiple edges are permitted (Zwillinger 2003, p. 220).

The case of the Weierstrass elliptic function with invariants g_2=-1 and g_3=0. The half-periods for this case are L(1+i)/4 and L(-1+i)/4, where L is the lemniscate constant ...

The pseudosmarandache function Z(n) is the smallest integer such that sum_(k=1)^(Z(n))k=1/2Z(n)[Z(n)+1] is divisible by n. The values for n=1, 2, ... are 1, 3, 2, 7, 4, 3, 6, ...

A pseudotree is a connected pseudoforest, i.e., an undirected connected graph that contains at most one graph cycle. Connected acyclic graphs (i.e., trees), are therefore ...

For a cyclic quadrilateral, the sum of the products of the two pairs of opposite sides equals the product of the diagonals AB×CD+BC×DA=AC×BD (1) (Kimberling 1998, p. 223). ...