Search Results for ""

The Somos sequences are a set of related symmetrical recurrence relations which, surprisingly, always give integers. The Somos sequence of order k, or Somos-k sequence, is ...

The first practical algorithm for determining if there exist integers a_i for given real numbers x_i such that a_1x_1+a_2x_2+...+a_nx_n=0, or else establish bounds within ...

An algorithm used to recursively construct a set of objects from the smallest possible constituent parts. Given a set of k integers (a_1, a_2, ..., a_k) with a_1<a_2<...<a_k, ...

Given two randomly chosen n×n integer matrices, what is the probability D(n) that the corresponding determinants are relatively prime? Hafner et al. (1993) showed that ...

Hoggatt and Denman (1961) showed that any obtuse triangle can be divided into eight acute isosceles triangles. There are 1, 4, 23, 180, 1806, 20198, ... (OEIS A056814) ...

A finite group is a group having finite group order. Examples of finite groups are the modulo multiplication groups, point groups, cyclic groups, dihedral groups, symmetric ...

Augmentation is the dual operation of truncation which replaces the faces of a polyhedron with pyramids of height h (where h may be positive, zero, or negative) having the ...

The most general form of "an" exponential function is a power-law function of the form f(x)=ab^(cx+d), (1) where a, c, and d are real numbers, b is a positive real number, ...

Let ||f|| be the supremum of |f(x)|, a real-valued function f defined on (0,infty). If f is twice differentiable and both f and f^('') are bounded, Landau (1913) showed that ...

The continuous Fourier transform is defined as f(nu) = F_t[f(t)](nu) (1) = int_(-infty)^inftyf(t)e^(-2piinut)dt. (2) Now consider generalization to the case of a discrete ...