Search Results for ""
851 - 860 of 895 for Symbolic ComputingSearch Results
An n-mark Golomb ruler is a set of n distinct nonnegative integers (a_1,a_2,...,a_n), called "marks," such that the positive differences |a_i-a_j|, computed over all possible ...
A graceful labeling (or graceful numbering) is a special graph labeling of a graph on m edges in which the nodes are labeled with a subset of distinct nonnegative integers ...
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 two-dimensional grid graph, also known as a rectangular grid graph or two-dimensional lattice graph (e.g., Acharya and Gill 1981), is an m×n lattice graph that is the graph ...
The hundred-dollar, hundred-digits challenge problems are a set of ten problems in numerical analysis published in the January/February 2002 issue of SIAM News ...
The term "integral" can refer to a number of different concepts in mathematics. The most common meaning is the the fundamenetal object of calculus corresponding to summing ...
The Jacobi elliptic functions are standard forms of elliptic functions. The three basic functions are denoted cn(u,k), dn(u,k), and sn(u,k), where k is known as the elliptic ...
A Keith number is an n-digit integer N>9 such that if a Fibonacci-like sequence (in which each term in the sequence is the sum of the n previous terms) is formed with the ...
Kontsevich's integral is a far-reaching generalization of the Gauss integral for the linking number, and provides a tool to construct the universal Vassiliev invariant of a ...
The partial differential equation u_t+u_(xxx)-6uu_x=0 (1) (Lamb 1980; Zwillinger 1997, p. 175), often abbreviated "KdV." This is a nondimensionalized version of the equation ...
...
View search results from all Wolfram sites (194123 matches)

