Search Results for ""
2911 - 2920 of 13134 for complexity theorySearch Results
Let p be an irregular prime, and let P=rp+1 be a prime with P<p^2-p. Also let t be an integer such that t^3≢1 (mod P). For an irregular pair (p,2k), form the product ...
A constant sometimes called Varga's constant is defined by V=1/Lambda=9.2890254919... (OEIS A073007), where Lambda is the one-ninth constant.
The vertex count of a graph g, commonly denoted V(g) or |g|, is the number of vertices in g. In other words, it is the cardinality of the vertex set. The vertex count of a ...
The depth of a vertex v in a rooted tree as the number of edges from v to the root vertex. A function to return the depth of a vertex v in a tree g may be implemented in a ...
The vertex height of a vertex v in a rooted tree is the number of edges on the longest downward path between v and a tree leaf. The height of the root vertex of a rooted tree ...
An auction in which the highest bidder wins but pays only the second-highest bid. This variation over the normal bidding procedure is supposed to encourage bidders to bid the ...
The base-20 notational system for representing real numbers. The digits used to represent numbers using vigesimal notation are 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, A, B, C, D, E, F, ...
An abstract machine that is implemented in software is termed a virtual machine.
A conjecture which treats the heights of points relative to a canonical class of a curve defined over the integers.
A modification of the Eberhart's conjecture proposed by Wagstaff (1983) which proposes that if q_n is the nth prime such that M_(q_n) is a Mersenne prime, then ...
...
View search results from all Wolfram sites (28442 matches)

