Search Results for ""
431 - 440 of 1833 for Disk_covering_problemSearch Results
Define f(x_1,x_2,...,x_n) with x_i positive as f(x_1,x_2,...,x_n)=sum_(i=1)^nx_i+sum_(1<=i<=k<=n)product_(j=i)^k1/(x_j). (1) Then minf=3n-C+o(1) (2) as n increases, where the ...
Informally, a function f is a one-way function if 1. The description of f is publicly known and does not require any secret information for its operation. 2. Given x, it is ...
A band over a fixed topological space X is represented by a cover X= union U_alpha, U_alpha subset= X, and for each alpha, a sheaf of groups K_alpha on U_alpha along with ...
Presburger arithmetic is the first-order theory of the natural numbers containing addition but no multiplication. It is therefore not as powerful as Peano arithmetic. ...
An almost perfect number, also known as a least deficient or slightly defective (Singh 1997) number, is a positive integer n for which the divisor function satisfies ...
A theorem stating the existence of an object, such as the solution to a problem or equation. Strictly speaking, it need not tell how many such objects there are, nor give ...
Let V(G) be the vertex set of a simple graph and E(G) its edge set. Then a graph isomorphism from a simple graph G to a simple graph H is a bijection f:V(G)->V(H) such that ...
The Grassmann graph J_q(n,k) is defined such that the vertices are the k-dimensional subspaces of an n-dimensional finite field of order q and edges correspond to pairs of ...
The series for the inverse tangent, tan^(-1)x=x-1/3x^3+1/5x^5+.... Plugging in x=1 gives Gregory's formula 1/4pi=1-1/3+1/5-1/7+1/9-.... This series is intimately connected ...
The longest increasing scattered subsequence is the longest subsequence of increasing terms, where intervening nonincreasing terms may be dropped. Finding the largest ...
...
View search results from all Wolfram sites (161691 matches)

